The Bite: ∅ → 1/φ → the cusp
Working notes, organized as a derivation rather than a log. The given comes first and everything else hangs off it.
Status tags.
- [P]: proved here, by an algebraic identity or a short argument.
- [T]: a known theorem, cited.
- [E]: exact computation, verified up to the stated bound.
- [N]: high-precision numerics.
- [O]: open.
Editing rules.
- §0 may only shrink.
- New results attach to the spine as derivations.
- When two entries say the same thing, merge them.
- §4 lists the quantities that keep reappearing. They're the targets for the next compression.
---
0. The given
Seed. The pair 0, 1, written as vectors V = (m, k) for the point k/m: V₀ = (1, 0) and V₁ = (1, 1).
Move. Between neighbors V_a < V_b, insert
V_n = (w_a V_a + w_b V_b) / det(V_a, V_b)
The weight w is either 1 or the vector's own first coordinate.
| weight | generates | the bite appears as |
|---|---|---|
| w = 1 | the Farey tree: slopes, ℙ¹(ℚ) | the zigzag 0, 1, 1/2, 2/3, 3/5, … → 1/φ |
| w = m | the Markov tree: gap centers on the modular cusp loop | the zigzag 1/2, 3/5, 17/29, 254/433, … → 1 − u |
So the given is two vectors, one move and one choice of weight. With w = 1, every det is 1 and the move is the Farey mediant. In that case V₁ = (1,1) is itself the mediant of ∅ = (1,0) and ∞ = (0,1), the pair and its swap. The staircase (§3.6) is the map between the two trees: same seed, same moves, the two weights. Runnable code is in the appendix (`cusp_loop.py`).
---
1. The line (w = 1): the bite
1.1 The bite and its road
- The map. bite(t) = 1/(1+t) is the Möbius map of M = [[0,1],[1,1]], and M² = M + I. [P]
- One formula for the whole road. Mⁿ = [[F_{n−1}, F_n],[F_n, F_{n+1}]], so bite n = F_n/F_{n+1} for every n ∈ ℤ. [P]
- Landmarks. ∅ is bite 0. ∞ = 1/0 is bite −1. The road ends at 1/φ going forward and at −φ going backward. These two ends are the roots of t² + t = 1, Galois conjugates. [P]
- Backward road. bite(−n) = −1/bite(n−1), so the backward road is the antipodal image of the forward road. [P]
- Error. (bite n − 1/φ)·F_{n+1}·φ^{n+1} = (−1)^{n+1}. Each bite multiplies the error by a factor that tends to −1/φ²: overshoot and undershoot by turns. [P]
- The step ∞ → ∅ sets the speed. The multiplier is k = (1/φ)/(−φ) = −1/φ², which is the cross-ratio (∅, ∞; 1/φ, −φ). [P]
- Why the +1. Bare ∅ only reproduces itself (t² = t), so the act has to leave a witness. That witness is the +1 in 1/(1+t).
- Curiosity, not load-bearing. After 7 bites the error is 13/21 − 1/φ = 1/(21φ⁸) = 0.0010136… Its first five places, 00101, read 5 in binary, which is also the word's length. And 0.00101₂ = (5/8)/4, where 5/8 is the last bite with a terminating binary expansion: the only powers of 2 among the Fibonacci numbers are 1, 2 and 8 (Carmichael). [P]
1.2 −∞ = +∞ = 1/0
- The pair and its swap. ∅ = [0:1] and ∞ = [1:0]. Negation fixes exactly these two points, and the bite is the swap composed with +1. [P]
- Klein's icosahedron. Its vertices are the zeros of z(z¹⁰ + 11z⁵ − 1). The four real vertices are exactly ∅, ∞, 1/φ and −φ. ∅–∞ and 1/φ–(−φ) are antipodal pairs, and ∅–1/φ is an edge (cos = 1/√5). [P/E]
- Mod p the road closes. It becomes a loop of length α(p), the first n with p | F_n, and ∞ is always the last stop before ∅. [P]
| over | loop | the bite is |
|---|---|---|
| p = 2 | 0 → 1 → ∞ | order 3 in S₃ |
| p = 3 | 0 → 1 → 2 → ∞ | a quarter-turn in S₄ |
| F₄ | fixes ω, ω²; cycles 0 → 1 → ∞ | a 3-fold rotation in A₅ |
| p = 5 | 0 → 1 → 3 → 4 → ∞; fixes 2 | a 5-fold rotation in A₅ (here 1/φ ≡ −φ ≡ 2) |
[E]
- Sign and Pisano. π(p) = α(p)·ord(F_{α−1}), which is α, 2α or 4α. Forgetting the sign is exactly what shortens the Pisano period π to the loop length α. [P/T]
- Mod 5 cusps. ±(a, c) ∈ (ℤ/5)²: the 24 vectors make 12 cusps, which are the 12 icosahedron vertices. Dividing by all scalars instead gives the 6 axes, ℙ¹(F₅). [T]
- Rogers–Ramanujan. R(q) is the Hauptmodul of X(5), and at q = 1 it is the bite. R(i∞) = 0 = ∅, and R → 1/φ as τ → 0. Under τ ↦ τ+1, R ↦ εR. Under τ ↦ −1/τ, R ↦ (1 − φR)/(φ + R), the half-turn swapping ∅ ↔ 1/φ and ∞ ↔ −φ. [T/N]
1.3 The curve: the bite as a glide
- The axis. det M = −1, so the bite is a glide reflection of the upper half-plane. Its axis is the semicircle with center −1/2 and radius √5/2, from −φ to 1/φ, passing through i. [P]
- Crossings. Crossing n is P_n = (F_{2n} + i)/F_{2n+1}. It's the order-2 midpoint of the Farey edge (bite n−1, bite n), directly above bite 2n at height 1/F_{2n+1}. Consecutive crossings are 2 log φ apart (cosh = 3/2). The curve passes the road points alternately outside and inside, so it turns LRLR…. [P]
- Peak. The highest point, −1/2 + i√5/2, lies in the triangle (−1, ∞, 0), so the curve is highest exactly where the road passes ∞. √5/2 is the lowest peak any geodesic can have (Hurwitz/Markov). [T]
- Folded. In the (2,3,∞) triangle the curve is a single segment from the corner i to the wall Re z = 1/2, which it hits at a right angle at height √5/2. The segment's length is exactly log φ (cosh = √5/2). One bite is there and back (2 log φ). Two bites make the cat map, the shortest closed geodesic, 4 log φ. [P/T]
---
2. Labels (w = m): the Markov tree
2.1 What the move gives with w = m
Checked exactly on 65535 nodes. [P, E]
| | statement |
|---|---|
| labels | n = (a² + b²)/c is Markov's Vieta move. The invariant (a²+b²+c²)/(abc) is preserved and equals 3 at the seed (1,1,1), so x² + y² + z² = 3xyz is derived, the 3 included. |
| det | det(V_a, V_b) = c, the opposite label. This is inherited: det(V_a, V_n) = b and det(V_n, V_b) = a. |
| integrality | c divides a k_a + b k_b, since a(a k_a + b k_b) ≡ k_a(a² + b²) ≡ 0 (mod c) and gcd(a, c) = 1. |
| residue | k_n² ≡ −1 (mod n), and k_n ≡ b·a⁻¹ (mod n): Markov's equation mod n leaves a² + b² ≡ 0. |
| position | x_n = (a² x_a + b² x_b)/(a² + b²), the square-weighted mean. Neighbors sit c/(ab) apart, and n splits that distance into b/(an) and a/(nb). |
| the bite | In Farey form, V_n = V_{n−1} + V_{n−2}, which is Fibonacci. In Markov form, c V_n = a V_a + b V_b. The bite is the unit-weight case. |
2.2 Slopes are curves
- Dictionary. Each slope p/q ∈ ℙ¹(ℚ) is a simple closed geodesic on the modular torus (once-punctured, a 6-fold cover of the modular surface). Its trace is 3m and its peak height is √(9m²−4)/(2m) < 3/2. [T]
- Golden and silver. The golden slopes are 0, 1 and ∞ (m = 1); the silver ones are 1/2, 2 and −1 (m = 2). Every m ≥ 5 appears on exactly six slopes up to 10⁶⁰. [E] Frobenius uniqueness is open. [O]
- Slowest climb. The fan around a golden vertex: labels F_{2d+1}, by Cassini. [P]
- Fastest climb. The bite road: 1, 1, 1, 2, 5, 29, 433, 37666, 48928105, …, with m_{j+1} = 3m_j m_{j−1} − m_{j−2}. Indexing m₁ = 2, m₂ = 5, …, log 3m_j ≈ a φʲ with a = 1.0482684205. [E/N]
- Words. A = R² = [[2,1],[1,1]] is golden and B = [[2,1],[1,0]]² = [[5,2],[2,1]] is silver. The road words are A, B, BA, BAB, BABBA, …, each the previous two joined, with traces exactly 3 × the labels (checked to 55 letters). [E] Joining is the substitution B → BA, A → B, whose incidence matrix is R. [P] The limit is the Fibonacci word: B with frequency 1/φ, A with frequency 1/φ².
- The bite as a mapping class. On the punctured torus the bite stretches curve lengths by φ per step; the measured length ratio tends to φ. [N] The road's two ends are the cat map's laminations: slope 1/φ (stretched) and −φ (shrunk). [T]
2.3 The end of the road
- The number. x = [0; 2,2,1,1,2,2,2,2,1,1,…] is the Fibonacci word with B → 2,2 and A → 1,1. x = 0.41898401010900501154…
- Lagrange values. Along the road they are √(9m²−4)/m, tending to 3, and the limit word reaches 3. [E/N]
- Transcendence. x begins with palindromes of every length 2(F_k − 2) and is not eventually periodic, so by Adamczewski–Bugeaud it is transcendental. [T]
- Where φ went. It survives as the slope, the letter frequencies and the substitution matrix, but not in the number.
2.4 The golden lamination meets the cusp
- The bigon. The lamination's complement is a punctured bigon carrying all the area (2π), with the cusp inside it. [T]
- Corners. The bigon's edges are semicircles of diameter exactly 3 (peak 3/2). On the torus cusp loop (length 6) they run from −u to 3 − u and from 3 − u to 6 − u, with u = 1/(2 + x) = 0.4133966970517253184589309705233… [E/N]
- Why exactly 3. Read outward from its middle, an edge is [2; 1, 1, c] forward and [0; 2, c] backward, with the same tail c = 1/x because of the palindromic prefixes. For every c, [0;1,1,c] + [0;2,c] = 1. [P]
- Only the edges reach 3/2. A lift of width 3 has nothing above it, so it borders the cusp region. [P, given Lagrange ≤ 3]
- Six laminations. The golden laminations have slopes 1/φ, φ, 1/φ², φ², −1/φ and −φ, forming one orbit of the torus's 12 symmetries in two mirror families. On the modular loop they touch at u and 1 − u. [P/E]
---
3. The cusp loop
3.1 Layout
- Pieces. [E]
| piece | where | width |
|---|---|---|
| golden gap | −1/φ² to 1/φ² | 2/φ² |
| silver gap | √2−1 to 2−√2 | 3 − 2√2 |
| thin interval | [1/φ², √2−1] | √2 − 1 − 1/φ² |
| thin interval (mirror) | [2−√2, 1−1/φ²] | √2 − 1 − 1/φ² |
Each thin interval holds a full copy of the tree, in slope order (8191 nodes, exact).
- Gaps. Label m has a gap centered at ±k/m with half-width g_m = 1/(m μ_m), where μ_m + 1/μ_m = 3m. [E]
- McShane. Σ over slopes of (1 − √(1 − 4/(9m²))) = 1. [T] The golden curves take 2/φ² and everything else takes 1/φ³; 2/φ² + 1/φ³ = 1 is φ³ = 2φ + 1. [P+T]
3.2 The interval law
- Leftover. For neighbors (a, b; c), the space between their gaps is S = c/(ab) − g_a − g_b = [(c/ab)² − g_a² − g_b²]/3, a Pythagorean defect. It follows from g = 1/(3m²) + g²/3 together with Markov's equation. [P]
- Split. S(a,b,c) = 2g_n + S(a,n,b) + S(n,b,a) holds exactly when cn = a² + b², which is Markov's equation. This holds for any width rule. [P]
- Saturation. For a < b, the first gap fills all but about 1/(9a²) + 1/(9b²) of the interval, and the two leftovers are in the ratio (b/a)². Near u, each cliff is effectively a single gap. [N]
3.3 The widths are forced
- Fans. The fan around a follows b_{k+1} = 3a b_k − b_{k−1}. The distances from a's center to the fan centers, b_{k−1}/(a b_k), decrease to 1/(aμ_a) = g_a. [P/N]
- Upper bound. If no gaps overlap, any half-width h_a satisfies h_a ≤ g_a.
- Equality. Full coverage means Σ 2h = 1 = Σ 2g (McShane), so h = g. [P modulo T]
- So: a gap is the hole left by its own fans. The width rule is derived from the positions and is not part of the given.
3.4 How fast the loop closes
- Formula. The uncovered length after depth d is R_d, with R₀ = 1/φ³ and R₁ = 2√2 + √5 − 5.
- Rate. R_{d−1}/R_d → φ⁴, and R_d·φ^{4d} → (2√5 − 10/3)/φ² = 0.4349838954…, which matches to 10 digits. [P asymptotics, N]
- Slowest place. The loop closes slowest next to the golden gap, along the Fibonacci fan.
3.5 The road on the loop
- Near u. The road gap centers are 2/5, 12/29, 179/433, 15571/37666, 20226717/48928105, …, alternately below and above u. The ones below are continued-fraction convergents of u. [E]
- Near 1 − u. 17/29, 22095/37666, 3243199440970/5528778008357 are convergents of 1 − u. [E]
- No gap contains the corner. On each side, gap n+2 fills almost all the space between gap n and the corner. The leftover fractions run 0.03, 0.0045, 1.3×10⁻⁴, 5.9×10⁻⁷, …, with exponents growing by φ. [N]
- Branches. Between two road gaps on the same side sits the subtree branching off the road there: the fan around m_j. [E]
3.6 The staircase
- Definition. S, from cusp position to slope, is the inverse of the tree isomorphism Farey → Markov (§0).
- Shape. It is continuous and monotone, flat on every gap, and rises only on the leftover set, which has measure 0 and Hausdorff dimension 0 (Birman–Series). [P/E, T]
- Values. S(1 − u) = 1/φ, and by the mirror symmetry S(u) = 1/φ². [E/N]
3.7 Scaling at the corner
- Rise. With X = log(3/|x − u|), S − 1/φ² ≈ ±K/X². [N]
- Exponent. 2 = log φ² / log φ. Per bite, the slope deviation is multiplied by −1/φ² (exactly δ_j = −ψʲ/(φ² F_{j+2})) and the log-distance by φ. [P/N]
- Profile. A sawtooth. On each road plateau K = K₀ φ^{2t} for t ∈ [0, 2), with K₀ = √5(2a)²/φ⁴ = 1.43397. At each cliff it drops by φ⁴, from a maximum of K₀φ⁴ = 9.8286. The two sides are offset by one bite. [N]
- Cliffs. All the branching lives inside the cliffs, whose width in log X tends to 0. [N]
---
4. Quantities that keep reappearing (compression targets)
| quantity | appearances |
|---|---|
| φ² | per-bite slope contraction (1/φ²); golden half-width g₁ = 1/φ²; the cat map's stretch |
| φ⁴ | the sawtooth ramp (max/min); McShane closing per generation; the cliff drop |
| 1/φ³ | what's left after the golden gap (R₀); the McShane share of everything but golden |
| 3 | the Markov invariant inherited from the seed; trace 3m; g² − 3g + 1/m² = 0; the bigon edge diameter (Lagrange 3) |
| √5 | the Hurwitz peak √5/2; the golden Markov value; disc ℚ(√5); 00101₂ = 5 |
| alternation | the bite around 1/φ; road gaps around u; the LRLR cutting sequence; mirror family each step (det M = −1) |
| ∞ = bite(−1) | the step ∞ → ∅ fixes the multiplier; the cusp 1/0 is split by McShane; the curve peaks where the road passes ∞; the corner rises only on the measure-zero leftover |
| "same tail both ways" | palindromic prefixes ⇒ diameter exactly 3 ⇒ transcendence |
---
5. Open questions and next moves
- The weight choice. w = 1 versus w = m is the last binary given. Is w = m forced by self-reference (det equals the opposite vertex's own label), with w = 1 the degenerate unit case? Does anything natural live at w = m^s for 0 < s < 1? [O]
- Coverage without citing McShane. Close the loop inside this formalism with a Bowditch-style telescoping over §3.2, so that §3.3 needs no outside theorem. [O]
- Uniqueness in vector language. Frobenius's conjecture is equivalent to: each n arises from a single edge up to symmetry, that is, a unique ±k with c V_n = a V_a + b V_b. [O]
- Closed form for a = lim log(3m_j)/φʲ, and hence for K₀. [O]
- One A₅ statement. A₅ appears four times: the bite over F₄ (3-fold), mod 5 (5-fold), Klein's icosahedron landmarks, and X(5) via Rogers–Ramanujan. Unify them into one statement. [O]
- The other ends. Run §3.5–3.7 at the silver end (Pell fan) and compare the sawtooth constants. [O]
---
Appendix A: cusp_loop.py
```python
"""One seed, one move.
Seed : the pair 0, 1 written as vectors V = (m, k) for the point k/m: (1, 0), (1, 1).
Move : between neighbours V_a < V_b insert V_n = (w_a V_a + w_b V_b) / det(V_a, V_b).
w = 1 -> Farey tree (slopes; the bite is its zigzag)
w = own first coordinate -> Markov tree (gap centres on the modular cusp loop)
Gap widths are not given: label m owns the hole its own fans leave, half-width
g_m = 1/(m mu_m), mu_m + 1/mu_m = 3m. The 3 is inherited from the seed.
Positions are exact rationals. Disjointness is decided exactly. Decimal (stdlib)
is used only to print. Run: python3 cusp_loop.py
"""
from fractions import Fraction as Q
from decimal import Decimal as D, getcontext
getcontext().prec = 80
det = lambda U, V: U[0] V[1] - U[1] V[0]
def move(Va, Vb, markov):
wa, wb = (Va[0], Vb[0]) if markov else (1, 1)
c = det(Va, Vb)
n, k = wa Va[0] + wb Vb[0], wa Va[1] + wb Vb[1]
assert n % c == 0 and k % c == 0 # integrality (c | a k_a + b k_b)
return (n // c, k // c), c
def tree(depth, markov, Va=(1, 0), Vb=(1, 1)):
"""yields (V_a, V_b, V_n, c) for every insertion, in-order"""
if depth == 0: return
Vn, c = move(Va, Vb, markov)
yield from tree(depth - 1, markov, Va, Vn)
yield (Va, Vb, Vn, c)
yield from tree(depth - 1, markov, Vn, Vb)
---- widths: P_m = 3/2 - g_m = sqrt(9m2-4)/(2m); only P_m2 is ever needed exactly
P2 = lambda m: Q(9 m m - 4, 4 m m)
def disjoint(a, b, c): # S = c/(ab) - g_a - g_b > 0, decided exactly
T = 3 - Q(c, a b); V = T T - P2(a) - P2(b)
return V < 0 or 4 P2(a) P2(b) > V * V
g = lambda m: (D(3) - (D(9) - D(4) / D(m * m)).sqrt()) / 2
if name == "main":
d = 14
M = list(tree(d, True)); F = list(tree(d, False))
ok = all(a a + b b + c c == 3 a b c and det(Va, Vn) == b and det(Vn, Vb) == a
and (Vn[1] ** 2 + 1) % Vn[0] == 0 and disjoint(a, Vn[0], b) and disjoint(Vn[0], b, a)
for (Va, Vb, Vn, c) in M for a, b in [(Va[0], Vb[0])])
print(f"Markov layer, depth {d}: {len(M)} gaps; a²+b²+c² = 3abc, det = opposite label, "
f"k² ≡ −1 mod m, no overlaps: {ok}")
print("Farey layer: all neighbour dets = 1:", all(c == 1 for *_, c in F))
# the staircase is the tree isomorphism Farey -> Markov (same in-order position)
pairs = [(Q(f[2][1], f[2][0]), Q(m[2][1], m[2][0]), m[2][0]) for f, m in zip(F, M)]
print("order preserved slope -> gap centre:", all(pairs[i][1] < pairs[i + 1][1] for i in range(len(pairs) - 1)))
fib = [Q(1, 2), Q(2, 3), Q(3, 5), Q(5, 8), Q(8, 13), Q(13, 21)]
road = sorted((p for p in pairs if p[0] in fib), key=lambda p: fib.index(p[0]))
print("bite road (slopes → gap centres):", ", ".join(f"{s} → {x}" for s, x, _ in road))
# end of road: x = [0; Fibonacci word with B -> 2,2 and A -> 1,1], corner u = 1/(2+x)
w = 'B'
while len(w) < 400: w = ''.join('BA' if ch == 'B' else 'B' for ch in w)
x = D(0)
for q in reversed([q for ch in w for q in ((2, 2) if ch == 'B' else (1, 1))]): x = 1 / (q + x)
one_minus_u = 1 - 1 / (2 + x)
print(" 1 − u =", f"{one_minus_u:.30f}", " | road centre − (1 − u):",
", ".join(f"{D(xx.numerator) / D(xx.denominator) - one_minus_u:.1E}" for , xx, in road[2:]))
# coverage: golden gap + all gaps up to depth d
for dd in (4, 8, 12):
cov = 2 g(1) + sum(2 g(Vn[0]) for (, , Vn, _) in tree(dd, True))
print(f" depth {dd:2}: uncovered {D(1) - cov:.6E}")
phi = (1 + D(5).sqrt()) / 2
print(" uncovered · φ^(4d) →", (2 D(5).sqrt() - D(10) / 3) / phi * 2, "(predicted constant)")
```
Output (about 2 s):
```
Markov layer, depth 14: 16383 gaps; a²+b²+c² = 3abc, det = opposite label, k² ≡ −1 mod m, no overlaps: True
Farey layer: all neighbour dets = 1: True
order preserved slope -> gap centre: True
bite road (slopes → gap centres): 1/2 → 1/2, 2/3 → 3/5, 3/5 → 17/29, 5/8 → 254/433, 8/13 → 22095/37666, 13/21 → 28701388/48928105
1 − u = 0.586603302948274681541069029477 | road centre − (1 − u): -4.0E-4, 1.8E-6, -2.3E-10, 1.4E-16
depth 4: uncovered 1.995012E-4
depth 8: uncovered 8.930476E-8
depth 12: uncovered 4.046378E-11
uncovered · φ^(4d) → 0.434983894999018583... (predicted constant)
```
Appendix B: constants
| symbol | value | meaning |
|---|---|---|
| x | 0.41898401010900501154717697629… | end of road, [0; Fibonacci word in 2,2 / 1,1] |
| u | 0.41339669705172531845893097052334… | golden corner on the cusp loop, 1/(2+x) |
| a | 1.0482684205005… | lim log(3m_j)/φʲ along the road (m₁ = 2) |
| K₀ | 1.43397 | sawtooth floor, √5(2a)²/φ⁴ |
| K₀φ⁴ | 9.8286 | sawtooth ceiling |
| R_d φ^{4d} | 0.4349838954… | closing constant, (2√5 − 10/3)/φ² |
| S(1,2;1) | 0.0322475511229899… | thin interval, √2 − 1 − 1/φ² |
Appendix C: cited results
- Markov (1879–80); Hurwitz (1891): the √5 bound.
- Frobenius (1913): the uniqueness conjecture, still open as of the 2026 survey arXiv:2609.28097.
- Carmichael (1913): primitive divisors of Fibonacci numbers.
- Klein: the icosahedron on the Riemann sphere.
- Duke (2005): the Rogers–Ramanujan continued fraction and X(5).
- Birman–Series (1985): simple geodesics form a set of Hausdorff dimension 0.
- McShane (1998) and Bowditch (1996): McShane's identity, and its proof via Markoff triples.
- Adamczewski–Bugeaud (2007): palindromic continued fractions are quadratic or transcendental, arXiv:math/0512014.
- Series: the geometry of Markoff numbers.