Theorems

A theorem is a mathematical statement that has been proven true through a logical chain of reasoning starting from accepted assumptions (axioms) and previously established results. Key result in words: if the premises (hypotheses) hold, then the conclusion must follow — with absolute certainty, not just high probability. Where it applies: every branch of mathematics — geometry, algebra, number theory, calculus, and beyond. Who/when: the formal notion crystallized in ancient Greece, especially with Euclid's Elements (~300 BCE), and was refined by logicians into the 19th–20th centuries.

A theorem is a proposition that follows logically and necessarily from a set of starting assumptions called axioms (or postulates), together with definitions and other theorems already proven. What distinguishes a theorem from a guess, a pattern, or a scientific law is its proof — an explicit, gap-free deductive argument. This matters because mathematics is the one discipline where conclusions are certain relative to their assumptions: a correctly proven theorem can never be overturned by new data the way scientific theories can. A surprising fact is that truth and provability are not the same thing — Kurt Gödel showed in 1931 that in any sufficiently rich mathematical system there exist true statements that can never be proven within that system.

The Core Insight

A theorem is an "if–then" guarantee. It does not assert that its conclusion is unconditionally true; it asserts that whenever the hypotheses are satisfied, the conclusion is forced. The entire power of mathematics rests on chaining such guarantees together: axioms → lemmas → theorems → corollaries, each link verified by pure logic. Strip away the proof, and a statement is merely a conjecture.

Formal Statement

Theorem and Its Logical Form

A theorem is a statement of the form "If $P$ , then $Q$ ," where $P$ is the hypothesis (the assumptions) and $Q$ is the conclusion. Symbolically:

P ⟹ Q

⟳This is the material conditional of formal logic;

P ⟹ Q

is false only in the single case where

P

is true but

Q

is false.

Here the symbols mean:

$P$ = hypothesis / premise — the given conditions assumed to hold.
$Q$ = conclusion — what is claimed to follow.
$⟹$ = logical implication ("implies," "then").

The truth table that defines implication is:

P T T F F Q T F T F P ⟹ Q T F T T

⟳A conditional is "vacuously true" whenever the hypothesis is false — a "false premise can prove anything" — which is why mathematicians treat the bottom two rows as true.

The Vocabulary of Mathematical Statements

Related terms form a hierarchy of named results:

Axiom / Postulate — an assumption accepted without proof; the foundation.
Definition — a precise meaning assigned to a term.
Lemma — a minor theorem proven mainly as a stepping-stone to a larger one.
Proposition — a proven statement of modest importance.
Theorem — a significant proven result.
Corollary — a result that follows quickly from a theorem.
Conjecture — a statement believed true but not yet proven.

Converse, Inverse, and Contrapositive

From any conditional $P ⟹ Q$ , three related statements arise. The contrapositive is logically equivalent to the original; the converse and inverse are not.

(P ⟹ Q) \equiv (\neg Q ⟹ \neg P)

⟳Both statements are false in exactly the same single row of the truth table (

P

true,

Q

false), so they are equivalent — this is the logical basis for proof by contrapositive.

| Name | Form | Equivalent to original? | |------|------|------------------------| | Original | $P ⟹ Q$ | — | | Converse | $Q ⟹ P$ | No | | Inverse | $\neg P ⟹ \neg Q$ | No | | Contrapositive | $\neg Q ⟹ \neg P$ | Yes |

Why It Holds / Derivation

How a Theorem Is Established — A Model Proof

We prove a classic theorem to illustrate the structure of all proofs: "If $n^{2}$ is even, then $n$ is even." We use the contrapositive method (Equation [3]).

Step 1 — Restate via contrapositive. Instead of "

n^{2}

even

⟹

n

even," prove the equivalent "

n

odd

⟹

n^{2}

odd." Step 2 — Assume the hypothesis. Let

n

be odd. By definition of odd, there exists an integer

k

such that

n = 2 k + 1

⟳Every odd integer is one more than an even integer

2 k

; this is the algebraic definition of oddness.

Step 3 — Compute $n^{2}$ .

n^{2} = (2 k + 1)^{2} = 4 k^{2} + 4 k + 1 = 2 (2 k^{2} + 2 k) + 1

⟳Expand the binomial, then factor out 2 from the first two terms to expose the "

