Algebra — flashcards

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.

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

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

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.

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.

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

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.

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.

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.

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.

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

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

Adolf Hurwitz, 1898.

Isaac Newton, c. 1666, published 1707.

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

Leonhard Euler, 1735.

Joseph Ritt, 1922.

Gaitsgory, Raskin and collaborators, 2024.

József Kürschák, 1912.

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

Kurt Hensel, 1897.

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

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

József Kürschák, 1912.

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

Nat.gcd_eq_gcd_ab — Mathlib.Data.Int.GCD

PadicInt — Mathlib.NumberTheory.Padics.PadicIntegers

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.

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.

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.

Symbol manipulation is introduced once arithmetic is automatic.

Coordinate geometry is usually taught right after algebraic basics.

Calculus assumes fluent algebra as a prerequisite.

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

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.

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.

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.

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

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.

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.

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.

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.

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.

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.

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

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

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.

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

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

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.

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.