We formulate a certificate-based proof architecture for the Collatz problem, built ona separation between a finite dyadic kernel and stable affine expansion regions. Theobjective of the present paper is not to claim an unconditional proof in the absence ofthe full certificate. Rather, it is to isolate the exact finite structure whose independentverification would constitute such a proof.The theorem is conditional in the following precise sense: if a concrete finite adaptivedyadic certificate of maximal depth Bmax ≤ 323 is supplied and accepted by the exactinteger verifier specified below, then the Collatz conjecture follows. The certificate isnot a flat enumeration of residue classes, but a finite recursive covering object whoseterminal leaves represent infinite truncated arithmetic progressions of odd parameters.The point of the construction is to respect the actual structure of the Collatz dynam-ics. The accelerated odd map is governed by the valuation function v2(3n + 1), whosebranching is not a cosmetic complication but part of the object itself. This branchingcreates a large finite dyadic kernel which cannot honestly be smoothed away by a singleglobal analytic inequality. A proof which ignores this kernel risks proving a simplified oraveraged model rather than the actual Collatz dynamics.The certificate therefore records the finite dyadic complexity that a global estimatecannot legitimately erase, while the analytic part proves uniform descent once the valu-ation word is stable. Terminal leaves are closed either by an analytic descent or by anaffine descent certified by a stable valuation word. Once the certificate is independentlyverified, every positive integer reaches the cycle 1 → 4 → 2 → 1. A companion Lean 4artifact formalizes the executable certificate interface and proves the current structuralextraction layer of the verifier contract; it is not presented as a complete Lean proof ofCollatz
julian redero (Wed,) studied this question.