GTE Orbits: From Arithmetic to Particle Masses
Two arithmetic steps from a single seed — and the three charged lepton generations appear, with no free parameters.
What Is GTE?
GTE stands for Generative Triple Evolution. The name describes the mechanism precisely: it generates triples of integers, and it evolves them through a deterministic arithmetic orbit — like a crystal growth law where each step is forced by the geometry of the previous one.
Each state in the orbit is an integer triple (a, b, c) at generation g. The three components play distinct roles:
The particle masses come from the b-values. The three generations of charged leptons correspond to the three b-values produced by two applications of the map: b = {73, 42, 275}.
The Map T
The GTE update map T takes a triple (a, b, c) and a step type (odd or even) and produces the next triple. The mechanism: divide the capacity c by the ladder index b to get a quotient q and remainder m. These two numbers control the update of all three components.
Step 0 — Divide:
Odd step (t = 1):
b' = b − (m + q)
c' = 2ⁿ − 1 (ridge Mersenne)
Even step (t = 2):
b' = b + F|q₂−q₁|
c' = 2n+2Nc − 1
Fk is the k-th Fibonacci number. The odd step contracts b (subtraction). The even step lifts b by a Fibonacci number. No free parameter appears anywhere.
The Lepton Seed
The starting point of the GTE lepton orbit is the Lepton Seed:
Where does (1, 73, 823) come from? It is the unique triple at ridge level n=10 that passes all four UGP invariants simultaneously — ridge lock, Fibonacci rigidity, kernel symmetry, and mirror invariance. It is not chosen. The MDL sieve and mirror constraints force it. 73 is prime (mirror-lock condition). 823 = 73×11 + 20 (the division structure is exact).
The Worked Cascade — Two Steps, Three Generations
Starting from the Lepton Seed, apply T twice. Every number below can be verified with pencil and paper.
Starting triple: the Lepton Seed at generation 1.
Apply map T with odd step (t=1). First: divide c by b.
Odd step (t = 1) — divide c by b:
823 ÷ 73 = 11 remainder 20
Check: 73 × 11 = 803 803 + 20 = 823 ✓
q₁ = 11 (quotient)
m₁ = 20 (remainder)
The quotient q₁ = 11 and remainder m₁ = 20 now drive the update of all three components.
Odd step (t = 1) — update all three components:
b' = b − (m₁ + q₁) = 73 − (20 + 11) = 73 − 31 = 42
c' = 2¹⁰ − 1 = 1024 − 1 = 1023 (ridge Mersenne)
a' = m₁ − (n + 2 − t) = 20 − (10 + 2 − 1) = 20 − 11 = 9
b' = 42 is the muon's arithmetic address. a' = 9 = N_c² is a machine-certified algebraic identity — not an assignment.
Even step (t = 2) — divide c by b:
1023 ÷ 42 = 24 remainder 15
Check: 42 × 24 = 1008 1008 + 15 = 1023 ✓
q₂ = 24 (quotient)
m₂ = 15 (remainder)
m₂ = 15 is not a coincidence. The ridge remainder lock theorem proves: for any valid divisor b₂, (2ⁿ−1) mod b₂ = 15 when n ≥ 5. Since b₂ = 42 divides R₁₀ = 1008, the remainder 15 is structurally guaranteed.
The quotient gap and the Fibonacci lift:
|q₂ − q₁| = |24 − 11| = 13
The gap is 13. The Fibonacci sequence at position 13:
The even step lifts b by F₁₃ = 233. This is not a free parameter — once the quotient gap is forced to 13 by the orbit structure, the Fibonacci lift is uniquely determined: b' = 42 + 233.
Why Fibonacci specifically? The gap 13 is itself the Fibonacci number F₇, where the index 7 = ord₇(2) + Nc + 1 is forced by the Z₇×Z₃ algebra. Here ord₇(2) = 3 is the multiplicative order of 2 modulo 7 (the unique k with 2k ≡ 1 mod 7, giving k = 3), and Nc = 3 is the QCD color rank. The Fibonacci recurrence is not a separate assumption — it is a consequence of the arithmetic structure, machine-certified by a computer proof system (Lean 4) that verifies every step automatically, with zero sorry.
Even step (t = 2) — update all three components:
b' = b + F₁₃ = 42 + 233 = 275
c' = 2^(10 + 2×3) − 1 = 2¹⁶ − 1 = 65536 − 1 = 65535
a' = m₂ − (n + 2 − t) = 15 − (10 + 2 − 2) = 15 − 10 = 5
b' = 275 is the tau lepton's arithmetic address. c' = 65535 = 2¹⁶ − 1 is another Mersenne number. a' = 5 = (N_c² + 1)/2 — another structural identity. Zero free parameters throughout.
Note on 1023 and 65535: The odd step produces c = 2¹⁰ − 1 = 1023; the even step extends it to 2^(n + 2Nc) − 1 = 2¹⁶ − 1 = 65535 (the exponent jump 2Nc = 6 carries the ridge from n=10 to 16). Both values are identical in GF(7) arithmetic — 1023 ≡ 1 mod 7 and 65535 ≡ 1 mod 7 — so the polynomial dynamics are unaffected. The distinction matters for the physical mass predictions, where the actual Mersenne value enters the mass formula.
The three lepton generations — result of two forced steps:
| Gen | Triple (a, b, c) | N-value (b) | Particle |
|---|---|---|---|
| g = 1 (seed) | (1, 73, 823) | 73 | Electron |
| g = 2 (odd step) | (9, 42, 1023) | 42 | Muon |
| g = 3 (even step) | (5, 275, 65535) | 275 | Tau |
The three N-values {73, 42, 275} are the output of two forced arithmetic steps from a sieve-forced seed. They are the arithmetic addresses from which the electron, muon, and tau masses are derived.
Why Three Generations? And Is This Just a Fit?
Why exactly Ngen = 3
The map T produces three triples because the orbit terminates at three steps under the structural constraints. This is not a parameter — Ngen = 3 is forced by seven independent structural conditions, all machine-certified in Lean 4.
Seven independent Lean-certified constraints each force Ngen = 3 independently. One master theorem certifies that all seven hold simultaneously.
The same arithmetic that produces three lepton generations produces exactly three quark generations — forced by the same constraints.
This is not numerology
A natural suspicion: "These numbers were chosen to match the particle masses." This suspicion is addressed directly by a null test.
1000-permutation null test: Take the orbit values {73, 42, 275} and scramble their order in 1000 random permutations. Apply the mass formula to each permutation. How many match the SM lepton masses within 1σ?
Answer: zero. Only the orbit order derived by the map T matches.
The N-values are not labels you can rearrange. They carry arithmetic structure (73 is prime, 42 = 6×7, 275 = 5²×11) that is specific to their position in the orbit. Permuting them destroys the mass predictions.
Key Takeaways
- GTE (Generative Triple Evolution) evolves integer triples (a, b, c) through an arithmetic orbit. The map T divides c by b, then updates all three components using the quotient and remainder. Odd and even steps alternate and have different update rules.
- The lepton seed (1, 73, 823; g=1) is the unique triple at ridge level n=10 satisfying all UGP invariants. It is not chosen — it is the output of the MDL sieve and mirror constraints.
- Two applications of T produce three generations: electron (b=73), muon (b=42), tau (b=275). The b-values are the arithmetic N-values from which particle masses are derived.
- m₂ = 15 (the remainder at step 2) is forced by the ridge remainder lock theorem — not a coincidence. F₁₃ = 233 appears because the quotient gap |q₂ − q₁| = 13 is forced. That gap equals F₇, where the index 7 = ord₇(2) + Nc + 1 is derived from the Z₇×Z₃ algebraic structure — machine-certified, zero sorry. Zero free parameters enter either step.
- Ngen = 3 is forced by seven independent structural constraints, all machine-certified. A 1000-permutation null test confirms the N-values cannot be rearranged — only the orbit order matches the SM lepton masses.
See Also
update_map_produces_canonical_orbit— view on GitHub ↗ridge_remainder_lock_general— view on GitHub ↗