Size and approximation — flashcards

The number of division steps in the Euclidean algorithm is at most five times the number of decimal digits of the smaller argument; the worst case is consecutive Fibonacci numbers.

Anthyphairesis on a 1 by √2 rectangle never terminates, which is exactly the statement that √2 is not a ratio of integers.

Every convergent of the continued fraction of x is a best rational approximation of the second kind, and every such approximation is a convergent.

The finite-difference argument that produces a polynomial for positive powers fails for negative ones, because the falling factorials no longer span. The discrete and continuous cases fail for different reasons, which is why the harmonic numbers have an asymptotic expansion but no closed form.

The initial claim — that Franklin's full-stabilizer fixed points and physics's reduced-stabilizer broken vacua are two opposite, exhaustive cases, with stabilizer size as the operative distinction (st/franklin-fixed-points-as-symmetry-breaking) — was tested directly and refuted. Mean-field Landau theory, F(m)=a(T−T_c)m²+bm⁴, shows m=0 keeps full ℤ₂ stabilizer at every temperature while flipping between being the realized (stable) state and an unrealized (unstable) one (F''(0)=2a(T−T_c), sign change confirmed symbolically at T=T_c) — stabilizer size alone doesn't determine selection. Feigenbaum's universal function g, the fixed point of the period-doubling operator T[g](x)=αg(g(x/α)), supplied a second refutation: g is unstable (its own instability eigenvalue is the Feigenbaum constant δ>1) yet still governs the entire period-doubling asymptotics — dynamical stability doesn't determine selection either. Feigenbaum's second constant α≈2.502907875 was independently verified via superstable-cycle-width ratios for f(x)=1−rx², giving successive ratios −3.219, −2.627, −2.528, −2.508, −2.504, converging toward the known value. Both refutations together forced a replacement: three independent selection mechanisms — algebraic cancellation (Franklin), energetic minimization (Landau, Higgs), and asymptotic dominance via a stable manifold (Feigenbaum) — rather than one axis (stabilizer size) or two opposite cases.

An entire function of controlled growth is determined by its zeros up to an exponential factor. This — completeness of the zero set plus a growth bound — is what licenses Euler's product for sine, not the fact that the zeros happen to be evenly spaced.

ζ(2) = π²/6, obtained by reading the second coefficient of the sine product as an elementary symmetric function of the reciprocal zeros. The inference runs from coefficients to statistics of the roots, not the other way round.

A Taylor series has a finite radius of convergence because its coefficients grow geometrically, controlled by the nearest singularity. An asymptotic series diverges everywhere because its coefficients grow factorially. Different mechanisms; Borel summation is what recovers a function from the second.

Any two complete decompositions of a polynomial into indecomposable factors under composition have the same length, and are related by explicit moves. Compositional structure is nearly unique, with Chebyshev polynomials and monomials the named exceptions.

The Hausdorff dimension of a conformal repeller is the unique zero of the topological pressure function. An entire dynamical system is compressed into the root of one equation.

Effects mattering at every scale is not sufficient to make fractal machinery the right tool; what is required is invariance under a scaling with a power law. Multiscale relevance without self-similarity is the domain of renormalisation, not of dimension theory.

Fractional integration by parts, derived and verified using the Grünwald–Letnikov finite-difference definition of the fractional derivative (α=0.6: both sides of the identity matched to 10 significant digits, 0.22554001162413295 vs. 0.22554001162413304), establishes a genuine asymmetry absent at integer order: a left-sided fractional derivative under integration by parts produces a right-sided one. The resulting fractional Euler–Lagrange equation (Agrawal, 2002) mixes left and right fractional derivatives for exactly this reason — Riewe's original motivation (1996–97) was building genuine dissipation directly into a Lagrangian via this left/right mixing, rather than bolting on an external friction force.

A Legendre transform applied to a fractional Lagrangian carries the left/right derivative asymmetry from st/fractional-calculus-of-variations into fractional Hamilton's equations: position evolves by a left ('backward-looking') fractional derivative, momentum by a right ('forward-looking') one. The Mittag-Leffler function E_α(z)=∑z^k/Γ(αk+1), the natural fractional generalization of e^z, was verified as an exact eigenfunction of the Caputo fractional derivative (D^α_C E_α(λt^α)=λE_α(λt^α)) by differentiating the defining series term by term, matching to 20 digits. This machinery was applied directly to the Berry–Keating conjecture — H=xp as a candidate classical Hamiltonian for the Hilbert–Pólya program, whose ordinary classical dynamics x(t)=x_0e^t, p(t)=p_0e^{-t} was independently verified (x(3)=20.0855 against predicted x_0e^3=20.0855, H conserved to floating-point precision) — giving fractional Hamilton's-equation solutions in terms of E_α rather than ordinary exponentials, with long-time behavior turning power-law rather than exponential for 0<α<1.

