Skip to content

The Core Course

This course is separate from the reference tracks on this site. The reference tracks are an encyclopaedia: alphabetical, cross-linked, no required order. This course is the opposite – a linear sequence where page N assumes page N−1, designed so that no concept you meet depends on a concept you have not yet learned.

The course assumes one thing: you can read, and you can recognise a pattern. It does not assume that you can add. Counting is built from axioms, addition and multiplication are defined recursively, their laws are proved as theorems, the integers and the rationals are constructed as equivalence classes, and the real line is built as Dedekind cuts. Everything after that is earned in the same way.

The order is dependency, not the school curriculum. Nothing appears before everything it needs, and the map below is machine-checked: a forward dependency, a cycle, or an unpaid debt fails the build.

Three rules govern every chapter:

RuleWhat it means
No theorem without proofEvery claim is proved from earlier results, or is a named debt with a chapter that will pay it, or is an axiom the course declares. Nothing is “obvious”
No symbol without definitionNotation is introduced at first use with its meaning and an example; a symbol cannot appear before it is defined
No forward referenceMotivating remarks, quick checks and problems included. Naming future content requires the honesty marker
graph TD
A["A: Reasoning (5)"]
B["B: Counting (4)"]
C["C: Expanding the line (4)"]
D["D: The continuum (5)"]
E["E: Completing algebra (3)"]
F["F: Structure and linear algebra (9)"]
G["G: Euclidean analysis (8)"]
H["H: The canvas (2)"]
I["I: Measure (7)"]
J["J: Calculus as linearisation (8)"]
K["K: Complex analysis (3)"]
L["L: Algebra and symmetry (3)"]
A --> B
A --> C
A --> D
A --> F
A --> H
A --> I
B --> C
B --> D
B --> E
B --> F
B --> G
B --> H
C --> D
C --> F
C --> L
D --> E
D --> F
D --> G
D --> H
D --> I
E --> F
E --> G
E --> K
E --> L
F --> G
F --> J
F --> L
G --> J
G --> K
H --> J
I --> J
I --> K
J --> K

Each node is a stage, with its chapter count; each arrow is a dependency that crosses a stage boundary. The arrows only ever point forward, which is the property the Lean artifact checks chapter by chapter.

The reader arrives knowing how to read. The course builds the rest in dependency order: logic before counting, counting before the number line, the number line before algebra, algebra before structure, structure before the continuum, and the continuum before everything that measures it. The full course is 61 chapters across 12 dependency stages, from logic to Galois, with 14 written. The graph is machine-checked: docs/course-graph.json is validated for acyclicity and order-consistency on every push, and the same data generates a Lean 4 proof, checked in CI, that every dependency of every chapter descends the course order.

