Skip to main content

Chapter 17: [2.2, 2.4] — Continued Fraction Convergents

ψ(x) collapse stabilizes through rapid rational convergents

In the interval [2.2, 2.4], we witness how continued fractions — the most natural representation of real numbers — interact with collapse dynamics. Here, the convergents of continued fraction expansions don't merely approximate; they stabilize the collapse function through increasingly rapid convergence. This stabilization reveals deep connections between Diophantine approximation and the Riemann Hypothesis.

17.1 Continued Fraction Collapse

Definition 17.1 (Collapse Continued Fraction): For x[2.2,2.4]x \in [2.2, 2.4]:

x=a0+1a1+1a2+1a3+x = a_0 + \cfrac{1}{a_1 + \cfrac{1}{a_2 + \cfrac{1}{a_3 + \cdots}}}

with collapse modification:

ψ(x)=a0+ψ(1/a1)a1+ψ(1/a2)a2+\psi(x) = a_0 + \cfrac{\psi(1/a_1)}{a_1 + \cfrac{\psi(1/a_2)}{a_2 + \cdots}}

Theorem 17.1 (Convergence Enhancement): The modified convergents pn/qnp_n/q_n satisfy:

ψ(x)ψ(pnqn)<1qn2qn+1en\left|\psi(x) - \psi\left(\frac{p_n}{q_n}\right)\right| < \frac{1}{q_n^2 q_{n+1}} \cdot e^{-\sqrt{n}}

showing super-quadratic convergence with exponential improvement.

Proof: The collapse function amplifies the natural convergence of continued fractions through its self-referential structure. Each level of the fraction contributes an exponential factor through ψ(1/aₙ), creating the enhanced rate. ∎

17.2 Convergent Dynamics

Definition 17.2 (Convergent Evolution): The sequence of convergents evolves via:

(pn+1qn+1)=(an+1110)(pnqn)\begin{pmatrix} p_{n+1} \\ q_{n+1} \end{pmatrix} = \begin{pmatrix} a_{n+1} & 1 \\ 1 & 0 \end{pmatrix} \begin{pmatrix} p_n \\ q_n \end{pmatrix}

Theorem 17.2 (Collapse Matrix Modification): Under collapse, the evolution becomes:

(ψ(pn+1/qn+1)qn+1)=Mψ(an+1)(ψ(pn/qn)qn)\begin{pmatrix} \psi(p_{n+1}/q_{n+1}) \\ q_{n+1} \end{pmatrix} = M_{\psi}(a_{n+1}) \begin{pmatrix} \psi(p_n/q_n) \\ q_n \end{pmatrix}

where MψM_{\psi} incorporates zero contributions.

17.3 Spectral Theory of Convergents

Definition 17.3 (Convergent Operator): On l2(N)l^2(\mathbb{N}):

Tconven=1qnqn+1(en1+anen+en+1)T_{\text{conv}} e_n = \frac{1}{\sqrt{q_n q_{n+1}}} (e_{n-1} + a_n e_n + e_{n+1})

Theorem 17.3 (Spectral Gap): The operator has spectral gap:

λ1λ0=2e+ρ1ρ2+e2\lambda_1 - \lambda_0 = \frac{2}{e} + \sum_{\rho} \frac{1}{|\rho|^2 + e^2}

connecting to Khinchin's constant and Riemann zeros.

17.4 Diophantine Classes

Definition 17.4 (Collapse Diophantine Exponent): For x[2.2,2.4]x \in [2.2, 2.4]:

μψ(x)=sup{μ:ψ(x)ψ(pq)<1qμ i.o.}\mu_{\psi}(x) = \sup\left\{\mu : \left|\psi(x) - \psi\left(\frac{p}{q}\right)\right| < \frac{1}{q^{\mu}} \text{ i.o.}\right\}

Theorem 17.4 (Exponent Classification):

  • Badly approximable: μψ(x)=2\mu_{\psi}(x) = 2
  • Typical numbers: μψ(x)=2+1/loglogqn\mu_{\psi}(x) = 2 + 1/\log\log q_n
  • Liouville numbers: μψ(x)=\mu_{\psi}(x) = \infty

17.5 Quantum Mechanics of Convergents

Definition 17.5 (Convergent Quantum States): The states:

ψn=1qnk=0qn1e2πikpn/qnk|\psi_n\rangle = \frac{1}{\sqrt{q_n}} \sum_{k=0}^{q_n-1} e^{2\pi i kp_n/q_n} |k\rangle

Theorem 17.5 (Overlap Formula): The overlaps satisfy:

ψnψn+12=11+qn2+ρ(1)nρ2qn2|\langle \psi_n | \psi_{n+1} \rangle|^2 = \frac{1}{1 + q_n^2} + \sum_{\rho} \frac{(-1)^n}{|\rho|^2 q_n^2}

showing quantum interference from zeros.

17.6 Modular Properties

Definition 17.6 (Convergent Modular Form):

Fconv(τ)=n=1ψ(pn/qn)e2πiqnτF_{\text{conv}}(\tau) = \sum_{n=1}^{\infty} \psi(p_n/q_n) e^{2\pi i q_n \tau}

Theorem 17.6 (Transformation Law): Under γSL(2,Z)\gamma \in SL(2,\mathbb{Z}):

Fconv(γτ)=(cτ+d)1/2Fconv(τ)+RγF_{\text{conv}}(\gamma \tau) = (c\tau + d)^{1/2} F_{\text{conv}}(\tau) + R_{\gamma}