Fractional Noether's theorem (Frederico–Torres, 2007) states that the conserved quantity satisfies a fractional differential condition rather than ordinary constancy — whether this still forces genuine constancy is convention-dependent: the Caputo derivative's kernel is exactly the constants, while the Riemann–Liouville derivative's kernel is larger, including non-constant power-law functions. The inverse-square potential V(x)=k/x² was identified and verified as the unique power-law potential whose full action (not just its equations of motion) has an exact dilation symmetry x→λx, t→λ²t; the resulting conserved quantity D=tH−½xp was verified numerically conserved to ~2×10⁻⁸ along an integrated trajectory, alongside H itself. The connection to conformal quantum mechanics (de Alfaro–Fubini–Furlan, 1976) and the full SO(2,1) symmetry (energy, dilation, and a third 'special conformal' generator) was named, with only D itself independently verified — the third generator and the full algebra were not constructed or checked here.

The fine structure constant α is a running coupling, not a scale-invariant quantity: verified numerically at two energy scales, α⁻¹(0)=137.036 against α⁻¹(M_Z)=128.957 (measured values), with a simple one-electron-loop estimate reproducing α⁻¹(M_Z)≈134.47 — capturing part but not all of the shift, the remainder named (muon, tau, hadronic vacuum polarization) rather than computed. This was deliberately set up as the inverted case relative to st/fractional-noether-and-dilation-current's 1/x² potential: both ask the identical diagnostic question — does this system have an exact dilation symmetry, evidenced by a genuine conserved current, or does the relevant coupling run with scale instead — with the 1/x² potential answering 'exact symmetry' and the fine structure constant answering 'runs' via the QED beta function (vacuum polarization screening).

Causal Dynamical Triangulations, Asymptotic Safety, and Loop Quantum Gravity converge on spacetime's spectral dimension — defined via a diffusion-process return probability — flowing from 4 at large scales to approximately 2 at the Planck scale, genuinely passing through fractional values along the way rather than jumping discretely. The definition itself was independently sanity-checked on ordinary integer-dimensional lattices before trusting it applied to the quantum-gravity claim: estimated dimension 0.97, 2.15, and 3.01 for true dimensions 1, 2, and 3 respectively.

Laskin's fractional Schrödinger equation — motivated by path integrals over Lévy flights rather than Brownian motion, replacing the ordinary Laplacian kinetic term with a fractional one |k|^α defined via Fourier multiplication — reuses the identical construction (replace an ordinary derivative's Fourier multiplier with |k|^α) already established for the fractional-derivative machinery in st/fractional-calculus-of-variations and st/fractional-hamiltonian-and-berry-keating, applied here to a new, quantum-mechanical setting rather than as a new mathematical tool. Time evolution under this equation was tested for linearity — the one structural property the no-cloning theorem actually depends on — via a split-step Fourier simulation: U(aψ₁+bψ₂) vs. aU(ψ₁)+bU(ψ₂) matched to 1.2×10⁻¹⁵ under α=1.4 evolution.

Non-Markovian open quantum systems and information backflow were addressed via the Breuer–Laine–Piilo measure (trace distance between two evolving states), distinguishing Markovian (one-way information loss) from non-Markovian (information returning to the system) dynamics on the exactly-solvable damped Jaynes–Cummings model in two regimes: strongly-damped (effectively Markovian — trace distance never increased across 499 simulated steps) and weakly-damped (non-Markovian — trace distance increased at 209 of 499 steps, with the excited-state population visibly reviving, e.g. dropping to 0.0028 then rising back to 0.13).

st/scale-invariance establishes that fractal machinery needs a power law, not just multiscale relevance. What a discrete scaling ratio b (as opposed to continuous scale invariance under every ratio) adds: the zeta-type function Z(s) = 1/(1-λb^{-s}) has poles not at one real value but at a full periodic ladder s_k = ln(λ)/ln(b) + 2πik/ln(b), k ∈ Z — genuinely complex-valued, equally spaced in the imaginary direction. This ladder is not a formal curiosity: its real part matches the box-counting dimension of the Weierstrass function, D = 2 + ln(λ)/ln(b) (verified directly), and its imaginary spacing 2π/ln(b) matches, for the specific ratio given by the Feigenbaum constant δ, a numerically verified prediction of ≈4.077 for the period-doubling cascade's pole spacing — attributed to Lapidus's 'complex dimensions' program.