2 m + 1

" form.

Step 4 — Identify the form. Let

m = 2 k^{2} + 2 k

, an integer. Then

n^{2} = 2 m + 1

, which is odd by definition. Step 5 — Conclude. We have shown

n

odd

⟹ n^{2}

odd. By the equivalence in [3], the original statement "

n^{2}

even

⟹ n

even" holds.

■

The Anatomy of Every Proof

Notice the universal pattern: (1) state precisely what is assumed, (2) apply definitions and prior results, (3) manipulate using valid logical/algebraic steps, (4) arrive at the conclusion with no gaps. A proof is like a chain — it is only as strong as its weakest link, and a single unjustified leap invalidates the whole argument. The four main proof strategies are: direct proof, proof by contrapositive, proof by contradiction, and proof by induction.

Euclid of Alexandria | c. 325 – c. 265 BCE

Euclid's Elements is the most influential mathematics text ever written and the template for the modern theorem. He began with just five postulates and five "common notions," then derived 465 propositions in airtight logical sequence. His method — define terms, state axioms, prove everything else — established the axiomatic-deductive method that defines mathematics to this day. The phrase "Q.E.D." (quod erat demonstrandum, "which was to be demonstrated") echoes his style. For over 2000 years, "geometry" meant Euclid.

Building Intuition

Theorems as Unbreakable Promises

Imagine a vending machine: "Insert £1 ⟹ get a drink." The promise says nothing about what happens if you insert £2 or nothing — it only guarantees the outcome when the condition is met. A theorem is exactly this kind of conditional promise, but enforced by logic rather than engineering. And crucially, the promise is forever: unlike a scientific result that could be revised, a proven theorem stays true as long as its axioms do. The Pythagorean theorem was true for Pythagoras, is true for you, and will be true in a billion years.

The logical landscape: from axioms to theorems and corollaries

Worked Examples

Verifying a Theorem Numerically — Pythagorean Theorem

Theorem (statement): In a right triangle with legs

a, b

and hypotenuse

c

a^{2} + b^{2} = c^{2}

. Given: A right triangle with legs

a = 3

and

b = 4

. Find: The hypotenuse

c

. Step 1 — Apply the theorem.

c^{2} = a^{2} + b^{2} = 3^{2} + 4^{2} = 9 + 16 = 25

⟳Substitute the leg lengths directly; the theorem guarantees this equation for any right triangle.

Step 2 — Solve for $c$ . Take the positive square root (a length is positive):

c = 25 = 5

⟳Only the positive root is geometrically meaningful for a side length.

Answer:

c = 5 units

. Note that verifying with numbers does not prove the theorem — it only illustrates it. The theorem is proven for all right triangles, not checked case by case.

Distinguishing a Statement from Its Converse

Original theorem: "If a quadrilateral is a square, then it has four equal sides." This is true. Given: We test whether the converse holds: "If a quadrilateral has four equal sides, then it is a square." Step 1 — Identify hypothesis and conclusion of the converse.

P

= "four equal sides,"

Q

= "is a square." Step 2 — Search for a counterexample. Consider a rhombus with all sides of length

5

but with angles of

6 0^{\circ}

and

12 0^{\circ}

instead of

9 0^{\circ}

. Step 3 — Evaluate. This shape has four equal sides (

P

true) but is not a square (

Q

false), since its angles are not all right angles. Answer:

The converse is FALSE.

This demonstrates Equation [3]'s warning: a true statement and its converse can have different truth values.

Common Misconceptions

Truth of Hypothesis vs. Truth of Implication

A theorem $P ⟹ Q$ does not claim that $P$ is true or that $Q$ is true on their own. It claims only that the connection holds. The theorem "If $x = 2$ , then $x^{2} = 4$ " is true even when $x = 7$ — because then the hypothesis is false and the implication is vacuously true (rows 3–4 of Equation [2]). Students often wrongly read a theorem as asserting its conclusion unconditionally.

Examples Are Not Proofs

Checking a statement for $n = 1, 2, 3, \dots, 1000$ and finding it works does not prove it. A famous illustration: the polynomial $n^{2} + n + 41$ produces a prime number for every $n$ from $0$ to $39$ — but at $n = 40$ it gives $4 0^{2} + 40 + 41 = 4 1^{2}$ , which is composite. A single counterexample destroys a universal claim; no finite number of confirmations establishes one.

