The Cyclotomic Fibonacci Bridge

Cyclotomic polynomials generate the axiom chain. Fibonacci carries the gate. Pisano speaks E8.

Two views of the same structure

What you were taught:
Cyclotomic polynomials factor xn-1. Fibonacci counts rabbits. Pisano periods are a curiosity in modular arithmetic. These are separate topics in separate textbooks.
What the axiom shows:
Cyclotomic polynomials at D=2 generate every axiom prime. Fibonacci carries the GATE. Pisano periods at axiom primes are all smooth, and their lcm = 240 = |roots(E8)|. One equation, three classical sequences, one web.

The Cyclotomic Generation Theorem

THEOREM (Cyclotomic Generation, S717): The cyclotomic polynomials evaluated at D=2 generate the axiom chain:
Phi_1(2) = 1 = sigma   |   Phi_2(2) = 3 = K   |   Phi_3(2) = 7 = b   |   Phi_4(2) = 5 = E Phi_10(2) = 11 = L   |   Phi_12(2) = 13 = GATE The smooth indices are {1, 2, 3, 4, 6, 10} — exactly D*K = 6 values.
PROOF: Phi_n(2) = (2n-1) / product(Phi_d(2) for d|n, d < n). Direct computation.

The first four cyclotomics give the inner chain

nPhi_n(x)Phi_n(2)AxiomRole
1x - 11sigmaGround state
2x + 13KClosure
3x2 + x + 17bDepth
4x2 + 15EObserver
5x4+x3+x2+x+131boundaryCC1(D)[5]
6x2 - x + 13KCollapse to closure
10x4-x3+x2-x+111LProtector (D*E = 10)
12x4-x2+113GATEBoundary (D2*K = 12)

Note: D = 2 itself is the input, not an output. The bridge generates all other primes. Phi_5(2) = 31 = M(5), the first Mersenne prime outside the axiom. The boundary is built in.

THEOREM (Cyclotomic Smooth Indices, S717): Phi_n(2) is 11-smooth for exactly n in {1, 2, 3, 4, 6, 10}. Count = D*K = 6.
These are the proper divisors of 12 = lambda(DATA) plus 10 = D*E = degree.
THEOREM (Zsygmondy Characterization, S718): Phi_n(2) is smooth iff every Zsygmondy primitive prime of 2n-1 is an axiom prime (≤ L).
n=2: K=3   n=3: b=7   n=4: E=5   n=6: none (Zsygmondy exception)   n=10: L=11 These exhaust all axiom primes. The NEXT Zsygmondy prime (n=12) is GATE=13 = wall.
PROOF: Phi_n(2) = (2n-1)/prod(Phi_d(2), d|n, d<n). Phi_n(2) is smooth iff its primitive prime factors are all ≤ 11. Verify: n=5 gives 31, n=7 gives 127, n=8 gives 17. All walls. n=6 = D*K is the unique Zsygmondy exception for base D=2 (no new prime at all). QED.

Where axiom primes first appear as Zsygmondy primes

Axiom primeFirst Zsygmondy indexIndex value
K = 3n = 2D
E = 5n = 4D2
b = 7n = 3K
L = 11n = 10D*E (degree)
GATE = 13n = 12D2*K = lambda(DATA)

Every axiom prime enters at an axiom-product index. GATE enters at lambda(DATA) = the exponent of the data ring. The Zsygmondy exception n = D*K = 6 adds K = 3 for free (no new prime). After L=11 at n=10, the next primitive prime is GATE=13 at n=12. The smooth zone ends at the protector.

The Cyclotomic-Depth Bridge

THEOREM (Depth = Cyclotomic, S717): The depth quadratic f(x) = x2 - x - 1 equals the 6th cyclotomic polynomial minus D:
f(x) = Phi_6(x) - 2 = Phi_6(x) - D PROOF: Phi_6(x) = x2 - x + 1. Subtract 2. QED.

Phi_3 maps bridge to depth, closure to gate

pPhi_3(p) = p2+p+1= sigma(p2)Smooth?
D = 27 = bsigma(4) = 7Yes
K = 313 = GATEsigma(9) = 13No (13)
E = 531sigma(25) = 31No (31)
b = 757 = 3*19sigma(49) = 57No (19)
L = 11133 = 7*19sigma(121) = 133No (19)