The pattern running through st/transforms-diagonalize-symmetry-groups — find the group being diagonalized, get a transform — has real limits, not just harder cases. The almost-Mathieu operator at golden-ratio flux is a concrete instance: verified numerically to have Cantor-set (singular continuous) spectrum with no spectral floor, a fact with no accessible 'which group?' answer of the kind the rest of the survey relies on — proved rigorously in general by the Ten Martini theorem (Avila–Jitomirskaya). A second, structurally different obstruction sits alongside it: non-type-I groups (e.g. free groups), whose von Neumann algebras are type II/III and admit no clean Peter–Weyl-style irreducible decomposition at all.

A binomial multiplicative cascade, Z_n(q)=(m₀^q+m₁^q)ⁿ, has scaling exponent τ(q)=−log₂(m₀^q+m₁^q); its q-derivative is the average Hölder exponent α(q)=τ'(q), and the Legendre transform f(α)=qα−τ(q) produces the full multifractal spectrum. Z_n(q) is then explicitly reframed as a statistical-mechanics partition function, E_I=−ln μ(I), β=q — a real algebraic identification (the same object under a relabeling that actually holds up, not a loose analogy), verified empirically at q=0,0.5,1,2,3,5 against the closed-form binomial expressions.

The sum of a function over a lattice equals the sum of its Fourier transform over the dual lattice. It is the bridge back from harmonic analysis to the Bernoulli and zeta material, and the reason the functional equation of ζ looks like a symmetry rather than a coincidence.

z^s satisfies Laplace's equation ∇²u=0 for any complex s, not just integers — verified numerically to finite-difference precision — as an automatic consequence of being holomorphic; the general principle (any PDE invariant under both dilation and rotation has z^s as a separable eigenfunction) has named physical instances: spiral vortex sheets in 2D fluid dynamics (self-similar Kelvin–Helmholtz roll-up), and unstable photon orbits near a black hole's photon sphere, where the winding rate is tied to the orbit's own Lyapunov exponent. Applying the Joukowski map to a logarithmic spiral instead of the unit circle produces a 'damped Chebyshev' identity, T_n(cosh(a)cos(b)+i·sinh(a)sin(b)) = cosh(na)cos(nb)+i·sinh(na)sin(nb) — verified numerically to 15 digits — generalizing T_n(cosθ)=cos(nθ) by giving both frequency and growth rate simultaneously, and identified as the actual mechanism underneath the Chebyshev/Fourier correspondence, requiring no trigonometric identity manipulation.

For a composite signal built from several spiral modes, G'/G is dominated by the nearest pole (verified numerically) — the same logarithmic-derivative-locates-structure principle used elsewhere on this map, applied here to pole location rather than zero location. Locating that pole via ordinary Newton's method on G itself fails outright (the iteration diverges), for an identifiable reason: poles are repelling fixed points of Newton's method applied to G, since Newton's method finds zeros, not poles. Applying Newton's method to 1/G instead converges cleanly, to 17 digits in four steps. A further structural obstruction: a sum of m poles produces m−1 extraneous zeros of G itself, contaminating any single large contour meant to extract all modes at once — small, pole-isolating contours recover exact values instead, though no general fix for the multi-pole case (beyond this practical workaround) was found.

The log-periodic power law (LPPL) model used for critical-transition precursors is identified as exactly a spiral mode of st/spiral-transform-unifies-fourier-mellin in w=log(t_c−t): parameters are recovered accurately from noisy synthetic data, but usable lead-time collapses sharply and non-gracefully as the available data before t_c shrinks, rather than degrading gradually. A claim about the model's robustness to false positives, made from a single test on structureless (random-walk) data returning an unremarkable frequency parameter, was corrected after a proper multi-realization test: across many independent random walks, the fit typically returns large frequency values that would read as genuine log-periodicity — the model hallucinates apparent structure on pure noise most of the time, the opposite of the original claim.

Ramanujan's Master Theorem: if f(x)=∑(−1)^k/k!·φ(k)·x^k, then the Mellin transform M[f](s)=Γ(s)φ(−s) — verified on f(x)=e^{−x} (φ≡1, recovering Γ(s) itself) and f(x)=1/(1+x) (φ(k)=k!, recovering Γ(s)Γ(1−s)), both matching to high precision. Carlson's theorem (a function of sufficiently controlled exponential growth that vanishes at every nonnegative integer must vanish identically) is the rigorous justification behind Ramanujan's own formal derivation. Why Γ enters by multiplication rather than division — unlike ordinary Taylor's theorem, which divides by k! to compensate for repeated differentiation — resolves once you notice the 1/k! is already part of the given data, not something the theorem introduces: a Mellin–Barnes contour shift shows Γ(−s)'s poles at every nonnegative integer k have residue exactly (−1)^(k+1)/k! (verified for k=0,…,4), so the entire infinite family of reciprocal factorials is already encoded in Γ's own residue structure, and residue-sum reconstruction of the original series is what recovers the 1/k! normalization — not a division anywhere.