A Pattern That Breaks

Claimed "theorem": "

2^{2^{n}} + 1

is always prime" (Fermat's conjecture, 1650). It holds for

n = 0, 1, 2, 3, 4

, giving

3, 5, 17, 257, 65537

— all prime. But Euler showed in 1732 that for

n = 5

2^{32} + 1 = 4, 294, 967, 297 = 641 \times 6, 700, 417

⟳Euler found the factor 641 by clever number-theoretic argument; the number is composite, so the conjecture is false.

This is why Fermat's conjecture never became a theorem — it was disproven.

Connections

Where Theorems Sit in Mathematics

The study of theorems and proofs is the subject of Mathematical Logic and Proof Techniques, which formalize valid reasoning. Every theorem rests on a chosen set of Axioms, and changing the axioms can change which theorems hold — this is dramatically true in Non-Euclidean Geometry, where dropping Euclid's parallel postulate yields new, internally consistent geometries. Powerful named theorems like the Pythagorean Theorem and the Fundamental Theorem of Calculus organize entire fields. The limits of what theorems can prove are studied in Gödel's Incompleteness Theorems.

Real-World Applications

Theorems at Work in the World

Cryptography (RSA encryption): Online banking security relies on theorems in number theory — especially Euler's theorem and the difficulty of factoring, guaranteeing messages can be encrypted but not feasibly broken.
GPS navigation: Positioning uses theorems of trilateration and the geometry of spheres, plus relativistic corrections grounded in proven physical-mathematical results.
Computer graphics & engineering (Pythagorean Theorem): Distance calculations, collision detection, and structural triangulation in CAD software all invoke this theorem millions of times per second.
Error-correcting codes (CDs, QR codes, deep-space probes): Theorems in finite-field algebra (Reed–Solomon coding) let damaged data be perfectly reconstructed.
Compiler verification & aircraft software: Formal theorem provers (Coq, Isabelle) mechanically check that flight-control code is mathematically free of certain bugs.
Search engines (PageRank): Google's ranking algorithm depends on the Perron–Frobenius theorem from linear algebra guaranteeing a unique stable ranking exists.
Architecture & surveying: Trigonometric theorems (law of sines, law of cosines) compute inaccessible distances and structural angles.

Historical Development

The Idea of the Theorem Through Time

c. 1800 BCE — Babylonian tablets (e.g., Plimpton 322) list Pythagorean triples, showing empirical knowledge without formal proof.
c. 600 BCE — Thales of Miletus is credited with the first deductive proofs of geometric statements, marking the birth of proof.
c. 530 BCE — The Pythagorean school proves the theorem bearing its name and grapples with the shocking proof that $2$ is irrational.
c. 300 BCE — Euclid's Elements establishes the axiomatic-deductive method, the gold standard for 2000+ years.
c. 250 BCE — Archimedes proves results on areas and volumes using rigorous "method of exhaustion," anticipating calculus.
1637 CE — Fermat scribbles his "Last Theorem" in a margin — a conjecture that resisted proof for 358 years.
1854 CE — Riemann and others develop non-Euclidean geometries, proving that which theorems hold depends on the axioms chosen.
1931 CE — Kurt Gödel proves his Incompleteness Theorems: any consistent system rich enough for arithmetic contains true statements it cannot prove.
1994 CE — Andrew Wiles finally proves Fermat's Last Theorem, turning a 358-year-old conjecture into a theorem.

Subtleties & Limits

The Boundaries of Provability

Gödel's Incompleteness Theorems (1931) reveal a profound limit: in any consistent formal system powerful enough to express ordinary arithmetic, there are true statements that cannot be proven within that system, and the system cannot prove its own consistency. This means mathematics can never be "completed" into a single finite list of axioms from which all truths follow. A related open question is whether certain famous conjectures (such as the Riemann Hypothesis or Goldbach's Conjecture) are merely unproven, or perhaps independent of standard axioms — unprovable and undisprovable, like the Continuum Hypothesis was shown to be (Cohen, 1963). The relationship between truth and proof remains one of the deepest themes in the foundations of mathematics.