The whole map — flashcards

Write a nonzero rational x as p^n · a/b with p dividing neither a nor b; then v_p(x) = n, and v_p(0) = +∞ by convention.

|x|_p = p^−v_p(x) for x ≠ 0, and |0|_p = 0. Divisibility by a high power of p is what it means to be small.

|x + y|_p ≤ max(|x|_p, |y|_p), strictly stronger than the ordinary triangle inequality, with equality whenever |x|_p ≠ |y|_p.

An absolute value on a field satisfies |x| = 0 exactly when x = 0, |xy| = |x||y|, and |x + y| ≤ |x| + |y|. Ostrowski's theorem is the statement that on ℚ these three conditions have far fewer solutions than one would guess.

Every element of ℚ_p is a series in powers of p extending infinitely toward *higher* powers, with only finitely many negative ones — the mirror image of a decimal. In ℚ₅, −1 = 4 + 4·5 + 4·5² + ⋯, which is the honest version of the schoolyard “…999 = −1”.

ℤ_p = { x ∈ ℚ_p : |x|_p ≤ 1 }, equivalently the inverse limit of ℤ/pⁿℤ. A local ring with unique maximal ideal pℤ_p and residue field 𝔽_p.

For positive integers a and b, the remainder sequence is strictly decreasing and non-negative, so it reaches zero after finitely many steps.

For integers a, b there exist integers x, y with ax + by = gcd(a, b). The extended Euclidean algorithm computes them.

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.

For distinct odd primes p, q the Legendre symbols satisfy (p|q)(q|p) = (−1)^((p−1)/2·(q−1)/2).

For a, b in ℚ*, the product of the local Hilbert symbols over all places equals 1. Reciprocity is this statement, and it is why the completions are not independent.

Every nontrivial absolute value on ℚ is equivalent either to the ordinary absolute value or to a p-adic one for exactly one prime p.

The only normed division algebras over ℝ are ℝ, ℂ, ℍ and 𝕆, of dimensions 1, 2, 4 and 8. This is why the ladder stops.

Any consistent, effectively axiomatised theory interpreting arithmetic contains a sentence neither provable nor refutable in it.

If ZFC is consistent, then neither CH nor its negation is provable from ZFC — Gödel 1940 for one direction, Cohen 1963 for the other.

If ZF is consistent, both ZFC and ZF plus the negation of choice are consistent. In Lean, choice is an axiom rather than a theorem, which makes the dependency mechanically visible.

Propositions correspond to types, proofs to terms, and proof normalisation to evaluation. In a dependently typed proof assistant this is not an analogy but the implementation.

Every elliptic curve over ℚ is modular. Proved for semistable curves by Wiles with Taylor (1995), in general by Breuil, Conrad, Diamond and Taylor (2001). Fermat's Last Theorem is a corollary.

If f(a) ≡ 0 mod p and f'(a) ≢ 0 mod p, then f has a unique p-adic root congruent to a. It is Newton's method with the ultrametric inequality doing the work that real-analytic estimates do over ℝ.

A quadratic form over ℚ has a nontrivial rational zero if and only if it has one over ℝ and over every ℚₚ. The first major local–global principle.

The rational points of an elliptic curve over a number field form a finitely generated abelian group — so infinitely many points are always generated by finitely many.

For nonzero rational x, the ordinary absolute value times the product of all p-adic ones equals 1. Every place is accounted for, and no single one is privileged.

The sum of the kth powers of the first n integers is a polynomial in n of degree k+1 whose coefficients are the Bernoulli numbers. The defining system is lower triangular and dense: each Bernoulli number depends on every earlier one.

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.

A sign-reversing pairing on partitions that cancels almost every term, leaving the pentagonal number theorem's sparse recurrence. The general principle: a recurrence needing little memory is not an easier problem, it is a harder theorem — the near-total cancellation has to be proved.

Franklin's involution (st/franklin-involution) is a ℤ/2 action on partitions into distinct parts that pairs almost everything freely; its isolated fixed points, at exactly the generalized pentagonal n, are mechanistically identified with the Lefschetz fixed point theorem and Duistermaat–Heckman/Atiyah–Bott localization — a signed sum over a space with a group action reducing to a sum over the fixed locus. This is contrasted, via orbit–stabilizer language, with spontaneous symmetry breaking in physics: a broken vacuum has a reduced stabilizer relative to the full symmetry group, the opposite of Franklin's fixed points, which have full stabilizer (the ℤ/2 action fixes them entirely, rather than moving them to a smaller-symmetry orbit). Goldstone's theorem (every broken continuous symmetry generates a massless mode) is named as physics's standard consequence of the reduced-stabilizer picture, not proved here.

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.

The Mexican-hat potential V(φ)=−μ²φ²+λφ⁴ has an unstable maximum at φ=0 (V''(0)=−2μ²<0) and a stable minimum at φ=μ/√(2λ) (V''>0, both confirmed by direct differentiation) forming a degenerate circle (3-sphere, for the full complex doublet) of vacua — the concrete instance of the energetic-minimization mechanism named in st/selection-mechanism-refuted-and-replaced. The chosen vacuum's stabilizer under SU(2)_L×U(1)_Y is Q=T³+Y/2 (the Gell-Mann–Nishijima formula), i.e. U(1)_EM — the worked example of 'reduced stabilizer' that st/franklin-fixed-points-as-symmetry-breaking's contrast was originally about. The 3 broken generators' would-be Goldstone bosons are absorbed into the longitudinal polarizations of W± and Z, leaving the photon massless with 2 polarizations; fermion masses via Yukawa couplings ride on the same vacuum as a separate mechanism. W³ and B mix via the Weinberg angle (tanθ_W=g'/g) into massive Z and massless A, from the mass matrix generated by |D_μΦ|²; the prediction m_W=m_Z cosθ_W was checked two ways — predicted m_W=79.87 GeV vs. measured 80.4 GeV, predicted m_Z=91.09 GeV vs. measured 91.19 GeV (from v=246 GeV), and m_W/m_Z vs. cosθ_W computed independently, both giving 0.8768 to four digits. The Yukawa-potential range argument (V(r)~e^{−mr}/r) explains the weak force's short range quantitatively: ℏ/(m_Wc)≈2.45×10⁻¹⁸ m, far smaller than a proton radius (≈0.84×10⁻¹⁵ m).