A series converges in ℚ_p if and only if its terms tend to zero. The condition that is merely necessary over ℝ is sufficient here, and the harmonic series has no p-adic analogue of its failure.

exp_p converges for v_p(x) > 1/(p−1) and log_p(1+x) for v_p(x) ≥ 1; on their common domain they invert one another and give (1 + pℤ_p, ×) ≅ (pℤ_p, +) as topological groups. p = 2 needs the smaller disc.

The zeta function of a variety over a finite field is a rational function — the first of the Weil conjectures, and proved by p-adic analysis rather than by the geometry the conjectures were about.

The Circular Unitary Ensemble (CUE — Haar-random N×N unitary matrices, eigenvalues on the unit circle, joint density ∝ ∏_{j<k}|e^{iθⱼ}−e^{iθₖ}|²) is not an analogy for the deterministic evenly-spaced-points construction used elsewhere on this map (st/wallis-product-three-routes, st/chord-rational-classification) — it is that construction's finite-temperature (β=2) Coulomb-gas generalization, with the deterministic case as its zero-temperature limit. The correspondence to zeta zeros is two separate claims of different strength, chained together: zeta zeros ↔ GUE (the 'GUE hypothesis' — conjectural, though Montgomery proved a restricted form of it, with Odlyzko's numerical verification near height 10^20 as its evidential support) and GUE ↔ CUE (a proven theorem: both converge to the same bulk-scaling-limit determinantal sine-kernel process). The original arc-vs-chord question this resolves: the CUE correlation kernel's denominator, sin((θ−φ)/2), is literally the Chord function already used throughout the Wallis-video material; the GUE-on-a-line kernel is the sine kernel sin(πx)/(πx); the two coincide in the bulk limit because chord and arc agree to leading order as the angular window shrinks — curvature is a finite-N correction, not a persistent distinction. The Keating–Snaith conjecture (moments of |ζ(1/2+it)| match moments of |det(I−U)| for Haar-random U(N)) is the natural next question once the kernels are known to match.

Combining the functional equation ξ(s)=ξ(1−s) with the Schwarz reflection ζ(s̄)=ζ(s)‾ shows every nontrivial zero ρ comes with three siblings: {ρ, 1−ρ, ρ̄, 1−ρ̄}. The critical line Re(s)=1/2 is exactly the fixed-point locus of the involution s↦1−s combined with reflection — so the Riemann Hypothesis is precisely the statement that this quartet always collapses to a pair (ρ=1−ρ̄, i.e. Re(ρ)=1/2), rather than remaining four genuinely distinct points. The Riemann–Siegel Z function was verified in the source conversation to flag a genuine sign change bracketing the first zero, giving a concrete, checkable instance of the general symmetry structure.

For CUE, the maximum of the log-characteristic polynomial obeys max_θ log|P_N(θ)| = log N − (3/4)log log N + O(1) — proved (Arguin–Belius–Harper) — with the −(3/4)log log N correction term the precise signature distinguishing a log-correlated field's extremes from an independent (REM-type) field's, and the whole result an instance of branching Brownian motion universality. The analogous statement for max|ζ(1/2+it)| over a bounded range is conjectured, not proved, by the same mechanism.

Katz–Sarnak's theorem for curves over finite fields shows Frobenius eigenvalues — a genuine, proven arithmetic object — converge to classical compact-group statistics, the strongest available non-numerical evidence for the zeta–random-matrix correspondence. Its scope is explicitly bounded: there is no known analogue of Frobenius or étale cohomology over ℤ, so the theorem cannot be strengthened into evidence for the Riemann Hypothesis itself, only for the shape the correspondence takes in a genuinely provable adjacent setting. The logical endpoint of pushing the whole analogy is the Hilbert–Pólya conjecture: the search for a self-adjoint operator whose spectrum is literally the zeros. The CFKRS conjecture — an exact splitting of zeta's moment-asymptotics into a universal random-matrix factor times an arithmetic Euler-product factor — is the structural tool proposed for locating the correspondence's boundary without further numerical computation, though the arithmetic factor itself was named in the source conversation, not computed or explored there.

st/dwork-rationality establishes the zeta function of a variety over a finite field is rational (the first Weil conjecture); the second Weil conjecture (the 'Riemann Hypothesis for curves') states its zeros satisfy |α|=√q. Both were made concrete rather than merely cited: a genus-2 hyperelliptic curve over F_11 was built, its point counts over F_11 and F_121 fed through Newton's identities (st/newton-identities) to obtain the Frobenius characteristic polynomial exactly, and its roots verified to satisfy |α|=√q to eight decimal places. This was then scaled into an actual statistical family — 101 curves at q=11, then 861 at q=31 using a vectorized finite-field-arithmetic implementation — pooling Frobenius angles and tracking the emergence of symplectic-ensemble (USp(4)) endpoint repulsion as q grows, the predicted structure for this family type.