ChapterTitleStatus
Stage A — ReasoningLogic, sets, relations, functions. No numbers.
A1Propositions, quantifiers, and what a proof is (assumes: classical-logic)queued
A2Sets: membership, products, power setsqueued
A3Relations: order, equivalencequeued
A4Functions: injections, surjections, bijections, compositionqueued
A5Proof strategies in action: the false proof, dissectedqueued
Stage B — CountingPeano, induction, arithmetic as theorems.
B1The Peano axioms: what counting isqueued
B2Addition defined recursively; its laws provedqueued
B3Multiplication, order, exponentiation: all theoremsqueued
B4Division with remainder; the Archimedean propertyqueued
Stage C — Expanding the lineZ, Q, primes, and the first crisis.
C1The failure of subtraction; Z as difference classesqueued
C2The failure of division; Q as fraction classes; densityqueued
C3The first crisis: x^2 = 2 has no rational solutionqueued
C4Primes and the fundamental theorem of arithmeticqueued
Stage D — The continuumR constructed; completeness; cardinality; choice.
D1Dedekind cuts: R constructed from order alonequeued
D2Arithmetic and completeness of R, provedqueued
D3Decimals, roots, the place of Q inside Rqueued
D4Cardinality: countable Q, uncountable Rqueued
D5Choice, Zorn’s lemma, and well-ordering (assumes: axiom-of-choice)queued
Stage E — Completing algebraPolynomials, C, and the FTA debt.
E1Polynomials as formal objectsqueued
E2C built as pairs with a multiplication rulequeued
E3The fundamental theorem of algebra: statement, consequences, and the debt (debt: fundamental-theorem-of-algebra → K3)queued
Stage F — Structure and linear algebraCategories and linear algebra over R and C.
F1Categories: objects, morphisms, universal properties, adjunctionswritten
F2Vector spaces, linear maps, dimension (debt: zorn-lemma → D5)written
F3Duality and the double dualwritten
F4Quotient spaces and their universal propertywritten
F5Determinants as alternating formswritten
F6Exterior algebrawritten
F7Eigenstructure, triangularisation, Cayley-Hamilton (debt: fundamental-theorem-of-algebra → K3)written
F8Inner products, orthogonality, the spectral theorem (debt: fundamental-theorem-of-algebra → K3)written
F9Canonical forms: what remains when diagonalisation failsqueued
Stage G — Euclidean analysisConvergence, continuity, derivatives, integration, the elementary functions, ODEs. Discharges the multivariable debts.
G1Convergence of sequences in R and R^nqueued
G2Continuity in several variablesqueued
G3The derivative in several variablesqueued
G4The chain rule, partials, and Clairautqueued
G5The inverse function theoremqueued
G6The exponential and trigonometric functions via power seriesqueued
G7Integration on the real line and the fundamental theorem of calculusqueued
G8The contraction mapping principle and existence for ODEsqueued
Stage H — The canvasMetric and topological spaces, connectedness, compactness.
H1Metric and topological spaces, continuity, homeomorphism (debt: completeness-axiom → D2, elementary-functions-continuity → G6)written
H2Connectedness and compactness; the IVT and EVT (debt: zorn-lemma → D5)written
Stage I — MeasureSigma-algebras to Fourier. Discharges the Fubini and change-of-variables debts.
I1Sigma-algebras and measuresqueued
I2The Lebesgue integral: Caratheodoryqueued
I3Modes of convergencequeued
I4L^p spaces and dualityqueued
I5Product measures and Fubini-Tonelli; the change-of-variables formulaqueued
I6Radon-Nikodym and conditional expectationqueued
I7Fourier series and the Fourier transformqueued
Stage J — Calculus as linearisationManifolds, tangent spaces, forms, Stokes, curvature.
J1Smooth manifolds: charts, atlases, smooth maps (debt: multivariable-chain-rule → G4, multivariable-inverse-function-theorem → G5, trigonometry-facts → G6)written
J2Tangent spaces, the differential, the IFT on manifolds (debt: fundamental-theorem-of-calculus → G7, differentiation-under-the-integral → I5)written
J3Differential forms and the exterior derivative (debt: clairaut-mixed-partials → G4)written
J4Partitions of unityqueued
J5Integration, orientation, and Stokes (debt: fubini-theorem → I5, change-of-variables-formula → I5, partitions-of-unity-existence → J4)written
J6Submanifolds, immersions, regular level setsqueued
J7Lie groups and group actionsqueued
J8Connections, curvature, and geodesicsqueued
Stage K — Complex analysisHolomorphy, Cauchy, residues, and the FTA proved — the ledger closes.
K1Holomorphy: complex differentiability and its rigidityqueued
K2Complex integration, Cauchy’s theorem, residuesqueued
K3The fundamental theorem of algebra, proved - the ledger closesqueued
Stage L — Algebra and symmetryGroups, rings and modules, Galois.
L1Groups through the categorical lensqueued
L2Rings and modules (debt: zorn-lemma → D5)queued
L3Galois theory: symmetry of equationsqueued

Two ledgers, not one. A debt is a declared input with a named chapter that pays it; the machine check refuses a debt without a payee. An axiom is a foundation the course deliberately adopts and never proves, listed in the graph so that no chapter can quietly assume one. Zermelo’s axiom of choice enters at D5 and is what the basis theorem, the maximal ideal theorem, and Tychonoff’s theorem actually consume.