One-loop renormalization-group running of the three Standard Model gauge couplings (U(1), SU(2), SU(3)) from their measured values at M_Z gives pairwise crossings at 1.02×10¹³, 2.39×10¹⁴, and 9.39×10¹⁶ GeV — a spread factor of roughly 9188× — that is, they do not meet at one scale. The MSSM (supersymmetric) beta coefficients, with a 1 TeV threshold, give a minimum spread of 0.345 at 1.43×10¹⁶ GeV, against the SM-only minimum spread of 3.647 — much closer to unification, though the spread degrades from 0.344 to 0.925 as the assumed supersymmetry-breaking threshold is raised from 1 TeV to 100 TeV. The proton-decay lower bound on the unification scale was invoked as an independent cross-check, not derived here.

Subbarao's observation that Franklin's involution preserves partition perimeter (λ₁+ℓ(λ)−1) was used to show Franklin's fixed points are exactly the unique perimeter-minimizing partitions into distinct parts — verified for every generalized pentagonal n≤35 — collapsing 'algebraic cancellation' and 'energetic minimization' (st/selection-mechanism-refuted-and-replaced's first and second mechanisms) into one mechanism for this specific case, contradicting the three-way independence claimed there. This collapse was then tested against a second, independently-known Franklin-type involution — Chen and Liu's involution on partitions into distinct parts with odd smallest part, whose fixed points sit at n=k² — by checking five candidate functionals (perimeter, largest part, number of parts, λ₁−ℓ, smallest part) for n≤25; none singles out the squares, with explicit mismatch counts reported for each. The collapse is therefore restricted to the classical Franklin case, not generalized into a new principle: the three-mechanism picture from st/selection-mechanism-refuted-and-replaced is restored, with the explicit caveat that the mechanisms can coincide on particular objects without being identical in general.

Power sums and elementary symmetric polynomials determine each other by a triangular system. This is how information moves between a polynomial's roots and its coefficients without any root ever being computed.

