The Dependency Graph of Mathematics¶

Overview

This page presents the canonical dependency map of the mathematical hierarchy — a directed acyclic graph (DAG) showing which layers depend on which, where universal constants emerge, and how bridge proofs create cross-layer connections. The graph reveals that mathematics is not a linear tower but a richly interconnected web with Logic as its single root.

The Master Graph¶

flowchart TD
    %% === LAYER NODES ===
    L0["<b>Layer 0: Logic & Foundations</b><br/>Propositional logic, predicate logic,<br/>proof theory, Gödel's incompleteness"]
    L1["<b>Layer 1: Set Theory</b><br/>ZFC axioms, cardinality, ordinals,<br/>Cantor's diagonal argument"]
    L2["<b>Layer 2: Number Systems</b><br/>ℕ → ℤ → ℚ → ℝ → ℂ<br/>Completeness, algebraic closure"]
    L3["<b>Layer 3: Algebra</b><br/>Groups, rings, fields,<br/>linear algebra, Galois theory"]
    L4["<b>Layer 4: Geometry & Topology</b><br/>Euclidean/non-Euclidean, manifolds,<br/>algebraic topology, Euler characteristic"]
    L5["<b>Layer 5: Analysis</b><br/>Limits, calculus, complex analysis,<br/>functional analysis, PDEs"]
    L6["<b>Layer 6: Probability & Statistics</b><br/>Measure-theoretic probability,<br/>CLT, Bayesian inference"]
    L7["<b>Layer 7: Discrete Mathematics</b><br/>Graph theory, combinatorics,<br/>number theory, computability"]
    L8["<b>Layer 8: Category Theory</b><br/>Categories, functors,<br/>natural transformations, Yoneda"]

    %% === PRIMARY DEPENDENCIES (solid) ===
    L0 ==> L1
    L1 ==> L2
    L2 ==> L3
    L3 ==> L4
    L3 ==> L5
    L4 ==> L5
    L5 ==> L6
    L0 ==> L7
    L1 ==> L7
    L3 ==> L7

    %% === META-DEPENDENCY ===
    L3 -.->|"describes"| L8
    L4 -.->|"describes"| L8
    L5 -.->|"describes"| L8
    L6 -.->|"describes"| L8
    L7 -.->|"describes"| L8

    %% === CROSS-LAYER CONNECTIONS (dashed) ===
    L5 -.->|"measure theory"| L6
    L5 -.->|"analytic number theory"| L7
    L3 -.->|"algebraic topology"| L4
    L4 -.->|"manifolds for PDEs"| L5
    L7 -.->|"Gödel, Turing"| L0
    L3 -.->|"spectral graph theory"| L7
    L6 -.->|"random matrices"| L3

    %% === STYLING ===
    style L0 fill:#e8eaf6,stroke:#283593,stroke-width:3px
    style L1 fill:#e3f2fd,stroke:#1565c0,stroke-width:2px
    style L2 fill:#e0f2f1,stroke:#00695c,stroke-width:2px
    style L3 fill:#e8f5e9,stroke:#2e7d32,stroke-width:2px
    style L4 fill:#fff3e0,stroke:#ef6c00,stroke-width:2px
    style L5 fill:#fce4ec,stroke:#c62828,stroke-width:2px
    style L6 fill:#f3e5f5,stroke:#7b1fa2,stroke-width:2px
    style L7 fill:#fff9c4,stroke:#f9a825,stroke-width:2px
    style L8 fill:#efebe9,stroke:#4e342e,stroke-width:3px

Reading the Graph¶

Solid arrows (\(\Rightarrow\)) represent primary dependencies: Layer \(B\) logically depends on Layer \(A\) — the concepts of \(B\) cannot be defined without the concepts of \(A\).

Dashed arrows (\(\dashrightarrow\)) represent cross-layer connections: Layer \(B\) uses tools or results from Layer \(A\), but the dependency is not foundational. These are the bridges — the unexpected connections that make mathematics a web rather than a tree.

Layer-by-Layer Dependencies¶

Layer 0: Logic and Foundations¶

Depends on: Nothing (the root node).

Provides to all layers: The axiomatic method, rules of inference, proof techniques (direct, contradiction, induction, construction). Every mathematical statement and proof ultimately rests on logic.

Constants that emerge: None directly, but the concept of formal definition that makes constants precise originates here.

Layer 1: Set Theory¶

Depends on: Logic (Layer 0).

Provides: The language of sets, functions, relations, cardinality. Every mathematical structure is built on sets (in the ZFC paradigm).

Key bridge upward: Cantor's diagonal argument (Layer 1) echoes in Gödel's incompleteness (Layer 0) and Turing's halting problem (Layer 7).

Layer 2: Number Systems¶

Depends on: Set Theory (Layer 1).

Provides: The concrete number systems \(\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C}\) that all of mathematics operates on.

Constants that emerge: \(\pi\) (as the half-period of the complex exponential), \(e\) (as the base of the natural logarithm), \(i\) (as \(\sqrt{-1}\) in \(\mathbb{C}\)), \(\varphi\) (as the root of \(x^2 - x - 1\)).