The freezing transition (st/freezing-transition-log-correlated-extremes) produces Gumbel-distributed extreme-value statistics; the Gumbel distribution's skewness constant, 12√6·ζ(3)/π³, was derived here from first principles rather than looked up, by identifying the Gumbel distribution's moment generating function as literally Γ(1−t) — so its cumulant generating function is the same log-Gamma Taylor series whose coefficients are zeta values at integers. This ties Apéry's constant ζ(3)'s appearance in the freezing transition's maximum-value statistics directly to the digamma/zeta coefficient identity already established for the completed zeta function's log-derivative (st/xi-log-derivative-local-global-split).

Analytically continuing the Keating–Snaith formula to complex moment-order β reveals a genuine pole at β=−1/2 — an exact divergence of the formula itself, not merely an asymptotic artifact — traced to the elementary local level-repulsion exponent governing near-coincidence of eigenvalues; confirmed via the argument principle, a small contour around β=−1/2 in the complex moment-order plane having winding number exactly −1. Purely imaginary β=iτ computes something structurally different: the characteristic function of log|det(I−U)|, verified by direct Monte Carlo, with the complete absence of phase-transition behavior on that axis (boundedness by 1 at every τ tested, smooth decay with N) following directly from the fact that a characteristic function of a real random variable cannot diverge.