A monic degree-n polynomial needs exactly n roots plus one scale (n+1 numbers) however it's written, but the two standard forms differ in more than notation. Coefficient form is evaluated by Horner's method, a sequential multiply-accumulate whose step k reads step k-1's output by construction — an unavoidable Θ(n) sequential critical path (parallel depth). Root form q∏(x-rᵢ) evaluates its n linear factors independently, then combines them by a parallel product reduction, giving Θ(log n) depth — the standard gap between a linear-recurrence/fold pattern and an associative-reduction pattern, general to computation and not special to polynomials. The mechanism behind the asymmetry: each root-form factor is x read in that root's own private frame (no shared origin across factors), so evaluating in parallel needs no shared reference to compare partial results, only an intrinsic tag (how many factors have deferred to the shared coordinate so far) — a count, not a position. Coefficient form, by contrast, is built by successively converting shared-frame data, which is exactly why extracting it (via Newton's identities, converting power sums to elementary symmetric functions — st/newton-identities) is itself sequential even though it never touches an actual root.

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.

Different families of tractable roots — the falling factorial (Stirling numbers of the first kind), geometric-progression roots (q-calculus, Gaussian binomial coefficients, the q-Pochhammer symbol), Chebyshev nodes (literal projections of roots of unity onto a diameter), and Legendre/Jacobi polynomial roots (eigenvalues of the tridiagonal Jacobi matrix from a three-term recurrence) — are cases of one underlying variational principle: Fekete points, the n→∞ minimizer of −∑ log|rᵢ−rⱼ| over i≠j. With no external field this minimizer is the uniform (arcsine) distribution 1/(π√(1−x²)) on [−1,1], the equilibrium measure. A genuinely different mechanism produces tractable roots without this variational structure: the Ginibre ensemble (eigenvalues of a random Gaussian matrix, uniform on a disk), tractable via random-matrix universality rather than an energy minimization.

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.

Fourier (on R, kernel e^{iξx}), Laplace (on [0,∞), kernel e^{st}), and Mellin (on (0,∞), kernel x^s) are not three unrelated formulas but the same construction — diagonalize translation by the relevant group — applied to translation, causal translation, and dilation respectively. The Mellin kernel's exponent is not a free convention: writing the multiplicative Haar measure on (0,∞) as dx/x forces the kernel x^{s-1}dx = x^s·(dx/x), a character (x^s) times the invariant measure, exactly parallel to e^{iξx}dx on the additive side. Evaluated at integer s, the Mellin transform hands back power sums of roots directly (moment order: Re(s) indexes power sums, Im(s) a log-frequency), feeding Newton's identities (st/newton-identities) as a bridge between the transform and elementary symmetric functions. Further members of the same family exist for other groups/geometries: the Hankel transform (radial Fourier, rotation group, Bessel functions), the Helgason–Fourier transform (hyperbolic space), and wavelets (simultaneous translation and dilation, when no single group suffices).

A kernel z^s=r^se^{is\theta} that diagonalizes both rotation (like Fourier) and scaling (like Mellin) at once fails for a structural reason, not a technical one: evaluating z^s at the same point reached by two different angular paths (θ vs θ+2π) gives values whose ratio is exactly e^{2πis}, confirmed numerically to differ sharply from 1 for non-integer s — single-valuedness on a loop enclosing the origin forces s∈Z. The practically-used compromise (the genuine Fourier–Mellin transform, used in image processing for scale/rotation-invariant matching) keeps the angular part discrete and only the radial part continuous. The full resolution removes the obstruction outright: a logarithmic spiral z(t)=e^{(a+ib)t} never closes on itself, so working on the universal cover (w=log z, unrestricted) makes a single spiral mode g(w)=e^{pw} transform (via a bilateral Laplace transform in w) to G(s)=1/(s−p) — one simple pole whose real part is growth rate and imaginary part is rotation rate, previously two separate quantities now encoded in one complex number. On the spiral, z·d/dz = d/dw exactly, and this single fact unifies the three classical transforms' apparently different derivative rules: the bilateral case gives clean multiplication by s, the one-sided case (spiral cut at a starting point z₀) gives a boundary term −f(z₀) — verified to 20 digits in both cases — so Fourier's clean rule, Laplace's f(0)-carrying rule, and Mellin's vanishing-boundary-term rule are one rule, distinguished only by whether the domain has an edge.

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.

An equivalence between categories of local systems on a curve and sheaves on the moduli of bundles over it. Proved 2024 by Gaitsgory, Raskin and collaborators.

Every continuous map f : Sⁿ → ℝⁿ sends some antipodal pair to the same point: f(p) = f(−p) for some p. The n in both places is the content — a phrasing that drops either one is a different, false claim.

In an antipodally-labelled triangulation of the n-ball, with labels ±1,…,±n and antipodal boundary vertices carrying opposite-signed labels, some edge joins two vertices with the same value and opposite sign. The combinatorial, Sperner-style statement equivalent to Borsuk–Ulam.

A necklace with k types of jewels, each present in an even number of beads, can be fairly split between two thieves using at most k cuts — and k is tight: arranged as k contiguous blocks, one per type, every block needs an internal cut, so 'at most k' cannot be improved in general.

Finding a fair two-thief split of a necklace is PPA-complete already at the simplest case — two thieves, the friendliest group action a proof by Borsuk–Ulam could ask for. Filos-Ratsikas & Goldberg, 2018 (arXiv:1805.12559). This refutes the hypothesis that k-thief difficulty tracks the availability of free ℤ/k actions on spheres: hardness is present at the friendliest case there is, so it is an artefact of the topological proof route rather than an obstruction inherent to the problem.

Two results, and the 2026-09 mining pass corrected the statement of both. (1) THE ONE-SIDED LEMMA. The bound is A_c(t) <= ceil(t*rho_c): no color ever runs more than one bead ahead of its proportional share. It is ONE-SIDED, and the natural two-sided version — a matching lower bound A_c(t) >= floor(t*rho_c) — is FALSE, with an explicit counterexample at x >= 4 reaching a deficit of 23/22. Earlier filings named the lemma 'one-sided' without stating the inequality or recording that the symmetric version fails, which left the asymmetry looking like a proof artifact rather than a fact about the construction. (2) THE MIDPOINT-EXACTNESS THEOREM. At the checkpoint t = y/2 the split is exactly fair. (3) 'GREEDY' NAMES AN INVARIANT CLASS, NOT AN ALGORITHM. The result does not depend on the argmax tie-break — it holds for ANY rule that only ever serves a color with non-negative deficit. The argmax largest-remainder rule is one member of that class and was previously filed as if it were the hypothesis; the tie-break question was explicitly asked in lemma-harvest-prompt.md section 3, the answer came back as the broader class, and this entry did not move until the 2026-09 mining pass. Corrected 2026-08 (retained): an earlier version wrongly conditioned this on a discrepancy statistic D <= 4/3. That statistic was never computed for greedy-built arrangements at all — only for independent random ones, in a separate, unrelated, single-batch numerical experiment (400 trials, three colors, twelve beads, not reproduced or tested at other sizes) with no completed proof behind it. The two results were conflated in translation from a summary and are unrelated.

For 3-color, 12-bead balanced necklace arrangements (4 beads of each color), exhaustive enumeration of all 34,650 distinct arrangements shows c(w)=1 ⟹ D ≤ 4/3, with no exceptions, and the bound is tight — 4/3 is achieved. The converse, once believed and stated on this map, is false: D ≤ 4/3 does not imply c(w)=1. 10,584 of the 34,650 arrangements (about 30%) have D ≤ 4/3 yet require two or three cuts, and fixing D at exactly 1 does not even determine c(w) — it splits close to evenly between one cut and two. D is necessary but far from sufficient.

Each nonzero residue mod p lifts uniquely to a (p−1)st root of unity in ℤ_p, giving a canonical multiplicative section of ℤ_p× → 𝔽_p×. The residue field sits inside the ring, multiplicatively but not additively.

Nearness in |·|_p and nearness in |·|_∞ are unrelated: by Ostrowski the absolute values are inequivalent, so neither induces any information about the other. Asking whether a p-adic number is larger than a real one has no content.

Because |x + y|_p = max(|x|_p, |y|_p) exactly when the two differ, among any three ultrametric distances the two largest are equal. The metric intuition imported from ℝ fails at the first triangle.

Balls in ℚ_p are simultaneously open and closed, so ℚ_p is totally disconnected — and yet not discrete, since ℤ is dense in ℤ_p.

If c ∈ B(a, r) then B(c, r) = B(a, r). Two balls are therefore either disjoint or nested; partial overlap is impossible.

ℤ_p is a closed subset of the product of the finite discrete spaces ℤ/pⁿℤ, hence compact by Tychonoff — or directly, by pigeonholing digits. ℚ_p is only locally compact.

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.

For odd p, ℤ_p× ≅ μ_{p−1} × (1 + pℤ_p) ≅ ℤ/(p−1)ℤ × ℤ_p — Teichmüller roots of unity times the one-units. For p = 2 it is ℤ/2ℤ × ℤ_2, generated by −1 and 1 + 4ℤ_2.

v_p(n!) = Σ_{i≥1} ⌊n/pⁱ⌋, which grows like n/(p−1). So Σ n! converges p-adically for every prime while diverging in every real sense.

Any field carrying an absolute value has a completion, constructed exactly as ℝ is built from ℚ. This is what puts ℚ_p on the same footing as ℝ rather than treating it as an exotic construction.

If |f(a)|_p < |f′(a)|_p² then f has a unique root α with |α − a|_p < |f′(a)|_p. Dropping the requirement that a be a simple root mod p is what makes the lemma usable in practice.

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.

The Random Energy Model (Derrida, 1980) — i.i.d. Gaussian energies — has a critical inverse temperature β_c=√(2ln2) separating a quadratic high-temperature free energy from a linear low-temperature (frozen) one, verified by simulation at N=2²² matching both branches (ln2+β²/4 above β_c, β√(ln2) below). The source material names this as sharing its mechanism directly with the Fyodorov–Hiary–Keating conjecture for the maxima of |ζ| on the critical line — already on this map at st/freezing-transition-log-correlated-extremes — making REM the textbook log-correlated-field instance of the exact phenomenon that statement's zeta-zero application borrows.

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.

The Hirschman–Beckner entropic uncertainty principle, H(|f|²)+H(|f̂|²) ≥ log(πe) with equality only for Gaussians (verified directly: both entropies computed for a Gaussian of arbitrary width, summing to exactly log(πe) independent of width), is the precise quantitative version of a tension recurring across this map between precise local knowledge and diffuse global knowledge. Three previously-established facts are each a separate instance of the same trade-off, not merely reminiscent of it: (1) a polynomial's roots-as-multiset and its coefficient list (Vieta's formulas, st/newton-identities) are a lossless bijection — zero information lost converting either way; (2) the argument principle's root count Z−P is a drastic, lossy compression from O(N) numbers to one integer, with each additional weighted contour moment restoring exactly one further degree of freedom until, after N moments, the information is recovered in full — a literal lossy-then-lossless compression channel; (3) a Taylor series' radius of convergence being controlled by the nearest singularity (st/borel-summation) is a statement that analytic functions are maximally compressible — an infinite-dimensional piece of purely local data (every derivative at one point) is exactly equivalent to the function's entire global behavior, with no redundancy either way.

