Mathematics and logic are built upon a foundation of rigorously proven statements (theorems) and compelling, yet unverified, propositions (conjectures). Together, they form the backbone of theoretical inquiry, driving breakthroughs across physics, computer science, cryptography, and philosophy.
This entry catalogs the most influential theorems and conjectures that have shaped mathematical thought, detailing their historical context, formal statements, and contemporary significance.
Foundational Theorems
These results established the structural principles that modern mathematics relies upon. Each has undergone centuries of scrutiny and remains universally accepted within its domain.
a² + b² = c²
In any right-angled triangle, the square of the hypotenuse equals the sum of the squares of the other two sides. Attributed to Pythagoras of Samos (c. 570–495 BCE), though evidence of its use predates him by millennia. It bridges arithmetic and geometry, forming the basis of Euclidean distance metrics and trigonometric identities.
xⁿ + yⁿ = zⁿ has no non-zero integer solutions for n > 2
Conjectured by Pierre de Fermat in 1637, this problem resisted proof for over 350 years. Andrew Wiles finally proved it in 1994 using modular forms and elliptic curves, fundamentally advancing the Langlands program and demonstrating the deep unity between number theory and algebraic geometry.
Any consistent formal system capable of elementary arithmetic contains true statements that cannot be proven within the system.
Published by Kurt Gödel in 1931, these results shattered the Hilbert program's dream of a complete, self-verifying mathematical foundation. They established intrinsic limits to formal reasoning and profoundly influenced logic, computer science, and the philosophy of mind.
Major Open Conjectures
Despite immense effort, several conjectures remain unresolved. They often sit at the intersection of pure theory and applied disciplines like cryptography and algorithmic complexity.
All non-trivial zeros of the Riemann zeta function ζ(s) have real part Re(s) = ½
Proposed by Bernhard Riemann in 1859, this conjecture governs the distribution of prime numbers. Its resolution would revolutionize analytic number theory, with direct implications for cryptographic security, random matrix theory, and quantum chaos. Verified computationally for over 10¹³ zeros.
Every even integer greater than 2 is the sum of two primes.
Communicated by Christian Goldbach in 1742, this elementary statement has resisted proof for nearly three centuries. Weak versions (Vinogradov's theorem) and asymptotic results (Chen's theorem) provide partial confirmation, but a complete proof remains elusive.
P = NP? (Are all problems with efficiently verifiable solutions also efficiently solvable?)
One of the seven Clay Mathematics Institute Millennium Prize Problems. A resolution would redefine computational complexity, with profound consequences for cryptography, artificial intelligence, optimization, and the theoretical limits of algorithmic reasoning.
Historically Refuted Conjectures
Not all conjectures survive. Examining disproven hypotheses reveals how mathematical maturity develops through counterexamples and paradigm shifts.
No right triangle with integer sides has an area that is a perfect square.
Fermat proved this in the 1630s using infinite descent. Though initially a curiosity, the techniques developed to prove it directly seeded the methodology behind the eventual proof of Fermat's Last Theorem.
"Mathematics is not about numbers, equations, computations, or algorithms: it is about understanding. Refuted conjectures teach us the boundaries of intuition and the necessity of rigor."
— Aevum Editorial Board, On Mathematical Epistemology
Contemporary Impact & Research Frontiers
Modern computational mathematics has accelerated both the verification and exploration of theorems and conjectures. Automated proof assistants (Coq, Lean, Isabelle) now routinely verify complex proofs that would take human teams years to audit.
- AI-Driven Discovery: DeepMind's Graph Neural Networks recently guided mathematicians toward novel bounds in knot theory and representation theory.
- Formal Verification: The Liquid Tensor Experiment (2022–2024) formally verified Scholze's condensed mathematics framework, bridging abstract topology and computational logic.
- Cryptographic Reliance: The unbroken status of the Riemann Hypothesis and P ≠ NP assumptions underpins RSA, elliptic-curve cryptography, and post-quantum security standards.
As Aevum Encyclopedia continues to integrate peer-reviewed updates and contributor-verified proofs, this entry will remain a living document reflecting the evolving landscape of mathematical certainty and open inquiry.