Correspondence — flashcards

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.

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.

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.

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.

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.

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.

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.

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.

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

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.

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.

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.

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

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

Ernst Selmer, 1951.

Isaac Newton, c. 1666, published 1707.

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

Leonhard Euler, 1735.

Joseph Ritt, 1922.

Siméon Denis Poisson, 1823.

Gaitsgory, Raskin and collaborators, 2024.

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

Charles Goldberg and Douglas West, 1985.

Bernard Dwork, 1960.

Kubota and Leopoldt, 1964.

Barry Mazur and Andrew Wiles, 1984.

John Tate, 1950.

Ernst Selmer, 1951.

Peter Scholze, 2012.

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

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.

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.

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.

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

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.

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

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.

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.

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.

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.

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.

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.

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

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

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

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

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

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.

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.

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.