Phi_3(D) = b and Phi_3(K) = GATE. The same cyclotomic maps D to b and K to GATE. These are the two critical transitions: bridge-to-depth and closure-to-boundary. Phi_3 is smooth at D ONLY. At K it hits the GATE. At E+ it escapes the axiom.

The Twin Gate Theorem

THEOREM (Twin Gate, S717): Two classical sequences hit the same wall from opposite sides:
sigma(n) smooth for n = 1..D3=8. Breaks at K2=9: sigma(K2) = 13 = GATE F(n) smooth for n = 0..6. Breaks at b=7: F(b) = 13 = GATE K2 and b are the Pell twins (K2 - b = D). The SAME value — GATE = 13 — terminates both smooth runs, from the twin directions.

sigma(n) = sum of divisors

nsigma(n)Axiom nameSmooth?
11sigmaYes
23KYes
34D2Yes
47bYes
56D*KYes
612D2*KYes
78D3Yes
815K*EYes
9 = K213GATEWALL

sigma(K2) = 1 + K + K2 = Phi_3(K) = 13 = GATE. The Pell twin K2 = 9 is where the divisor function first escapes the axiom.

The Fibonacci-Axiom Map

THEOREM (Fibonacci Fixed Point, S717): F(E) = E. The observer is a fixed point of Fibonacci.
THEOREM (Fibonacci-Gate, S717): F(b) = 13 = GATE. Depth maps to the boundary.

Fibonacci at axiom positions

nF(n)Axiom valuePrime?
0 = o0void-
1 = sigma1sigma-
2 = D1sigma-
3 = K2DYes
5 = E5E (FIXED POINT!)Yes
7 = b13GATEYes
11 = L89primeYes
13 = GATE233primeYes

The Fibonacci chain image: K maps to D (closure to bridge), E maps to itself (fixed point!), b maps to GATE (depth hits the wall). F(p) is prime for ALL five axiom primes.

THEOREM (Fibonacci Axiom Primality, S717): F(p) is prime for all axiom primes p in {K=3, E=5, b=7, L=11} and GATE=13, and also 17 and 23.
First composite F(p): F(19) = 37 * 113. Note: 19 = f(E) (depth quadratic of the observer) and 37 is the depth quadratic return prime. The Fibonacci primality breaks at the observer's shadow.

The Pisano-E8 Theorem

THEOREM (Pisano-E8, S717): The Pisano periods (Fibonacci mod p) at axiom primes are all smooth and in axiom vocabulary:
pi(D)=K=3   pi(K)=D3=8   pi(E)=D2*E=20   pi(b)=D4=16   pi(L)=D*E=10 Their least common multiple:
lcm(3, 8, 20, 16, 10) = 240 = D4*K*E = |roots(E8)| SEVENTH PATH to 240. PROOF: direct computation. QED.
Also: pi(DATA=210) = 240. The Fibonacci period in the data ring IS E8.

Pisano periods at axiom and boundary primes

ppi(p)FactorizationAxiom nameSmooth?
2 = D33KYes
3 = K823D3Yes
5 = E2022*5D2*EYes
7 = b1624D4Yes
11 = L102*5D*EYes
132822*7THORNSYes
173622*32D2*K2Yes
19182*32MEYes
234824*3SEESYes
29142*7D*bYes
377622*19-No

ALL Pisano periods at primes up to 31 are 11-smooth. First non-smooth: pi(37) = 76 = 4*19. 37 is the depth quadratic return prime — the same prime that breaks Fibonacci primality via F(19).

The Pisano-E8 Mechanism

THEOREM (Pisano-E8 Mechanism, S718): The identity lcm(pi(D),...,pi(L)) = 240 follows from THREE axiom structures:

(1) Legendre Sorting. The Legendre symbol (E|p) classifies axiom primes:
QNR (E invisible): {D, K, b} → pi(p) | 2(p+1) QR (E visible): {L} → pi(p) | p-1 Ramified (E self-blind): {E} → pi(p) = 4E (2) Cunningham Vocabulary. Each bound B(p) is a pure axiom product:
B(D)=D(D+1)=D*K   B(K)=D(K+1)=D3   B(b)=D(b+1)=D4 B(L)=L-1=D*E   B(E)=4E=D2*E because D+1=K, K+1=D2, b+1=D3 (Cunningham) and L-1=D*E (the (p-1) ladder).
(3) LCM. lcm(D*K, D3, D2*E, D4, D*E) = D4*K*E = 240.
For pi(D)=K (half bound, since -1=1 in char 2): lcm(K, D3, D2*E, D4, D*E) = 240 too, because K=3 is coprime to all D-powers and already present. QED.

