Active-Route Collatz Proof Package: Proof Concept, Review Manuscript, Lemma Stock, and Finite Verification Artifacts

This archive contains a review package for a proposed active-route constructive proof of the Collatz conjecture.

Most attempted Collatz proofs fail by leaving room for one unseen infinite mechanism. This package is organized to make that escape route explicit and testable: every theorem-relevant branch must enter known stock, enter a finite splice ledger, terminate, or descend.

The proof is organized around five explicit bridge targets:

1. global entry / Lemma 1a
2. finite launch menu
3. finite splice menu
4. bounded-tail splice
5. (R, lambda) determinism / finiteness / stock splice

The package is structured so that each bridge target is tied to a specific theorem-level carrier, review module, lemma-stock file, or finite verification artifact.

Main readable entry points:

- Proof_Concept.pdf
- Reviewer_Overview.pdf

Main review entry point:

- ACTIVE/review/README_FOR_REVIEW.md

Main cleaned proof-stock file:

- ACTIVE/foundation/active_route_proof_stack.md

The archive includes theorem-facing lemma carriers, review modules, dependency matrices, scripts, and machine-readable audit/certificate artifacts.

Finite scripts and JSON artifacts are used as reproducible verification boundaries for bounded finite ledgers. They do not replace the theorem-facing proof carriers; independent audit of the computer-assisted components is a separate validation step.

The claim of the package is that no autonomous infinite mechanism remains outside the finite audited structure assembled from these components. If the five bridge targets withstand review, the assembled route gives the Collatz theorem through the standard minimal-counterexample descent argument.

Recommended reviewer task: attempt to break one of the five bridge targets.

For questions, corrections, or review comments, contact:

Jaan Allikvere  
jaan@lahendus.ee