Kummer's congruences between Bernoulli numbers are the shadow of a single p-adic analytic function interpolating ζ(1−n). A 19th-century family of coincidences turns out to be one object.

The p-adic L-function and the algebraically defined Iwasawa module generate the same ideal. Proved for ℚ in 1984 — worth contrasting with Birch–Swinnerton-Dyer, its classical analogue, which remains open.

Analytic continuation and the functional equation of Hecke L-functions, reproved as Fourier analysis on the adeles. The functional equation becomes Poisson summation.

st/tate-thesis reproves Hecke L-function analytic continuation via Fourier analysis on the adeles. At a single p-adic place, the local piece of that machinery — Tate's local zeta integral Z(f,s) = ∫_{Q_p*} f(x)|x|_p^s d*x — is exactly the p-adic analogue of the (archimedean) Mellin transform, using the multiplicative Haar measure d*x in place of dx/x. For f the indicator of Z_p, it sums to (1−p⁻¹)/(1−p^{-(s+1)}), the local Euler factor itself — so the Euler factor at p is literally a Mellin transform value, not just an analogue of one by loose resemblance.

st/tate-thesis reproves the Hecke L-function functional equation as Poisson summation on Q embedded diagonally in its adele ring A_Q — a consequence of the product formula ∏_v |x|_v = 1 over all places v (finite and infinite), which underlies the whole construction and was checked directly for a specific rational number. Carrying this local/global structure one step further: the log-derivative ξ'(s)/ξ(s) of the completed zeta function decomposes exactly into two pieces — an archimedean piece built from the digamma function (from the Gamma factor at the infinite place) plus a finite-place piece built from the von Mangoldt function (from the Euler product over primes) — verified numerically to 17 digits. The local zeta integral at a single prime p, Z(f,s) for f the indicator of Z_p, sums directly to the Euler factor 1/(1-p^{-s}); the global decomposition is what happens when every place's local computation is assembled at once under the product-formula constraint.

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.

In 0 → E(ℚ)/2E(ℚ) → Sel₂(E) → Ш(E)[2] → 0 the middle term is assembled from local conditions at each place and so is mechanically computable; Ш is precisely the local–global failure that remains.

When the Mordell–Weil rank is less than the genus, p-adic integration bounds the number of rational points on a curve. Analysis over ℚ_p answering a question ℝ cannot touch.

For each degree d, Artin's conjecture on forms over ℚ_p holds for all but finitely many p — proved by model theory, by showing ℚ_p and 𝔽_p((t)) become elementarily equivalent as p grows.

A tilting equivalence relating characteristic 0 and characteristic p geometry, which turned a long list of separate p-adic comparison results into instances of one construction.

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.

Chord(f) = 2sin(fπ) reduces the question 'which rational f give a rational chord length?' to Niven's theorem: rational values of sin(θ) at rational-multiple-of-π angles θ are confined to {0, ±1/2, ±1}. Translated back, Chord(f) is rational for rational f∈[0,1] only at f=0, 1/6, 1/2, 5/6, 1 — f=1/2 (Wallis' own case) is not the only one, contrary to the natural first guess. At f=1/6 (Chord=1), the same product identity underlying st/wallis-product-three-routes' route (2), ∏_{k≠0} k/(k−f) = f·2π/Chord(f), generalizes cleanly to a second explicit Wallis-type product converging to π/3.

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.

For a = 2^m·u, b = 2^n·v with u, v odd 2-adic units, (a,b)₂ = (−1)^(ε(u)ε(v) + mω(v) + nω(u)), where ε(u) = (u−1)/2 mod 2 and ω(u) = (u²−1)/8 mod 2 — both fixed-depth congruences (u mod 4, u mod 8) independent of the size of u.

By Hensel's lemma, whether an odd 2-adic unit u is a square depends only on u mod 8 — a fixed-width digit-read, however large u is. No analogous fixed k exists at an odd prime q: whether u is a quadratic residue mod q is not determined by any bounded number of low bits of u. Checked directly: u=3 vs u=11 (agreeing mod 8) disagree on 339/666 tested primes q; u=7 vs u=71 (agreeing mod 64) disagree on 500/1004 — matching more shared bits does not shrink the disagreement rate toward 0. This is the precise sense in which quadratic reciprocity's supplementary laws are free lookups while the reciprocity step itself is not, and it is what st/hilbert-product's 2-adic term is actually doing.

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.

