Open Questions & Frontiers¶
Synopsis
The greatest unsolved problems in mathematics often sit at the boundaries between layers — precisely where the Core Principles predict the deepest results should emerge. This page catalogs the major open problems, from the Millennium Prize Problems to contested conjectures and emerging fields. Each problem is situated within the hierarchy, and its significance is explained in terms of the connections it would forge if resolved.
The Millennium Prize Problems¶
In 2000, the Clay Mathematics Institute designated seven problems, each carrying a $1 million prize. They represent some of the deepest challenges across the mathematical hierarchy. As of 2026, only one has been solved.
1. Riemann Hypothesis¶
Conjectured Layers: Number Systems (L2) \(\leftrightarrow\) Analysis (L5)
Riemann Hypothesis (1859)
All non-trivial zeros of the Riemann zeta function
(extended to all \(s \in \mathbb{C}\) by analytic continuation) lie on the critical line \(\text{Re}(s) = \frac{1}{2}\).
Why it matters. The zeta function encodes the distribution of prime numbers via the Euler product:
The location of the zeros of \(\zeta(s)\) directly controls the error term in the prime number theorem. If the Riemann Hypothesis is true, then the prime counting function satisfies:
This would be the strongest possible result on the regularity of prime distribution — a number-theoretic conclusion derived entirely from complex analysis. The problem epitomizes the discrete-continuous duality (Principle 6): primes are the most discrete objects in mathematics, yet their distribution is governed by a function living in the continuous complex plane.
Status. Unproven. Over \(10^{13}\) zeros have been verified computationally to lie on the critical line. Multiple equivalent formulations exist (the Li criterion, positivity of certain operators, random matrix theory connections). No viable proof strategy has gained consensus.
2. P vs NP¶
Conjectured Layers: Logic (L0) \(\leftrightarrow\) Discrete Math (L7)
P \(\neq\) NP
The class \(\mathbf{P}\) (problems solvable in polynomial time) is strictly smaller than \(\mathbf{NP}\) (problems whose solutions can verified in polynomial time).
Why it matters. This is arguably the most important open problem in all of mathematics and computer science. If \(\mathbf{P} = \mathbf{NP}\), then every problem whose solution can be checked quickly can also be found quickly. This would collapse the distinction between finding proofs and checking proofs, render most cryptographic systems insecure, and enable polynomial-time algorithms for optimization, scheduling, protein folding, and thousands of other NP-complete problems.
Most experts believe \(\mathbf{P} \neq \mathbf{NP}\), but proving it requires showing that no polynomial-time algorithm exists for any NP-complete problem — a fundamentally different kind of result from constructing an algorithm. Known barrier results (relativization, natural proofs, algebrization) demonstrate that current proof techniques are insufficient.
Status. Unproven. No proof technique has circumvented all three known barriers. The problem sits at the heart of computational complexity theory and touches logic (the relationship between proof and computation), algebra (algebraic complexity theory), and combinatorics (extremal graph theory).
3. Navier-Stokes Existence and Smoothness¶
Conjectured Layers: Analysis (L5)
Navier-Stokes regularity
Given smooth, divergence-free initial data and external forcing in \(\mathbb{R}^3\), there exist smooth, globally defined solutions to the incompressible Navier-Stokes equations:
and these solutions have bounded energy for all time.
Why it matters. The Navier-Stokes equations govern fluid flow — from weather to blood circulation to aerodynamics. We use these equations in engineering every day, yet we do not know whether they always have well-behaved solutions in three dimensions. The problem is purely analytical: it asks whether a specific PDE develops singularities (infinite velocities or pressures in finite time). A resolution would deepen our understanding of nonlinear PDEs and turbulence.
Status. Unproven. Partial results exist: global existence is known for small data and for 2D flows. The 3D case remains open. Terence Tao has shown that a modified ("averaged") Navier-Stokes system can blow up in finite time, suggesting that a proof of regularity for the true equations must exploit specific structural properties of the nonlinearity.
4. Hodge Conjecture¶
Conjectured Layers: Geometry (L4) \(\leftrightarrow\) Algebra (L3)
Hodge Conjecture
On a smooth projective algebraic variety \(X\) over \(\mathbb{C}\), every Hodge class (a rational cohomology class of type \((p,p)\)) is a rational linear combination of classes of algebraic subvarieties.
Why it matters. This conjecture bridges algebraic geometry and differential geometry (topology). It asks whether the topological invariants of an algebraic variety that "look algebraic" (the Hodge classes) actually come from algebra. A proof would unify two of the most powerful tools in geometry: cohomological methods (topology) and algebraic cycles (algebraic geometry).
Status. Unproven. Known to be true in specific cases (divisors, by the Lefschetz theorem on (1,1)-classes). The general case remains intractable. Grothendieck proposed a weaker "standard conjectures" program; even those remain open.
5. Yang-Mills Existence and Mass Gap¶
Conjectured Layers: Analysis (L5) \(\leftrightarrow\) Physics
Yang-Mills mass gap
For any compact simple gauge group \(G\), there exists a quantum Yang-Mills theory on \(\mathbb{R}^4\) satisfying the Wightman axioms, and the mass operator has a positive lower bound (mass gap) \(\Delta > 0\).
Why it matters. Yang-Mills theory is the mathematical foundation of the Standard Model of particle physics. The "mass gap" explains why nuclear forces are short-range (gluons are confined). Physicists use Yang-Mills theory every day with spectacular experimental success, but a rigorous mathematical formulation does not exist. This problem asks for one — bridging physics and rigorous analysis.
Status. Unproven. Constructive quantum field theory has achieved rigorous results in lower dimensions, but the 4-dimensional case remains open. Lattice gauge theory provides strong numerical evidence for the mass gap.
6. Birch and Swinnerton-Dyer Conjecture¶
Conjectured Layers: Number Theory (L2) \(\leftrightarrow\) Algebra (L3)
BSD Conjecture
For an elliptic curve \(E\) over \(\mathbb{Q}\), the rank of the group of rational points \(E(\mathbb{Q})\) equals the order of vanishing of its \(L\)-function at \(s = 1\):
Why it matters. This connects the arithmetic of elliptic curves (how many rational solutions exist — a discrete, algebraic question) to the analytic behavior of an \(L\)-function (a complex-analytic object). It is a specific, deep instance of the discrete-continuous duality and the broader Langlands philosophy, which posits systematic connections between number theory and representation theory.
Status. Partially resolved. The conjecture is known to be true when the analytic rank is 0 or 1 (Gross-Zagier, Kolyvagin). The general case is open.
7. Poincare Conjecture¶
Proven Layer: Topology (L4)
Poincare Conjecture — Resolved by Perelman (2002-2003)
Statement: Every simply connected, closed 3-manifold is homeomorphic to the 3-sphere \(S^3\).
Proof approach: Grigori Perelman proved the conjecture by establishing Thurston's geometrization conjecture using Hamilton's Ricci flow with surgery. The Ricci flow
evolves a Riemannian metric in the direction of its Ricci curvature, smoothing out geometric irregularities. Perelman showed that the flow (with controlled surgical interventions at singularities) converges to a canonical geometric decomposition of any closed 3-manifold, from which the Poincare conjecture follows as a special case.
Significance. This is the only Millennium Prize Problem solved to date. Perelman famously declined both the $1 million prize and the Fields Medal. The proof exemplifies the power of geometric analysis: a topological conjecture (about the shape of spaces) was resolved by analytic methods (PDE techniques applied to the metric).
Other Major Open Conjectures¶
The Continuum Hypothesis¶
Is there a set whose cardinality lies strictly between \(|\mathbb{N}|\) and \(|\mathbb{R}|\)?
Layer: Set Theory (L1)
Cantor's continuum hypothesis (CH) asserts that there is no such intermediate cardinality: \(2^{\aleph_0} = \aleph_1\). Godel (1940) showed that CH is consistent with ZFC. Cohen (1963) showed that \(\neg\)CH is also consistent with ZFC. Therefore CH is independent of ZFC — it can be neither proved nor disproved from the standard axioms.
What this means for foundations. The independence of CH is not a failure of mathematics but a revelation about the limits of a particular axiom system. It shows that set theory (and therefore the mathematics built on it) contains genuine freedom — choices that are not determined by the axioms. This connects directly to Principle 2: truth propagates upward from the axioms, and if the axioms do not determine a statement, that statement is genuinely undecided at the foundational level.
Current research (Woodin's \(\Omega\)-logic, forcing axioms, the ultimate-\(L\) program) seeks either new axioms that resolve CH or a deeper understanding of why the independence is fundamental.
Goldbach's Conjecture (1742)¶
Conjectured Layers: Number Theory (L2)
Every even integer greater than 2 is the sum of two primes
Verified computationally for all even integers up to \(4 \times 10^{18}\). The weak version (every odd integer > 5 is the sum of three primes) was proved by Helfgott (2013). The strong version remains open. The conjecture sits squarely in additive number theory and its resolution would require new insights into the additive structure of the primes.
Twin Prime Conjecture¶
Conjectured Layers: Number Theory (L2)
There are infinitely many primes \(p\) such that \(p + 2\) is also prime
The breakthrough of Yitang Zhang (2013) proved that there are infinitely many pairs of primes with gap at most \(70{,}000{,}000\). The Polymath 8 project and James Maynard reduced this bound to 246. The full twin prime conjecture (gap = 2) remains open. Progress relies on sieve methods — a blend of combinatorics and analysis.
Collatz Conjecture (1937)¶
Conjectured Layers: Number Theory (L2) \(\leftrightarrow\) Discrete Math (L7)
For any positive integer \(n\), the sequence defined by \(n \mapsto n/2\) if \(n\) is even, \(n \mapsto 3n+1\) if \(n\) is odd, eventually reaches 1
Verified for all \(n\) up to approximately \(2.95 \times 10^{20}\). Erdos famously said, "Mathematics may not be ready for such problems." Tao (2019) proved that almost all Collatz orbits attain almost boundedly small values — the strongest partial result to date, using logarithmic density arguments. The conjecture is notoriously resistant to existing techniques because the interplay between multiplication by 3 and division by 2 mixes arithmetic in a way that no current framework can fully control.
ABC Conjecture¶
Conjectured Layers: Number Theory (L2) \(\leftrightarrow\) Algebra (L3)
ABC Conjecture (Oesterle-Masser, 1985)
For any \(\varepsilon > 0\), there are only finitely many triples of coprime positive integers \(a + b = c\) with \(c > \text{rad}(abc)^{1+\varepsilon}\), where \(\text{rad}(n)\) is the product of the distinct prime factors of \(n\).
Shinichi Mochizuki announced a proof in 2012 using his "inter-universal Teichmuller theory" (IUT). Despite years of review, the mathematical community has not reached consensus on the proof's validity. Peter Scholze and Jakob Stix have identified what they consider a fundamental gap in the argument; Mochizuki and his supporters disagree. This remains one of the most contentious situations in modern mathematics.
Why it matters. If true, the ABC conjecture would imply Fermat's Last Theorem (among many other results) as an almost immediate corollary, and would reveal deep constraints on how the additive and multiplicative structures of the integers interact.
Frontier Areas¶
Homotopy Type Theory (HoTT)¶
Emerging Layers: Logic (L0) \(\leftrightarrow\) Topology (L4)
A potential new foundation for mathematics
Homotopy Type Theory, developed by Voevodsky and collaborators (Univalent Foundations, 2013), proposes replacing set theory with a type theory in which types are interpreted as topological spaces and equalities as paths. The univalence axiom asserts that equivalent types are identical:
This axiom has no counterpart in classical set theory and collapses the distinction between "isomorphic" and "equal" — a vindication of the categorical perspective (Principle 7).
Significance for foundations. HoTT makes constructive reasoning and topological intuition native to the foundational system, rather than layered on top of set theory after the fact. It is natively suited to computer-verified proof (implemented in the Lean, Agda, and Coq proof assistants). If HoTT matures into a practical replacement for ZFC, it would represent the most significant shift in mathematical foundations since the early 20th century.
Quantum Computing and Complexity Theory¶
Emerging Layers: Discrete Math (L7) \(\leftrightarrow\) Analysis (L5) \(\leftrightarrow\) Physics
Quantum computing introduces the complexity class \(\mathbf{BQP}\) (bounded-error quantum polynomial time), which sits somewhere between \(\mathbf{P}\) and \(\mathbf{NP}\) (the precise containment relations are unknown). Key mathematical questions:
- \(\mathbf{BQP}\) vs \(\mathbf{NP}\): Can quantum computers solve NP-complete problems efficiently? Most experts believe not, but no proof exists.
- Quantum error correction: The theory of quantum error-correcting codes uses algebraic topology (homological codes, surface codes), connecting discrete math and topology in novel ways.
- Quantum advantage: Demonstrating provable quantum speedups for practical problems remains an active challenge. Google's 2019 quantum supremacy experiment and IBM's subsequent work have made this a fast-moving frontier.
AI and Mathematical Discovery¶
Emerging Layers: All
Can machines discover and prove new mathematical theorems?
Recent developments have blurred the boundary between human and machine mathematics:
- AlphaProof (DeepMind, 2024) solved multiple International Mathematical Olympiad problems at a silver-medal level by combining a language model with the Lean proof assistant.
- Lean and Mathlib have formalized substantial portions of undergraduate and graduate mathematics, creating a machine-checkable library of theorems.
- LLM-assisted conjecture generation has produced novel conjectures in knot theory and combinatorics (e.g., Davies et al., Nature 2021, using ML to discover patterns that human mathematicians then proved).
The philosophical question is sharp: if an AI system produces a valid proof (verified by a proof assistant), does it "understand" the mathematics? And more practically: will AI primarily serve as a tool for human mathematicians (like a telescope for astronomers) or as an autonomous mathematical agent?
The implications for the thesis are direct: if mathematics evolves by resolving contradictions and compressing patterns, then AI systems trained on pattern recognition may accelerate this process — or they may discover compressions that human minds cannot parse.
Chaos, Dynamical Systems, and Ergodic Theory¶
Developing Layers: Analysis (L5) \(\leftrightarrow\) Probability (L6)
Dynamical systems theory studies the long-term behavior of iterated maps and differential equations. The key insight — that deterministic systems can exhibit unpredictable behavior (chaos) — challenges naive assumptions about the relationship between mathematical models and prediction.
Core phenomena:
- Sensitivity to initial conditions. Small perturbations grow exponentially: \(|\delta(t)| \approx |\delta(0)| e^{\lambda t}\), where \(\lambda > 0\) is the Lyapunov exponent. This is deterministic but effectively unpredictable beyond a finite time horizon.
- Strange attractors. The Lorenz attractor, the Henon map, and other chaotic systems exhibit fractal geometry in their phase portraits — an unexpected connection between analysis and geometry.
- Ergodic theory. When does a deterministic system "look random" over long time scales? The ergodic theorem provides conditions under which time averages equal ensemble (spatial) averages — bridging analysis and probability theory.
Open problems include the existence and nature of strange attractors for Navier-Stokes flows, the classification of dynamical systems up to conjugacy, and the precise relationship between chaos and computational complexity.
The Meta-Question¶
Is Mathematics Discovered or Invented?
This is the oldest open question in the philosophy of mathematics, and our research bears on it directly.
The case for discovery (Platonism):
- The same mathematical structures are discovered independently by different civilizations (the Pythagorean theorem was known in Babylon, China, and India independently of Greece).
- Mathematical truths appear to be necessary — we cannot conceive of a universe where \(2 + 2 = 5\).
- The unreasonable effectiveness of mathematics in physics (see Real-World Mapping) suggests that mathematical structures exist independently and the physical world instantiates them.
- The hierarchy documented in this research seems to be forced (Principle 1): if you start with logic, you are compelled to build set theory, then number systems, then algebra, and so on. This suggests discovery, not free invention.
The case for invention (Constructivism / Formalism):
- Mathematical axiom systems are chosen by humans. ZFC is one choice among many; alternatives (constructive type theory, NF, category-theoretic foundations) yield different mathematics.
- The independence of the Continuum Hypothesis from ZFC shows that mathematics contains genuine choices that are not determined by any pre-existing structure.
- Godel's incompleteness theorems show that no single formal system captures all mathematical truth. If mathematics were "out there," why would it resist complete description?
- The historical record shows that mathematical concepts are shaped by the cultures that develop them — notation, emphasis, standards of rigor, and even what counts as "a number" have changed dramatically over time.
A possible synthesis:
The research documented in this knowledge base suggests a middle position. The constraints are discovered — the necessity stack, the crisis-driven evolution, the forced extensions. But the representations are invented — the specific axiom systems, notations, and frameworks chosen to express those constraints. Mathematics may be like geography: the mountain is there regardless of what you call it, but the map is a human creation.
The hierarchy we have documented is evidence for this synthesis: its shape appears to be inevitable (any sufficiently powerful mathematical system reproduces it), but its expression in ZFC, Peano arithmetic, or any other formalism is a human choice among equivalent options.
Summary: The Landscape of the Unknown¶
| Problem / Frontier | Layers | Status | Why it matters |
|---|---|---|---|
| Riemann Hypothesis | L2 \(\leftrightarrow\) L5 | Conjectured | Prime distribution; discrete-continuous bridge |
| P vs NP | L0 \(\leftrightarrow\) L7 | Conjectured | Computation, proof, and optimization |
| Navier-Stokes | L5 | Conjectured | PDE regularity; turbulence |
| Hodge Conjecture | L3 \(\leftrightarrow\) L4 | Conjectured | Algebraic vs. topological geometry |
| Yang-Mills | L5 \(\leftrightarrow\) Physics | Conjectured | Rigorous quantum field theory |
| BSD Conjecture | L2 \(\leftrightarrow\) L3 | Conjectured | Arithmetic of elliptic curves |
| Poincare Conjecture | L4 | Proven | Topology of 3-manifolds |
| Continuum Hypothesis | L1 | Independent of ZFC | Nature of foundational axioms |
| Goldbach | L2 | Conjectured | Additive prime structure |
| Twin Primes | L2 | Conjectured | Gaps between primes |
| Collatz | L2 \(\leftrightarrow\) L7 | Conjectured | Arithmetic dynamics |
| ABC Conjecture | L2 \(\leftrightarrow\) L3 | Contested | Additive vs. multiplicative number theory |
| HoTT | L0 \(\leftrightarrow\) L4 | Emerging | New foundations for mathematics |
| Quantum complexity | L5 \(\leftrightarrow\) L7 | Emerging | Computational power of quantum mechanics |
| AI in mathematics | All | Emerging | Automation of proof and discovery |
Further Reading¶
- Core Principles — the principles that predict where breakthroughs will come
- Real-World Mapping — how current mathematics applies to the sciences
- The Mathematical Landscape — the hierarchy in which these problems live
- Key Takeaways — the findings that frame these open questions
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. |