Tap any node for its description and how it connects under
the current lens. Two nodes have full pages so far — they carry an outer ring on the map.
area
ObjectsWhole numbers, primes, divisibility, and equations required to have integer or rational solutions.
MachineryCongruence and modular reduction, factorisation, descent, reciprocity laws — and, when those run out, analytic and algebraic tools imported wholesale from elsewhere.
Good atExact facts about individual numbers. Is this prime, does this equation have integer solutions, what exactly is the greatest common divisor. Answers here are yes or no, with no error bar.
Bad atAnything approximate or continuous — it has almost no native vocabulary for “roughly”. It is also famously unable to predict its own difficulty: one-line questions here stay open for centuries, and nothing internal to the area explains why.
Connections — Structural only lens
19 concepts in this group — Eight areas
Peano arithmetic · Euclidean algorithm · Pell's equation · Quadratic reciprocity · Zeta function & prime distribution · Class field theory · Galois representations · Local–global principle · Adeles & ideles · Iwasawa theory · L-functions · p-adic numbers · Ostrowski's theorem · Continued fractions · Hyperoperation hierarchy · Collatz conjecture · Pisot numbers & the plastic number · Baker's theorem · Bernoulli numbers & power sums
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
→ Algebra
Symbol manipulation is introduced once arithmetic is automatic.
→ Combinatorics
Counting problems are usually introduced early, alongside arithmetic.
Connections — First principles lens
← Logic
The natural numbers are built from a formal base (e.g. Peano axioms over logic and sets).
→ Algebra
Algebraic structures are the axiomatic generalisation of arithmetic's operations.
Connections — Correspondences lens
Gödel numbering
Propositional & predicate calculus ↔ Peano arithmetic
Formulas and proofs ↔ natural numbers, so that provability becomes an arithmetic relation. This is what lets arithmetic talk about itself.
Artin reciprocity
Algebraic number fields ↔ Class field theory
Abelian extensions of a number field ↔ quotients of its idele class group. The abelian, fully proved fragment of Langlands.
Reciprocity, generalised
Quadratic reciprocity ↔ Class field theory
Quadratic reciprocity is the first visible instance of the pattern class field theory completes for all abelian extensions.
Langlands correspondence
Galois representations ↔ Modular & automorphic forms
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.
still conjectural
Artin / Hasse–Weil L-function
Galois representations ↔ L-functions
Each Galois representation produces an L-function — the arithmetic side's contribution to the shared currency.
Hecke L-function
Modular & automorphic forms ↔ L-functions
Each automorphic form produces an L-function too. Langlands asserts these two supplies of L-functions coincide.
Hilbert symbol product formula
Quadratic reciprocity ↔ p-adic numbers
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.
Montgomery–Dyson
Zeta function & prime distribution ↔ Random matrix theory
Pair correlation of the zeta zeros ↔ eigenvalue statistics of large random Hermitian matrices. Numerically overwhelming, still conjectural.
still conjectural
Connections — Forks lens
Which absolute value you complete at
Ostrowski's theorem ↔ p-adic numbers
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.
source sentence withheld
The Archimedean branch
Ostrowski's theorem ↔ Differentiation & integration
Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.
Which base you expand in
Orbits & itineraries ↔ p-adic numbers
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.
source sentence withheld
Work at one place, or all of them
Adeles & ideles ↔ Local–global principle
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.
Variable-root schemes
Nested radicals ↔ Continued fractions
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.
source sentence withheld
apparent fork — it collapsed
Connections — Direction lens
Forward orbit
Continued fractions ↔ Orbits & itineraries
A continued fraction is the run-length encoding of a geodesic — the forward itinerary of the Gauss map. The digits stop being digits and become a record of where a point went.
source sentence withheld
schema re-applied 4× — each return a level up
Reverse the map
Collatz conjecture ↔ Baker's theorem
Forwards, the fate of a Collatz orbit is undecidable in practice. Backwards, the orbit hones in on its seed — and the question of how fast becomes a question about linear forms in logarithms, which is where Baker's theorem lives.
source sentence withheld
Build up, or descend
Peano arithmetic ↔ Hyperoperation hierarchy
From below, succession is an axiom and addition is defined from it. From above, addition is one rung of the hyperoperation ladder and the Peano axioms read as theorems about the bottom of it. Same content, opposite direction of justification.
source sentence withheld
Reductive vs generative
Euclidean algorithm ↔ Continued fractions
Euclid's algorithm consumes a pair and reduces it; the continued fraction it produces generates approximations outward. The same recursion read as destruction or as construction depending on which end you stand at.
source sentence withheld
Connections — What breaks lens
Continued fractions → nested radicals
Hyperoperation hierarchy ↔ Base-independence
Moving the recursion up one hyperoperation level buys expressive power and costs base-independence — the property that made continued fractions worth having.
source sentence withheld
A proposed shared loss
Continued fractions ↔ Distance information
Proposed cost that was not one. Both discard something about distance, but not the same something: p-adic expansions are positional and linear, continued fractions relative and recursive. The refutation forced a distinction worth more than the conjecture.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Quadratic forms → cubics
Local–global principle ↔ Local data determining global
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.
Fate not determinable in advance
Collatz conjecture ↔ Decidability
Not a theorem — an instance of the same shape. The interest of Collatz here is structural: a rule this simple should not be able to hide its own outcome, and it does.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsAlgorithms, machines, formal languages, and the resources a procedure consumes.
MachinerySimulation, diagonalisation, reduction of one problem to another, and accounting for time and space.
Good atImpossibility and cost. This cannot be decided at all; that needs at least this much time; this problem is secretly the same as that one. It is the only area that routinely proves a method cannot exist.
Bad atSaying what is true. It reports what is reachable, not what holds. And its own central question about cost has resisted every technique it has produced.
Connections — Structural only lens
4 concepts in this group — Eight areas
Effective procedure · Turing machines / P vs NP · Typed λ-calculus · Computational complexity
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Logic
Algorithms are often taught as precise logic, after a foundations course.
Connections — First principles lens
← Logic
Computability is a question about formal systems, logically prior to any physical machine.
Connections — Correspondences lens
Curry–Howard
Propositional & predicate calculus ↔ Typed λ-calculus
Propositions ↔ types, proofs ↔ programs, proof normalisation ↔ program evaluation. Logic and computation turn out to be the same subject written twice.
Undecidability ↔ incompleteness
Turing machines / P vs NP ↔ Gödel's incompleteness theorems
The halting problem's undecidability yields incompleteness directly: if provability were complete, halting would be decidable.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Self-reference
Turing machines / P vs NP ↔ Decidability
Once a system can encode its own halting, the fate of a process stops being determinable in advance. The cost of enough expressive power is that you can no longer see the end from the beginning.
Completeness as the computational form of best-possible
Computational complexity ↔ Optimality of approximation
Optimality elsewhere on this map means an approximation sequence is the best available at its size. A completeness result is the same question asked of a search procedure: PPA-completeness of necklace-splitting says no algorithm can do asymptotically better than the hardest problem in its class, already at the friendliest case (two thieves). The property is the same idea one level up — best-possible, now measured in cost rather than in closeness.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsGroups, rings, fields, vector spaces, and above all the structure-preserving maps between them.
MachineryAxioms stated once and applied everywhere, homomorphisms, quotients, and invariants that survive a transformation.
Good atTransporting 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 atMagnitude. 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.
Connections — Structural only lens
8 concepts in this group — Eight areas
Rings & fields · Groups & symmetry · Algebraic number fields · Representation theory · Division algebra ladder · Nested radicals · Function fields · Symmetric functions
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Arithmetic
Symbol manipulation is introduced once arithmetic is automatic.
→ Geometry
Coordinate geometry is usually taught right after algebraic basics.
→ Calculus
Calculus assumes fluent algebra as a prerequisite.
→ Logic
Formal proof and logic are usually introduced once symbolic fluency exists.
Connections — First principles lens
← Arithmetic
Algebraic structures are the axiomatic generalisation of arithmetic's operations.
→ Geometry
Coordinate/vector geometry is algebra plus a metric — geometry is the derived object here.
→ Calculus
Analysis needs algebraic/order structure (fields, limits) before it needs any picture.
Connections — Correspondences lens
Galois theory
Rings & fields ↔ Groups & symmetry
Subfields of a normal extension ↔ subgroups of its automorphism group, inclusion-reversing. Solvability of the group ↔ solvability of the equation by radicals.
Hilbert's Nullstellensatz
Coordinate geometry ↔ Rings & fields
Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.
Erlangen program
Erlangen program ↔ Groups & symmetry
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.
Pontryagin duality
Fourier analysis ↔ Groups & symmetry
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.
Formal power series
Generating functions ↔ Rings & fields
Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.
Curves ↔ function fields
Riemann surfaces ↔ Rings & fields
Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.
Artin reciprocity
Algebraic number fields ↔ Class field theory
Abelian extensions of a number field ↔ quotients of its idele class group. The abelian, fully proved fragment of Langlands.
Automorphic representations
Modular & automorphic forms ↔ Representation theory
Automorphic forms are best understood as representations of adelic groups — which is what makes functoriality expressible at all.
Geometric Langlands
Riemann surfaces ↔ Representation theory
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.
Connections — Forks lens
Which imaginary axis you keep
Division algebra ladder ↔ Groups & symmetry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Variable-root schemes
Nested radicals ↔ Continued fractions
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.
source sentence withheld
apparent fork — it collapsed
Connections — Direction lens
Backward orbit
Nested radicals ↔ Orbits & itineraries
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.
source sentence withheld
Connections — What breaks lens
ℝ → ℂ
Division algebra ladder ↔ Order
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 ℂ.
source sentence withheld
ℂ → ℍ
Division algebra ladder ↔ Commutativity
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.
ℍ → 𝕆
Division algebra ladder ↔ Associativity
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.
The series dual is all-positive
Nested radicals ↔ Optimality of approximation
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.
source sentence withheld
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsSpaces, shapes, the transformations acting on them, and whatever survives those transformations unchanged.
MachineryCoordinates, symmetry groups, curvature, continuity and deformation — and the habit of asking which group a question is really about.
Good atQuestions 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 atDiscrete 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.
Connections — Structural only lens
8 concepts in this group — Eight areas
Coordinate geometry · Erlangen program · Topological spaces · Elliptic curves · Riemann surfaces · Non-Euclidean geometry · Fractal dimension · Growth of groups
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Algebra
Coordinate geometry is usually taught right after algebraic basics.
→ Calculus
Visual/geometric intuition typically precedes the formal machinery of calculus.
Connections — First principles lens
← Algebra
Coordinate/vector geometry is algebra plus a metric — geometry is the derived object here.
Connections — Correspondences lens
Tucker's lemma / Borsuk–Ulam
Graph theory & combinatorial proof ↔ Topological spaces
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.
source sentence withheld
Hilbert's Nullstellensatz
Coordinate geometry ↔ Rings & fields
Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.
Erlangen program
Erlangen program ↔ Groups & symmetry
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.
Stone duality
Boolean algebra ↔ Topological spaces
Boolean algebras ↔ compact totally disconnected Hausdorff spaces, as an anti-equivalence of categories. Pure logic ↔ pure geometry.
Curves ↔ function fields
Riemann surfaces ↔ Rings & fields
Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.
Geometric Langlands
Riemann surfaces ↔ Representation theory
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.
Connections — Forks lens
The parallel postulate
Coordinate geometry ↔ Non-Euclidean geometry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Two different kinds of incompleteness
Gödel's incompleteness theorems ↔ Non-Euclidean geometry
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.
source sentence withheld
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsFunctions, limits, measures, and differential equations — anything varying continuously.
MachineryLimits, inequalities and estimates, convergence, and controlled approximation. The one area that handles actual infinity carefully rather than avoiding it.
Good atControl and approximation. How fast, how close, within what error, does this converge. It answers quantitative questions no other area can even pose.
Bad atExactness and structure. It will hand you 0.915965594… and be unable to say whether that number is transcendental. Where there is no continuity to exploit, its entire toolkit is unavailable. (It also carries this map's analysis and representation theory, which do not fit anywhere else — an admitted defect of an eight-way split.)
Connections — Structural only lens
6 concepts in this group — Eight areas
Differentiation & integration · Fourier analysis · Heat equation & harmonic functions · Modular & automorphic forms · Orbits & itineraries · Asymptotic series & transseries
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Algebra
Calculus assumes fluent algebra as a prerequisite.
← Geometry
Visual/geometric intuition typically precedes the formal machinery of calculus.
→ Probability
Continuous probability distributions wait for calculus to be in hand.
Connections — First principles lens
← Algebra
Analysis needs algebraic/order structure (fields, limits) before it needs any picture.
→ Probability
Continuous probability needs measure and limit machinery from analysis.
Connections — Correspondences lens
Pontryagin duality
Fourier analysis ↔ Groups & symmetry
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.
Kakutani / Feynman–Kac
Brownian motion ↔ Heat equation & harmonic functions
Harmonic functions ↔ expected values over Brownian paths; the heat kernel ↔ the transition density of Brownian motion.
Langlands correspondence
Galois representations ↔ Modular & automorphic forms
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.
still conjectural
Hecke L-function
Modular & automorphic forms ↔ L-functions
Each automorphic form produces an L-function too. Langlands asserts these two supplies of L-functions coincide.
Automorphic representations
Modular & automorphic forms ↔ Representation theory
Automorphic forms are best understood as representations of adelic groups — which is what makes functoriality expressible at all.
Connections — Forks lens
The Archimedean branch
Ostrowski's theorem ↔ Differentiation & integration
Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.
Which base you expand in
Orbits & itineraries ↔ p-adic numbers
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.
source sentence withheld
Connections — Direction lens
Forward orbit
Continued fractions ↔ Orbits & itineraries
A continued fraction is the run-length encoding of a geodesic — the forward itinerary of the Gauss map. The digits stop being digits and become a record of where a point went.
source sentence withheld
schema re-applied 4× — each return a level up
Backward orbit
Nested radicals ↔ Orbits & itineraries
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.
source sentence withheld
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsFinite sets, graphs, arrangements and configurations — structures you could in principle list.
MachineryCounting the same thing two ways, pigeonhole, extremal arguments, induction, and the probabilistic method.
Good atExistence and enumeration on finite structures, often proving something must exist without producing one. Its arguments need the least prior machinery of any area, which is why its problems are so easy to state.
Bad atConstruction — a probabilistic proof shows an object exists and hands you nothing you can build. It also transfers badly: each problem tends to need a new idea rather than an existing theory.
Connections — Structural only lens
2 concepts in this group — Eight areas
Graph theory & combinatorial proof · Generating functions
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Arithmetic
Counting problems are usually introduced early, alongside arithmetic.
→ Probability
Probability courses standardly open with combinatorial counting.
Connections — First principles lens
← Logic
Counting is direct set-theoretic reasoning — it doesn't actually need arithmetic first.
→ Probability
Probability on finite spaces is just counting, normalised to sum to one.
Connections — Correspondences lens
Tucker's lemma / Borsuk–Ulam
Graph theory & combinatorial proof ↔ Topological spaces
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.
source sentence withheld
Formal power series
Generating functions ↔ Rings & fields
Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsRandom variables, distributions, and processes evolving under uncertainty.
MachineryMeasure and independence, concentration inequalities, limit theorems, coupling — analysis with a normalisation that makes total mass one.
Good atTypical and limiting behaviour. What happens almost surely, how much fluctuation to expect, what a system looks like once it has run a long time. It answers questions about populations that are hopeless one at a time.
Bad atIndividual cases. It will prove almost every number has a property and be unable to certify a single specific one. Rare events with hidden structure are where its estimates are least trustworthy.
Connections — Structural only lens
4 concepts in this group — Eight areas
Random walks & distributions · Brownian motion · Random matrix theory · Thermodynamic formalism
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Combinatorics
Probability courses standardly open with combinatorial counting.
← Calculus
Continuous probability distributions wait for calculus to be in hand.
Connections — First principles lens
← Combinatorics
Probability on finite spaces is just counting, normalised to sum to one.
← Calculus
Continuous probability needs measure and limit machinery from analysis.
Connections — Correspondences lens
Kakutani / Feynman–Kac
Brownian motion ↔ Heat equation & harmonic functions
Harmonic functions ↔ expected values over Brownian paths; the heat kernel ↔ the transition density of Brownian motion.
Montgomery–Dyson
Zeta function & prime distribution ↔ Random matrix theory
Pair correlation of the zeta zeros ↔ eigenvalue statistics of large random Hermitian matrices. Numerically overwhelming, still conjectural.
still conjectural
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
area
ObjectsFormal systems, proofs, theories, and the models that satisfy them. Its objects are mathematics itself.
MachineryFormalisation, interpretation of one theory inside another, diagonalisation, model construction and forcing.
Good atLimitative results and relative consistency. What a system cannot prove, which statements are independent of it, what is undecidable, and what follows if you assume something unprovable. It is the only area that can answer questions *about* the map.
Bad atProducing mathematics. It rarely settles an ordinary mathematical question, and having shown two alternatives are equally consistent, it has nothing whatever to say about which one is right.
Connections — Structural only lens
6 concepts in this group — Eight areas
Propositional & predicate calculus · Boolean algebra · Gödel's incompleteness theorems · Zermelo–Fraenkel set theory · Axiom of choice · Continuum hypothesis
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
← Algebra
Formal proof and logic are usually introduced once symbolic fluency exists.
→ Computation
Algorithms are often taught as precise logic, after a foundations course.
Connections — First principles lens
→ Arithmetic
The natural numbers are built from a formal base (e.g. Peano axioms over logic and sets).
→ Combinatorics
Counting is direct set-theoretic reasoning — it doesn't actually need arithmetic first.
→ Computation
Computability is a question about formal systems, logically prior to any physical machine.
Connections — Correspondences lens
Curry–Howard
Propositional & predicate calculus ↔ Typed λ-calculus
Propositions ↔ types, proofs ↔ programs, proof normalisation ↔ program evaluation. Logic and computation turn out to be the same subject written twice.
Stone duality
Boolean algebra ↔ Topological spaces
Boolean algebras ↔ compact totally disconnected Hausdorff spaces, as an anti-equivalence of categories. Pure logic ↔ pure geometry.
Gödel numbering
Propositional & predicate calculus ↔ Peano arithmetic
Formulas and proofs ↔ natural numbers, so that provability becomes an arithmetic relation. This is what lets arithmetic talk about itself.
Undecidability ↔ incompleteness
Turing machines / P vs NP ↔ Gödel's incompleteness theorems
The halting problem's undecidability yields incompleteness directly: if provability were complete, halting would be decidable.
Connections — Forks lens
Two different kinds of incompleteness
Gödel's incompleteness theorems ↔ Non-Euclidean geometry
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.
source sentence withheld
Assume choice, or deny it
Zermelo–Fraenkel set theory ↔ Axiom of choice
The third return, and the one where you named the schema explicitly rather than just using it. ZFC and ZF¬C are both consistent if ZF is.
source sentence withheld
schema re-applied 3× — each return a level up
Independent of ZFC
Zermelo–Fraenkel set theory ↔ Continuum hypothesis
Same shape again: Gödel showed CH cannot be disproved, Cohen that it cannot be proved. A fork you reached for but did not develop — the thread stalled for want of forcing.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Peano arithmetic
elementary
ArithmeticEight areasFoundationKind of question
The natural numbers axiomatised: zero, successor, and induction. The base object almost everything else is eventually built on or compared to.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Foundation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Gödel numbering
↔ Propositional & predicate calculus
Formulas and proofs ↔ natural numbers, so that provability becomes an arithmetic relation. This is what lets arithmetic talk about itself.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
Build up, or descend
↔ Hyperoperation hierarchy
From below, succession is an axiom and addition is defined from it. From above, addition is one rung of the hyperoperation ladder and the Peano axioms read as theorems about the bottom of it. Same content, opposite direction of justification.
source sentence withheld
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Maximal memory
← Bernoulli numbers & power sums
Every Bernoulli number depends on all the earlier ones: the defining system is lower triangular and dense. This is the worst case, and it is the baseline the sparse recurrences get compared against.
source sentence withheld
Connections — Degeneracy lens
The integers as an intersection
← Ostrowski's theorem
Being an integer is what survives every valuation at once — a condition imposed on a larger object, not a starting point that everything else is built up from.
source sentence withheld
Machinery first, integers after
← Orbits & itineraries
Studying iteration in general and recovering the integer facts as corollaries, rather than building up from the integers and meeting iteration late. A claim about the right order to learn things in, not about what is true.
source sentence withheld
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
Mathlib import
← p-adic numbers
`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.
Open full page →
elementary
ArithmeticEight areasComputationKind of question
Repeated division to find the gcd of two numbers — the oldest algorithm still in everyday use.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Computation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
Reductive vs generative
↔ Continued fractions
Euclid's algorithm consumes a pair and reduces it; the continued fraction it produces generates approximations outward. The same recursion read as destruction or as construction depending on which end you stand at.
source sentence withheld
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Same computation, less kept
→ Continued fractions
The continued fraction of x is the quotient sequence of the Euclidean algorithm run on x. Identical work; the CF keeps only the quotients and discards the remainders, which is exactly where the magnitude information lived.
source sentence withheld
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
Mathlib import
← p-adic numbers
`Mathlib.NumberTheory.Padics.PadicVal.Basic` imports `Mathlib.NumberTheory.Divisors`. Read off Mathlib/NumberTheory/Padics/PadicVal/Basic.html. No human asserted this edge.
Mathlib import
→ Rings & fields
`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 import
→ Groups & symmetry
`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.
Pell's equation
advanced
ArithmeticEight areasComputationKind of question
x² − ny² = 1, solved via continued fractions. The classical entry point where number theory starts reaching into algebra, and where continued fractions stop being a curiosity.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Computation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Quadratic reciprocity
advanced
ArithmeticEight areasStructureKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Reciprocity, generalised
↔ Class field theory
Quadratic reciprocity is the first visible instance of the pattern class field theory completes for all abelian extensions.
Hilbert symbol product formula
↔ p-adic numbers
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.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Zeta function & prime distribution
advanced
ArithmeticEight areasSize and approximationKind of question
The Riemann zeta function encodes the primes analytically; its zeros control their distribution.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Montgomery–Dyson
↔ Random matrix theory
Pair correlation of the zeta zeros ↔ eigenvalue statistics of large random Hermitian matrices. Numerically overwhelming, still conjectural.
still conjectural
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
Are these the same combs used in Maynard's twin-prime bound?
← Graph theory & combinatorial proof
REFUTED at the level asked. Checked against Maynard's actual definition of an admissible tuple, and the objects are not the same. A real connection was found one level up instead — at the level of technique (moment methods), not of the objects themselves. The surface-level naming match was the wrong place to look.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Class field theory
research
ArithmeticEight areasClassificationKind of question
The abelian case of reciprocity, completed in the 1920s–30s: it classifies all abelian extensions of a number field in terms of data inside the field itself.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Classification (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Artin reciprocity
↔ Algebraic number fields
Abelian extensions of a number field ↔ quotients of its idele class group. The abelian, fully proved fragment of Langlands.
Reciprocity, generalised
↔ Quadratic reciprocity
Quadratic reciprocity is the first visible instance of the pattern class field theory completes for all abelian extensions.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Open full page →
research
ArithmeticEight areasCorrespondenceKind of question
Actions of a field's absolute Galois group on vector spaces. The arithmetic side of the Langlands correspondence.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Langlands correspondence
↔ Modular & automorphic forms
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.
still conjectural
Artin / Hasse–Weil L-function
↔ L-functions
Each Galois representation produces an L-function — the arithmetic side's contribution to the shared currency.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Local–global principle
advanced
ArithmeticEight areasCorrespondenceKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Work at one place, or all of them
↔ Adeles & ideles
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.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Quadratic forms → cubics
↔ Local data determining global
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.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Adeles & ideles
research
ArithmeticEight areasStructureKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Work at one place, or all of them
↔ Local–global principle
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.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Iwasawa theory
research
ArithmeticEight areasStructureKind of question
Class groups studied along infinite towers of number fields, where their growth becomes regular and is captured by a p-adic L-function.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
L-functions
research
ArithmeticEight areasCorrespondenceKind of question
Analytic invariants attached to arithmetic and to automorphic objects alike. They are the common currency in which both sides of Langlands are compared.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Artin / Hasse–Weil L-function
↔ Galois representations
Each Galois representation produces an L-function — the arithmetic side's contribution to the shared currency.
Hecke L-function
↔ Modular & automorphic forms
Each automorphic form produces an L-function too. Langlands asserts these two supplies of L-functions coincide.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Effective procedure
elementary
ComputationEight areasFoundationKind of question
The pre-formal idea of a method you could just follow step by step — the intuition later made rigorous.
Connections — Structural only lens
Membership, by carve-up
Computation (Eight areas) · Foundation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Turing machines / P vs NP
advanced
ComputationEight areasImpossibilityKind of question
Turing's formal model of computation; the basis for algorithmic complexity and the P vs NP question.
Connections — Structural only lens
Membership, by carve-up
Computation (Eight areas) · Impossibility (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — Correspondences lens
Undecidability ↔ incompleteness
↔ Gödel's incompleteness theorems
The halting problem's undecidability yields incompleteness directly: if provability were complete, halting would be decidable.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Self-reference
↔ Decidability
Once a system can encode its own halting, the fate of a process stops being determinable in advance. The cost of enough expressive power is that you can no longer see the end from the beginning.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Typed λ-calculus
advanced
ComputationEight areasFoundationKind of question
Computation as function abstraction and application, with types constraining what may be applied to what.
Connections — Structural only lens
Membership, by carve-up
Computation (Eight areas) · Foundation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — Correspondences lens
Curry–Howard
↔ Propositional & predicate calculus
Propositions ↔ types, proofs ↔ programs, proof normalisation ↔ program evaluation. Logic and computation turn out to be the same subject written twice.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Computational complexity
advanced
ComputationEight areasImpossibilityKind of question
Not just whether a proof of existence can be turned into a procedure, but what that procedure has to cost — classified by reduction into complexity classes (PPA, PPAD, TFNP and the rest) rather than judged case by case. Turing machines ask whether a method exists at all; this asks what the cheapest one can possibly do, and a completeness result is the sharpest form of that question — it says a whole class of problems is exactly as hard as its hardest member.
Connections — Structural only lens
Membership, by carve-up
Computation (Eight areas) · Impossibility (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Computation for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Completeness as the computational form of best-possible
↔ Optimality of approximation
Optimality elsewhere on this map means an approximation sequence is the best available at its size. A completeness result is the same question asked of a search procedure: PPA-completeness of necklace-splitting says no algorithm can do asymptotically better than the hardest problem in its class, already at the friendliest case (two thieves). The property is the same idea one level up — best-possible, now measured in cost rather than in closeness.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Rings & fields
elementary
AlgebraEight areasStructureKind of question
Abstract structures generalising arithmetic — sets with addition and multiplication obeying fixed axioms.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
Galois theory
↔ Groups & symmetry
Subfields of a normal extension ↔ subgroups of its automorphism group, inclusion-reversing. Solvability of the group ↔ solvability of the equation by radicals.
Hilbert's Nullstellensatz
↔ Coordinate geometry
Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.
Formal power series
↔ Generating functions
Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.
Curves ↔ function fields
↔ Riemann surfaces
Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
Commutativity as the special case
← Division algebra ladder
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.
source sentence withheld
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
Mathlib import
← Euclidean algorithm
`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 import
← Continued fractions
`Mathlib.Algebra.ContinuedFractions.Basic` imports `Mathlib.Algebra.Field.Defs`. Read off Mathlib/Algebra/ContinuedFractions/Basic.html. No human asserted this edge.
Mathlib import
← p-adic numbers
`Mathlib.NumberTheory.Padics.Hensel` imports `Mathlib.Algebra.Polynomial.Identities`. Read off Mathlib/NumberTheory/Padics/Hensel.html. No human asserted this edge.
Groups & symmetry
elementary
AlgebraEight areasStructureKind of question
The algebra of invertible transformations. Wherever something is preserved, a group is acting.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
Galois theory
↔ Rings & fields
Subfields of a normal extension ↔ subgroups of its automorphism group, inclusion-reversing. Solvability of the group ↔ solvability of the equation by radicals.
Erlangen program
↔ Erlangen program
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.
Pontryagin duality
↔ Fourier analysis
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.
Connections — Forks lens
Which imaginary axis you keep
↔ Division algebra ladder
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.
source sentence withheld
schema re-applied 4× — each return a level up
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Each rung costs a different amount
← Division algebra ladder
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.
source sentence withheld
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
Mathlib import
← Euclidean algorithm
`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.
Algebraic number fields
advanced
AlgebraEight areasClassificationKind of question
Extensions of the rationals built from roots of polynomials — where number theory and algebra fuse.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Classification (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
Artin reciprocity
↔ Class field theory
Abelian extensions of a number field ↔ quotients of its idele class group. The abelian, fully proved fragment of Langlands.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Representation theory
advanced
AlgebraEight areasCorrespondenceKind of question
Groups studied by how they act on vector spaces — turning symmetry into linear algebra.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
Automorphic representations
↔ Modular & automorphic forms
Automorphic forms are best understood as representations of adelic groups — which is what makes functoriality expressible at all.
Geometric Langlands
↔ Riemann surfaces
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.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Growth of groups
research
GeometryEight areasSize and approximationKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Coordinate geometry
elementary
GeometryEight areasCorrespondenceKind of question
Euclidean geometry recast with vectors and inner products, following Descartes' translation into algebra.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
Hilbert's Nullstellensatz
↔ Rings & fields
Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.
Connections — Forks lens
The parallel postulate
↔ Non-Euclidean geometry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
Integer dimension is measure zero
← Fractal dimension
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.
source sentence withheld
Zero curvature
← Non-Euclidean geometry
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.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Erlangen program
advanced
GeometryEight areasClassificationKind of question
Klein's 1872 reorganisation: a geometry is defined by the group of transformations under which its statements stay true.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Classification (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
Erlangen program
↔ Groups & symmetry
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.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
Pick the group first
→ Non-Euclidean geometry
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.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Topological spaces
advanced
GeometryEight areasStructureKind of question
Geometry stripped down to nearness and continuity, with no distances or angles.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
Tucker's lemma / Borsuk–Ulam
↔ Graph theory & combinatorial proof
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.
source sentence withheld
Stone duality
↔ Boolean algebra
Boolean algebras ↔ compact totally disconnected Hausdorff spaces, as an anti-equivalence of categories. Pure logic ↔ pure geometry.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
Solve the continuous necklace, then round to the lattice
→ Graph theory & combinatorial proof
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.
Connections — Correspondence test lens
Is x=3 special because of a division-algebra ladder?
← Division algebra ladder
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.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Dependency (Mathlib) lens
Mathlib import
← p-adic numbers
`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.
Elliptic curves
advanced
GeometryEight areasExistenceKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Existence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Riemann surfaces
research
GeometryEight areasCorrespondenceKind of question
One-complex-dimensional manifolds. The stage on which the geometric form of Langlands is set.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
Curves ↔ function fields
↔ Rings & fields
Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.
Geometric Langlands
↔ Representation theory
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.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Differentiation & integration
elementary
CalculusEight areasSize and approximationKind of question
The calculus of elementary functions — the core toolkit before measure theory or real analysis proper.
Connections — Structural only lens
Membership, by carve-up
Calculus (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
The Archimedean branch
↔ Ostrowski's theorem
Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Information in the divergence rate
← Asymptotic series & transseries
An asymptotic series remembers a function to every finite order and forgets it at all orders at once. The content is in how fast the coefficients grow — factorially, not geometrically — so the divergence is the message rather than the failure.
source sentence withheld
Connections — Degeneracy lens
ℝ is one place among many
← Ostrowski's theorem
The reals are the completion at the infinite place. Being the ambient number system you happened to grow up with is a fact about pedagogy, not about ℝ.
Convergence as a coincidence
← Asymptotic series & transseries
A convergent power series is the transseries in which every exponentially small term happens to vanish. Convergence is a degenerate case of expansion, not the definition of it.
source sentence withheld
Connections — Correspondence test lens
Is asymptotic divergence the same mechanism as radius-of-convergence failure?
← Asymptotic series & transseries
REFUTED. The two divergences look alike but come from different mechanisms: a Taylor series' radius of convergence is set by geometric growth of coefficients, controlled by the nearest singularity; an asymptotic series diverges everywhere because its coefficients grow factorially. Different mechanism, not the same phenomenon wearing two names.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Dependency (Mathlib) lens
Mathlib import
← Ostrowski's theorem
`Mathlib.NumberTheory.Ostrowski` imports `Mathlib.Analysis.AbsoluteValue.Equivalence`, `Mathlib.Analysis.SpecialFunctions.Log.Base`, `Mathlib.Analysis.SpecialFunctions.Pow.Continuity`. Read off Mathlib/NumberTheory/Ostrowski.html. No human asserted this edge.
Mathlib import
← p-adic numbers
`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.
Fourier analysis
advanced
CalculusEight areasCorrespondenceKind of question
Decomposing functions into waves. Turns differentiation into multiplication and convolution into product.
Connections — Structural only lens
Membership, by carve-up
Calculus (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — Correspondences lens
Pontryagin duality
↔ Groups & symmetry
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.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
Does Fourier analysis tie in at all?
→ Bernoulli numbers & power sums
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.
source sentence withheld
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Heat equation & harmonic functions
advanced
CalculusEight areasSize and approximationKind of question
How quantities diffuse, and the functions that sit at equilibrium under that diffusion.
Connections — Structural only lens
Membership, by carve-up
Calculus (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — Correspondences lens
Kakutani / Feynman–Kac
↔ Brownian motion
Harmonic functions ↔ expected values over Brownian paths; the heat kernel ↔ the transition density of Brownian motion.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Graph theory & combinatorial proof
elementary
CombinatoricsEight areasExistenceKind of question
Counting and structure on discrete objects; proof techniques native to finite mathematics.
Connections — Structural only lens
Membership, by carve-up
Combinatorics (Eight areas) · Existence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Combinatorics for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Combinatorics for its links under this lens.
Connections — Correspondences lens
Tucker's lemma / Borsuk–Ulam
↔ Topological spaces
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.
source sentence withheld
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
Solve the continuous necklace, then round to the lattice
← Topological spaces
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.
Connections — Correspondence test lens
Do Bernoulli coefficients have a combinatorial interpretation?
← Bernoulli numbers & power sums
Partial. No direct interpretation the way binomial coefficients count something outright, but one step removed — through the Genocchi and zigzag numbers, both of which do have direct combinatorial meanings. A correspondence that holds once you're willing to go via an intermediate object.
source sentence withheld
still conjectural
Are these the same combs used in Maynard's twin-prime bound?
→ Zeta function & prime distribution
REFUTED at the level asked. Checked against Maynard's actual definition of an admissible tuple, and the objects are not the same. A real connection was found one level up instead — at the level of technique (moment methods), not of the objects themselves. The surface-level naming match was the wrong place to look.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Generating functions
advanced
CombinatoricsEight areasComputationKind of question
Encoding a whole sequence as the coefficients of one formal power series, so counting becomes algebra.
Connections — Structural only lens
Membership, by carve-up
Combinatorics (Eight areas) · Computation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Combinatorics for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Combinatorics for its links under this lens.
Connections — Correspondences lens
Formal power series
↔ Rings & fields
Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Sparse because of cancellation
→ Bernoulli numbers & power sums
The partition recurrence needs only a handful of earlier terms, and the reason is Franklin's involution: almost everything cancels in pairs. Sparse memory is not a lighter problem, it is a heavier theorem — the cancellation has to be proved.
source sentence withheld
One object, many questions
→ Symmetric functions
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.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Random walks & distributions
elementary
ProbabilityEight areasSize and approximationKind of question
Basic probabilistic objects — the bridge from counting to continuous randomness.
Connections — Structural only lens
Membership, by carve-up
Probability (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Probability for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Probability for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Brownian motion
advanced
ProbabilityEight areasSize and approximationKind of question
The continuous limit of a random walk; the canonical continuous-time random process.
Connections — Structural only lens
Membership, by carve-up
Probability (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Probability for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Probability for its links under this lens.
Connections — Correspondences lens
Kakutani / Feynman–Kac
↔ Heat equation & harmonic functions
Harmonic functions ↔ expected values over Brownian paths; the heat kernel ↔ the transition density of Brownian motion.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Random matrix theory
research
ProbabilityEight areasSize and approximationKind of question
Statistics of eigenvalues of large random matrices. Turns up, startlingly, in the distribution of zeta zeros.
Connections — Structural only lens
Membership, by carve-up
Probability (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Probability for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Probability for its links under this lens.
Connections — Correspondences lens
Montgomery–Dyson
↔ Zeta function & prime distribution
Pair correlation of the zeta zeros ↔ eigenvalue statistics of large random Hermitian matrices. Numerically overwhelming, still conjectural.
still conjectural
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Propositional & predicate calculus
elementary
LogicEight areasFoundationKind of question
Formal systems for reasoning, and the proofs expressible inside them.
Connections — Structural only lens
Membership, by carve-up
Logic (Eight areas) · Foundation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — Correspondences lens
Curry–Howard
↔ Typed λ-calculus
Propositions ↔ types, proofs ↔ programs, proof normalisation ↔ program evaluation. Logic and computation turn out to be the same subject written twice.
Gödel numbering
↔ Peano arithmetic
Formulas and proofs ↔ natural numbers, so that provability becomes an arithmetic relation. This is what lets arithmetic talk about itself.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Boolean algebra
elementary
LogicEight areasStructureKind of question
The algebraic structure of truth values, meets, joins and complements.
Connections — Structural only lens
Membership, by carve-up
Logic (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — Correspondences lens
Stone duality
↔ Topological spaces
Boolean algebras ↔ compact totally disconnected Hausdorff spaces, as an anti-equivalence of categories. Pure logic ↔ pure geometry.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Gödel's incompleteness theorems
advanced
LogicEight areasImpossibilityKind of question
No consistent formal system strong enough for arithmetic can prove all truths about itself.
Connections — Structural only lens
Membership, by carve-up
Logic (Eight areas) · Impossibility (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — Correspondences lens
Undecidability ↔ incompleteness
↔ Turing machines / P vs NP
The halting problem's undecidability yields incompleteness directly: if provability were complete, halting would be decidable.
Connections — Forks lens
Two different kinds of incompleteness
↔ Non-Euclidean geometry
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.
source sentence withheld
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
p-adic numbers
advanced
ArithmeticEight areasStructureKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Structure (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
Hilbert symbol product formula
↔ Quadratic reciprocity
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.
Connections — Forks lens
Which absolute value you complete at
↔ Ostrowski's theorem
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.
source sentence withheld
Which base you expand in
↔ Orbits & itineraries
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.
source sentence withheld
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Both surrender distance
← Continued fractions
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.
source sentence withheld
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
Mathlib import
← Ostrowski's theorem
`Mathlib.NumberTheory.Ostrowski` imports `Mathlib.NumberTheory.Padics.PadicNorm`. Read off Mathlib/NumberTheory/Ostrowski.html. No human asserted this edge.
Mathlib import
→ Euclidean algorithm
`Mathlib.NumberTheory.Padics.PadicVal.Basic` imports `Mathlib.NumberTheory.Divisors`. Read off Mathlib/NumberTheory/Padics/PadicVal/Basic.html. No human asserted this edge.
Mathlib import
→ Peano arithmetic
`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 import
→ Rings & fields
`Mathlib.NumberTheory.Padics.Hensel` imports `Mathlib.Algebra.Polynomial.Identities`. Read off Mathlib/NumberTheory/Padics/Hensel.html. No human asserted this edge.
Mathlib import
→ Differentiation & integration
`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 import
→ Topological spaces
`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.
Ostrowski's theorem
advanced
ArithmeticEight areasClassificationKind of question
Every absolute value on ℚ is equivalent to the ordinary one or to a p-adic one. This is the fork itself: it says exactly what the branches are and that there are no others.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Classification (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Which absolute value you complete at
↔ p-adic numbers
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.
source sentence withheld
The Archimedean branch
↔ Differentiation & integration
Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
The integers as an intersection
→ Peano arithmetic
Being an integer is what survives every valuation at once — a condition imposed on a larger object, not a starting point that everything else is built up from.
source sentence withheld
ℝ is one place among many
→ Differentiation & integration
The reals are the completion at the infinite place. Being the ambient number system you happened to grow up with is a fact about pedagogy, not about ℝ.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
Mathlib import
→ Differentiation & integration
`Mathlib.NumberTheory.Ostrowski` imports `Mathlib.Analysis.AbsoluteValue.Equivalence`, `Mathlib.Analysis.SpecialFunctions.Log.Base`, `Mathlib.Analysis.SpecialFunctions.Pow.Continuity`. Read off Mathlib/NumberTheory/Ostrowski.html. No human asserted this edge.
Mathlib import
→ p-adic numbers
`Mathlib.NumberTheory.Ostrowski` imports `Mathlib.NumberTheory.Padics.PadicNorm`. Read off Mathlib/NumberTheory/Ostrowski.html. No human asserted this edge.
Division algebra ladder
advanced
AlgebraEight areasClassificationKind of question
ℝ → ℂ → ℍ → 𝕆. Each rung doubles dimension and surrenders a property: order, then commutativity, then associativity. Hurwitz's theorem says it stops at eight.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Classification (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Which imaginary axis you keep
↔ Groups & symmetry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
ℝ → ℂ
↔ Order
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 ℂ.
source sentence withheld
ℂ → ℍ
↔ Commutativity
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.
ℍ → 𝕆
↔ Associativity
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.
Connections — Information cost lens
Each rung costs a different amount
→ Groups & symmetry
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.
source sentence withheld
Connections — Degeneracy lens
Commutativity as the special case
→ Rings & fields
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.
source sentence withheld
Connections — Correspondence test lens
Is x=3 special because of a division-algebra ladder?
→ Topological spaces
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.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Non-Euclidean geometry
advanced
GeometryEight areasExistenceKind of question
Deny the parallel postulate and the resulting geometry is consistent. The first widely accepted demonstration that an axiom could be genuinely optional.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Existence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
The parallel postulate
↔ Coordinate geometry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Two different kinds of incompleteness
↔ Gödel's incompleteness theorems
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.
source sentence withheld
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
Zero curvature
→ Coordinate geometry
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.
Pick the group first
← Erlangen program
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.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Zermelo–Fraenkel set theory
elementary
LogicEight areasFoundationKind of question
The standard foundation: sets built from the empty set by a short list of construction axioms.
Connections — Structural only lens
Membership, by carve-up
Logic (Eight areas) · Foundation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Assume choice, or deny it
↔ Axiom of choice
The third return, and the one where you named the schema explicitly rather than just using it. ZFC and ZF¬C are both consistent if ZF is.
source sentence withheld
schema re-applied 3× — each return a level up
Independent of ZFC
↔ Continuum hypothesis
Same shape again: Gödel showed CH cannot be disproved, Cohen that it cannot be proved. A fork you reached for but did not develop — the thread stalled for want of forcing.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Axiom of choice
advanced
LogicEight areasFoundationKind of question
Given any family of nonempty sets, a set can be formed by picking one element from each. Independent of ZF: assuming it and denying it both give consistent theories.
Connections — Structural only lens
Membership, by carve-up
Logic (Eight areas) · Foundation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Assume choice, or deny it
↔ Zermelo–Fraenkel set theory
The third return, and the one where you named the schema explicitly rather than just using it. ZFC and ZF¬C are both consistent if ZF is.
source sentence withheld
schema re-applied 3× — each return a level up
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Continuum hypothesis
advanced
LogicEight areasImpossibilityKind of question
There is no cardinality strictly between the integers and the reals. Gödel and Cohen together showed it can be neither proved nor refuted from ZFC.
Connections — Structural only lens
Membership, by carve-up
Logic (Eight areas) · Impossibility (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Logic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Independent of ZFC
↔ Zermelo–Fraenkel set theory
Same shape again: Gödel showed CH cannot be disproved, Cohen that it cannot be proved. A fork you reached for but did not develop — the thread stalled for want of forcing.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Continued fractions
elementary
ArithmeticEight areasSize and approximationKind of question
Write a number as an integer plus one over an integer plus one over… Unlike decimal it has no fixed alphabet, which is what buys it base-independence and best-approximation.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Variable-root schemes
↔ Nested radicals
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.
source sentence withheld
apparent fork — it collapsed
Connections — Direction lens
Forward orbit
↔ Orbits & itineraries
A continued fraction is the run-length encoding of a geodesic — the forward itinerary of the Gauss map. The digits stop being digits and become a record of where a point went.
source sentence withheld
schema re-applied 4× — each return a level up
Reductive vs generative
↔ Euclidean algorithm
Euclid's algorithm consumes a pair and reduces it; the continued fraction it produces generates approximations outward. The same recursion read as destruction or as construction depending on which end you stand at.
source sentence withheld
Connections — What breaks lens
A proposed shared loss
↔ Distance information
Proposed cost that was not one. Both discard something about distance, but not the same something: p-adic expansions are positional and linear, continued fractions relative and recursive. The refutation forced a distinction worth more than the conjecture.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Information cost lens
Same computation, less kept
← Euclidean algorithm
The continued fraction of x is the quotient sequence of the Euclidean algorithm run on x. Identical work; the CF keeps only the quotients and discards the remainders, which is exactly where the magnitude information lived.
source sentence withheld
Both surrender distance
→ p-adic numbers
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.
source sentence withheld
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
Does nested radicals have an analogous series pairing?
← Nested radicals
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.
source sentence withheld
Connections — Dependency (Mathlib) lens
Mathlib import
→ Rings & fields
`Mathlib.Algebra.ContinuedFractions.Basic` imports `Mathlib.Algebra.Field.Defs`. Read off Mathlib/Algebra/ContinuedFractions/Basic.html. No human asserted this edge.
Nested radicals
advanced
AlgebraEight areasComputationKind of question
The same recursion one hyperoperation up: roots inside roots rather than divisions inside divisions. Gains a level, loses base-independence.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Computation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Variable-root schemes
↔ Continued fractions
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.
source sentence withheld
apparent fork — it collapsed
Connections — Direction lens
Backward orbit
↔ Orbits & itineraries
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.
source sentence withheld
Connections — What breaks lens
The series dual is all-positive
↔ Optimality of approximation
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.
source sentence withheld
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
Does nested radicals have an analogous series pairing?
→ Continued fractions
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.
source sentence withheld
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Orbits & itineraries
advanced
CalculusEight areasSize and approximationKind of question
A map applied over and over, and the symbolic record of where the point went. Continued fractions turn out to be run-length encodings of geodesics under exactly this construction.
Connections — Structural only lens
Membership, by carve-up
Calculus (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
Which base you expand in
↔ p-adic numbers
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.
source sentence withheld
Connections — Direction lens
Forward orbit
↔ Continued fractions
A continued fraction is the run-length encoding of a geodesic — the forward itinerary of the Gauss map. The digits stop being digits and become a record of where a point went.
source sentence withheld
schema re-applied 4× — each return a level up
Backward orbit
↔ Nested radicals
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.
source sentence withheld
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Orbit versus seed
→ Collatz conjecture
A full orbit determines its seed; orbit statistics do not. Reversing the map is the question of how much of the seed survives being averaged.
source sentence withheld
Connections — Degeneracy lens
Machinery first, integers after
→ Peano arithmetic
Studying iteration in general and recovering the integer facts as corollaries, rather than building up from the integers and meeting iteration late. A claim about the right order to learn things in, not about what is true.
source sentence withheld
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Hyperoperation hierarchy
advanced
ArithmeticEight areasComputationKind of question
Succession, addition, multiplication, exponentiation, tetration — each level iterating the one below. Cross-confirmed: this ladder appears in both transcripts as a place to move up and down.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Computation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
Build up, or descend
↔ Peano arithmetic
From below, succession is an axiom and addition is defined from it. From above, addition is one rung of the hyperoperation ladder and the Peano axioms read as theorems about the bottom of it. Same content, opposite direction of justification.
source sentence withheld
Connections — What breaks lens
Continued fractions → nested radicals
↔ Base-independence
Moving the recursion up one hyperoperation level buys expressive power and costs base-independence — the property that made continued fractions worth having.
source sentence withheld
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Collatz conjecture
advanced
ArithmeticEight areasExistenceKind of question
Halve if even, 3n+1 if odd. Whether every start returns to 1 is open. Its interest here is structural: the fate of an orbit cannot be determined in advance.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Existence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
Reverse the map
↔ Baker's theorem
Forwards, the fate of a Collatz orbit is undecidable in practice. Backwards, the orbit hones in on its seed — and the question of how fast becomes a question about linear forms in logarithms, which is where Baker's theorem lives.
source sentence withheld
Connections — What breaks lens
Fate not determinable in advance
↔ Decidability
Not a theorem — an instance of the same shape. The interest of Collatz here is structural: a rule this simple should not be able to hide its own outcome, and it does.
Connections — Information cost lens
Orbit versus seed
← Orbits & itineraries
A full orbit determines its seed; orbit statistics do not. Reversing the map is the question of how much of the seed survives being averaged.
source sentence withheld
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Pisot numbers & the plastic number
advanced
ArithmeticEight areasSize and approximationKind of question
Algebraic integers whose conjugates all sit inside the unit circle. The plastic number is the smallest; nothing lives between 1 and it — provided you require an algebraic integer, which is the sloppiness you caught.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Baker's theorem
research
ArithmeticEight areasSize and approximationKind of question
Effective lower bounds on linear forms in logarithms. Where reverse-orbit reasoning about Collatz-like maps actually bottoms out.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
Reverse the map
↔ Collatz conjecture
Forwards, the fate of a Collatz orbit is undecidable in practice. Backwards, the orbit hones in on its seed — and the question of how fast becomes a question about linear forms in logarithms, which is where Baker's theorem lives.
source sentence withheld
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Function fields
research
AlgebraEight areasCorrespondenceKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Bernoulli numbers & power sums
advanced
ArithmeticEight areasComputationKind of question
The coefficients that turn a sum of kth powers into a polynomial in n. The defining system is lower triangular and dense — every Bernoulli number depends on all the earlier ones — which makes them the standard against which sparser recurrences get measured.
Connections — Structural only lens
Membership, by carve-up
Arithmetic (Eight areas) · Computation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Arithmetic for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Maximal memory
→ Peano arithmetic
Every Bernoulli number depends on all the earlier ones: the defining system is lower triangular and dense. This is the worst case, and it is the baseline the sparse recurrences get compared against.
source sentence withheld
Sparse because of cancellation
← Generating functions
The partition recurrence needs only a handful of earlier terms, and the reason is Franklin's involution: almost everything cancels in pairs. Sparse memory is not a lighter problem, it is a heavier theorem — the cancellation has to be proved.
source sentence withheld
Connections — Degeneracy lens
One basis among several
← Symmetric functions
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.
Connections — Correspondence test lens
Do Bernoulli coefficients have a combinatorial interpretation?
→ Graph theory & combinatorial proof
Partial. No direct interpretation the way binomial coefficients count something outright, but one step removed — through the Genocchi and zigzag numbers, both of which do have direct combinatorial meanings. A correspondence that holds once you're willing to go via an intermediate object.
source sentence withheld
still conjectural
Does Fourier analysis tie in at all?
← Fourier analysis
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.
source sentence withheld
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Symmetric functions
advanced
AlgebraEight areasCorrespondenceKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Algebra (Eight areas) · Correspondence (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Algebra for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
One object, many questions
← Generating functions
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.
Connections — Degeneracy lens
One basis among several
→ Bernoulli numbers & power sums
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.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Asymptotic series & transseries
research
CalculusEight areasSize and approximationKind of question
Expansions that diverge for every argument and are nonetheless the best finite description available. Coefficients grow factorially rather than geometrically, which is why the divergence has a different cause from a finite radius of convergence, and why Borel summation and resurgence exist.
Connections — Structural only lens
Membership, by carve-up
Calculus (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Calculus for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
Information in the divergence rate
→ Differentiation & integration
An asymptotic series remembers a function to every finite order and forgets it at all orders at once. The content is in how fast the coefficients grow — factorially, not geometrically — so the divergence is the message rather than the failure.
source sentence withheld
Connections — Degeneracy lens
Convergence as a coincidence
→ Differentiation & integration
A convergent power series is the transseries in which every exponentially small term happens to vanish. Convergence is a degenerate case of expansion, not the definition of it.
source sentence withheld
Connections — Correspondence test lens
Is asymptotic divergence the same mechanism as radius-of-convergence failure?
→ Differentiation & integration
REFUTED. The two divergences look alike but come from different mechanisms: a Taylor series' radius of convergence is set by geometric growth of coefficients, controlled by the nearest singularity; an asymptotic series diverges everywhere because its coefficients grow factorially. Different mechanism, not the same phenomenon wearing two names.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Fractal dimension
advanced
GeometryEight areasSize and approximationKind of question
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.
Connections — Structural only lens
Membership, by carve-up
Geometry (Eight areas) · Size and approximation (Kind of question)
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — First principles lens
This lens is drawn between whole areas, not individual concepts. See Geometry for its links under this lens.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
A system compressed to one root
← Thermodynamic formalism
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.
Connections — Degeneracy lens
Integer dimension is measure zero
→ Coordinate geometry
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.
source sentence withheld
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Order
property
That any two elements can be compared. The first thing surrendered going up the division algebra ladder, and the reason ℂ has no sensible < .
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
ℝ → ℂ
↔ Division algebra ladder
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 ℂ.
source sentence withheld
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Commutativity
property
That ab = ba. Surrendered at the quaternions, which is exactly what lets them encode rotation.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
ℂ → ℍ
↔ Division algebra ladder
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.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Associativity
property
That (ab)c = a(bc). Surrendered at the octonions. Its loss is severe enough that most machinery stops working, which is why the ladder ends.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
ℍ → 𝕆
↔ Division algebra ladder
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.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Base-independence
property
That the representation does not depend on an arbitrary choice of alphabet. Continued fractions have it; decimal does not; nested radicals give it up to gain a hyperoperation level.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Continued fractions → nested radicals
↔ Hyperoperation hierarchy
Moving the recursion up one hyperoperation level buys expressive power and costs base-independence — the property that made continued fractions worth having.
source sentence withheld
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Optimality of approximation
property
That the successive approximations are the best available at their size. Depends on convergents straddling the target, which all-positive expansions cannot do.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
The series dual is all-positive
↔ Nested radicals
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.
source sentence withheld
Completeness as the computational form of best-possible
↔ Computational complexity
Optimality elsewhere on this map means an approximation sequence is the best available at its size. A completeness result is the same question asked of a search procedure: PPA-completeness of necklace-splitting says no algorithm can do asymptotically better than the hardest problem in its class, already at the friendliest case (two thieves). The property is the same idea one level up — best-possible, now measured in cost rather than in closeness.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Distance information
property
How much of the metric survives a representation. The site of a refuted conjecture: continued fractions and p-adic expansions both discard something about distance, but not the same something.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
A proposed shared loss
↔ Continued fractions
Proposed cost that was not one. Both discard something about distance, but not the same something: p-adic expansions are positional and linear, continued fractions relative and recursive. The refutation forced a distinction worth more than the conjecture.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Local data determining global
property
Whether knowing a solution everywhere locally forces one globally. Holds for quadratic forms by Hasse–Minkowski; Selmer's cubic 3x³+4y³+5z³=0 destroys it in general, and measuring the failure is what the Tate–Shafarevich group is for.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Quadratic forms → cubics
↔ Local–global principle
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.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Decidability
property
That the fate of a process can be determined in advance. Surrendered the moment a system is expressive enough to encode its own halting.
Connections — Structural only lens
Membership, by carve-up
Belongs to no group — properties cut across every carve-up, which is what makes them properties.
Membership is a claim by a grouping, not a fact about the concept. Switch the carve-up above and this node moves.
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
No connections recorded here yet.
Connections — Forks lens
No connections recorded here yet.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Self-reference
↔ Turing machines / P vs NP
Once a system can encode its own halting, the fate of a process stops being determinable in advance. The cost of enough expressive power is that you can no longer see the end from the beginning.
Fate not determinable in advance
↔ Collatz conjecture
Not a theorem — an instance of the same shape. The interest of Collatz here is structural: a rule this simple should not be able to hide its own outcome, and it does.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Foundation
area
AsksWhat are we allowed to assume, and what exactly did we assume?
Answer shapeAn axiom list, an interpretation of one theory inside another, and a proof that the assumptions do not collide.
Good atMaking the starting point explicit, so that later disagreements can be traced to a choice rather than to a mistake.
Bad atGetting anywhere. Foundations settle what is permitted, and almost never settle what is true.
Connections — Structural only lens
6 concepts in this group — Kind of question
Peano arithmetic · Effective procedure · Typed λ-calculus · Propositional & predicate calculus · Zermelo–Fraenkel set theory · Axiom of choice
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Curry–Howard
Propositional & predicate calculus ↔ Typed λ-calculus
Propositions ↔ types, proofs ↔ programs, proof normalisation ↔ program evaluation. Logic and computation turn out to be the same subject written twice.
Gödel numbering
Propositional & predicate calculus ↔ Peano arithmetic
Formulas and proofs ↔ natural numbers, so that provability becomes an arithmetic relation. This is what lets arithmetic talk about itself.
Connections — Forks lens
Assume choice, or deny it
Zermelo–Fraenkel set theory ↔ Axiom of choice
The third return, and the one where you named the schema explicitly rather than just using it. ZFC and ZF¬C are both consistent if ZF is.
source sentence withheld
schema re-applied 3× — each return a level up
Independent of ZFC
Zermelo–Fraenkel set theory ↔ Continuum hypothesis
Same shape again: Gödel showed CH cannot be disproved, Cohen that it cannot be proved. A fork you reached for but did not develop — the thread stalled for want of forcing.
Connections — Direction lens
Build up, or descend
Peano arithmetic ↔ Hyperoperation hierarchy
From below, succession is an axiom and addition is defined from it. From above, addition is one rung of the hyperoperation ladder and the Peano axioms read as theorems about the bottom of it. Same content, opposite direction of justification.
source sentence withheld
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Computation
area
AsksHow do I actually produce the thing, with a procedure that finishes?
Answer shapeAlgorithms, recurrences, expansions, and the bookkeeping that turns an existence claim into an object you can hold.
Good atTurning a proof that something exists into the thing itself, and giving a cost for doing so.
Bad atSaying anything about the objects it cannot reach. A procedure that never terminates reports nothing at all.
Connections — Structural only lens
6 concepts in this group — Kind of question
Euclidean algorithm · Pell's equation · Generating functions · Nested radicals · Hyperoperation hierarchy · Bernoulli numbers & power sums
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Formal power series
Generating functions ↔ Rings & fields
Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.
Connections — Forks lens
Variable-root schemes
Nested radicals ↔ Continued fractions
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.
source sentence withheld
apparent fork — it collapsed
Connections — Direction lens
Backward orbit
Nested radicals ↔ Orbits & itineraries
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.
source sentence withheld
Build up, or descend
Peano arithmetic ↔ Hyperoperation hierarchy
From below, succession is an axiom and addition is defined from it. From above, addition is one rung of the hyperoperation ladder and the Peano axioms read as theorems about the bottom of it. Same content, opposite direction of justification.
source sentence withheld
Reductive vs generative
Euclidean algorithm ↔ Continued fractions
Euclid's algorithm consumes a pair and reduces it; the continued fraction it produces generates approximations outward. The same recursion read as destruction or as construction depending on which end you stand at.
source sentence withheld
Connections — What breaks lens
Continued fractions → nested radicals
Hyperoperation hierarchy ↔ Base-independence
Moving the recursion up one hyperoperation level buys expressive power and costs base-independence — the property that made continued fractions worth having.
source sentence withheld
The series dual is all-positive
Nested radicals ↔ Optimality of approximation
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.
source sentence withheld
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Structure
area
AsksWhat laws does this obey, and what stays fixed when everything else moves?
Answer shapeAxioms applied wholesale, invariants, quotients, and the maps that preserve whatever is being preserved.
Good atTransporting one argument to every situation with the same shape, and proving impossibility by exhibiting something that would have to change.
Bad atAnything about a specific object that its structure does not already determine — including, usually, its size.
Connections — Structural only lens
9 concepts in this group — Kind of question
Quadratic reciprocity · Adeles & ideles · Iwasawa theory · Rings & fields · Groups & symmetry · Topological spaces · Boolean algebra · p-adic numbers · Thermodynamic formalism
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Tucker's lemma / Borsuk–Ulam
Graph theory & combinatorial proof ↔ Topological spaces
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.
source sentence withheld
Galois theory
Rings & fields ↔ Groups & symmetry
Subfields of a normal extension ↔ subgroups of its automorphism group, inclusion-reversing. Solvability of the group ↔ solvability of the equation by radicals.
Hilbert's Nullstellensatz
Coordinate geometry ↔ Rings & fields
Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.
Erlangen program
Erlangen program ↔ Groups & symmetry
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.
Stone duality
Boolean algebra ↔ Topological spaces
Boolean algebras ↔ compact totally disconnected Hausdorff spaces, as an anti-equivalence of categories. Pure logic ↔ pure geometry.
Pontryagin duality
Fourier analysis ↔ Groups & symmetry
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.
Formal power series
Generating functions ↔ Rings & fields
Sequences ↔ elements of a power series ring; convolution of sequences ↔ multiplication. Counting arguments become ring computations.
Curves ↔ function fields
Riemann surfaces ↔ Rings & fields
Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.
Reciprocity, generalised
Quadratic reciprocity ↔ Class field theory
Quadratic reciprocity is the first visible instance of the pattern class field theory completes for all abelian extensions.
Hilbert symbol product formula
Quadratic reciprocity ↔ p-adic numbers
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.
Connections — Forks lens
Which absolute value you complete at
Ostrowski's theorem ↔ p-adic numbers
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.
source sentence withheld
Which imaginary axis you keep
Division algebra ladder ↔ Groups & symmetry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Which base you expand in
Orbits & itineraries ↔ p-adic numbers
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.
source sentence withheld
Work at one place, or all of them
Adeles & ideles ↔ Local–global principle
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.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
No connections recorded here yet.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Classification
area
AsksWhat is the complete list, and how do I know nothing is missing?
Answer shapeInvariants fine enough to separate, constructions rich enough to exhaust, and an argument that the two meet.
Good atClosing a subject. After a classification the remaining questions are about the members, not about the population.
Bad atSurviving a widened definition. Classifications are brittle at their own boundary, and the interesting objects are usually just outside it.
Connections — Structural only lens
6 concepts in this group — Kind of question
Class field theory · Algebraic number fields · Erlangen program · Modular & automorphic forms · Ostrowski's theorem · Division algebra ladder
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Erlangen program
Erlangen program ↔ Groups & symmetry
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.
Artin reciprocity
Algebraic number fields ↔ Class field theory
Abelian extensions of a number field ↔ quotients of its idele class group. The abelian, fully proved fragment of Langlands.
Reciprocity, generalised
Quadratic reciprocity ↔ Class field theory
Quadratic reciprocity is the first visible instance of the pattern class field theory completes for all abelian extensions.
Langlands correspondence
Galois representations ↔ Modular & automorphic forms
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.
still conjectural
Hecke L-function
Modular & automorphic forms ↔ L-functions
Each automorphic form produces an L-function too. Langlands asserts these two supplies of L-functions coincide.
Automorphic representations
Modular & automorphic forms ↔ Representation theory
Automorphic forms are best understood as representations of adelic groups — which is what makes functoriality expressible at all.
Connections — Forks lens
Which absolute value you complete at
Ostrowski's theorem ↔ p-adic numbers
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.
source sentence withheld
The Archimedean branch
Ostrowski's theorem ↔ Differentiation & integration
Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.
Which imaginary axis you keep
Division algebra ladder ↔ Groups & symmetry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
ℝ → ℂ
Division algebra ladder ↔ Order
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 ℂ.
source sentence withheld
ℂ → ℍ
Division algebra ladder ↔ Commutativity
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.
ℍ → 𝕆
Division algebra ladder ↔ Associativity
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.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Correspondence
area
AsksWhen are two apparently unrelated things secretly the same thing?
Answer shapeDictionaries, functors, transforms, and the discipline of checking that the translation carries the hard part rather than losing it.
Good atImporting an entire toolkit into a subject that lacked one. The best answers here make a hard question easy by refusing to answer it where it was asked.
Bad atBeing trusted. A correspondence that is merely apparent is the most expensive error available, because everything built on it looks fine.
Connections — Structural only lens
10 concepts in this group — Kind of question
Galois representations · Local–global principle · L-functions · Representation theory · Coordinate geometry · Riemann surfaces · Fourier analysis · Function fields · Symmetric functions · Information theory
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Hilbert's Nullstellensatz
Coordinate geometry ↔ Rings & fields
Affine algebraic sets ↔ radical ideals in a polynomial ring. Geometry of solutions ↔ algebra of the equations defining them.
Pontryagin duality
Fourier analysis ↔ Groups & symmetry
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.
Curves ↔ function fields
Riemann surfaces ↔ Rings & fields
Compact Riemann surfaces ↔ algebraic function fields of one variable, an equivalence of categories. A geometric object and an algebraic one carrying identical information.
Langlands correspondence
Galois representations ↔ Modular & automorphic forms
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.
still conjectural
Artin / Hasse–Weil L-function
Galois representations ↔ L-functions
Each Galois representation produces an L-function — the arithmetic side's contribution to the shared currency.
Hecke L-function
Modular & automorphic forms ↔ L-functions
Each automorphic form produces an L-function too. Langlands asserts these two supplies of L-functions coincide.
Automorphic representations
Modular & automorphic forms ↔ Representation theory
Automorphic forms are best understood as representations of adelic groups — which is what makes functoriality expressible at all.
Geometric Langlands
Riemann surfaces ↔ Representation theory
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.
Connections — Forks lens
The parallel postulate
Coordinate geometry ↔ Non-Euclidean geometry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Work at one place, or all of them
Adeles & ideles ↔ Local–global principle
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.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Quadratic forms → cubics
Local–global principle ↔ Local data determining global
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.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Size and approximation
area
AsksHow big, how close, how fast, how likely?
Answer shapeLimits, inequalities, estimates, concentration, and controlled error.
Good atQuantitative control. It is the only kind of question whose answers come with a margin attached, which is what makes them usable.
Bad atExactness. It will locate a number to fifty digits and be unable to say what that number is.
Connections — Structural only lens
13 concepts in this group — Kind of question
Zeta function & prime distribution · Differentiation & integration · Heat equation & harmonic functions · Random walks & distributions · Brownian motion · Random matrix theory · Continued fractions · Orbits & itineraries · Pisot numbers & the plastic number · Baker's theorem · Asymptotic series & transseries · Fractal dimension · Growth of groups
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Kakutani / Feynman–Kac
Brownian motion ↔ Heat equation & harmonic functions
Harmonic functions ↔ expected values over Brownian paths; the heat kernel ↔ the transition density of Brownian motion.
Montgomery–Dyson
Zeta function & prime distribution ↔ Random matrix theory
Pair correlation of the zeta zeros ↔ eigenvalue statistics of large random Hermitian matrices. Numerically overwhelming, still conjectural.
still conjectural
Connections — Forks lens
The Archimedean branch
Ostrowski's theorem ↔ Differentiation & integration
Ordinary analysis is what you get by taking the one branch we happen to live on. Naming it a branch rather than the default is the whole point of the lens.
Which base you expand in
Orbits & itineraries ↔ p-adic numbers
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.
source sentence withheld
Variable-root schemes
Nested radicals ↔ Continued fractions
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.
source sentence withheld
apparent fork — it collapsed
Connections — Direction lens
Forward orbit
Continued fractions ↔ Orbits & itineraries
A continued fraction is the run-length encoding of a geodesic — the forward itinerary of the Gauss map. The digits stop being digits and become a record of where a point went.
source sentence withheld
schema re-applied 4× — each return a level up
Backward orbit
Nested radicals ↔ Orbits & itineraries
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.
source sentence withheld
Reverse the map
Collatz conjecture ↔ Baker's theorem
Forwards, the fate of a Collatz orbit is undecidable in practice. Backwards, the orbit hones in on its seed — and the question of how fast becomes a question about linear forms in logarithms, which is where Baker's theorem lives.
source sentence withheld
Reductive vs generative
Euclidean algorithm ↔ Continued fractions
Euclid's algorithm consumes a pair and reduces it; the continued fraction it produces generates approximations outward. The same recursion read as destruction or as construction depending on which end you stand at.
source sentence withheld
Connections — What breaks lens
A proposed shared loss
Continued fractions ↔ Distance information
Proposed cost that was not one. Both discard something about distance, but not the same something: p-adic expansions are positional and linear, continued fractions relative and recursive. The refutation forced a distinction worth more than the conjecture.
source sentence withheld
proposed, then refuted — the distinction it forced was the payoff
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Impossibility
area
AsksWhat cannot be done at all, by any method, ever?
Answer shapeDiagonalisation, reduction, invariants that would have to change, and independence proofs.
Good atEnding searches. A single impossibility result retires an entire research programme, which no positive result ever does.
Bad atSuggesting what to do instead. It closes doors and points at nothing.
Connections — Structural only lens
4 concepts in this group — Kind of question
Turing machines / P vs NP · Gödel's incompleteness theorems · Continuum hypothesis · Computational complexity
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Undecidability ↔ incompleteness
Turing machines / P vs NP ↔ Gödel's incompleteness theorems
The halting problem's undecidability yields incompleteness directly: if provability were complete, halting would be decidable.
Connections — Forks lens
Two different kinds of incompleteness
Gödel's incompleteness theorems ↔ Non-Euclidean geometry
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.
source sentence withheld
Independent of ZFC
Zermelo–Fraenkel set theory ↔ Continuum hypothesis
Same shape again: Gödel showed CH cannot be disproved, Cohen that it cannot be proved. A fork you reached for but did not develop — the thread stalled for want of forcing.
Connections — Direction lens
No connections recorded here yet.
Connections — What breaks lens
Self-reference
Turing machines / P vs NP ↔ Decidability
Once a system can encode its own halting, the fate of a process stops being determinable in advance. The cost of enough expressive power is that you can no longer see the end from the beginning.
Completeness as the computational form of best-possible
Computational complexity ↔ Optimality of approximation
Optimality elsewhere on this map means an approximation sequence is the best available at its size. A completeness result is the same question asked of a search procedure: PPA-completeness of necklace-splitting says no algorithm can do asymptotically better than the hardest problem in its class, already at the friendliest case (two thieves). The property is the same idea one level up — best-possible, now measured in cost rather than in closeness.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.
Existence
area
AsksIs there one? Does this ever happen?
Answer shapeConstruction, descent, counting two ways, the probabilistic method, and the search for a single counterexample.
Good atSettling a question with one object. The cheapest decisive answers in mathematics are of this kind.
Bad atSaying how many, or which one. A proof that something exists frequently hands you nothing you can build.
Connections — Structural only lens
4 concepts in this group — Kind of question
Elliptic curves · Graph theory & combinatorial proof · Non-Euclidean geometry · Collatz conjecture
Connections — Historical lens
No connections recorded here yet.
Connections — Pedagogical lens
No connections recorded here yet.
Connections — First principles lens
No connections recorded here yet.
Connections — Correspondences lens
Tucker's lemma / Borsuk–Ulam
Graph theory & combinatorial proof ↔ Topological spaces
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.
source sentence withheld
Connections — Forks lens
The parallel postulate
Coordinate geometry ↔ Non-Euclidean geometry
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.
source sentence withheld
schema re-applied 4× — each return a level up
Two different kinds of incompleteness
Gödel's incompleteness theorems ↔ Non-Euclidean geometry
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.
source sentence withheld
Connections — Direction lens
Reverse the map
Collatz conjecture ↔ Baker's theorem
Forwards, the fate of a Collatz orbit is undecidable in practice. Backwards, the orbit hones in on its seed — and the question of how fast becomes a question about linear forms in logarithms, which is where Baker's theorem lives.
source sentence withheld
Connections — What breaks lens
Fate not determinable in advance
Collatz conjecture ↔ Decidability
Not a theorem — an instance of the same shape. The interest of Collatz here is structural: a rule this simple should not be able to hide its own outcome, and it does.
Connections — Information cost lens
No connections recorded here yet.
Connections — Degeneracy lens
No connections recorded here yet.
Connections — Correspondence test lens
No connections recorded here yet.
Connections — Dependency (Mathlib) lens
No connections recorded here yet.