3x³ + 4y³ + 5z³ = 0 is solvable over ℝ and over every ℚₚ, and has no nontrivial rational solution. Found in 1951; it is why the local–global principle is a phenomenon rather than a theorem.

Euclid, c. 300 BC.

Claude Bachet, then Étienne Bézout, 1624 (Bachet), 1779 (Bézout).

Gabriel Lamé, 1844.

the Pythagorean school, c. 450 BC.

Joseph-Louis Lagrange, 1770.

Carl Friedrich Gauss, 1801.

David Hilbert, 1897.

Alexander Ostrowski, 1916.

Adolf Hurwitz, 1898.

Kurt Gödel, 1931.

Paul Cohen, 1963.

Paul Cohen, 1963.

Haskell Curry, then William Howard, 1934 (Curry), 1969 (Howard).

Wiles with Taylor; then Breuil, Conrad, Diamond and Taylor, 1995, completed 2001.

Lothar Collatz, 1937.

Kurt Hensel, 1897.

Hermann Minkowski, then Helmut Hasse, 1890 (Minkowski), 1923 (Hasse).

Ernst Selmer, 1951.

Louis Mordell, then André Weil, 1922 (Mordell), 1929 (Weil).

Artin and Whaples, 1945.

Leonhard Euler, 1735.

Leonhard Euler, 1735.

Fabian Franklin, 1881.

Isaac Newton, c. 1666, published 1707.

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.

Gaitsgory, Raskin and collaborators, 2024.

Karol Borsuk, conjectured by Stanisław Ulam, 1933.

Albert W. Tucker, 1946.

Charles Goldberg and Douglas West, 1985.

Aris Filos-Ratsikas and Paul Goldberg, 2018.

Kurt Hensel, 1897.

Kurt Hensel, 1897.

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

József Kürschák, 1912.

Kurt Hensel, 1897.

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

Alexander Ostrowski, 1916.

Kurt Hensel, 1897.

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

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

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

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

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

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

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

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

József Kürschák, 1912.

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

Bernard Dwork, 1960.

Kubota and Leopoldt, 1964.

Barry Mazur and Andrew Wiles, 1984.

John Tate, 1950.

Ernst Selmer, 1951.

Claude Chabauty, then Robert Coleman, 1941 (Chabauty), 1985 (Coleman).

James Ax and Simon Kochen, 1965.

Peter Scholze, 2012.

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

Nat.gcd_eq_gcd_ab — Mathlib.Data.Int.GCD

irrational_sqrt_two — Mathlib.NumberTheory.Real.Irrational

GenContFract.convs — Mathlib.Algebra.ContinuedFractions.Basic

legendreSym.quadratic_reciprocity — Mathlib.NumberTheory.LegendreSymbol.QuadraticReciprocity

Rat.AbsoluteValue.equiv_real_or_padic — Mathlib.NumberTheory.Ostrowski

padicValRat — Mathlib.NumberTheory.Padics.PadicVal.Basic

padicNorm — Mathlib.NumberTheory.Padics.PadicNorm

padicNorm.nonarchimedean — Mathlib.NumberTheory.Padics.PadicNorm

PadicInt — Mathlib.NumberTheory.Padics.PadicIntegers

IsUltrametricDist.dist_eq_max_of_dist_ne_dist — Mathlib.Topology.MetricSpace.Ultra.Basic

IsUltrametricDist.isClopen_ball — Mathlib.Topology.MetricSpace.Ultra.Basic

IsUltrametricDist.ball_eq_of_mem — Mathlib.Topology.MetricSpace.Ultra.Basic

PadicInt.compactSpace — Mathlib.NumberTheory.Padics.ProperSpace

sub_one_mul_padicValNat_factorial — Mathlib.NumberTheory.Padics.PadicVal.Basic

hensels_lemma — Mathlib.NumberTheory.Padics.Hensel

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.

Every Bernoulli number depends on all the earlier ones: the defining system is lower triangular and dense. This is the worst case, and it is the baseline the sparse recurrences get compared against.

The partition recurrence needs only a handful of earlier terms, and the reason is Franklin's involution: almost everything cancels in pairs. Sparse memory is not a lighter problem, it is a heavier theorem — the cancellation has to be proved.

A generating function carries an entire sequence in a single expression; which coefficients you can cheaply extract is a statement about how much of the sequence you needed to store to begin with.

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.

Climbing the ladder surrenders order, then commutativity, then associativity — and the amounts are not equal. This edge is the same observation as the What breaks edge; it is here because how much is forgotten and what is surrendered are different questions.

The stolen-necklace argument solves the continuous division problem first — cuts anywhere on a real interval — and recovers the discrete, integer-bead necklace by sliding each cut to the nearest bead boundary. The discrete problem is an un-arbitrary restriction of the continuous one, arrived at from outside the transcript this schema was originally admitted from.

Being an integer is what survives every valuation at once — a condition imposed on a larger object, not a starting point that everything else is built up from.

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.

Euclidean geometry is the curvature-zero member of a family. It looks canonical because it is flat, and flat is a constraint rather than an absence of one.

A geometry is the invariants of a group acting on a space, so choosing Euclidean geometry is choosing one group out of many. Klein's move is this schema applied to geometry wholesale.

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.

Power sums are the symmetric functions you get by fixing a particular basis. Newton's identities convert between the choices, which is what makes the choice visible as a choice.

The commutative, associative, ordered case is one rung of a short ladder that provably stops at eight dimensions. It is the rung everybody starts on and the least general one.

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.

Symbol manipulation is introduced once arithmetic is automatic.

Coordinate geometry is usually taught right after algebraic basics.

Calculus assumes fluent algebra as a prerequisite.

Visual/geometric intuition typically precedes the formal machinery of calculus.

Counting problems are usually introduced early, alongside arithmetic.

Probability courses standardly open with combinatorial counting.

Continuous probability distributions wait for calculus to be in hand.

Formal proof and logic are usually introduced once symbolic fluency exists.

