Structure — 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 integers a, b there exist integers x, y with ax + by = gcd(a, b). The extended Euclidean algorithm computes them.

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.

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.

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.

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.

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.

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.

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.

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).

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 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.

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.

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.

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 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.

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

Carl Friedrich Gauss, 1801.

David Hilbert, 1897.

Alexander Ostrowski, 1916.

Kurt Hensel, 1897.

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

Artin and Whaples, 1945.

Rufus Bowen, 1979.

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.

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

James Ax and Simon Kochen, 1965.

Peter Scholze, 2012.

Nat.gcd_eq_gcd_ab — Mathlib.Data.Int.GCD

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

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.

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.

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.

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.

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

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.

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

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

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.

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.

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.

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.

`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.

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.

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.

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.

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

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

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.

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.