This paper presents a geometric framework for the Collatz conjecture based on a navigable two-dimensional coordinate space in which the Collatz tree operations define four movement directions. The framework introduces three foundational bounding surface equations — upSurface, bottomSurface, and deltaMatrix — whose algebraic identity proves that the gap between bounding surfaces is exactly independent of the initialization vector IV for all coordinates. This IV cancellation is a proven algebraic result, not a conjecture. The coordinate space is characterized by a walker model in which ascending and descending the Collatz tree corresponds to counterclockwise and clockwise rotation through the grid, rational tile boundaries represent crossings between isomorphic tree families, and stopping distance corresponds directly to diagonal position. The path height invariant establishes that any walk through the space has intrinsic vertical geometry independent of IV. Two closed-form formulas are presented and verified that together partition all positive integers exactly once: OSteps (n, x) = 2^ (n+1) x + (2ⁿ-1) indexes all odd integers by compressed Collatz step class, and ESteps (n, x) = 2ⁿ (2x+1) indexes all even integers by halving step class. The Grand Unified Partition Theorem states that every positive integer belongs to exactly one class in exactly one formula. Both formulas are computationally verified and invertible. A geometric proof sketch of the Collatz conjecture is presented, reducing the problem to a single named open condition — the Gap-Free Tiling Lemma — which the partition formulas substantially narrow. Applications to asymmetric cryptography and lossless data compression are developed, including a novel cryptographic framework with a security property termed Strategy Opacity and a compression method based on structural equivalence across the infinite Collatz tree family.
Karl Easterly (2026) studied this question.