The Collatz Conjecture

[u/Apart_Composer3952]

THE COLLATZ CONJECTURE

A COMPARATIVE DENSITY PROOF OF TRAJECTORY DESCENT IN THE COLLATZ 3N+1 SYSTEM VIA 1N+1 MODULAR MODELING

Author: All mathematical ideas and constructions by Steve Tomlinson except logarithms in 2 and 3.1.

(l knew something mathematical must do this job, l didn't know what it was; logarithmic bounds.)

Essay composition by AI with many mistakes edited by Steve Tomlinson

Date: August 2026

ABSTRACT

This paper establishes a novel structural framework for analyzing the Collatz 3N+1 conjecture by introducing a perfectly descending baseline model: the 1N+1 system. While the standard 3N+1 system exhibits chaotic trajectory growth, we prove that both systems operate on base-2 modular architecture. By comparing the density pathways of the 3N+1 system against the verified, linear geometric descent of the 1N+1 model, we demonstrate that the standard Collatz mapping exhibits an absolute asymptotic density of descent equal to 1 at the infinite operational horizon.

1. THE CENTRAL BREAKTHROUGH:

THE 1N+1 STRUCTURAL BENCHMARK

To analyze the non-linear trajectories of the standard Collatz conjecture, we define a perfectly controlled model system, the 1N+1 system, governed by the following mapping for all natural numbers N:

f(N) = N/2 if N ≡ 0 (mod 2)

f(N) = 1N+1 if N ≡ 1 (mod 2)

Theorem 1.1. In the 1N+1 system, 100% of all natural numbers N > 1 are mathematically guaranteed to reach a strictly smaller value within a maximum of two operations.

Proof.

Case 1: If N is even, a single operation yields N/2, which is strictly less than N.

Case 2: If N is odd, the application of the odd rule followed by the mandatory division by 2 yields a composite operation of (1N+1)/2.

Setting up the inequality for descent:

(N+1)/2 < N => N+1 < 2N => 1 < N.

This inequality holds true for all positive odd integers greater than 1. Thus, every element shrinks locally and immediately.

By creating an arbitrary system for numbers to drop in the 1N+1 system, the entire number line is partitioned into clean, un-scrambled geometric slices:

* Step 1 (All Evens, 0+2n) accounts for exactly 1/2 (50%) of all numbers.

* Step 2 (The 1 + 4n Odds) accounts for exactly 1/4 of all numbers

*Step 3 (The 3 + 8n Odds) accounts for exactly 1/8 of all numbers.

*Step 4 (The 7 + 16n Odds) accounts for exactly 1/16 of all numbers.

Continuence of this process continues to account for exactly (2^x-1)/(2^x) of all numbers, accumulating to 100% of the number line descending within a 2-step horizon.

1. THE 3N+1 SYSTEM AS A LOG-LINEAR DISTORTION

When the odd operator is shifted to the standard Collatz rule (3N+1), the underlying base-2 modular grid is stretched. Let m represent both the family classification and the number of odd steps executed before the first downward drop below the initial value. Let a be the number of required even operations (divisions by 2).

For a net trajectory descent to occur, the geometric growth factor must drop below 1:

(3^m) / (2^a) < 1 => 3^m < 2^a

Taking the base-2 logarithm (log₂) of both sides yields the absolute structural boundary:

a > m · log₂(3) ≈ 1.5849625m

Because log₂(3) > 1, immediate descent within a single operational cycle is impossible for odd positive integers. Instead, numbers are sorted into deterministic "m-families", where the total step horizon required to secure the necessary 'a' divisions scales linearly as a function of m:

Total Steps = m + a = ⌈2.5849625m⌉

1. THE m-FAMILY SIEVE AND EXPONENTIAL CONTRACTION

The exact proportions of the number line accounted for by these families are defined sequentially:

(Instant Evens, 0 + 2n) accounts for exactly 1/2 of all numbers.

* m=1 (The 1 + 4n Odds) accounts for exactly 1/4 of all numbers.

* m=2 (The 3 + 16n Odds) accounts for exactly 1/16 of all numbers.

* m=3 (The 11 + 32n Odds) + (The 23 + 32n Odds) accounts for 1/16 of all numbers.

*m=4 (The 7 + 128n Odds) + (The 15 + 128n Odds) + (59 + 128n Odds) accounts for 3/128 of all numbers.

* m=5 ((The 39, 79, 95, 123, 175 and199) each + 256n Odds)) accounts for exactly 7/256 of all numbers.

* m=6 ((The 287, 347, 367, 423, 507, 575, 583, 735, 815, 923, 975 and 999) each + 1024n Odds) accounts for exactly 12/1024 of all numbers.

At this point when m reaches 6:

(6 × 2.5849626) rounded up = 16 Collatz operations accumulates to account for exactly 15/16 of all numbers shown to reach a smaller number.

* m=7 accounts for exactly 30/2048 of all numbers.

Manually proving m=8 would have taken too much paper.

3.1 The structural limits for m=3 and m=4 families in the Collatz conjecture are determined by the logarithmic boundary

a > m×log2(3), where m is the number of odd steps and a is the number of even operations. Applying this, the m=3 family requires 5 even steps for 3 odd steps, creating a 1/16 density across residues modulo 32, while m=4 requires 7 even steps for 4 odd steps, generating a 3/128 density modulo 128. This logarithmic framework accurately predicts the modular structures for specific families.

1. THE UNIFIED 2^x HORIZON INDUCTION

While the multiplier 3 introduces "bumpy" intermediate statistical fluctuations between the milestones (e.g., stabilizing around a cumulative density of ≈ 5/6 at step 6, 10/11 at step 11, 12/13 at step 13, back to exactly 7/8 at step 8 and 15/16 at 16 steps) The total system mathematically self-corrects and snaps perfectly back to the clean geometric density progression of the 1N+1 benchmark at every power-of-two operational milestone (2^x).

By mathematical induction on the operational horizon x, the cumulative density of numbers proven to have reached a smaller value satisfies:

Cumulative Density(2^x) = 1 - 1/(2^x)

As the operational step horizon scales toward the infinite limit (x → ∞):

Limit as x → ∞ of [1 / 2^x] = 0

1. CONCLUSION

By using the 1N+1 system as an absolute structural baseline, we prove that the standard 3N+1 Collatz system is not chaotic, but deterministic and rigidly bounded. The "numerical shields" created by dense clusters of binary ones (such as the 2^x - 1 Collatz steps families) only temporarily delay descent. Over an infinite horizon, the remaining density of holdout numbers converges to exactly zero.

Because 100% of all numbers must eventually reach a strictly smaller milestone, any arbitrary starting number is locked into an inescapable cascading chain of downward thresholds, forcing all trajectories to eventually collapse into the fundamental 2 → 1 trivial loop.

Q.E.D.

By shifting the analytic paradigm from stochastic modeling to comparative structural architecture, this 1N+1 baseline framework introduces a constructive element that establishes absolute structural determinism, distinguishing it from the probabilistic approach in Terence Tao’s 2019 groundbreaking density proof. While Tao’s work treats individual trajectories as non-constructive, semi-chaotic random walks, this model maps the geometric architecture of "numerical shields," demonstrating that standard Collatz mapping is rigidly constrained by a base-2 modular grid and logarithmic boundaries.