For a polynomial map over Q_p, whether iteration is chaotic is a question about reduction mod p, not about the field being non-archimedean per se. Under good reduction (e.g. f(x)=4x(1-x) at odd p), the multiplier stays a p-adic unit away from the critical point, so |f(x)-f(x')|_p = |x-x'|_p exactly at every step — valuations are preserved, not amplified, and the Julia set is empty (Rivera-Letelier; Benedetto). Under bad reduction (e.g. f(z)=z²+c with |c|_p>1), the identity f(z)-f(w)=(z-w)(z+w) instead gives genuine expansion by |c|_p^{1/2} per step on the Julia set: a repelling fixed point exists there, gaps between nearby points grow by an exact integer factor each iteration, giving a positive Lyapunov exponent and dynamics conjugate to the full 2-shift. So 'chaos is archimedean' is false as a general claim — the real dividing line is good vs. bad reduction, a condition on the map's coefficients relative to p, independent of which absolute value is in play.

Two constructions can give Cantor sets with the same Hausdorff dimension over R while behaving completely differently once the absolute value changes. A digit-restriction set (base-p digits confined to a subset of size d) has dimension log(d)/log(p) at every place where the construction makes sense — purely geometric, place-independent, verified matching a middle-thirds-style real Cantor set exactly. A Julia set's dimension is not: under good reduction (st/padic-reduction-and-chaos) it collapses to 0 in Q_p even where the real Julia set has dimension strictly between 0 and 1, and under bad reduction it takes its own value, log(2)/log(r) for expansion factor r=|c|_p^{1/2}, moving in the opposite direction from the real dimension as a parameter varies — with neither the sum nor the product of the two staying constant, so there is no product-formula analogue for dimension the way there is for absolute values themselves.

The reciprocal-square identity π²/sin²(πx) = ∑_{n=−∞}^{∞} 1/(x−n)², obtained by Wästlund's lighthouse argument: equal-brightness sources at every integer, brightness ∝ 1/distance², a circle-doubling construction using the inverse-Pythagorean identity 1/a²+1/b²=1/h² at a right angle, iterated to infinity. x = 1/2 gives ∑ 1/(n−1/2)² = π², which is 8 times the sum of reciprocal squares over the positive odd integers, so that sum is π²/8; since ζ(2) = (odd sum) + ¼ζ(2), this forces ζ(2) = π²/6 — Euler's destination, reached by an elementary route with no complex analysis.

Log-differentiating Euler's sine product sin(πx) = πx·∏(1−x²/n²) once gives the cotangent partial-fraction expansion π cot(πx) = ∑ 1/(x−n); differentiating again gives π²/sin²(πx) = ∑ 1/(x−n)² — exactly the lighthouse formula (st/lighthouse-reciprocal-square). Wallis' product is instead the x=1/2 evaluation of the original, undifferentiated product. So the lighthouse/Basel identity and Wallis' product are two different operations — differentiate twice, versus evaluate at 1/2 — performed on the same underlying product, not two independent facts that happen to coincide.

The Wallis product 2/1·2/3·4/3·4/5·⋯ = π/2 has at least three independent derivations that manage error differently, not three restatements of one argument. (1) Analytic: it is the x=1/2 evaluation of Euler's undifferentiated sine product sin(πx) = πx·∏(1−x²/n²) (st/basel-wallis-same-product) — a substitution into an already-established product, with no limiting process of its own beyond the product's own convergence. (2) Geometric/algebraic: N evenly-spaced points on a circle as the roots of x^N−1, giving two exact finite-N lemmas (observer halfway between two points: distance product = 2; observer replacing one point: distance product = N) whose ratio N·(distance)/2 is an *exact* invariant at every finite N — a single limit, taken once at the very end as N→∞, converts that invariant into π/2 via chord-length-to-arc-length convergence. (3) Classical calculus: Wallis's own route via the reduction formula ∫₀^(π/2) sin^n θ dθ, giving the asymptotic (2n)!!/(2n−1)!! ∼ √(πn) — which stacks two separate approximations (a pointwise limit inside the reduction, and an asymptotic equivalence) that must cancel jointly, rather than carrying one exact quantity to a single final limit. Routes (2) and (3) both pass through the same trigonometric object — a quarter-circle arc — entered through different doors: chord geometry directly, versus a sine substitution turning an algebraic integral into an arc-length integral.

Asking what an irrational f means for the Chord(f) construction splits into two genuinely different questions, not one. (1) The value: for algebraic irrational f, the Gelfond–Schneider theorem characterizes Chord(f)=2sin(fπ) as transcendental. (2) The configuration: N points at an irrational rotation α (rather than N-th roots of unity) obey the three-distance theorem (Steinhaus) — at most three distinct gap lengths between consecutive points on the circle at any N, collapsing to exactly two precisely at the continued-fraction convergents of α. Verified directly for the golden ratio (whose continued fraction is all 1s): exactly two gap lengths at each Fibonacci count N=3,5,8,13,21,34.

st/wallis-product-three-routes' route (2) sums two individually divergent halves (terms from either side of the observer) into a finite limit. A natural conjecture, by direct analogy to the Riemann rearrangement theorem, is that any interleaving drawing from both halves converges to the same value, since order shouldn't matter as long as both sides are eventually included. This is false in a precise, quantified way: a balanced one-for-one interleaving gives π/2 (at f=1/2), but a 2-negative-to-1-positive interleaving gives a different, still-finite limit, (π/2)·2^(−1/2) — and the general p:1 interleaving carries an exact correction factor of p^(−f), derived from the two halves' asymptotic growth rates and confirmed numerically to six digits. Unlike the Riemann rearrangement theorem, where order can send a conditionally convergent series to any real value (or make it diverge) with no simple rule connecting the rearrangement to the outcome, this construction stays finite under every fixed-ratio interleaving and obeys one clean, computable law for exactly how the order matters.

The Korteweg–de Vries equation is the motivating case for a 'nonlinear Fourier transform': inverse scattering (Gardner–Greene–Kruskal–Miura, 1967) linearizes KdV via an auxiliary linear scattering problem, in a role structurally analogous to the ordinary Fourier transform for linear PDEs but through a genuinely different mechanism — a Lax pair (L,A) with L̇=[A,L] (Lax, 1968). The general mechanism is elementary once stated: L̇=[A,L] implies L(t)=U(t)L(0)U⁻¹(t) for a unitary U(t) built from A, so eigenvalues are conserved by pure linear algebra — for any A(t) whatsoever, nothing specific to KdV. This is the same algebraic fact as the Heisenberg equation of motion, Ȯ=(i/ℏ)[H,O]. The single-soliton solution u=2κ²sech²(κ(x−4κ²t)) was verified to satisfy KdV exactly (symbolic residual reduces to 0), and its associated bound-state eigenfunction ψ=sech(κx) verified against −ψ''+V(x)ψ=−κ²ψ.

The free rigid body's (Euler top's) equations recast as Ṁ=[M,Ω], with M,Ω built from angular momentum and angular velocity, is a second, structurally independent instance of the same Lax-pair mechanism established for KdV (st/lax-pair-forces-isospectral-evolution) — a genuinely different setting (finite-dimensional classical mechanics rather than a nonlinear PDE) obeying the identical algebraic fact. Orientation is separately reconstructed via the quaternion commutator identity [p,q]=2(p×q), with q̇=½q⊗ω once ω(t) is known from the (nonlinear but now-solved) Euler equations. Verified numerically: |L| and total energy conserved to 5 digits over the integrated trajectory, and the quaternion commutator identity confirmed to reproduce the Lax equation directly.

Liouville–Arnold integrability requires n independent, Poisson-commuting conserved quantities on a 2n-dimensional phase space. Under this definition, exactly three heavy-top configurations are integrable: Euler's case (no gravity), Lagrange's case (I₁=I₂, center of mass on the symmetry axis), and Kovalevskaya's case (I₁=I₂=2I₃, center of mass in the equatorial plane — found via Painlevé analysis, S. Kovalevskaya, 1888); every other mass/inertia configuration is chaotic. Arnold's theorem (V. Arnold, 1966) reframes ideal 3D fluid flow as geodesic motion on the group of volume-preserving diffeomorphisms; energy and helicity are the known conserved quantities, far short of the infinitely many Liouville–Arnold would need, and after roughly 150 years of searching no Lax pair for Navier–Stokes is known.