Algorithms are often taught as precise logic, after a foundations course.

The natural numbers are built from a formal base (e.g. Peano axioms over logic and sets).

Counting is direct set-theoretic reasoning — it doesn't actually need arithmetic first.

Algebraic structures are the axiomatic generalisation of arithmetic's operations.

Coordinate/vector geometry is algebra plus a metric — geometry is the derived object here.

Analysis needs algebraic/order structure (fields, limits) before it needs any picture.

Probability on finite spaces is just counting, normalised to sum to one.

Continuous probability needs measure and limit machinery from analysis.

Computability is a question about formal systems, logically prior to any physical machine.

A discrete, antipodally-labelled triangulation of the ball (Tucker, 1946) is the combinatorial equivalent of a continuous antipodal map on the sphere (Borsuk–Ulam, 1933) — the same relation Sperner's lemma has to Brouwer's fixed point theorem. The via is the whole edge: encode a necklace cut as a point on Sⁿ so that the antipodal map exactly swaps the two thieves, and the topological theorem hands back a fair division for free.

Subfields of a normal extension ↔ subgroups of its automorphism group, inclusion-reversing. Solvability of the group ↔ solvability of the equation by radicals.

Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.

A geometry ↔ its group of transformations; the theorems of that geometry ↔ the invariants of that group. Euclidean, affine and projective geometry become one family indexed by groups.

Propositions ↔ types, proofs ↔ programs, proof normalisation ↔ program evaluation. Logic and computation turn out to be the same subject written twice.

Boolean algebras ↔ compact totally disconnected Hausdorff spaces, as an anti-equivalence of categories. Pure logic ↔ pure geometry.

Formulas and proofs ↔ natural numbers, so that provability becomes an arithmetic relation. This is what lets arithmetic talk about itself.

The halting problem's undecidability yields incompleteness directly: if provability were complete, halting would be decidable.

A locally compact abelian group ↔ its group of characters, with Fourier transform the dictionary. Ordinary Fourier series is the case of the circle ↔ the integers.

Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.

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

Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.

Abelian extensions of a number field ↔ quotients of its idele class group. The abelian, fully proved fragment of Langlands.

Quadratic reciprocity is the first visible instance of the pattern class field theory completes for all abelian extensions.

Galois representations ↔ automorphic representations, matched by their L-functions. Proved for elliptic curves over ℚ (modularity, Wiles–Taylor, giving Fermat) and in many other cases; open in general.

Recorded as conjectural: expected, not proved.

Each Galois representation produces an L-function — the arithmetic side's contribution to the shared currency.

Each automorphic form produces an L-function too. Langlands asserts these two supplies of L-functions coincide.

Automorphic forms are best understood as representations of adelic groups — which is what makes functoriality expressible at all.

Local systems on a curve ↔ sheaves on the moduli of bundles over it. Proved in 2024 by Gaitsgory, Raskin and collaborators across roughly a thousand pages.

Reciprocity is the statement that the local Hilbert symbols over every completion multiply to 1. So the p-adic worlds are not independent — fixing all but one determines the last. This was your own question: whether quadratic reciprocity means the completions are coupled. It does.

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

Recorded as conjectural: expected, not proved.

The origin of the schema. Accept the fifth postulate or deny it; both worlds are consistent, and neither is the true one. This became the tool you reached for four more times, each at a higher level.

Your objection, and it was right: axiomatic independence is not Gödelian self-reference. One is a choice the axioms leave open; the other is a statement the system cannot settle about itself.

The third return, and the one where you named the schema explicitly rather than just using it. ZFC and ZF¬C are both consistent if ZF is.

Same shape again: Gödel showed CH cannot be disproved, Cohen that it cannot be proved. A fork you reached for but did not develop — the thread stalled for want of forcing.

Ostrowski's theorem says the branches are exactly ℝ and one ℚₚ per prime. This is the cleanest fork in mathematics: infinitely many consistent completions of the same starting object, and no principled reason to privilege the real one.

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.

Descending ℍ → ℂ means choosing a U(1) inside SU(2) — a whole sphere of equally valid choices. Descending 𝕆 → ℍ offers three. Descending ℂ → ℝ offers one. You noticed the descent is non-uniform before I did.

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.

You may study a problem at a single completion, or assemble every place at once into the adeles. Neither is the default; the product formula says no place is privileged, and choosing one is a choice.

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.

From below, succession is an axiom and addition is defined from it. From above, addition is one rung of the hyperoperation ladder and the Peano axioms read as theorems about the bottom of it. Same content, opposite direction of justification.

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.

The first rung of the ladder. Adjoining i buys algebraic closure and costs the ability to compare any two elements — which is why there is no sensible ordering on ℂ.

Doubling again costs ab = ba. The loss is productive rather than merely regrettable: non-commutativity is exactly what lets quaternions encode rotation in three dimensions.

The last rung costs (ab)c = a(bc). Hurwitz says there is nothing further to surrender, which is why the ladder stops at eight dimensions rather than continuing.

Moving the recursion up one hyperoperation level buys expressive power and costs base-independence — the property that made continued fractions worth having.

Nested radicals do have a series dual by difference-of-squares telescoping, but it is all-positive. Without alternation the approximations no longer straddle the target, and optimality goes.

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.

Hasse–Minkowski gives local-implies-global for quadratic forms. Raise the degree by one and Selmer's cubic destroys it. The cost of a single extra degree is the entire principle — and the Tate–Shafarevich group exists to measure exactly how much was lost.

Once a system can encode its own halting, the fate of a process stops being determinable in advance. The cost of enough expressive power is that you can no longer see the end from the beginning.

Not a theorem — an instance of the same shape. The interest of Collatz here is structural: a rule this simple should not be able to hide its own outcome, and it does.

Optimality elsewhere on this map means an approximation sequence is the best available at its size. A completeness result is the same question asked of a search procedure: PPA-completeness of necklace-splitting says no algorithm can do asymptotically better than the hardest problem in its class, already at the friendliest case (two thieves). The property is the same idea one level up — best-possible, now measured in cost rather than in closeness.

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.