E-Visibility: the Legendre symbol IS E2 self-blindness

p(E|p)MeaningBound type
D = 2-1E invisible to bridge2(p+1) = D*K
K = 3-1E invisible to closure2(p+1) = D3
E = 50E self-blind4E = D2*E
b = 7-1E invisible to depth2(p+1) = D4
L = 11+1E visible to protectorp-1 = D*E

The observer E=5 is the discriminant of x2-x-1 (the Fibonacci characteristic polynomial). The Legendre symbol (E|p) encodes who can "see" the observer: only L, the protector. E2 self-blindness is literal: (E|E) = 0 (ramified). E cannot see itself. This is the E2 = null theorem expressed in Legendre symbols.

THEOREM (Golden Ratio Primitive Root, S718): The golden ratio phi = (1+√E)/D is a primitive root mod L=11.
√5 ≡ 4 (mod 11).   phi ≡ (1+4)/2 ≡ 5*6 ≡ 8 (mod 11).   ord(8) = 10 = L-1. PROOF: 810 ≡ 1 (mod 11), and 85 ≡ 10 ≡ -1 ≠ 1. So ord(8) = 10 = L-1. QED.
The observer (E in √E) and the bridge (D in /D) construct phi, and phi generates all of FL*. The protector is the only prime that can see the observer — and phi proves it by generating all nonzero residues.

Cross-chain Pisano identities

pi(D) * pi(L) = K * D*E = 30 = P(0) = shadow polynomial at zero The first and last axiom primes' Pisano periods multiply to the shadow polynomial constant. pi(D) = K: duality's Fibonacci = closure (cross-chain!) pi(L) = D*E = degree: protector's Fibonacci = degree of TRUE FORM pi(K) = D3 = legs: closure's Fibonacci = spider's legs pi(b) = D4: depth's Fibonacci = fourth power of bridge pi(GATE) = D2*b = THORNS: gate's Fibonacci = thorns (8 legs * b segments / D) All Pisano periods speak axiom vocabulary. The Fibonacci sequence is axiom-native.

THEOREM (Eight Paths to 240, S717): D3 = 8 independent mathematical constructions, each fed axiom inputs, all produce 240 = D4*K*E. The paths count the dimension. ALL factor through the Catalan identity K2 = D3 + sigma (Mihailescu 2002), which forces D=2, K=3, hence E=5, b=7, L=11, hence 240.

D3 = 8 Paths to 240

#PathMachineFormula
1ShadowPolynomial evalP(b) = (6)(5)(4)(2) = D4*K*E
2IndexGroup quotient[S8 : GL(3,F2)] = (D3)! / (D3*K*b)
3GeometryRoot count112 (basis) + 128 (code) = D4(b + DK)
4EisensteinModular form-2k/Bk at k=D2=4
5FactorialFactorial ratioD * E! = D * (D3*K*E)
6KissingSphere packingtau(D3=8) = 240 touching spheres
7PisanoFibonacci modlcm(pi(D),pi(K),pi(E),pi(b),pi(L))
8Pisano DATAFibonacci modpi(DATA=210) = 240

Unification: Each path computes D4*K*E through a different factorization. Root identity: K2 = D3 + sigma (Catalan). Bonus: E! = D3*K*E = 120. The observer's factorial IS legs*closure*observer. Theta ratio: 2160/240 = K2 = 9 = STOP. The E8 series knows where the chain ends.

Pisano sum and product

Sum: pi(D)+pi(K)+pi(E)+pi(b)+pi(L) = 3+8+20+16+10 = 57 = K*f(E) = Phi_3(b) The sum of Pisano periods = Phi_3 evaluated at depth. The cyclotomic connection runs both ways.
pi(GATE=13) = 28 = THORNS = D2*b pi(23) = 48 = SEES = phi(DATA) pi(f(E)=19) = 18 = ME = inner axiom sum Every Pisano period at an axiom-significant prime IS an axiom constant.

Explorer

The Cyclotomic Ladder

Number Theory Thread: Cyclotomic polynomials connect to the Lambda Chain (Carmichael crystallization), depth quadratic return (37 appears in both Fibonacci and Pisano breaks), E8 roots (seventh path to 240), and Pell twins (K2 and b bound the Twin Gate). The Smooth Census catalogues the divisor-sum run independently.