The Triangle: One Substrate, Three Views
UGP arithmetic, the GTE orbit, and the polynomial are not three separate things. They are three descriptions of a single mathematical object — and all three arrows between them are machine-certified.
What Path 1 Has Built
Over six lessons, three distinct objects have appeared. It is tempting to think of them as separate pieces of the theory. This lesson shows they are not.
The survivor space — configurations of prime residues satisfying the four UGP invariants. This is the substrate: the space in which everything else lives.
The sequence of triples (1,73,823) → (9,42,1023) → (5,275,65535). Two arithmetic steps from the lepton seed. The N-values b = {73, 42, 275} are the particle mass addresses.
p(L,C,R) = C + R − CR − LCR over GF(7). The update rule. On binary inputs it equals Rule 110. Selected by MDL — 19 bits.
The question: are these three separate objects, or are they related? The answer — proved and machine-certified — is that they are three descriptions of the same algebraic object, viewed from three different angles.
The Triangle
Three nodes. Three edges. All arrows machine-certified.
Explore the three edges
The GTE update map T is a finite-local endomorphism of the survivor space (as shown in L04 and L05). When you follow the orbit of the lepton seed under T — starting at (1, 73, 823) and applying the map twice — you get the two subsequent triples that encode the muon and tau.
The GTE orbit is not defined separately from the UGP substrate. It IS the orbit generated by the UGP update map T on the survivor space, starting from the MDL-forced seed. The spectrum arm of the theory (masses, quantum numbers) is produced by following this orbit.
The polynomial p(L,C,R) is the native update rule of the survivor space. UWCA tiles are clopen cylinders — the natural basic sets of the survivor space's topology (L04). The polynomial is not placed on top of the substrate: it is constructed from the substrate's invariants by MDL minimization.
The dynamics arm of the theory (computational universality, Rule 110) comes from the polynomial evaluated on the survivor space. The GTE dynamics IS the UWCA running the tile set Σ_GTE — a finite tile set derived from the GTE map T.
P08: "UGP supplies the substrate (UWCA evaluator); GTE is a program (finite tile set) that runs on it."
This is the closing edge — the hardest to see. It says: the GTE orbit's own algebraic structure forces the polynomial.
The orbit has a parity shadow: the pattern of even/odd remainders alternating through the cascade encodes the same information as the polynomial's GF(7) structure. Combined with the MDL selection principle — which uniquely picks the polynomial as the shortest rule consistent with the invariants — the orbit structure and the polynomial are two representations of the same object.
The closing edge is machine-certified: the orbit parity shadow + MDL uniquely identifies the polynomial. All three arrows are proved.
GTE Is a Program Running on the UWCA
One way to state the triangle relationship concisely is P08's formulation:
"UGP supplies the substrate (UWCA evaluator); GTE is a program (finite tile set) that runs on it."
The machine: The UWCA is the evaluation mechanism — the survivor space together with the four-pass sweep. It is a universal computer (L05). Any computable function can be expressed as a finite tile set running on it.
The program: The GTE update map T is implemented as a specific tile set Σ_GTE. This tile set encodes the orbit arithmetic — the divide-then-update rule — in terms of local clopen operations on the survivor space.
The same orbit: The sequence (1,73,823) → (9,42,1023) → (5,275,65535) is simultaneously:
- An arithmetic sequence — produced by applying T to integer triples. This is the spectrum arm: masses, quantum numbers.
- A computation — what the UWCA computes when it runs tile set Σ_GTE. This is the dynamics arm.
"GTE orbit" and "UWCA running Σ_GTE" are two names for the same mathematical object, viewed from two different angles.
Why This Matters
The triangle is not an aesthetic observation. It has concrete consequences.
If the three objects were separate, the theory would have three independent foundations — and each would need its own justification. Because they are one object, a single justification (MDL + PSC) covers all three. No hidden redundancy.
Any result about the polynomial (e.g., Turing universality via Rule 110) is automatically a result about the GTE orbit — and vice versa. Proofs about one side of the triangle transfer to the other.
The triangle shows that the particle spectrum (GTE) and the dynamics (polynomial) are both forced by the same substrate (UGP). No independent choice is made for either.
Key Takeaways
- The UGP triangle has three nodes: (1) the arithmetic substrate (survivor space), (2) the GTE orbit (particle spectrum), and (3) the polynomial p(L,C,R). All three are the same mathematical object viewed from different perspectives.
- Edge 1 (UGP → GTE): The GTE orbit is the trajectory of the lepton seed under the UGP update map T. The spectrum arm grows from the substrate.
- Edge 2 (UGP → Polynomial): The polynomial is the native update rule of the survivor space. The UWCA evaluates it. GTE is a finite tile program running on the UWCA.
- Edge 3 (GTE → Polynomial, the closing edge): The orbit parity shadow combined with MDL uniquely identifies the polynomial. All three arrows are machine-certified. The triangle closes.
- This unification means there are no redundant assumptions: a single MDL + PSC derivation justifies all three objects simultaneously. Proofs on one side of the triangle transfer to the others.
- The triangle closes a circle: two independent routes — Chain A (PSC arithmetic: Nc=3 → ridge → Fibonacci → orbit → p) and Chain B (MDL algebra: Z₇×Z₃ → p directly) — both arrive at the same polynomial. This convergence is machine-certified with zero sorry.
The triangle closes a circle. Two independent derivation routes both arrive at the same polynomial p. Chain A (PSC arithmetic chain): PSC → Nc=3 → ridge constant 16 → Fibonacci gap 13 → orbit {73, 42, 275} → p (via orbit-parity interpolation). Chain B (MDL algebraic chain): MDL → Z₇×Z₃ → p directly. Both routes are machine-certified with zero sorry — they are not two independent hypotheses about p but two rigorous proofs that the arithmetic and the algebra are consistent descriptions of the same object.
Path 1 Complete
You now have the full foundation: the problem (L01), the principle (L02), the polynomial (L03), the substrate (L04), the UWCA (L05), the orbit (L06), and the triangle that unifies them (L07).