Hyperfactorization Theorem

Module Thesis

The No-Tie Lemma and Remainder Descent prove that the ABCD encoding is injective; coordinate injectivity is the first structural hinge of the series.

Overview

The ABCD Coordinate Chart assigns every object a four-dimensional address. But is that address unique? The Hyperfactorization Theorem answers: yes. It is the first hinge theorem of the entire series – the result on which all subsequent structural claims depend. If two distinct objects could share the same ABCD address, the coordinate system would be ambiguous and the framework’s later derivations would collapse. The Hyperfactorization Theorem closes that door.

The Core Idea

The theorem states that every $X\ge 2$ in $\tau \text{-Idx}$ has exactly one decomposition:

$$X={\left({}^{C}A\right)}^B\cdot D$$

subject to four conditions: (i) $A$ is an internal prime, (ii) $B\ge 1$, (iii) $C\ge 1$, and (iv) $D\ge 1$ with all prime factors of $D$ strictly less than $A$. Both existence and uniqueness are proved.

The proof rests on three lemmas, each hard-won:

Tetration injectivity (from Part III): if ${}^{C_1}A={}^{C_2}A$ for prime $A$, then $C_1=C_2$. Tetration preserves enough structural information for the greedy peel to be deterministic.

The No-Tie Lemma (I.L03): if both ${}^{c_1}A|X$ and ${}^{c_2}A|X$ with $c_1<c_2$, the greedy algorithm deterministically selects $c_2$. No two tetration heights can “tie” – there is always a well-defined maximum. This prevents the coordinate extraction from encountering an ambiguous choice point.

Strict Remainder Descent (I.L04): after extracting the tower atom ${\left({}^{C}A\right)}^B$, the remainder $D$ is strictly smaller in every relevant measure. This ensures the greedy peel terminates and the decomposition is finite.

Together, these three results establish that the ABCD chart $\Phi$ is not merely total (every object has an address) but injective (distinct objects have distinct addresses). The coordinate system is a genuine bijection onto its image.

Why This Matters

Injectivity has a profound consequence: shadow equality collapses to ontic identity. If two objects share the same ABCD coordinates, they are the same object. There is no “accidental” address collision. This means the three-level equality hierarchy introduced in Earning Arithmetic does not produce ghost distinctions – the coordinate system is faithful to the underlying ontology.

The Hyperfactorization Theorem is called a “hinge” because it is the structural pivot between the kernel’s abstract orbit structure and the concrete coordinatized universe that the rest of the framework builds on. The Prime Polarity Theorem (next module) will use this coordinate system to discover the bipolar structure of primes.

Key Claims

1. I.T04 – Hyperfactorization Theorem: every $X\ge 2$ has a unique ABCD decomposition (established, machine-checked in TauLib)
2. I.L03 – No-Tie Lemma: greedy peel is deterministic (established, machine-checked)
3. I.L04 – Strict Remainder Descent: decomposition terminates (established, machine-checked)
4. Shadow equality collapses to ontic identity under the ABCD chart (tau-effective)