Research Layers¶
Each layer of mathematics introduces new abstractions that resolve limitations of previous layers. The hierarchy below is not an arbitrary filing system — it reflects genuine logical dependency. Layer \(n\) cannot exist without the layers below it.
How to Read These Pages
Each research page includes "Why This Matters" for real-world motivation, a collapsible "Notation Used on This Page" box for quick symbol reference, intuitive explanations before formal definitions, worked examples to ground the theory, and an applications table connecting each topic to modern practice. If mathematical symbols are unfamiliar, start with the Notation Guide.
The Hierarchy at a Glance¶
mindmap
root((Mathematics))
Foundations
Layer 0: Logic
Layer 1: Set Theory
Arithmetic
Layer 2: Number Systems
Structures
Layer 3: Algebra
Layer 4: Geometry & Topology
Systems
Layer 5: Analysis
Layer 6: Probability & Statistics
Meta & Discrete
Layer 7: Discrete Mathematics
Layer 8: Category TheoryLayer Index¶
-
:material-logic-buffer:{ .lg .middle } Layer 0 — Logic Foundational
The bedrock: formal rules of valid reasoning, proof systems, and the inherent limits of formal systems (Gödel).
-
Layer 1 — Set Theory Foundational
The universal language of mathematics. Everything — numbers, functions, spaces — is built from sets.
-
Layer 2 — Number Systems Bridge
The chain \(\mathbb{N} \subset \mathbb{Z} \subset \mathbb{Q} \subset \mathbb{R} \subset \mathbb{C}\) — each extension forced by a concrete algebraic or analytic gap.
-
Layer 3 — Algebra
The science of structure: groups, rings, fields, vector spaces, and the symmetries they encode.
-
Layer 4 — Geometry & Topology
Shape, space, and the properties that survive continuous deformation. From Euclid to manifolds.
-
Layer 5 — Analysis
The mathematics of change and limits: derivatives, integrals, convergence, measure theory.
-
Layer 6 — Probability & Statistics
Quantifying uncertainty. Measure-theoretic probability, distributions, stochastic processes.
-
Layer 7 — Discrete Mathematics
Combinatorics, graph theory, number theory — the mathematics of countable structures.
-
Layer 8 — Category Theory
The mathematics of mathematics: objects, morphisms, functors, and natural transformations as a unifying meta-language.
Extensibility
This hierarchy is a living structure. New branches and cross-layer connections are added as research deepens. Topics like chaos theory, information theory, and game theory can be added as new research pages following the same template. See the Methodology for the process.
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\). |
| 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. |
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. |
| Blackboard Bold | The double-struck typeface (\(\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb{C}\)) used to denote standard number sets and structures. |
| 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. |
| 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. |
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}\). |
| 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. |
E¶
| Term | Definition |
|---|---|
| Eigenvalue | 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. |
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. |
| 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. |
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 |
|---|---|
| Sigma-Algebra | 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." |
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. |
U¶
| Term | Definition |
|---|---|
| Universal Quantifier | The symbol \(\forall\), meaning "for all" or "for every." Used to assert that a property holds for every object in a domain. |
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. |