Geometry — flashcards

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Ernst Selmer, 1951.

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

Rufus Bowen, 1979.

Rufus Bowen, 1979.

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.

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.

Ernst Selmer, 1951.

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

Peter Scholze, 2012.

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

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

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

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

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.

Coordinate geometry is usually taught right after algebraic basics.

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

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

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.

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.

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

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.

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.

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.Padics.Hensel` imports `Mathlib.Topology.Algebra.Polynomial`, `Mathlib.Topology.MetricSpace.CauSeqFilter`. Read off Mathlib/NumberTheory/Padics/Hensel.html. No human asserted this edge.

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.

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

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.

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.