The UGP State Space and Survivor Space
What a cell state actually is, what gets filtered out, and why the update rule is native to the state space — not imposed on top of it.
The Question
In the previous lesson, cells held values from {0, 1, 2, 3, 4, 5, 6}. But where do those values come from? What is the state space of UGP? Is it all integers? All primes? Something else entirely?
And once we have a state space, a harder question appears: the UWCA update rule seems to be placed on top of the state space — as if we invented it separately and then chose to run it there. Is that what's happening? Or is the update rule somehow intrinsic to the state space itself?
Step 1 — What Is a Cell State?
In UGP, each cell position i is assigned its own unique
prime number p_i. The state of cell i
is a residue — a remainder when dividing by p_i.
What is a residue? It is exactly the same as a remainder in long division. When you divide 47 by 7, the answer is 6 remainder 5. That remainder — 5 — is the residue of 47 modulo 7, written 47 mod 7 = 5.
For a prime p = 7, the possible residues are {0, 1, 2, 3, 4, 5, 6} —
all the possible remainders when dividing by 7. These are the 7 cell states.
Crucially, the symbols 0 and 1 are already inside the prime field GF(7) — they are native elements, not added from outside. The binary alphabet {0, 1} is a subset of {0, 1, 2, 3, 4, 5, 6}, intrinsically.
0 and 1 are native to the prime field — not imported from outside. The binary alphabet sits inside GF(7) naturally.
Step 2 — Why Primes? Non-interference by CRT
Each cell gets its own prime. But why primes specifically — what is wrong with, say, using 4, 6, 9 as the cell moduli?
The answer is non-interference. When two moduli share a common factor, operations in one can affect residues in the other. Primes share no common factors (other than 1), so they are completely independent.
Chinese Remainder Theorem (CRT): Given distinct primes p₀, p₁, p₂,… any combination of residues (r₀, r₁, r₂, …) corresponds to exactly one integer N in the range [0, p₀ × p₁ × p₂ × …). Reading cell i's state = computing N mod p_i. The primes don't interfere: changing cell i's residue does not affect any other cell's residue.
Concrete example
Three cells with primes p₀ = 3, p₁ = 5, p₂ = 7. Tape state: [1, 2, 4].
Find N such that:
N mod 3 = 1 (cell 0's state)
N mod 5 = 2 (cell 1's state)
N mod 7 = 4 (cell 2's state)
Answer: N = 67
Verify:
67 mod 3 = 1 (67 = 22×3 + 1) ✓
67 mod 5 = 2 (67 = 13×5 + 2) ✓
67 mod 7 = 4 (67 = 9×7 + 4) ✓
The single number N = 67 completely encodes the three-cell tape [1, 2, 4]. Reading any cell is just one division. The cells are completely independent.
Step 3 — The Full State Space
Put n cells together. Each cell has its own prime and its own set of residues. The full state space is the Cartesian product of all those residue sets.
Cell L (p = 3)
Cell C (p = 5)
Cell R (p = 7)
3 × 5 × 7 = 105
By CRT, each combo of residues maps to exactly one N in [0, 105).
Because p_L, p_C, p_R are distinct primes, changing any one cell's state leaves the other cells' states exactly unchanged.
{0,1}³ = 8
When all cells hold only 0 or 1, there are 8 configurations — the binary sub-sector.
Step 4 — The Survivor Space
Not every point in the full product space (all 105 configurations for 3 cells) is physically valid under UGP. The framework defines a set of algebraic invariants — conditions that every valid state must satisfy. States that pass all the tests are called survivors. The set of all survivors is the survivor space.
This is what "the UGP state space" means. Not the full product space. The survivor space — the structured subset that satisfies all four invariants.
Schematic — each dot is a potential configuration. Most are ruled out by the UGP invariants. Survivors form a sparse, structured subset.
The four UGP invariants
| Invariant | What it says |
|---|---|
| Ridge lock | The value c at the ridge step equals 2N − 1, fixed by the operational level N |
| Fibonacci rigidity | The quotient gap |q₂ − q₁| = 13 — the 13th Fibonacci number; forced by the Fibonacci lift theorem |
| Kernel symmetry | Quarter-Lock: k_M = k_G + ¼ k_L — a codimension-1 constraint on all lawful dynamics |
| Mirror invariance | b₁ is prime-locked and mirror-dual — both branch seeds are prime-locked simultaneously |
Each invariant eliminates most configurations. What remains — the intersection of all four — is the survivor space. It is not arbitrary; it inherits algebraic structure from the invariants.
Step 5 — N = 10 Is Not a Prime. What Is It?
The canonical operational level is N = 10. But 10 = 2 × 5 — it is not prime. If UGP is all about primes, how does 10 enter?
The answer is that different numbers in UGP play completely different roles. There are three roles, and they must not be confused:
| Number | Role | Must be prime? | Example |
|---|---|---|---|
| N | Ridge level — the operational parameter that sets c = 2N − 1 | No | N = 10 (= 2×5, not prime) |
| p_i | CRT coordinate primes — one per cell position, used for the residue encoding | Yes — this is why primes are needed | p = 3, 5, 7, 11, 13, … |
| b₁ | The orbit seed value — required by the mirror invariant to be prime | Yes — algebraic constraint | b₁ = 73 (prime) |
UGP operates over all positive integers — not just primes. The GTE orbit values (1, 73, 823, 9, 42, 1023, …) are integers; some are prime, some are not. Primes appear in specific, localized roles — as CRT coordinate labels and as an algebraic constraint on certain orbit values. The ambient space is integers throughout.
Step 6 — The Natural Topology: Clopen Cylinders
The survivor space has a natural topology — its basic open sets are called clopen cylinders. A cylinder is a set defined by specifying finitely many coordinates and leaving all others free.
"All configurations where cell 3 = 1 AND cell 4 = 0"
This constrains only 2 coordinates out of n. All other cells are completely free. In the product topology of the prime fields, this set is simultaneously open AND closed — hence "clopen." These are the building blocks of the state space's topology.
Why does this matter for the UWCA?
A UWCA tile specifies exactly what a neighborhood (L, C, R) must be, and what the output must be. That is precisely a clopen cylinder — finitely many coordinate values, all others free. UWCA tiles are not external machinery placed on top of the state space. They are the natural basic sets of its topology.
Step 7 — The UWCA Is Intrinsic, Not Imposed
Here is a single UWCA tile for Rule 110 in the binary sub-sector. It says: "if the neighborhood is (L=0, C=1, R=1), then the penalty is zero when the next state is 1."
This tile is not a foreign object placed onto the survivor space. It is a clopen cylinder of the survivor space's own topology. Rule 110 requires 8 such tiles — all of them are natural topological objects in the survivor space.
For any clopen, finite-local map on the survivor windows, there exists a finite UWCA tile set that realizes it. The GTE update map T is such a map. Therefore, its tile set is constructed from T itself — not added on top. The UWCA is the generic name for "finite-local law on this substrate."
The sweep (deterministic left-to-right penalty enforcement) is the zero-temperature limit of the natural dynamics on the dissonance functional — itself a natural object on the survivor space. Nothing external is required once the survivor space is fixed.
Tile: (L=0, C=1, R=1) → next C = 1
penalty e_C = 0 iff output = R(0,1,1) = 1
One of 8 tiles for Rule 110. All 8 are finite clopen cylinders in the survivor space's topology — natural objects, not foreign additions.
Key Takeaways
- Each cell position i has its own prime p_i. The cell's state is a residue mod p_i — an element of {0, 1, …, p_i − 1}. The binary symbols 0 and 1 are native elements of GF(p) — not imported from outside.
- The full state space is the Cartesian product of all prime residue rings. The Chinese Remainder Theorem guarantees that distinct primes do not interfere: one large number N encodes the entire tape, and reading any cell is one modular division.
- The survivor space is the subset satisfying four UGP invariants: ridge lock, Fibonacci rigidity, kernel symmetry, and mirror invariance. This — not the full product space — is what "the UGP state space" means in the theory.
- N = 10 (the operational level) is NOT one of the CRT primes. It is a separate parameter that sets the ridge value c = 210 − 1 = 1023. Primes serve three distinct roles: CRT coordinate labels (p_i), the polynomial field GF(7), and algebraic constraints on certain orbit values (b₁ = 73 must be prime).
- UWCA tiles are clopen cylinders — the natural basic sets of the survivor space's topology. The Internal Church–Turing Theorem (P08) shows every finite-local map on survivors is expressible as a finite tile set. The GTE map T is such a map, so the UWCA is intrinsic to the survivor space — not imposed on it from outside.
- The next step: what does the UWCA actually do, pass by pass, when it runs? L05 traces one complete sweep in detail, with register values and a full worked example.
See Also
uwca_sweep_implements_rule110— view on GitHub ↗ (preview — covered fully in L05)ugp_is_turing_universal— view on GitHub ↗ (preview — covered fully in L05)