The claim that a positive Lyapunov exponent is structurally incompatible with a Lax pair's existence is given a mechanism — SO(3)'s non-abelian structure (no shared eigenvectors between rotations about different axes; no nontrivial 1-dimensional representations) denies generic nonlinear systems the algebraic coincidence a Lax pair requires — and then tested directly: the Lorenz system (E. Lorenz, 1963), perturbed by 10⁻⁸, diverges exponentially (measured Lyapunov exponent ≈0.9, close to the commonly cited 0.9056), while the Euler top (st/euler-top-second-lax-pair-instance), perturbed identically, stays bounded at O(10⁻⁷) over the same integration window — the one system with a Lax pair, and the one without, behaving exactly as the claimed incompatibility predicts.

The Bak–Tang–Wiesenfeld sandpile model (1987), run on an L=60 lattice with threshold 4 over 40,000 grain drops, produces avalanches spanning four orders of magnitude (sizes 1 to 11,194) with no external tuning. Dhar's abelian sandpile group (D. Dhar, 1990) identifies recurrent sandpile configurations with spanning trees of the underlying graph via the Matrix-Tree theorem — verified directly on a 2×2 grid, where brute-force enumeration gives 192 recurrent configurations, exactly matching the determinant of the reduced graph Laplacian (192) computed independently via linear algebra. Separately, a fixed-energy (undriven, periodic-boundary) variant locates a genuine absorbing-to-active phase transition at ζ_c≈2.1–2.2, and the driven sandpile's self-organized density (ζ≈2.10) lands on that independently-located transition point.

Iterating n ↦ n/2 for even n and 3n+1 for odd n reaches 1 from every positive integer. Open.

Gabriel Lamé, 1844.

the Pythagorean school, c. 450 BC.

Joseph-Louis Lagrange, 1770.

Lothar Collatz, 1937.

Leonhard Euler, 1735.

Karl Weierstrass, then Jacques Hadamard, 1876 (Weierstrass), 1893 (Hadamard).

Leonhard Euler, 1735.

Émile Borel, 1899.

Joseph Ritt, 1922.

Rufus Bowen, 1979.

Rufus Bowen, 1979.

Siméon Denis Poisson, 1823.

Hasse, Schnirelmann, Teichmüller and others, 1920s–1930s.

Hasse, Schnirelmann, Teichmüller and others, 1920s–1930s.

Bernard Dwork, 1960.

