Collatz Proof Route: Lean 4.29.1 Formalization, Review Files, and Finite Certificates

WITHDRAWN BY THE AUTHOR (July 2026): this package contains a fundamental mathematical error and its claims should not be relied upon. File access has been closed.

This release presents a finite case-reduction route for the Collatz problem, together with a Lean 4.29.1 formalization of the proof stack.

The argument proceeds in three stages. First, the relevant affine branch data are compressed into a bounded centered coordinate and a finite state. Second, the possible live branches are catalogued into a finite entry list of 13 cases. Third, each listed case is closed by an explicit finite calculation, a terminal periodicity obstruction, a carrier-indexed closeout, or a return to ordinary positive-odd descent.

The paper gives the complete proof route, and the Lean files under artifact/lean/ formalize the corresponding proof stack. The main Lean build target is C18FinalImplicationMap and can be checked from the release directory with:

python artifact/scripts/build_lean_proof.py

The submitted Lean artifact is sorry/admit-free and contains no user-declared axiom/constant assumptions.

Recommended review entry points:
- paper.pdf
- README.md
- artifact_manifest.md
- artifact/carriers/CARRIER_INDEX.md
- artifact/lean/C18FinalImplicationMap.lean

For questions, corrections, or review comments, contact:

Jaan Allikvere
jaan@lahendus.ee