The Resolution of the Collatz Conjecture via a Unified Framework: Local Residue Dynamics and Global Ladder Coverage

1. Introduction

Despite its apparent simplicity, the Collatz Conjecture has resisted proof for more than eight decades. In two prior papers by the author, the arithmetic skeleton of the dynamics was isolated from two complementary directions.

• The local view: a deterministic residue framework of the Reverse Collatz Function that governs admissibility and guarantees unique parentage, describing the step-by-step behavior of individual trajectories [1].
• The global view: an iterative offset–ladder framework that shows how child–parent differences extend to arithmetic progressions whose higher lifts systematically fill all odd residues, achieving complete recursive coverage of the odd integers [2].

Neither perspective alone suffices to prove closure. The local view explains how each odd moves, but not how the whole set of odds fits together. The global view explains how the set of odds closes globally, but not why each trajectory is constrained locally. Only when both perspectives are combined can the Collatz function be recognized as a closed structure. In this work we present that unified picture and the duality between recursion and iteration, showing that it yields a complete resolution of the conjecture.

To make this framework precise, we first establish the basic definitions of the reverse operator, admissibility, and residue lenses that will guide the analysis.

2. Definitions

Definition 1

(Classic Collatz function). The classical Collatz map $C:\mathbb{N}\to \mathbb{N}$ is defined by