Layer 3: Algebra¶

Depends on: Number Systems (Layer 2), Set Theory (Layer 1).

Provides: Abstract structure (groups, rings, fields, vector spaces) to Layers 4–8.

Key bridges:

To Layer 4: Symmetry groups in geometry, algebraic topology (homology as functors)
To Layer 5: Linear algebra is the backbone of functional analysis
To Layer 7: Algebraic graph theory, algebraic coding theory
To Layer 8: Algebra provides the primary examples for category theory

Layer 4: Geometry and Topology¶

Depends on: Number Systems (Layer 2), Algebra (Layer 3).

Provides: Spatial intuition, manifold theory, topological invariants.

Key bridges:

To Layer 5: Manifolds as domains for differential equations; Riemannian geometry for general relativity
To Layer 8: Top as a fundamental category; algebraic topology as a functor from Top to Grp
From Layer 5: Complex analysis provides tools for Riemann surfaces

Layer 5: Analysis¶

Depends on: Number Systems (Layer 2), Algebra (Layer 3), Geometry/Topology (Layer 4).

Provides: Rigorous calculus, measure theory, PDEs, functional analysis.

Key bridges:

To Layer 6: Measure theory is the foundation of probability (Kolmogorov axioms)
To Layer 7: Analytic number theory (Riemann zeta function, prime distribution)
Bridge proof: Fundamental Theorem of Calculus connects differentiation and integration

Layer 6: Probability and Statistics¶

Depends on: Analysis (Layer 5) — measure theory.

Key bridges:

To Layer 3: Random matrix theory (eigenvalue distributions)
To Layer 7: Probabilistic method in combinatorics (Erdős)
Bridge proof: Central Limit Theorem (sums → normal distribution)

Layer 7: Discrete Mathematics¶

Depends on: Logic (Layer 0), Set Theory (Layer 1), Algebra (Layer 3).

Key bridges:

To Layer 0: Gödel's incompleteness and Turing's undecidability are foundational results that originate in discrete/logical reasoning and constrain all of mathematics
To Layer 5: Analytic number theory brings analysis to bear on prime distribution
To Layer 3: Spectral graph theory uses eigenvalues of adjacency matrices

Layer 8: Category Theory¶

Depends on: All previous layers (for examples and motivation).

Provides: The meta-framework that describes relationships between all mathematical structures.

Unique position: Category theory does not sit "above" the other layers in a dependency sense — it sits alongside them, providing a language that describes their interconnections.

Sub-Topic Connections¶

Beyond layer-level dependencies, specific sub-topics create fine-grained bridges:

flowchart LR
    MT["Measure Theory<br/>(Analysis)"] -->|"foundation"| PROB["Probability<br/>(Layer 6)"]
    LA["Linear Algebra<br/>(Algebra)"] -->|"spectral theory"| FA["Functional Analysis<br/>(Analysis)"]
    LA -->|"adjacency matrix"| GT["Graph Theory<br/>(Discrete)"]
    GT2["Galois Theory<br/>(Algebra)"] -->|"field extensions"| NT["Number Theory<br/>(Discrete)"]
    DG["Differential Geometry<br/>(Geometry)"] -->|"spacetime"| GR["General Relativity<br/>(Physics)"]
    CA["Complex Analysis<br/>(Analysis)"] -->|"zeta function"| PNT["Prime Number Theorem<br/>(Number Theory)"]
    PROB -->|"random matrices"| LA
    AT["Algebraic Topology<br/>(Topology)"] -->|"functors"| CAT["Category Theory<br/>(Layer 8)"]
    HS["Hilbert Spaces<br/>(Functional Analysis)"] -->|"state spaces"| QM["Quantum Mechanics<br/>(Physics)"]

    style MT fill:#fce4ec
    style LA fill:#e8f5e9
    style GT fill:#fff9c4
    style GT2 fill:#e8f5e9
    style NT fill:#fff9c4
    style DG fill:#fff3e0
    style GR fill:#e0f7fa
    style CA fill:#fce4ec
    style PNT fill:#fff9c4
    style PROB fill:#f3e5f5
    style AT fill:#fff3e0
    style CAT fill:#efebe9
    style HS fill:#fce4ec
    style QM fill:#e0f7fa
    style FA fill:#fce4ec

Properties of the Graph¶

It Is a DAG (With Cross-Edges)¶

The primary dependency structure is a directed acyclic graph — there are no circular dependencies among the layers. Logic is the unique root (source node), and every layer can be reached from it.

However, the cross-layer connections (dashed edges) introduce cycles at the topic level: analysis feeds into number theory (analytic number theory), which feeds back into algebra (algebraic number theory), which feeds into topology (algebraic topology), which feeds back into analysis (differential topology). Mathematics is locally a DAG but globally a web.

Logic Is the Single Root¶

Every mathematical statement is ultimately a logical statement. Every proof is a logical derivation. Logic (Layer 0) is the foundation from which all else grows — and Gödel's incompleteness theorems (also Layer 0) set the permanent boundaries on what the entire structure can achieve.