Partial. No direct interpretation the way binomial coefficients count something outright, but one step removed — through the Genocchi and zigzag numbers, both of which do have direct combinatorial meanings. A correspondence that holds once you're willing to go via an intermediate object.

Recorded as conjectural: expected, not proved.

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.

Held, and closed a loop rather than opening a new one: Poisson summation is the bridge back from Fourier analysis to the Bernoulli/zeta material, and it's the reason the functional equation of ζ looks like a symmetry instead of a coincidence.

REFUTED as proposed. The instinct that a complex-analytic proof of the necklace theorem wouldn't generalize was right; the reason given (a quaternion/division-algebra obstruction) was wrong. The actual obstruction is Adams' Hopf-invariant-one theorem — non-parallelisability of spheres — related territory, wrong mechanism.

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.NumberTheory.Ostrowski` imports `Mathlib.NumberTheory.Padics.PadicNorm`. Read off Mathlib/NumberTheory/Ostrowski.html. No human asserted this edge.

`Mathlib.NumberTheory.Padics.PadicVal.Basic` imports `Mathlib.NumberTheory.Divisors`. Read off Mathlib/NumberTheory/Padics/PadicVal/Basic.html. No human asserted this edge.

`Mathlib.NumberTheory.Padics.PadicVal.Basic` imports `Mathlib.Data.Nat.MaxPowDiv`, `Mathlib.Data.Nat.Multiplicity`, `Mathlib.Data.Nat.Prime.Int`. Read off Mathlib/NumberTheory/Padics/PadicVal/Basic.html. No human asserted this edge.

`Mathlib.Data.Int.GCD` imports `Mathlib.Algebra.Divisibility.Basic`, `Mathlib.Algebra.GroupWithZero.Semiconj`, `Mathlib.Algebra.GroupWithZero.Divisibility`, `Mathlib.Algebra.GroupWithZero.Nat`. Read off Mathlib/Data/Int/GCD.html. No human asserted this edge.

`Mathlib.Data.Int.GCD` imports `Mathlib.Algebra.Group.Commute.Units`, `Mathlib.Algebra.Group.Int.Defs`, `Mathlib.Algebra.Group.Nat.Defs`, `Mathlib.Algebra.Group.Nat.Units`. Read off Mathlib/Data/Int/GCD.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.Algebra.Polynomial.Identities`. Read off Mathlib/NumberTheory/Padics/Hensel.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.

`Mathlib.NumberTheory.Padics.Hensel` imports `Mathlib.Topology.Algebra.Polynomial`, `Mathlib.Topology.MetricSpace.CauSeqFilter`. Read off Mathlib/NumberTheory/Padics/Hensel.html. No human asserted this edge.

The natural numbers axiomatised: zero, successor, and induction. The base object almost everything else is eventually built on or compared to.

Repeated division to find the gcd of two numbers — the oldest algorithm still in everyday use.

x² − ny² = 1, solved via continued fractions. The classical entry point where number theory starts reaching into algebra, and where continued fractions stop being a curiosity.

Whether p is a square mod q is determined by whether q is a square mod p. Gauss called it the golden theorem; it is the seed of the whole reciprocity story.

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

The abelian case of reciprocity, completed in the 1920s–30s: it classifies all abelian extensions of a number field in terms of data inside the field itself.

Actions of a field's absolute Galois group on vector spaces. The arithmetic side of the Langlands correspondence.

Solve a problem over the reals and over every ℚₚ, and ask whether that forces a solution over ℚ. It holds for quadratic forms and fails for cubics — the failure is where the interesting objects live.

All completions of a number field handled at once, as a single restricted product. The device that turns ‘check every place separately’ into one object with its own analysis.

Class groups studied along infinite towers of number fields, where their growth becomes regular and is captured by a p-adic L-function.

Analytic invariants attached to arithmetic and to automorphic objects alike. They are the common currency in which both sides of Langlands are compared.

The pre-formal idea of a method you could just follow step by step — the intuition later made rigorous.

Turing's formal model of computation; the basis for algorithmic complexity and the P vs NP question.

Computation as function abstraction and application, with types constraining what may be applied to what.

Not just whether a proof of existence can be turned into a procedure, but what that procedure has to cost — classified by reduction into complexity classes (PPA, PPAD, TFNP and the rest) rather than judged case by case. Turing machines ask whether a method exists at all; this asks what the cheapest one can possibly do, and a completeness result is the sharpest form of that question — it says a whole class of problems is exactly as hard as its hardest member.

Abstract structures generalising arithmetic — sets with addition and multiplication obeying fixed axioms.

The algebra of invertible transformations. Wherever something is preserved, a group is acting.

Extensions of the rationals built from roots of polynomials — where number theory and algebra fuse.

Groups studied by how they act on vector spaces — turning symmetry into linear algebra.

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.

Euclidean geometry recast with vectors and inner products, following Descartes' translation into algebra.

Klein's 1872 reorganisation: a geometry is defined by the group of transformations under which its statements stay true.

Geometry stripped down to nearness and continuity, with no distances or angles.

Smooth genus-one curves with a marked point, whose points form a group. Filed under geometry because it is a curve, studied almost entirely for its arithmetic — the clearest single case of this map's eight-way split failing to hold an object.

One-complex-dimensional manifolds. The stage on which the geometric form of Langlands is set.

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

Decomposing functions into waves. Turns differentiation into multiplication and convolution into product.

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

Highly symmetric analytic functions on the upper half-plane and its generalisations. The analytic side of Langlands. (Filed under calculus only because an eight-way split leaves no separate slot for analysis or representation theory.)

Counting and structure on discrete objects; proof techniques native to finite mathematics.

Encoding a whole sequence as the coefficients of one formal power series, so counting becomes algebra.

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.

Formal systems for reasoning, and the proofs expressible inside them.

The algebraic structure of truth values, meets, joins and complements.

No consistent formal system strong enough for arithmetic can prove all truths about itself.