Johan Wästlund, 2010 (Wästlund's paper); popularized 2018 by 3Blue1Brown.

irrational_sqrt_two — Mathlib.NumberTheory.Real.Irrational

GenContFract.convs — Mathlib.Algebra.ContinuedFractions.Basic

The continued fraction of x is the quotient sequence of the Euclidean algorithm run on x. Identical work; the CF keeps only the quotients and discards the remainders, which is exactly where the magnitude information lived.

Two representations that each throw away the same thing. Neither lets you read off how big a number is from a prefix of its expansion — the ordering information is simply not in the encoding.

An asymptotic series remembers a function to every finite order and forgets it at all orders at once. The content is in how fast the coefficients grow — factorially, not geometrically — so the divergence is the message rather than the failure.

A full orbit determines its seed; orbit statistics do not. Reversing the map is the question of how much of the seed survives being averaged.

Bowen's formula computes the Hausdorff dimension of a Julia set as the zero of a pressure function. An entire dynamical system is summarised by a single number, and the pressure equation is the accounting for what that number is allowed to forget.

The reals are the completion at the infinite place. Being the ambient number system you happened to grow up with is a fact about pedagogy, not about ℝ.

Hausdorff dimension takes values in a continuum and integer values are the exceptional slice. The familiar case is the degenerate one, which is the cleanest instance of this schema on the map.

A convergent power series is the transseries in which every exponentially small term happens to vanish. Convergence is a degenerate case of expansion, not the definition of it.

Studying iteration in general and recovering the integer facts as corollaries, rather than building up from the integers and meeting iteration late. A claim about the right order to learn things in, not about what is true.

Harmonic functions ↔ expected values over Brownian paths; the heat kernel ↔ the transition density of Brownian motion.

Pair correlation of the zeta zeros ↔ eigenvalue statistics of large random Hermitian matrices. Numerically overwhelming, still conjectural.

Recorded as conjectural: expected, not proved.

Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.

The alphabet size is the number of inverse branches of the map. Choosing base p and choosing to work p-adically are versions of the same choice, differing in how the refinement is oriented — disjoint balls rather than intervals sharing boundaries.

An apparent fork that collapsed. Letting the root vary at each stage looks like a new family, but every canonical version is continued fractions conjugated by a logarithm — and the base of that logarithm turns out to be irrelevant, even numerically. Testing whether a fork is real is half the work of this lens.

Recorded as apparent: the resemblance is real, the mechanism is not shared.

A continued fraction is the run-length encoding of a geodesic — the forward itinerary of the Gauss map. The digits stop being digits and become a record of where a point went.

The same reframe applied to a different object, and it inverts: a nested radical is a backward orbit. Running the two at once gives the natural extension — an interval crossed with a Cantor set.

Forwards, the fate of a Collatz orbit is undecidable in practice. Backwards, the orbit hones in on its seed — and the question of how fast becomes a question about linear forms in logarithms, which is where Baker's theorem lives.

Euclid's algorithm consumes a pair and reduces it; the continued fraction it produces generates approximations outward. The same recursion read as destruction or as construction depending on which end you stand at.

Proposed cost that was not one. Both discard something about distance, but not the same something: p-adic expansions are positional and linear, continued fractions relative and recursive. The refutation forced a distinction worth more than the conjecture.

Recorded as refuted: this edge was drawn and then withdrawn.

Tested directly: nested radicals do have a series dual, via difference-of-squares telescoping, echoing continued fractions' own series representation. The pairing is real, but it isn't the same shape — it comes out all-positive rather than alternating, which is exactly what breaks optimality for nested radicals. A confirmed analogy that differs in a load-bearing way from the thing it was tested against.

REFUTED. The two divergences look alike but come from different mechanisms: a Taylor series' radius of convergence is set by geometric growth of coefficients, controlled by the nearest singularity; an asymptotic series diverges everywhere because its coefficients grow factorially. Different mechanism, not the same phenomenon wearing two names.

Recorded as refuted: this edge was drawn and then withdrawn.

REFUTED at the level asked. Checked against Maynard's actual definition of an admissible tuple, and the objects are not the same. A real connection was found one level up instead — at the level of technique (moment methods), not of the objects themselves. The surface-level naming match was the wrong place to look.

Recorded as refuted: this edge was drawn and then withdrawn.

`Mathlib.NumberTheory.Ostrowski` imports `Mathlib.Analysis.AbsoluteValue.Equivalence`, `Mathlib.Analysis.SpecialFunctions.Log.Base`, `Mathlib.Analysis.SpecialFunctions.Pow.Continuity`. Read off Mathlib/NumberTheory/Ostrowski.html. No human asserted this edge.

`Mathlib.Algebra.ContinuedFractions.Basic` imports `Mathlib.Algebra.Field.Defs`. Read off Mathlib/Algebra/ContinuedFractions/Basic.html. No human asserted this edge.

`Mathlib.NumberTheory.Padics.Hensel` imports `Mathlib.Analysis.SpecificLimits.Basic`, `Mathlib.Analysis.Normed.Field.ProperSpace`. Read off Mathlib/NumberTheory/Padics/Hensel.html. No human asserted this edge.

The Riemann zeta function encodes the primes analytically; its zeros control their distribution.

How fast the ball of radius n in a group's Cayley graph grows — polynomially, exponentially, or, for self-similar groups such as Grigorchuk's, strictly in between.

The calculus of elementary functions — the core toolkit before measure theory or real analysis proper.

How quantities diffuse, and the functions that sit at equilibrium under that diffusion.

Basic probabilistic objects — the bridge from counting to continuous randomness.

The continuous limit of a random walk; the canonical continuous-time random process.

Statistics of eigenvalues of large random matrices. Turns up, startlingly, in the distribution of zeta zeros.

Write a number as an integer plus one over an integer plus one over… Unlike decimal it has no fixed alphabet, which is what buys it base-independence and best-approximation.

A map applied over and over, and the symbolic record of where the point went. Continued fractions turn out to be run-length encodings of geodesics under exactly this construction.

Algebraic integers whose conjugates all sit inside the unit circle. The plastic number is the smallest; nothing lives between 1 and it — provided you require an algebraic integer, which is the sloppiness you caught.

Effective lower bounds on linear forms in logarithms. Where reverse-orbit reasoning about Collatz-like maps actually bottoms out.

Expansions that diverge for every argument and are nonetheless the best finite description available. Coefficients grow factorially rather than geometrically, which is why the divergence has a different cause from a finite radius of convergence, and why Borel summation and resurgence exist.

Hausdorff and box dimension, taking values in a continuum. Integer dimension is the exceptional case rather than the default — which is the cleanest instance on this map of a familiar object turning out to be a degenerate slice of a general one.