Category Theory Is the Universal Observer¶

Category theory (Layer 8) occupies a unique position: it depends on all other layers for its examples, but once established, it provides a framework that describes all other layers from above. It is simultaneously the most dependent and the most encompassing layer.

Bridge Proofs Create Shortcuts¶

Every dashed arrow in the master graph corresponds to one or more bridge proofs or bridge constructions:

Bridge	From	To	Key Result
Measure theory	Analysis	Probability	Kolmogorov axioms
Analytic number theory	Analysis	Discrete Math	Prime Number Theorem
Algebraic topology	Algebra	Topology	Homology, cohomology
Spectral graph theory	Algebra	Discrete Math	Cheeger inequality
Functional analysis	Algebra	Analysis	Spectral theorem
Fundamental Theorem of Algebra	Analysis/Topology	Algebra	\(\mathbb{C}\) is algebraically closed
Gauss-Bonnet	Geometry	Topology	\(\int K\,dA = 2\pi\chi\)

Emergence of Constants¶

Constants do not appear at Layer 0 — they emerge as the structure grows:

Constant	First Emerges	Most Active Layers
\(\pi\)	Layer 2 (geometry of \(\mathbb{R}^2\))	Layers 4, 5, 6
\(e\)	Layer 2 (completeness of \(\mathbb{R}\))	Layers 5, 6
\(i\)	Layer 2 (construction of \(\mathbb{C}\))	Layers 3, 5
\(\varphi\)	Layer 2 (roots of \(x^2 - x - 1\))	Layers 4, 7
\(0, 1\)	Layer 0/1 (logical/set-theoretic construction)	All layers

Living Document

This graph grows as new research pages are added. Each new topic page should identify its dependencies and the bridges it creates, and this graph should be updated accordingly.

title: Glossary tags: - reference - glossary

Glossary¶

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¶

Term	Definition
Abelian Group	A group \((G, \ast)\) in which the operation is commutative: \(a \ast b = b \ast a\) for all \(a, b \in G\).
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.

B¶

Term	Definition
Bijection	A function that is both injective (one-to-one) and surjective (onto), establishing a one-to-one correspondence between two sets.
Boolean Algebra	An algebraic structure capturing the laws of classical logic: complement, meet, join, with identities \(0\) and \(1\).

C¶

Term	Definition
Cardinality	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.
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\).
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.

D¶

Term	Definition
Dedekind Cut	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}\).
Distribution	A probability measure on a measurable space describing the likelihood of outcomes for a random variable.

E¶

Term	Definition
Eigenvalue	A scalar \(\lambda\) such that \(Av = \lambda v\) for some non-zero vector \(v\) (the eigenvector) and linear map \(A\).

F¶

Term	Definition
Field	A commutative ring with unity in which every non-zero element has a multiplicative inverse. Examples: \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\).
Functor	A structure-preserving map between categories, sending objects to objects and morphisms to morphisms while respecting composition and identities.

G¶

Term	Definition
Graph	A combinatorial structure \(G = (V, E)\) consisting of vertices \(V\) and edges \(E \subseteq V \times V\).
Group	A set \(G\) with a binary operation satisfying closure, associativity, existence of identity, and existence of inverses.

H¶

Term	Definition
Homeomorphism	A continuous bijection whose inverse is also continuous. Two spaces are homeomorphic if they are "topologically the same."
Homomorphism	A structure-preserving map between algebraic structures (groups, rings, etc.).

I¶

Term	Definition
Injection	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."

L¶

Term	Definition
Lemma	A proven statement used as a stepping stone toward a larger theorem.
Limit	The value that a function or sequence approaches as the input or index approaches some value.

M¶

Term	Definition
Manifold	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.
Morphism	An arrow in a category — a generalization of "structure-preserving map" that abstracts functions, homomorphisms, and continuous maps.

N¶

Term	Definition
Natural Transformation	A family of morphisms connecting two functors \(F, G : \mathcal{C} \to \mathcal{D}\) that commutes with every morphism in \(\mathcal{C}\).

P¶

Term	Definition
Predicate	A statement containing one or more variables that becomes a proposition when values are substituted. Example: \(P(x) \equiv x > 5\).
Prime	A natural number \(p > 1\) whose only divisors are \(1\) and \(p\). The fundamental building blocks of \(\mathbb{N}\) under multiplication.
Proof	A finite sequence of logical deductions establishing the truth of a statement from axioms and previously proven results.

Q¶

Term	Definition
Quantifier	A logical symbol binding a variable: the universal quantifier \(\forall\) ("for all") and the existential quantifier \(\exists\) ("there exists").

R¶

Term	Definition
Random Variable	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.

S¶

Term	Definition
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."

T¶

Term	Definition
Tautology	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.

V¶

Term	Definition
Vector Space	A set \(V\) over a field \(F\) equipped with addition and scalar multiplication satisfying eight axioms (closure, associativity, distributivity, identity elements, inverses).

Z¶

Term	Definition
ZFC	Zermelo-Fraenkel set theory with the Axiom of Choice — the standard axiomatic foundation for modern mathematics.