Mathematics is not a collection of disconnected subjects but a single, hierarchical system of abstraction. Each layer resolves a specific limitation of the layer below it, and proofs ensure that truth propagates upward through the entire structure. This page maps the terrain.
Notice the convergence pattern: Layers 3, 4, and 5 all feed into Layer 8 (Category Theory), which acts as a meta-language describing what the lower layers have in common.
Across the entire hierarchy, mathematical progress follows a recurring four-stage cycle:
graph LR
A["<b>Practice</b><br/>Intuitive use"] --> B["<b>Crisis</b><br/>Contradiction or limitation"]
B --> C["<b>Breakthrough</b><br/>New abstraction"]
C --> D["<b>Formalization</b><br/>Axioms & proofs"]
D --> A
Examples of the cycle:
Crisis
Layer
Breakthrough
Zeno's paradoxes
Analysis (5)
Rigorous definition of limits (Weierstrass)
\(\sqrt{2}\) is irrational
Number Systems (2)
Extension from \(\mathbb{Q}\) to \(\mathbb{R}\)
Russell's paradox
Set Theory (1)
ZFC axiomatization
Parallel postulate independence
Geometry (4)
Non-Euclidean geometries
Incompleteness of arithmetic
Logic (0)
Gödel's theorems; refined understanding of formal systems
\(x^2 + 1 = 0\) has no real root
Number Systems (2)
Complex numbers \(\mathbb{C}\)
Every crisis is a gift: it tells mathematicians exactly where the current framework is incomplete, and the resolution always produces a strictly more powerful layer of abstraction.
What are the objects, operations, and axioms? What patterns recur?
Each layer page catalogs the key structures — groups, topological spaces, sigma-algebras, categories — and shows how they relate to structures in adjacent layers.
A working reference of essential terms spanning all nine layers of the mathematical hierarchy. Terms are grouped alphabetically; hover-tooltip definitions are provided at the bottom for use across the knowledge base.
A group \((G, \ast)\) in which the operation is commutative: \(a \ast b = b \ast a\) for all \(a, b \in G\).
Adjunction
A pair of functors \(F \dashv G\) related by a natural bijection \(\text{Hom}(F(A), B) \cong \text{Hom}(A, G(B))\). The most fundamental relationship between categories.
Algebraic Closure
A field extension in which every non-constant polynomial has a root. \(\mathbb{C}\) is the algebraic closure of \(\mathbb{R}\).
Axiom
A statement accepted without proof that serves as a starting point for a deductive system.
Axiom of Choice
For any collection of non-empty sets, there exists a function selecting one element from each set. Equivalent to Zorn's lemma and the well-ordering theorem.
A measure of the "size" of a set. Two sets have equal cardinality if a bijection exists between them.
Category
A collection of objects and morphisms (arrows) between them, equipped with composition and identity morphisms satisfying associativity and identity laws.
Coherence Thesis
The meta-analytical claim that mathematics is one unified system — not a collection of independent disciplines — evidenced by constant recurrence, bridge theorems, and the forced hierarchy.
Cauchy Sequence
A sequence \((a_n)\) in a metric space where for every \(\varepsilon > 0\) there exists \(N\) such that \(d(a_m, a_n) < \varepsilon\) for all \(m, n > N\).
Commutative Ring
A ring in which multiplication is commutative: \(ab = ba\).
Compactness
A topological property generalizing closed and bounded subsets of \(\mathbb{R}^n\); equivalently, every open cover admits a finite subcover.
Completeness
(Analysis) A metric space in which every Cauchy sequence converges. (Logic) A property of a deductive system in which every semantically valid formula is provable.
Complex Number
An element of \(\mathbb{C} = \{a + bi \mid a, b \in \mathbb{R}\}\), where \(i^2 = -1\).
Conjecture
A mathematical statement believed to be true but not yet proven.
Continuity
A function \(f\) is continuous at \(a\) if \(\lim_{x \to a} f(x) = f(a)\). Intuitively, small changes in input produce small changes in output.
Convergence
A sequence \((a_n)\) converges to \(L\) if for every \(\varepsilon > 0\) there exists \(N\) such that (
Corollary
A result that follows directly from a theorem with little or no additional proof.
A partition of \(\mathbb{Q}\) into two non-empty sets \((A, B)\) where every element of \(A\) is less than every element of \(B\) and \(A\) has no greatest element. Used to construct \(\mathbb{R}\).
Derivative
The instantaneous rate of change of \(f\) at \(x\): \(f'(x) = \lim_{h \to 0} \frac{f(x+h) - f(x)}{h}\).
Diffeomorphism
A smooth bijection between manifolds whose inverse is also smooth; the natural notion of equivalence in differential geometry.
Distribution
A probability measure on a measurable space describing the likelihood of outcomes for a random variable.
A scalar \(\lambda\) such that \(Av = \lambda v\) for some non-zero vector \(v\) (the eigenvector) and linear map \(A\).
Epsilon-Delta Definition
The rigorous definition of limits: for every \(\varepsilon > 0\), there exists \(\delta > 0\) such that closeness in input (\(\delta\)) guarantees closeness in output (\(\varepsilon\)).
Existential Quantifier
The symbol \(\exists\), meaning "there exists" or "for some." Used to assert that at least one object satisfies a condition.
A function \(f\) where \(f(a) = f(b) \implies a = b\). Also called "one-to-one."
Integral
The Riemann or Lebesgue integral measures the "accumulated value" of a function over a domain. \(\int_a^b f(x)\,dx\).
Irrational Number
A real number that cannot be expressed as a ratio of integers. Examples: \(\sqrt{2}\), \(\pi\), \(e\).
Isomorphism
A bijective homomorphism — a structure-preserving map with a structure-preserving inverse. Two objects are isomorphic if they are "algebraically the same."
A topological space that locally resembles \(\mathbb{R}^n\). Smooth manifolds carry differentiable structure.
Measure
A function assigning a non-negative extended real number to subsets of a space, generalizing length, area, and volume. Must be countably additive.
Monad
An endofunctor \(T: \mathcal{C} \to \mathcal{C}\) equipped with unit and multiplication natural transformations satisfying associativity and identity laws. In programming, structures computation with effects (e.g., Haskell's IO, Maybe).
Morphism
An arrow in a category — a generalization of "structure-preserving map" that abstracts functions, homomorphisms, and continuous maps.
A measurable function from a probability space to \(\mathbb{R}\) (or \(\mathbb{R}^n\)).
Ring
A set equipped with two operations (addition and multiplication) where addition forms an abelian group, multiplication is associative, and multiplication distributes over addition.
A collection \(\mathcal{F}\) of subsets of \(\Omega\) closed under complement and countable union. Defines which events can be assigned probability or measure.
Surjection
A function \(f: A \to B\) where every element of \(B\) is the image of at least one element of \(A\). Also called "onto."
A propositional formula that is true under every truth-value assignment. Example: \(P \lor \lnot P\).
Theorem
A mathematical statement proven true within a formal system.
Topology
The study of properties preserved under continuous deformations. A topology on a set \(X\) is a collection of "open" subsets closed under arbitrary unions and finite intersections.
Transcendental Number
A real or complex number that is not a root of any non-zero polynomial with integer coefficients. Examples: \(\pi\), \(e\).
Tree
A connected acyclic graph. Equivalently, a graph on \(n\) vertices with exactly \(n - 1\) edges and no cycles.
A set \(V\) over a field \(F\) equipped with addition and scalar multiplication satisfying eight axioms (closure, associativity, distributivity, identity elements, inverses).