For each prime p, a completion of the rationals in which closeness means divisibility by high powers of p. Non-Archimedean: every triangle is isosceles, and every point of a disc is its centre.

Every absolute value on ℚ is equivalent to the ordinary one or to a p-adic one. This is the fork itself: it says exactly what the branches are and that there are no others.

ℝ → ℂ → ℍ → 𝕆. Each rung doubles dimension and surrenders a property: order, then commutativity, then associativity. Hurwitz's theorem says it stops at eight.

Deny the parallel postulate and the resulting geometry is consistent. The first widely accepted demonstration that an axiom could be genuinely optional.

The standard foundation: sets built from the empty set by a short list of construction axioms.

Given any family of nonempty sets, a set can be formed by picking one element from each. Independent of ZF: assuming it and denying it both give consistent theories.

There is no cardinality strictly between the integers and the reals. Gödel and Cohen together showed it can be neither proved nor refuted from ZFC.

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.

The same recursion one hyperoperation up: roots inside roots rather than divisions inside divisions. Gains a level, loses base-independence.

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.

Succession, addition, multiplication, exponentiation, tetration — each level iterating the one below. Cross-confirmed: this ladder appears in both transcripts as a place to move up and down.

Halve if even, 3n+1 if odd. Whether every start returns to 1 is open. Its interest here is structural: the fate of an orbit cannot be determined in advance.

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.

Curves over finite fields, behaving like number fields but easier. Flagged repeatedly across both transcripts as the cleanest generalisation available and never opened — the single highest-value unopened prerequisite. It is also where Langlands was actually proved.

The coefficients that turn a sum of kth powers into a polynomial in n. The defining system is lower triangular and dense — every Bernoulli number depends on all the earlier ones — which makes them the standard against which sparser recurrences get measured.

Elementary symmetric polynomials, power sums, and Newton's identities converting between them. The precise machinery for moving between a polynomial's roots and its coefficients without ever solving for a root.

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.

Topological pressure, transfer operators and Birkhoff sums, importing statistical mechanics into dynamics. Bowen's formula computes the dimension of a Julia set as the zero of a pressure function — an entire system compressed to the root of one equation.

What a description carries and what it must give up: entropy as the measure, and the trade-offs between dual descriptions of one object — the uncertainty principle read as a statement about information rather than about measurement.

That any two elements can be compared. The first thing surrendered going up the division algebra ladder, and the reason ℂ has no sensible < .

That ab = ba. Surrendered at the quaternions, which is exactly what lets them encode rotation.

That (ab)c = a(bc). Surrendered at the octonions. Its loss is severe enough that most machinery stops working, which is why the ladder ends.

That the representation does not depend on an arbitrary choice of alphabet. Continued fractions have it; decimal does not; nested radicals give it up to gain a hyperoperation level.

That the successive approximations are the best available at their size. Depends on convergents straddling the target, which all-positive expansions cannot do.

How much of the metric survives a representation. The site of a refuted conjecture: continued fractions and p-adic expansions both discard something about distance, but not the same something.

Whether knowing a solution everywhere locally forces one globally. Holds for quadratic forms by Hasse–Minkowski; Selmer's cubic 3x³+4y³+5z³=0 destroys it in general, and measuring the failure is what the Tate–Shafarevich group is for.

That the fate of a process can be determined in advance. Surrendered the moment a system is expressive enough to encode its own halting.

Good at — Exact facts about individual numbers. Is this prime, does this equation have integer solutions, what exactly is the greatest common divisor. Answers here are yes or no, with no error bar.

Bad at — Anything approximate or continuous — it has almost no native vocabulary for “roughly”. It is also famously unable to predict its own difficulty: one-line questions here stay open for centuries, and nothing internal to the area explains why.

Good at — Impossibility and cost. This cannot be decided at all; that needs at least this much time; this problem is secretly the same as that one. It is the only area that routinely proves a method cannot exist.

Bad at — Saying what is true. It reports what is reachable, not what holds. And its own central question about cost has resisted every technique it has produced.

Good at — Transporting a result to every situation obeying the same axioms, and proving impossibility cheaply by exhibiting an invariant that would have to change. Its answers are reusable in a way no other area's are.

Bad at — Magnitude. Algebra sees structure and not size, so it generally cannot tell you how big, how close, how fast, or how likely — and it is nearly silent about anything requiring approximation.

Good at — Questions whose answers depend on shape rather than quantity, and on making structure visible enough to reason with. It converts hard algebraic statements into pictures you can manipulate.

Bad at — Discrete and arithmetic questions, where there is no shape to exploit. Its reliance on intuition also becomes a liability past three dimensions, where the picture quietly stops being a guide and starts being a trap.

Good at — Control and approximation. How fast, how close, within what error, does this converge. It answers quantitative questions no other area can even pose.

Bad at — Exactness and structure. It will hand you 0.915965594… and be unable to say whether that number is transcendental. Where there is no continuity to exploit, its entire toolkit is unavailable. (It also carries this map's analysis and representation theory, which do not fit anywhere else — an admitted defect of an eight-way split.)

Good at — Existence and enumeration on finite structures, often proving something must exist without producing one. Its arguments need the least prior machinery of any area, which is why its problems are so easy to state.

Bad at — Construction — a probabilistic proof shows an object exists and hands you nothing you can build. It also transfers badly: each problem tends to need a new idea rather than an existing theory.

Good at — Typical and limiting behaviour. What happens almost surely, how much fluctuation to expect, what a system looks like once it has run a long time. It answers questions about populations that are hopeless one at a time.

Bad at — Individual cases. It will prove almost every number has a property and be unable to certify a single specific one. Rare events with hidden structure are where its estimates are least trustworthy.

Good at — Limitative results and relative consistency. What a system cannot prove, which statements are independent of it, what is undecidable, and what follows if you assume something unprovable. It is the only area that can answer questions *about* the map.

Bad at — Producing mathematics. It rarely settles an ordinary mathematical question, and having shown two alternatives are equally consistent, it has nothing whatever to say about which one is right.