AxiomStatement
classical-logicEvery proposition is either true or false, and a proof may use the law of the excluded middle.
axiom-of-choiceFor every family of nonempty sets there is a function choosing one element from each set.

The flagship debt is the fundamental theorem of algebra, declared at E3, consumed at F7 and F8, and paid at K3, roughly forty chapters later. Dependencies that run upstream (a stage-7 chapter declaring something a stage-6 chapter proves) are legal and visible: the ledger checks the payee, not the direction of travel.

The reference tracks in the sidebar remain the encyclopaedia; this course is the path through it.

This course integrates five learning protocols designed for self-directed study without the artificial forcing function of exams.

Never read a proof straight through. Read the theorem statement. Close the book. Spend fifteen minutes attempting the proof or identifying the exact technical roadblock. If stuck, open the book and read only the first sentence of the author’s proof – that sentence almost always introduces the trick or auxiliary object. Close the book again and finish the proof yourself. This turns passive consumption into active discovery.

Write your own unified exposition targeting an intelligent version of yourself from six months ago. For every core concept, include:

  1. The Defect: what broke that made this definition necessary?
  2. The Universal Property or Diagram: the commutative diagram or the precise statement.
  3. The Extremes: the trivial example, the canonical workhorse, and the counterexample that breaks when you drop one axiom.
  4. The Pivot: the single line in any long proof where the crucial conceptual shift happens.

Skip computational drills. Do classification problems (“classify all groups of order 8”), counterexample challenges (“show the theorem fails if axiom X is omitted”), and omitted lemmas (when an author defers a verification to the reader, treat that as mandatory).

Mathematics is learned by doing, not by reading. Every numbered section of every page ends with a Quick check: five short questions with terse answers, testing exactly what the section proved. Do them before moving on; if one fails, reread only that section. Every page then ends with Problems: multi-step chains that require written arguments, with hints where the jump is large. The One-Line Reveal tells you what to attempt before reading; the quick checks keep you honest while reading; the problems are where you find out whether you can do it.

Every week, spend forty-five minutes on a blank-page retrieval drill from two levels back. Write the definition, the theorem hypotheses, the mental picture, and the proof architecture from memory. If you cannot, you have found a crack before it causes structural collapse.

When stuck: drop one dimension (solve on a 2-sphere or in Set instead), or apply the 48-hour incubation rule – write the obstacle in one plain English question, close the book, and walk away. Subconscious processing in mathematics is a documented reality.

PageLevelContent
Categories: The Language of Mathematics1AObjects, morphisms, universal properties, functors, natural transformations
Linear Algebra Done Wrong1BCoordinate-free vector spaces, dual spaces, quotient spaces, exterior algebra, determinants as alternating forms
Level 2: Topology2Metric and abstract topologies, continuity, subspaces and products, Hausdorff, connectedness (intermediate value theorem), compactness (extreme value theorem)
Level 3A: Smooth Manifolds3ADifferentiability in Euclidean space, charts and atlases, locality and the maximal-atlas theorem with uniqueness, the stereographic sphere, smooth maps and diffeomorphisms, dimension as an invariant
Level 3B: Tangent Spaces3BDerivations on germs, Hadamard’s lemma, the chart transport and change-of-basis law, the differential as the Jacobian, the manifold chain rule, the inverse function theorem on manifolds
Level 3C: Differential Forms3CForms as determinant evaluators, the wedge with definitional associativity, the exterior derivative with d² = 0, the graded Leibniz rule, pullback commutation, coordinate independence of d
Level 3D: Integration and Stokes3DManifolds with boundary, orientation and the outward-first boundary convention proved well defined, chart and partition-of-unity integration, the local Stokes theorem by Fubini and FTC, the generalised Stokes theorem, and the classical Green, divergence, and Stokes theorems as coordinate expansions

Levels 4–5 are under construction. The dependency graph above shows the planned structure.