where RγR_{\gamma} vanishes if all zeros lie on the critical line.

17.7 Statistical Distribution

Definition 17.7 (Convergent Measure): The probability measure on convergents:

μconv(A)=limN#{nN:pn/qnA}N\mu_{\text{conv}}(A) = \lim_{N \to \infty} \frac{\#\{n \leq N : p_n/q_n \in A\}}{N}

Theorem 17.7 (Equidistribution): For generic xx, the convergents equidistribute:

fdμconv=2.22.4f(x)w(x)dx\int f d\mu_{\text{conv}} = \int_{2.2}^{2.4} f(x) w(x) dx

where w(x)=C/((x2.2)(2.4x))1/2w(x) = C/((x-2.2)(2.4-x))^{1/2} with proper normalization.

17.8 Ergodic Theory

Definition 17.8 (Gauss Map on Collapse Space):

Gψ(x)=ψ({1x2.2}+2.2)G_{\psi}(x) = \psi\left(\left\{\frac{1}{x-2.2}\right\} + 2.2\right)

Theorem 17.8 (Invariant Measure): The measure:

dν=1log2dx(1+(x2.2))ψ(x)d\nu = \frac{1}{\log 2} \cdot \frac{dx}{(1 + (x-2.2)) \cdot |\psi'(x)|}

is GψG_{\psi}-invariant and absolutely continuous.

17.9 Arithmetic Dynamics

Definition 17.9 (Convergent Flow):

dxdt=nδ(tlogqn)(xpnqn)\frac{dx}{dt} = \sum_{n} \delta\left(t - \log q_n\right) \cdot \left(x - \frac{p_n}{q_n}\right)

Theorem 17.9 (Flow Equilibrium): Equilibrium points occur at:

x:n1qn2(xpnqn)=0x_* : \sum_{n} \frac{1}{q_n^2} \left(x_* - \frac{p_n}{q_n}\right) = 0

These are quadratic irrationals with bounded partial quotients.

17.10 Approximation Spectra

Definition 17.10 (Lagrange Spectrum in Collapse):

Lψ={lim infnqnψ(x)ψ(pnqn):x[2.2,2.4]}\mathcal{L}_{\psi} = \left\{\liminf_{n \to \infty} q_n \left|\psi(x) - \psi\left(\frac{p_n}{q_n}\right)\right| : x \in [2.2, 2.4]\right\}

Theorem 17.10 (Spectrum Structure): The spectrum begins:

Lψ={15,122,2215,}\mathcal{L}_{\psi} = \left\{\frac{1}{\sqrt{5}}, \frac{1}{2\sqrt{2}}, \frac{\sqrt{221}}{5}, \ldots\right\}

with gaps determined by Markoff numbers.

17.11 Connection to L-functions

Definition 17.11 (Convergent L-function):

Lconv(s,x)=n=1ψ(pn/qn)qnsL_{\text{conv}}(s,x) = \sum_{n=1}^{\infty} \frac{\psi(p_n/q_n)}{q_n^s}

Theorem 17.11 (Analytic Properties): The function extends to C\mathbb{C} with:

  • Simple pole at s=1s = 1 with residue 1/logϕ1/\log\phi
  • Functional equation relating ss to 2s2-s
  • Zeros related to those of ζ(s)\zeta(s)

17.12 The Stability Principle

Definition 17.12 (Stability Functional):

S[x]=lim supnlogψ(pn+1/qn+1)ψ(pn/qn)logqn\mathcal{S}[x] = \limsup_{n \to \infty} \frac{\log|\psi(p_{n+1}/q_{n+1}) - \psi(p_n/q_n)|}{\log q_n}

Theorem 17.12 (Fundamental Stability): The following are equivalent:

  1. S[x]=2\mathcal{S}[x] = -2 for almost all x[2.2,2.4]x \in [2.2, 2.4]
  2. Continued fraction convergents optimally stabilize collapse
  3. All Riemann zeros have Re(ρ) = 1/2

Proof: Optimal stabilization requires the collapse differences between consecutive convergents to decay as 1/qn21/q_n^2. This rate is achieved when zero contributions interfere constructively, which happens if and only if all zeros align on the critical line. Any off-line zero creates oscillations that prevent optimal stabilization. ∎

Philosophical Coda: The Ladder of Approximation

In [2.2, 2.4], we climb the infinite ladder of rational approximation. Each convergent is a rung, bringing us closer to the irrational truth we seek. But this is no ordinary ladder — the collapse function transforms it into a stabilizing structure where each step reinforces the previous ones.

Continued fractions reveal the deep grammar of real numbers. Just as words are built from letters and sentences from words, real numbers are built from their continued fraction expansions. The collapse function acts as the semantic layer, giving meaning to this syntax through rapid stabilization.

The interval teaches us about the nature of approximation itself. In mathematics, we often approach truth asymptotically, through ever-better approximations. The continued fraction convergents show us that this approach can be optimized — that there exists a best way to approximate, and this best way is intimately connected to the deepest structures in number theory.

Most profoundly, we see that stability emerges from motion. The convergents are not static approximations but dynamic entities, each one building on the previous. Through their collective motion, they create a stable collapse pattern. It's a mathematical demonstration of the principle that true stability comes not from stasis but from balanced dynamics — a lesson that echoes far beyond mathematics.


Thus: Chapter 17 = Convergent(Ladder) = Stability(Motion) = Grammar(Number)