$$C\left(n\right)=\left\{\begin{array}{cc}n/2,\hfill & ifn\mathit{is}\mathit{even},\hfill \\ 3n+1,\hfill & ifn\mathit{is}\mathit{odd}.\hfill \end{array}\right.$$

Definition 2

(Forward Collatz function). The complete-step (odd-to-odd) Collatz map $T:{\mathbb{N}}_{\mathrm{odd}}\to {\mathbb{N}}_{\mathrm{odd}}$ is

$$T\left(n\right)={\displaystyle \frac{3n+1}{2^{k_{max}}}},$$

where $k_{max}\ge 1$ is the maximal exponent such that the denominator $2^{k_{max}}$ divides $3n+1$. Thus $T\left(n\right)$ gives the next odd iterate of n under the Collatz process.

Definition 3

(Reverse Collatz function). The complete-step reverse Collatz map $R:{\mathbb{N}}_{\mathrm{odd}}\to {\mathbb{N}}_{\mathrm{odd}}$ assigns to each odd integer n its admissible parent via

$$R(n;k)={\displaystyle \frac{2^{k}n-1}{3}},k\ge 1,$$

where k is admissible if $2^{k}n\equiv 1\left(\mathrm{mod}3\right)$. If $k_{min}$ is the minimal admissible doubling count, then $R(n;k_{min})$ is called the first parent of n.

Definition 4

(Middle-even values). In the odd-to-odd formulation of the Collatz map, each step factors through an intermediate even value.

• For the forward map, given an odd integer n, the intermediate (middle-even) value is

  $$E_f\left(n\right):=3n+1.$$
• For the reverse map, given an odd integer n and an admissible doubling count $k\ge 1$ (i.e. $2^{k}n\equiv 1\left(\mathrm{mod}3\right)$), the intermediate (middle-even) value is

  $$E_r(n,k):=2^{k}n.$$

Both $E_f$ and $E_r$ are even and serve as the “middle” stage between odd inputs and odd outputs. Read modulo 18, these values determine the child’s odd class through the fixed gate $10\mapsto C_0$, $4\mapsto C_2$, $16\mapsto C_1$ in the reverse Collatz function.

Definition 5

(Parent (reverse Collatz function)). An odd integer n is called a parent. If $n\equiv 3\left(\mathrm{mod}6\right)$ (that is, n is an odd multiple of 3), then it has no admissible doubling and is called a terminating parent. If $n\equiv 1\left(\mathrm{mod}6\right)$ or $n\equiv 5\left(\mathrm{mod}6\right)$, then n is live and admits some $k\ge 1$ that is admissible.

Definition 6

(Child (reverse Collatz function)). Given a parent n and an admissible $k\ge 1$, the corresponding child is

$$m={\displaystyle \frac{2^{k}n-1}{3}}\left(\mathrm{odd}\right).$$

For a fixed n, admissible k have fixed parity and are exactly

$$k=k_{min}\left(n\right)+2j,j\ge 0,$$

where j is the lift index counting successive admissible exponents above the minimal one. As k increases by $+2$, the middle-even residue cycles $10\to 4\to 16\to 10$; under the fixed gate $10\mapsto C_0$, $4\mapsto C_2$, $16\mapsto C_1$, the children of n therefore occur in the deterministic class rotation

$$C_0\to C_2\to C_1\to C_0\to \cdots$$

Definition 7

(First child). For a live parent n, let $k_{min}$ be the minimal admissible doubling count. The first child of n is

$$m_1={\displaystyle \frac{2^{k_{min}}n-1}{3}}.$$

Definition 8

(Admissible doubling and child). Let n be odd. A doubling count $k\ge 1$ is admissible if

$$2^{k}n\equiv 1\left(\mathrm{mod}3\right).$$

For any admissible k, the reverse child is

$$R(n;k):={\displaystyle \frac{2^{k}n-1}{3}}\in \mathbb{Z}.$$

The set of admissible k for a fixed odd n has fixed parity (even if $n\equiv 1\left(\mathrm{mod}3\right)$, odd if $n\equiv 2\left(\mathrm{mod}3\right)$), and hence $k\mapsto k+2$ preserves admissibility.

Definition 9

(Progression index). For an odd parent n, the progression index t is the integer parameter in the canonical forms

$$n=6t+5\left(C_1\right),n=6t+1\left(C_2\right),$$

with $t\ge 0$. The index t counts the position of n within its mod-6 residue class. In later sections, offsets and ladders are expressed as explicit functions of this progression index.

3. The Deterministic Residue Framework

This section extends the local residue framework first developed in A Deterministic Residue Framework for the Collatz Operator at $q=3$ [1], together with earlier unpublished notes that identified the mod-9 residue cycle as the source of reverse determinism. The core construction is preserved: admissibility is fixed by residue classes modulo 6, while refinement to mod 9 and its canonical lift to mod 18 determines the child class at each step.

The result is a deterministic lens through which every odd integer is classified and every admissible step is resolved. This local structure now appears explicitly as the microscopic counterpart of the global coverage framework that follows.

3.1. The Mod 6 Classification for Odd Integers

All odd integers fall into three residue classes modulo 6:

• C0: $n\equiv 3\left(\mathrm{mod}6\right)$ (odd multiples of 3: $3,9,15,\dots$).
  Forward (middle-even identification): $3n+1\equiv 10\left(\mathrm{mod}18\right)$.
  Reverse (admissibility/parity): No admissible k with $2^{k}n\equiv 1\left(\mathrm{mod}3\right)$ exists, so $C_0$ has no reverse parent.
• C1: $n\equiv 5\left(\mathrm{mod}6\right)$ (two higher than a multiple of 3: $5,11,17,\dots$).
  Forward (middle-even identification): $3n+1\equiv 16\left(\mathrm{mod}18\right)$.
  Reverse (admissibility/parity): $n\equiv 2\left(\mathrm{mod}3\right)$, so admissible k are odd. The first admissible is $k=1$. One doubling gives

  $$n·2^1\equiv 4\left(\mathrm{mod}6\right).$$
  Since $k_{min}=1$ for $C_1$, we have $2^{k_{min}}n\equiv 1\left(\mathrm{mod}3\right)$; subtracting 1 yields a multiple of 3, so the reverse step is an integer. Thus $C_1$ always resolves after

  $$k=k_{min}+2t=1+2t(t\in {\mathbb{Z}}_{\ge 0})$$
• C2: $n\equiv 1\left(\mathrm{mod}6\right)$ (two lower than a multiple of 3: $1,7,13,\dots$).
  Forward (middle-even identification): $3n+1\equiv 4\left(\mathrm{mod}18\right)$.
  Reverse (admissibility/parity): $n\equiv 1\left(\mathrm{mod}3\right)$, so admissible k are even. The first admissible is $k=2$, yielding

  $$4n\equiv 1\left(\mathrm{mod}3\right)\Rightarrow m={\displaystyle \frac{4n-1}{3}}\in \mathbb{Z}.$$
  Since $k_{min}=2$ for $C_2$, we have $2^{k_{min}}n\equiv 1\left(\mathrm{mod}3\right)$; subtracting 1 yields a multiple of 3, so the reverse step is an integer. Thus $C_2$ always resolves after

  $$k=k_{min}+2t=2+2t(t\in {\mathbb{Z}}_{\ge 0})$$

  doublings.

Lemma 1

(C0 is terminating under the reverse step). If $n\equiv 3\left(\mathrm{mod}6\right)$ (i.e., n is an odd multiple of 3), then for every $k\ge 1$,

$${\displaystyle \frac{2^{k}n-1}{3}}\notin \mathbb{Z}.$$

In particular, the class C0 has no admissible reverse child.

Proof. 

If $3\mid n$ then $2^{k}n\equiv 0\left(\mathrm{mod}3\right)$ for all $k\ge 1$, hence $2^{k}n-1\equiv -1\equiv 2\left(\mathrm{mod}3\right)$, which is not divisible by 3. □

Corollary 1

(Forward root from C0). If $n\in C_0$ (so n is an odd multiple of 3), then in the forward map $3n+1=2^{k}m$ with $k\ge 1$, the resulting odd m is not in $C_0$ but lies in $C_1\cup C_2$. Thus $C_0$ serves only as a root in the forward Collatz function, never as a child.

Proof. 

For any $n\in C_0$, we have $3n\equiv 0\left(\mathrm{mod}3\right)$ and hence $3n+1\equiv 1\left(\mathrm{mod}3\right)$. Therefore the resulting odd m cannot be a multiple of 3, so $m\notin C_0$. □

Lemma 2

(Admissibility parity). Let n be an odd integer. The congruence

$$2^{k}n\equiv 1\left(\mathrm{mod}3\right)$$

has a solution if and only if n is not divisible by 3. Moreover, the residue of n modulo 3 determines the parity of k:

$$n\equiv 1\left(\mathrm{mod}3\right)\Rightarrow k\mathit{must}\mathit{be}\mathit{even},n\equiv 2\left(\mathrm{mod}3\right)\Rightarrow k\mathit{must}\mathit{be}\mathit{odd}.$$

Once one admissible k exists, every larger k with the same parity is also admissible.

Proof. 

Because $2\equiv -1\left(\mathrm{mod}3\right)$, raising 2 to the kth power gives

$$2^k\equiv {(-1)}^k\left(\mathrm{mod}3\right).$$

So the condition $2^{k}n\equiv 1\left(\mathrm{mod}3\right)$ is the same as

$${(-1)}^k·n\equiv 1\left(\mathrm{mod}3\right).$$

Now check the possibilities for $n\mathrm{mod}3$:

• If $n\equiv 0\left(\mathrm{mod}3\right)$, then ${(-1)}^{k}n\equiv 0$, which can never be 1. So no solution exists in this case.
• If $n\equiv 1\left(\mathrm{mod}3\right)$, then we need ${(-1)}^k\equiv 1\left(\mathrm{mod}3\right)$. That means k must be even.
• If $n\equiv 2\left(\mathrm{mod}3\right)$, then we need ${(-1)}^k\equiv 2\equiv -1\left(\mathrm{mod}3\right)$. That means k must be odd.

Finally, adding 2 to k does not change ${(-1)}^k$, so once one admissible value of k exists, every other admissible k is given by $k+2j$ for $j\ge 0$. □

3.2. Mod 18 Gate and its Mod 9 Origin

Overview.

The child class is decided locally by the middle–even residue modulo 18. This gate has a mod–9 source: mod–9 residues split into even/odd power triads, and the admissible parity of k chooses the triad, which lifts canonically to the mod–18 gate.

Remark 1

(The usage of mod 9). When odd integers are listed in their natural numerical order, the sequence of first-child classes follows the repeating nine-step cycle modulo 9:

$$2,x,0,0,x,2,1,x,1,\cdots$$

where x denotes terminating parents ($C_0$). This cycle partitions the six odd non-multiples of 3 into two fixed triads $\{5,8,2\}$ and $\{7,4,1\}$, corresponding to $C_1$ and $C_2$ parents respectively. Thus mod 9 alone determines the child-class framework. Parity of the doubling exponent k then lifts this structure into mod 18, producing the deterministic gate $10\mapsto C_0,4\mapsto C_2,16\mapsto C_1$.

Corollary 2

(Linear segment pattern 19–35). List the odd integers n from 19 to 35. For each n, record its class (mod 6), its residue (mod 9) and (mod 18), the reverse middle-even at the minimal admissible doubling $k_{min}$ ($k_{min}=2$ for $C_2$, $k_{min}=1$ for $C_1$, none for $C_0$), and the class of the first child

$$m={\displaystyle \frac{2^{k_{min}}n-1}{3}}\left(\mathit{when}\mathit{defined}\right).$$

Explanation. 

For each n: determine its class by $n\mathrm{mod}6$ (C₀: 3, C₁: 5, C₂: 1). If $n\in C_0$, no admissible reverse step exists. If $n\in C_1$ (resp. $C_2$), take $k_{min}=1$ (resp. $k_{min}=2$) by admissibility parity. Then use the deterministic gate: $\left(2^{k_{min}}n\right)\mathrm{mod}18\in \{10,4,16\}$ with the fixed mapping $10\mapsto C_0,4\mapsto C_2,16\mapsto C_1$. Evaluating these nine cases yields the displayed sequence $2,x,0,0,x,2,1,x,1$. This finite segment already hints at a repeating cycle, whose global distribution is examined in the next section. □

The resulting first-child classes follow the repeating nine-step cycle modulo 18:

$$\begin{array}{|c|}\hline 2,x,0,0,x,2,1,x,1\\ \hline\end{array},$$

i.e. $C_2$, (none), $C_0$, $C_0$, (none), $C_2$, $C_1$, (none), $C_1$.

These nine odd residues partition into inadmissible and admissible parents:

$$\underset{inadmissible(\mathit{terminated}\mathit{parent})}{\underbrace{\{0,3,6\}}},\underset{\mathit{first}\mathit{child}\mathit{is}{C}_0}{\underbrace{\{7,5\}}}+10,\underset{\mathit{first}\mathit{child}\mathit{is}{C}_1}{\underbrace{\{4,8\}}}+16,\underset{\mathit{first}\mathit{child}\mathit{is}{C}_2}{\underbrace{\{1,2\}}}+4.$$

This pattern reflects the mod-9 residue structure of odd integers that are not multiples of 3. The units modulo 9 split into two triads:

$$\{1,4,7\}(\mathit{even}\mathit{powers}\mathit{of}2),\{2,5,8\left\}(\mathit{odd}\mathit{powers}\mathit{of}2\right).$$

The admissible parity of $k_{min}$ (even for $n\equiv 1\left(\mathrm{mod}3\right)$, odd for $n\equiv 2\left(\mathrm{mod}3\right)$) selects the appropriate triad, and hence determines the first child directly from the mod-9 cycle.

When lifted to mod-18 by parity, these residues land exactly in the forward middle-even gate $\{10,4,16\}$, which maps to classes $10\mapsto C_0$, $4\mapsto C_2$, $16\mapsto C_1$. Thus the mod-9 sequence of first children is the global source of reverse determinism, and it aligns arithmetically with the forward gate.

Although this sequence is explained in full in the global framework (Section 4), its role here is crucial: it provides the residue template for reverse determinism. Working modulo 9, the same repeating nine-step cycle splits into an even set $\{1,4,7\}$ and an odd set $\{2,5,8\}$, corresponding to the parity of admissible exponents $2^{k_{min}}$. Thus the first child of any parent is determined by its place in this mod-9 sequence together with parity.

Lifting from mod 9 to mod 18 (by parity), these residues land exactly in $\{10,4,16\}$, the forward middle-even values $E_f\left(n\right)=3n+1$. Hence the global sequence and the reverse admissibility condition are arithmetically identical when expressed through residues: the sequence drives reverse determinism, and the forward and reverse middle-even gates coincide.

Lemma 3

(Equidistribution of First-Child Classes). Across every complete 18-residue cycle of odd parents, the first-child classes $C_0,C_1,C_2$ appear with exact frequency $1/3$ each.

Proof. 

By Corollary 2, the nine admissible residues modulo 18 yield the child-class sequence

$$C_2,-,C_0,C_0,-,C_2,C_1,-,C_1,$$

where dashes denote terminating parents. Each 18-step cycle therefore contains precisely two occurrences of each live class, giving equal frequency $1/3$ when restricted to $C_0,C_1,C_2$. □

Remark 2

(Forward mod 6 lifts to mod 18 in the first step). For odd n, the forward middle-even value $E_f\left(n\right):=3n+1$ carries the mod 6 residue of n to a residue mod 18:

$$n\equiv 1\left(\mathrm{mod}6\right)⟹E_f\left(n\right)\equiv 4\left(\mathrm{mod}18\right),$$

$$n\equiv 3\left(\mathrm{mod}6\right)⟹E_f\left(n\right)\equiv 10\left(\mathrm{mod}18\right),$$

$$n\equiv 5\left(\mathrm{mod}6\right)⟹E_f\left(n\right)\equiv 16\left(\mathrm{mod}18\right).$$

Thus the first forward step lifts the mod 6 classification to the combined lens mod $18=6·3$ (residue + multiplicative), and the child’s class is then read off by the fixed gate $10\mapsto C_0$, $4\mapsto C_2$, $16\mapsto C_1$.

Proposition 1

(Deterministic child-class decision via mod 18). In the Reverse Collatz function, and for odd n, the residue of the middle even in $\{4,10,16\}\left(\mathrm{mod}18\right)$ alone determines the child’s odd class, both in forward and reverse middle-even. This gives a one-step, local rule independent of trajectory history.

$$10\mapsto C_0,4\mapsto C_2,16\mapsto C_1,$$

Existence of a forward–reverse alignment.

Lemma 4

(Middle-even equivalence mod 18). If 3 does not divide n, then there exists an admissible $k\ge 1$ such that

$$2^{k}n\equiv 3n+1\left(\mathrm{mod}18\right).$$

Proof. 

Forward side (mod 6 lifted to mod 18). For odd n, the forward middle-even value is $E_f\left(n\right)=3n+1$. Reducing n modulo 6 and multiplying by 3 lifts the residue to mod 18:

$$n\equiv 1,3,5\left(\mathrm{mod}6\right)⟹E_f\left(n\right)\equiv 4,10,16\left(\mathrm{mod}18\right),$$

so $E_f\left(n\right)$ always lies in $\{4,10,16\}\left(\mathrm{mod}18\right)$.

Reverse side (mod 9 determinism). For odd n not divisible by 3, the residue $n\mathrm{mod}9$, together with the admissible parity of $k_{min}$ (even if $n\equiv 1\left(\mathrm{mod}3\right)$, odd if $n\equiv 2\left(\mathrm{mod}3\right)$), selects exactly one of the two triads of units modulo 9:

$$\{1,4,7\}\left(\mathrm{even}k\right),\{2,5,8\}\left(\mathrm{odd}k\right).$$

Applying $2^{k_{min}}$ places n into the middle-even value that belongs to the nine-step cycle of Corollary 2. That middle-even value is already one of $\{10,4,16\}\left(\mathrm{mod}18\right)$, the forward gates.

Gate alignment. Thus the mod-9 sequence is the global arithmetic source of reverse determinism: it guarantees that the first child of every admissible parent is fixed by residue alone, and it coincides exactly with the forward middle-even gates

$$10\mapsto C_0,4\mapsto C_2,16\mapsto C_1.$$

In this way the global sequence and the reverse step are isomorphic views of the same mechanism. □

3.3. Microcycles and Lifted k with Tables

Lemma 5

(Rotation under $k\mapsto k+2$ in mod 18). If k is admissible for odd n ($2^{k}n\equiv 1\left(\mathrm{mod}3\right)$), then

$$E_r(n,k)=2^{k}n\equiv 10,4,16\left(\mathrm{mod}18\right).$$

Moreover $E_r(n,k+2)=4E_r(n,k)$, and hence

$$10\stackrel{+2}{\to }4\stackrel{+2}{\to }16\stackrel{+2}{\to }10\left(\mathrm{mod}18\right).$$

Proof. 

Admissible $E_r(n,k)$ are even and $1\left(\mathrm{mod}3\right)$, so only $10,4,16$ occur modulo 18. For admissible k, $E_r(n,k+2)=2^{k+2}n=4E_r(n,k)$; computing mod 18 gives $4·10\equiv 4$, $4·4\equiv 16$, $4·16\equiv 10$, which establishes the 3-cycle. □

Microcycles: function and reason.

Fix a live odd parent n not divisible by 3. For the Reverse Collatz Function, all admissible reverse doublings for n share the same parity (by admissibility parity), so from the minimal admissible count $k_{min}$ we may advance by steps of 2: $k_{min},k_{min}+2,k_{min}+4,\dots$. By Lemma 5, each $+2$ step multiplies the reverse middle-even by 4 modulo 18, sending $10\mapsto 4\mapsto 16\mapsto 10$ and hence rotating the child classes $C_0\mapsto C_2\mapsto C_1\mapsto C_0$.

$$E_r(n,k_{min})\mathrm{mod}18\in \{10,4,16\}⟹E_r(n,k_{min}+2)\equiv 4·E_r(n,k_{min})\left(\mathrm{mod}18\right),$$

$$E_r(n,k_{min}+4)\equiv 4·E_r(n,k_{min}+2)\left(\mathrm{mod}18\right),$$

cycling through $10\to 4\to 16\to 10$ (mod 18). By the common mod-18 gate (Lemma 4), these three middle-even classes deterministically select the child odd classes $C_0,C_2,C_1$, in that order. Thus every fixed parent n generates a k-lifted microcycle of children:

($C_0,C_2,C_1$), in cyclic order beginning with the first admissible child, repeating every three even-k steps. Moreover, by the forward–reverse middle-even equivalence (Lemma 4), there exists an admissible k for which $E_r(n,k)\equiv E_f\left(n\right)=3n+1\left(\mathrm{mod}18\right)$, so the reverse microcycle is aligned with the residue one sees on the forward side.

To display this mechanism explicitly, we present two parallel tables: (i) the integer view, which lists specific n and its children at each admissible lift, and (ii) the residue view, which reduces n to $r\equiv n\left(\mathrm{mod}18\right)$. Both views coincide in the mod-18 column and the resulting child class.

Reading across the rows of either table shows how each $+2$ lift advances through the microcycle, and how every admissible parent reaches a residue $10\mathrm{mod}18$ within at most two steps, certifying an accessible termination to $C_0$.

Example $n=25$ (reverse step, even k; here $n\mathrm{mod}18=7$, $n\mathrm{mod}6=1\Rightarrow C_2$):

Example $n=29$ (reverse step, odd k; here $n\mathrm{mod}18=11$, $n\mathrm{mod}6=5\Rightarrow C_1$):

Figure 1. Even-k rotation of child classes through the mod-18 gate. Each increment of two in k multiplies the middle-even residue by 4, producing the cycle $10\to 4\to 16\to 10$. These residues correspond deterministically to classes $C_0\to C_2\to C_1\to C_0$ (with $10\mapsto C_0$, $4\mapsto C_2$, $16\mapsto C_1$). Hence the child class rotates in the fixed order $C_0\to C_2\to C_1\to C_0$, making the terminating class $C_0$ periodically available alongside the live classes.

Figure 1. Even-k rotation of child classes through the mod-18 gate. Each increment of two in k multiplies the middle-even residue by 4, producing the cycle $10\to 4\to 16\to 10$. These residues correspond deterministically to classes $C_0\to C_2\to C_1\to C_0$ (with $10\mapsto C_0$, $4\mapsto C_2$, $16\mapsto C_1$). Hence the child class rotates in the fixed order $C_0\to C_2\to C_1\to C_0$, making the terminating class $C_0$ periodically available alongside the live classes.

3.4. Consistency of Aligned Steps

Lemma 6

(Forward–Reverse Uniqueness). For any odd n, the forward step

$$T\left(n\right)={\displaystyle \frac{3n+1}{2^{k_{max}}}}$$

uses the maximal admissible exponent $k_{max}=v_2(3n+1)$ and is unique: no smaller exponent $k<k_{max}$ yields an odd integer, and no larger exponent $k>k_{max}$ yields a valid integer. In contrast, the reverse Collatz function

$$R(n;k)={\displaystyle \frac{2^{k}n-1}{3}}$$

admits infinitely many valid odd children for admissible k (odd k when $n\equiv 5\left(\mathrm{mod}6\right)$, even k when $n\equiv 1\left(\mathrm{mod}6\right)$).

Proof. 

Suppose $k<k_{max}$. Then $2^k$ does not fully divide $3n+1$, so $T\left(n\right)$ would not be an integer. If $k>k_{max}$, then $3n+1$ is divisible by $2^{k_{max}}$ but not by any higher power of 2. Dividing by $2^k$ with $k>k_{max}$ therefore produces either a non-integer or an even number, not the next odd iterate. Thus the forward step is uniquely determined.

On the reverse side, admissibility requires $2^{k}n-1$ to be a multiple of 3. This condition is satisfied for infinitely many k, and these admissible values grow without bound. Therefore the reverse tree branches indefinitely, while the forward map selects exactly one step. □

3.4.1. The Trivial Loop from $n=1$: Reverse and Forward Views

Lemma 7

(1 is $C_2$ and has even admissible doublings). Since $1\equiv 1\left(\mathrm{mod}6\right)$, the integer 1 lies in class $C_2$. Admissibility for the reverse step $m={\displaystyle \frac{2^{k}n-1}{3}}\in \mathbb{Z}$ requires $2^{k}n\equiv 1\left(\mathrm{mod}3\right)$. With $n=1$ and $2\equiv -1\left(\mathrm{mod}3\right)$, this gives ${(-1)}^k\equiv 1$, hence k is even. The minimal admissible doubling count is $k_{min}=2$.

Proposition 2

(First child of 1 equals 1). With $k_{min}=2$, the reverse child of $n=1$ is

$$m_1={\displaystyle \frac{2^{k_{min}}·1-1}{3}}={\displaystyle \frac{4-1}{3}}=1,$$

so the first child of 1 is 1 again. Consequently, under the reverse map with minimal admissible doubling, $n=1$ is a fixed point in class $C_2$.

Remark 3

(Consistency with the forward picture: the $4\to 2\to 1$ loop). From the forward side, starting at 1,

$$3·1+1=4⟶2⟶1,$$

which is the well-known $4\to 2\to 1$ loop. Thus the reverse fixed point at $n=1$ (with minimal $k=2$) corresponds exactly to the unique forward cycle.

Remark 4

(Other even doublings). Any admissible doubling for $n=1$ has the form $k=2t$ with $t\ge 1$, yielding

$$m\left(t\right)={\displaystyle \frac{2^{2t}-1}{3}}={\displaystyle \frac{4^t-1}{3}}\in \mathbb{Z}.$$

The first child uses $t=1$ and returns to 1 as above. Larger t give other (valid) reverse children (e.g. $t=2\Rightarrow m=5\in C_1$), but for our purposes the minimal-child dynamics at $n=1$ are governed by $k_{min}=2$, which identifies 1 as a fixed point and ensures consistency with the forward $4\to 2\to 1$ loop.

Theorem 1

(Local Determinism of the Collatz Operator). The residue framework modulo 6, 9, and 18 fixes the Collatz dynamics at the stepwise level. In particular:

• (Unique parentage) Every live odd n (i.e. not a multiple of 3) has a fixed parity of admissible doublings k, so it belongs to exactly one admissible family of reverse children. Class $C_0$ (odd multiples of 3) is terminating and produces no children (Lemmas 1, 2). Hence no nontrivial odd cycles can form.
• (Deterministic residue rotation) For admissible k, the reverse middle-even value is restricted to

  $$E_r(n,k)\equiv 10,4,16\left(\mathrm{mod}18\right).$$

  By Lemma 5, these residues form a strict 3-cycle under $k\mapsto k+2$:

  $$10\mapsto 4\mapsto 16\mapsto 10\left(\mathrm{mod}18\right).$$
  Thus admissible lifts rotate deterministically through the gate $\{10,4,16\}$.
• (Residue–class correspondence) This 3-cycle fixes the child’s class unambiguously:

  $$10\mapsto C_0,4\mapsto C_2,16\mapsto C_1$$
  (Proposition 1, Lemma 5). Equivalently, the mod-9 sequence of first children (Corollary 2) lifts canonically into this mod-18 cycle.
• (Forward–reverse equivalence) For every live odd n, the forward middle-even $E_f\left(n\right)=3n+1$ and the reverse middle-even $E_r(n,k)$ coincide modulo 18 at the admissible $k=k_{min}$. Thus both forward and reverse maps send n through the same gate and into the same child class (Lemmas 4 and 6).

Therefore the Collatz operator is locally deterministic: every odd integer has exactly one parent, every child class is fixed arithmetically by the 3-cycle $\{10,4,16\}$, and the forward and reverse directions are aligned through the same gate.

4. The Global Framework: Offset Ladders and Arithmetic Progressions

This section rederives the global offset framework introduced in Arithmetic Offsets and Recursive Coverage Patterns in the Collatz Function [2], presenting it as a complete additive structure: anchor ladders, progression steps, and higher lifts partition ${\mathbb{Z}}_{\mathrm{odd}}$ without omission or overlap.

4.1. Offset Formulas in the Transformation

4.1.1. $C_1$ Offsets

From the mod 6 classification established in the prior section, every odd integer is congruent to 1, 3, or 5 modulo 6. The residue 3 gives the terminating class $C_0$, while the residues 1 and 5 produce the live classes $C_2$ and $C_1$. Thus every $C_1$ parent can be written in the form

$$n=6t+5,t\ge 0,$$

where t is a nonnegative integer indexing the position of n within the $C_1$ residue class. Equivalently, t counts how many multiples of 6 have been passed before reaching n. By the admissibility rule, $C_1$ nodes allow only odd exponents k. With the minimal choice $k=1$, the reverse Collatz function is

$$R(n,1)={\displaystyle \frac{2n-1}{3}}.$$

Substituting $n=6t+5$ gives

$$R(6t+5,1)={\displaystyle \frac{2(6t+5)-1}{3}}={\displaystyle \frac{12t+9}{3}}=4t+3.$$

The offset is obtained by subtracting the parent:

$${\Delta }_1(6t+5)=R(6t+5,1)-(6t+5)=(4t+3)-(6t+5)=-2(t+1).$$

Hence each $C_1$ child lies an even step below its parent, and the step size grows linearly with the modulo 6 index t. The resulting ladder of offsets is

$$-2,-4,-6,-8,\dots$$

Concrete examples:

$$5\mapsto 3(-2),11\mapsto 7(-4),17\mapsto 11(-6).$$

Thus the $C_1$ offsets are the explicit arithmetic realization of the reverse rule with odd k, derived directly from the mod 6 classification.

4.1.2. C₂ Offsets

From the mod 6 classification, every $C_2$ parent can be written as $n=6t+1$ with $t\ge 0$. By admissibility, $C_2$ nodes allow only even exponents k. With the minimal choice $k=2$,

$$R(n,2)={\displaystyle \frac{4n-1}{3}}.$$

Substituting $n=6t+1$ gives

$$R(6t+1,2)={\displaystyle \frac{4(6t+1)-1}{3}}={\displaystyle \frac{24t+3}{3}}=8t+1.$$

Therefore the offset (child minus parent) is

$${\Delta }_2(6t+1)=R(6t+1,2)-(6t+1)=(8t+1)-(6t+1)=2t.$$

Hence the first admissible reverse step in $C_2$ is nondecreasing and, for $t\ge 1$, strictly increasing in t:

$${\Delta }_2=0,2,4,6,\dots$$

Concrete examples:

$$1\mapsto 1\left(0\right),7\mapsto 9(+2),13\mapsto 17(+4).$$

The explicit offsets for small values of n are listed in Table A1 in Appendix A. This table illustrates the arithmetic ladders described in Section 4.1.1 and Section 4.1.2, making the underlying arithmetic structure relative to each n transparent up to $n=35$.

Lemma 8

(Offset Ladders by Class). For each live parent n, the first admissible reverse step defines an arithmetic offset depending only on its class:

$$C_1:\Delta (6t+5)=-2(t+1),C_2:\Delta (6t+1)=2t.$$

Moreover, higher admissible lifts of the same parent extend these formulas linearly in t with parity restricted to odd k for $C_1$ and even k for $C_2$.

Proof. 

Direct substitution of $n=6t+5$ with odd k and $n=6t+1$ with even k into the reverse Collatz function $R(n,k)=(2^{k}n-1)/3$ gives the claimed offset formulas. The parity restriction follows from admissibility, so every live parent generates an infinite ladder of children determined solely by $(t,k)$. □

Theorem 2

(Anchor principle). All progressive path iterations of the Collatz map are anchored at the two primitive parents $1\in C_2$ and $5\in C_1$. Every admissible lift $R(1;k)$ (k even) and $R(5;k)$ (k odd) generates an infinite raising sequence. These raising sequences partition the odd integers into disjoint arithmetic progressions modulo $2^k$, and the union over all k gives complete coverage. Thus the global recursive structure is entirely determined by the anchor pair $\{1,5\}$.

Corollary 3

(Exhaustion by anchors). Every odd integer lies in exactly one ladder iteration of a raising sequence anchored at 1 or 5. No other origins exist.

4.1.3. Further Lifts of Admissible k

The reverse Collatz function extends naturally to higher admissible exponents: odd $k=1,3,5,\dots$ for $C_1$ parents ($n=6t+5$) and even $k=2,4,6,\dots$ for $C_2$ parents ($n=6t+1$). Substituting these values into

$$R(n,k)={\displaystyle \frac{2^{k}n-1}{3}}$$

gives the general offset formulas

$${\Delta }_k(6t+5)=2(2^k-3)t+\frac{5·2^k-16}{3},{\Delta }_k(6t+1)=2(2^k-3)t+\frac{2^k-4}{3}.$$

The first admissible k gives the minimal child, and increasing k by two corresponds to a deeper lift along a higher ladder. Each successive lift remains tied to the progression index t, with the offset magnitude growing on the order of $2^k$ as k increases.

Remark 5

(Offsets and the itinerary). The higher-k formulas confirm that offsets are determined not by the “generation depth” but by the progression index t and the parity of k. Which ladder is followed depends on the sequence of class transitions as the function is iterated. Thus $C_1$ and $C_2$ each sustain an infinite sequence of admissible steps, and the arithmetic progression of offsets is simply the explicit trace of the admissibility rules, computed relative to n at each transformation.

4.2. Arithmetic Progressions of Children

While offsets describe the displacement between a parent and its child, progressions describe how children of consecutive parents distribute across the integers. We now compute these inter-parent progressions.

4.2.1. $C_1$ Parents

Take consecutive $C_1$ parents $n=6t+5$ and $n^{\prime }=6(t+1)+5=6t+11$. From the reverse rule with $k=1$, their children are

$$m={\displaystyle \frac{2(6t+5)-1}{3}}=4t+3,m^{\prime }={\displaystyle \frac{2(6t+11)-1}{3}}=4t+7.$$

Hence

$$m^{\prime }-m=(4t+7)-(4t+3)=4.$$

Thus first admissible children of consecutive $C_1$ parents advance in an arithmetic progression with step size $+4$.

4.2.2. $C_2$ Parents

Take consecutive $C_2$ parents $n=6t+1$ and $n^{\prime }=6(t+1)+1=6t+7$. From the reverse rule with $k=2$, their children are

$$m={\displaystyle \frac{4(6t+1)-1}{3}}=8t+1,m^{\prime }={\displaystyle \frac{4(6t+7)-1}{3}}=8t+9.$$

Hence

$$m^{\prime }-m=(8t+9)-(8t+1)=8.$$

Thus first admissible children of consecutive $C_2$ parents advance in an arithmetic progression with step size $+8$.

Lemma 9

(Progressions of Consecutive Parents). First admissible children of consecutive parents form arithmetic progressions:

$$C_1:(6t+5)\mapsto (4t+3),(6t+11)\mapsto (4t+7),\Delta =+4,$$

$$C_2:(6t+1)\mapsto (8t+1),(6t+7)\mapsto (8t+9),\Delta =+8.$$

Thus children of adjacent parents distribute evenly across odd integers with step size fixed by class.

Remark 6.

The offset ladders of Section 4.1.1 and Section 4.1.2 describe how each parent generates children in a ladder determined relative to its own value of n. The arithmetic progressions, by contrast, describe how numerically consecutive parents distribute their children across the integers. Both perspectives are needed: ladders explain the local offsets tied to each parent, while progressions explain the global coverage across parents.

Proof. 

For $C_1$ parents, each has the form $n=6t+5$. With the minimal admissible exponent $k=1$, the child is

$$R(6t+5,1)={\displaystyle \frac{2(6t+5)-1}{3}}=4t+3.$$

Subtracting the parent gives the offset

$${\Delta }_1(6t+5)=(4t+3)-(6t+5)=-2(t+1).$$

Thus the offset depends linearly on t and grows in magnitude as t increases.

For $C_2$ parents, each has the form $n=6t+1$. With the minimal admissible exponent $k=2$, the child is

$$R(6t+1,2)={\displaystyle \frac{4(6t+1)-1}{3}}=8t+1,$$

so the offset is

$${\Delta }_2(6t+1)=(8t+1)-(6t+1)=2t.$$

This offset also depends on t, and for $t\ge 1$ it is strictly increasing.

Therefore, offsets are not fixed increments across all parents, but arithmetic expressions relative to each parent’s index t within its residue class. Each live class generates an infinite ladder of children, and the offset size expands with t while preserving the admissibility rule (odd k for $C_1$, even k for $C_2$).

The arithmetic progressions across consecutive parents are simply the global counterpart of the same rule. When t increases by $+1$ (advancing to the next parent in the same class), the child also advances by a constant step ($+4$ for $C_1$ at $k=1$, $+8$ for $C_2$ at $k=2$, and in general $+2^{k+1}$). This step is independent of t because the dependence on t is linear.

Thus the two descriptions are isomorphic: offsets show how children are positioned relative to a fixed parent, while progressions show how those positions line up across the sequence of parents. Both arise from the same affine relation $R(6t+\rho ,k)=2^{k+1}t+c_{\rho ,k}$, and together they capture the local and global arithmetic structure of the reverse Collatz map. □

4.2.3. Higher Lifts

Lemma 10

(Quadrupling of Step Sizes at Higher Lifts). For each class, increasing the admissible exponent k by two applies two successive doublings, thereby quadrupling the progression step size of consecutive parents. Concretely:

$$C_1:+4\mapsto +16\mapsto +64\mapsto \cdots ,C_2:+8\mapsto +32\mapsto +128\mapsto \cdots .$$

Proof. 

From the general offset formulas in Section 4.1.3, the difference between children of consecutive parents is proportional to $2^k$. Replacing k by $k+2$ multiplies this factor by 4, hence quadruples the step size between odd children. Therefore each successive two-lift scales the step size by a factor of four. □

At higher admissible k-lifts, step sizes scale as $2^k$: each unit increase of k doubles the progression spacing, and in particular every two lifts quadruple it (Lemma 10). A convenient way to display this is to show the two-lift subsequences and stagger the one-lift intermediates:

$$\begin{array}{cc}\hfill C_1:& +4\to +16\to +64\to \cdots \hfill \\ \hfill C_2:& +8\to +32\to +128\to \cdots \hfill \end{array}$$

This pattern follows directly from the formulas of Section 4.1.3.

Table A2 in Appendix A displays these higher-k lifts explicitly. The overlay of odd and even admissible values shows how apparent gaps at lower scales are filled directly by higher lifts, ensuring complete coverage of the odd integers.

4.2.4. Visual Overlay

Corollary 4

(Visual Overlay and Complete Coverage). Overlaying the progression ladders from consecutive parents shows that apparent gaps at lower admissible lifts are exactly filled by higher lifts. Each anchor sequence covers its congruence class without overlap, and the union across all admissible lifts exhausts the odd integers. Thus ladder iterations across all lift levels ensure complete coverage of ${\mathbb{Z}}_{\mathrm{odd}}$. This structure is explicitly illustrated in Table A2.

Proof. 

By Lemma 9, consecutive parents generate fixed-step progressions, and by Lemma 10, higher admissible lifts scale these progressions by powers of four. The apparent omissions at a given scale correspond precisely to residue classes that are elements of progression of higher-lift ladders. Therefore the superposition of ladders fills all gaps systematically, partitioning the odd integers with no overlap. □

4.3. Anchor Ladders as the Basis of Coverage

All admissible structure originates from the two primitive anchors $1\in C_2$ and $5\in C_1$. Each admissible lift

$$R(1;k)={\displaystyle \frac{2^k-1}{3}},k\mathrm{even},$$

$$R(5;k)={\displaystyle \frac{2^k·5-1}{3}},k\mathrm{odd},$$

produces a new anchor point. Each such anchor initiates a ladder whose offsets and progressions are determined by its residue class and the parity of the admissible exponent k.

Lemma 11

(Anchors generate complete coverage). Every odd integer lies in exactly one ladder initiated by a lift of the primitive anchors 1 or 5. Higher admissible lifts extend these ladders indefinitely, and their superposition guarantees that no odd integer is omitted.

Proof. 

From Section 4.1.1 and Section 4.1.2, the offset formulas show that each live parent n generates children of the form $R(n,k)=(2^{k}n-1)/3$, linear in the progression index t and restricted in parity by class. Every new child becomes the base of its own ladder, and the process continues indefinitely. Since all ladders trace back to admissible lifts of 1 and 5, their union partitions ${\mathbb{Z}}_{\mathrm{odd}}$. Thus global coverage arises from the recursive expansion of anchor ladders. □

Remark 7

(Local ladders versus global progressions). Locally, the offsets $\Delta (6t+5)=-2(t+1)$ for $C_1$ and $\Delta (6t+1)=2t$ for $C_2$ describe how each parent generates its own ladder of children. Globally, consecutive parents within each class produce arithmetic progressions with fixed step sizes ($+4$ for $C_1$, $+8$ for $C_2$). These viewpoints are isomorphic: the local offsets of individual ladders aggregate into the global progressions across consecutive parents. The apparent large-scale structure is therefore nothing separate, but the emergent union of locally defined ladders.

Corollary 5

(Recursive sieve coverage). Overlaying the ladders anchored at 1 and 5 shows that gaps left at lower admissible lifts are exactly filled by higher lifts. Each new anchor produced by a higher lift initiates its own ladder, and the superposition of all such ladders partitions ${\mathbb{Z}}_{\mathrm{odd}}$ without omission or overlap. What appears globally as complete coverage is therefore the direct arithmetic consequence of local ladder recursion, functioning as a deterministic sieve.

Lemma 12

(Completeness by Anchor Sequences). Every odd integer belongs to exactly one admissible raising sequence anchored at $1\in C_2$ or $5\in C_1$. Each admissible lift $R(a;k)$ ($a\in \{1,5\}$) initiates an arithmetic progression whose step size is a power of two (Lemma 10). These progressions partition ${\mathbb{Z}}_{\mathrm{odd}}$ into disjoint congruence classes modulo $2^k$. Apparent gaps at finite depth correspond to congruence classes not yet reached by smaller k, but they are exactly the initial terms of higher raising sequences. Hence the iterative extension of anchor sequences across all lifts exhausts the odd integers with no omissions or overlaps.

Proof. 

By Lemma 8, each parent spawns an infinite ladder of children. Lemmas 9 and 10 show that these ladders form arithmetic progressions with step sizes doubling as k increases. Theorem 2 establishes that all such progressions originate from the two anchors 1 and 5. At any finite stage, some residue classes mod $2^m$ remain unfilled, but by Corollary 4, those classes are precisely the initial terms of higher anchor sequences. Thus every odd integer is absorbed at some finite lift, and the union of all anchor progressions partitions the odd integers completely. □

Global Interpretation

In the forward view, $E_f\left(n\right)=3n+1$ maps $n\mathrm{mod}6$ into $\{4,10,16\}\mathrm{mod}18$, the fixed gate that determines the child’s class. In the reverse view, the mod-9 cycle of first children selects the same classes once lifted by parity to mod-18. Forward gates and reverse ladders are therefore isomorphic descriptions of a single closure mechanism. The resulting global structure is the sieve pattern generated by the anchor ladders.

Corollary 6

(Origin at 1). By Lemma 12, every odd integer belongs to a unique admissible ladder within ladders within some admissible progression class. Tracing these ladders backward terminates uniquely at the self-parent 1 (since $R(1;2)=1$). Therefore the reverse Collatz function has a single global root: the integer 1. Every odd integer is a descendant of an admissible reverse function applied to 1, and no other origin is possible.

Theorem 3

(Structural Symmetry of Dyadic Lifts and Ladders). For every admissible parent, increasing the exponent k produces a dyadic scaling of offsets that is structurally parallel to the ladder system. Each doubling of k on the parent side corresponds to a doubling of step sizes on the ladder side, and each two-lift quadruples both in exact proportion. Thus the local dyadic effect on trajectories and the global extension of ladders remain aligned. Moreover, across successive doublings of k, the distribution of odd integers is balanced across congruence classes, showing that the system preserves structural symmetry between local recursion and global progression.

Proof. 

Fix a class $C\in \{C_1,C_2\}$ and two consecutive live parents p and $p^{\prime }=p+6$ in that class. For any admissible lift $k\ge 1$, the odd children are

$$R(p;k)={\displaystyle \frac{2^{k}p-1}{3}},R(p^{\prime };k)={\displaystyle \frac{2^k(p+6)-1}{3}}.$$

Hence the gap between the children at lift k is

$${\Delta }_k:=R(p^{\prime };k)-R(p;k)={\displaystyle \frac{2^k·6}{3}}=2^{k+1}.$$

Therefore

$${\Delta }_{k+2}=2^{k+3}=4·2^{k+1}=4{\Delta }_k,$$

so increasing k by two multiplies the child gap by 4.

Finally, the concrete sequences follow from the parity of admissible lifts: for $C_1$ the admissible k are odd ($k=1,3,5,\dots$), yielding ${\Delta }_k=2^{k+1}=4,16,64,\dots$; for $C_2$ the admissible k are even ($k=2,4,6,\dots$), yielding ${\Delta }_k=2^{k+1}=8,32,128,\dots$. In both cases, the step sizes scale exactly by a factor of four at every two-lift. □

Theorem 4

(Fractal Coverage by Anchor Lifts). The reverse Collatz function admits a fractal decomposition of the odd integers into phases generated by successive lifts of

$$R(n;k)={\displaystyle \frac{2^{k}n-1}{3}},k\ge 1.$$

This structure is governed by class residues $C_1,C_2,C_0$ and the parity of k:

• Anchor lifts. Every admissible lift of 1,

  $$A_t={\displaystyle \frac{2^{k_t}-1}{3}},$$

  with $k_t$ chosen so that $A_t$ is odd, generates a new anchor value (examples: $5,21,85,\dots$). Each anchor seeds a local system replicating the $C_1$–$C_2$–$C_0$ rotation on a larger scale.
• Parity rule. By Lemma 8, the parity of k determines the class of the child: odd k for $C_1$ parents, even k for $C_2$ parents, and $C_0$ closing paths when a multiple of 3 is reached.
• Superposition of lifts. By Lemmas 9 and 10, successive lifts superimpose into interlaced progressions, so apparent gaps at one scale are filled by higher admissible exponents.
• Equidistribution. By Lemma 3, across each 18-step cycle of odd parents, first-child classes occur with exact frequency $1/3$, balancing $C_1,C_2,$ and $C_0$ globally.

Thus the reverse Collatz operator generates a fractal system of offset ladders and progressions, anchored at 1, whose higher lifts iteratively fill all odd congruence classes without omission.

Theorem 5

(Global Iterative Coverage of the Odd Integers). The reverse Collatz operator covers the odd integers exhaustively through offset ladders and anchor sequence progressions. In particular:

• (Offset ladders) By Lemma 8, each live parent n generates children in arithmetic ladders with explicit formulas depending only on class and admissible parity.
• (Arithmetic progressions) By Lemmas 9 and 10, first admissible children of consecutive parents advance in fixed progressions ($+4$ for $C_1$, $+8$ for $C_2$), and higher lifts double these step sizes in sequence.
• (Equidistribution) By Lemma 3, live first-child classes are balanced in frequency $1/3$ each across every 18 consecutive integers, ensuring balanced propagation of classes.
• (Higher lifts) At each dyadic scale $2^m$, ladder progressions that appear incomplete at lower lifts are filled directly by higher lifts, so that every congruence class is eventually covered.
• (Completeness) By Lemma 12, the union of all anchor ladders across admissible lifts partitions ${\mathbb{Z}}_{\mathrm{odd}}$ with no omissions or overlaps.

Consequently, the global structure of the Collatz operator forms a deterministic, fractal coverage of all odd integers: every odd has a unique parent, no integers escape, and higher-lift ladder progressions eliminate all gaps.

5. Unification of Local and Global Frameworks

The residue lens and the offset ladders, developed in the previous sections, are not independent frameworks but complementary facets of a single operator.

Corollary 7

(Unique Parentage). Every odd integer n has exactly one admissible parent under the reverse Collatz operator.

Proof. 

Local admissibility fixes the parity of k and assigns n to a single class (Lemma 2, Prop. 1). Global offset ladders are disjoint and partition the odds (Lemmas 9, 10). Together these imply that no odd integer can arise from two different parents. □

Lemma 13

(Coverage by Anchors). Every odd integer lies in a raising sequence ultimately anchored at 1. The auxiliary anchor $5\in C_1$ arises as the first admissible lift of $1\in C_2$, so all raising sequences descend from the origin 1.

Proof. 

Local view. By Corollary 7, every odd integer has exactly one admissible parent, determined by the parity of k and its residue class mod 18. Thus each odd lies on a unique trajectory.

Global view. Anchors 1 ($C_2$) and 5 ($C_1$) generate the two parent families $n=6t+1$ and $n=6t+5$. The offset formulas for the first admissible lift convert these into child progressions:

$$(6t+1)\stackrel{k=2}{\to }8t+1(\mathrm{step}+8),(6t+5)\stackrel{k=1}{\to }4t+3(\mathrm{step}+4)$$

(Lemma 9). Higher admissible lifts $k\mapsto k+2$ multiply the step size by 4 (Lemma 10). The union of these interlaced progressions over all lifts covers ${\mathbb{Z}}_{\mathrm{odd}}$, with each odd integer appearing exactly once.

Unification. Since 5 itself is produced as the first lift of 1, every ladder sequence originates in the raising structure of 1. Therefore every odd integer arises in exactly one anchor sequence, and globally all odds are covered by the function rooted at 1. □

Corollary 8

(Forward–Reverse Closure). For every odd n, if $T\left(n\right)=(3n+1)/2^{k_{max}}$ then

$$n={\displaystyle \frac{2^{k}T\left(n\right)-1}{3}}\in \mathbb{Z}⟺k=k_{max}.$$

Hence the forward step coincides with the unique reverse admissible step in both class and exponent.

Proof. 

Immediate from Lemma 2 and Proposition 1. Since $k_{max}$ is unique in the forward map and admissibility requires $k=k_{max}$ for integrality, forward and reverse coincide. □

Local determinism (residue lens).

By Lemma 2, every live odd has a fixed parity of admissible doublings. By Proposition 1, the child’s class is decided locally by the middle-even residue in $\{4,10,16\}\left(\mathrm{mod}18\right)$. Lemma 5 shows that $k\mapsto k+2$ rotates these residues (and hence classes) in a 3-cycle.

Global completeness (offset lens).

Section 4.1.1, Section 4.1.2 and Section 4.1.3 show that consecutive parents generate arithmetic progressions of children with steps $+4$ ($C_1$) and $+8$ ($C_2$), scaling by $2^k$ at higher lifts. Overlaying these ladders ensures that every congruence class is filled, so the anchors $\{1,5\}$ exhaust ${\mathbb{Z}}_{\mathrm{odd}}$.

Unification.

The residue lens and offset ladders are two views of the same arithmetic mechanism:

• The residue framework determines which class a step enters (local determinism and unique parentage).
• The ladder framework determines where that class sits in the global partition (iterative completeness).

Together they describe the operator without ambiguity: every odd has one parent, and higher-lift ladders fill all congruence classes. The trivial cycle $1\to 4\to 2\to 1$ is the unique global anchor.

Theorem 6

(Unified Residue–Offset Framework). The residue lens and offset ladders are isomorphic descriptions of the same system. Locally, residues modulo 6 and 18 fix admissibility, parity of doublings, and class transitions. Globally, anchor ladders interlace into a deterministic sieve that covers all odd integers without omission or overlap.

Thus every odd has a unique parent (residue determinism), every odd lies in exactly one anchor ladder (offset progression), and the forward and reverse middle-even gates coincide. The Collatz dynamics are therefore unified into a single deterministic system: local residues and global ladders are different views of the same closure.

Theorem 7

(Collatz Closure Theorem). The Collatz operator preserves the set of odd integers and partitions it deterministically: the local residue framework and the global anchor ladders are isomorphic descriptions of a single system. Every odd integer lies in exactly one admissible ladder, and all trajectories converge to the trivial cycle $4\mapsto 2\mapsto 1$.

Proof. 

Local determinism. By Lemma 2 and Proposition 1, every live odd n admits a fixed parity of admissible doublings k, assigning it a unique parent and determining its child class via the mod-18 gate $\{10,4,16\}$.

Global sieve structure. By Theorem 5, all odd integers lie in raising sequences seeded by the anchors 1 and 5. Each admissible lift expands these ladders, and their union forms a deterministic sieve of offsets and progressions that covers the odd integers with no omissions or overlaps. Apparent gaps at lower lifts are precisely the starting points of higher lifts, as shown in Table A2.

Isomorphism. Corollary 2 and Lemma 4 establish that the mod-9 residue cycle and the mod-18 gate coincide arithmetically: the forward middle-even $E_f\left(n\right)=3n+1$ and the reverse middle-even $E_r(n,k)$ align at the same gate. Thus the residue framework and ladder framework evolve in synchrony.

Conclusion. Because residues fix local admissibility, anchors generate global coverage, and the two views coincide exactly at the middle-even gate, the Collatz system exhibits complete closure: the set of odd integers is invariant, every trajectory lies in an anchor ladder, and all paths converge to the trivial cycle $4\mapsto 2\mapsto 1$. □

6. Consequences

From the unified perspective of residue admissibility and higher-lift coverage, three immediate consequences follow:

Corollary 9

(Exhaustive inclusion). Every odd integer has an admissible parent and is therefore included in the partition anchored at 1 (and its first lift 5). No odd integer is excluded.

Corollary 10

(No divergence). No runaway trajectories exist. All progressions are eventually absorbed into the higher-lift ladder system and terminate at the trivial cycle.

Corollary 11

(No cycles beyond the trivial loop). The only cycle in the system is the trivial forward loop $1\to 4\to 2\to 1$. No other nontrivial cycles can occur.