The Timpson Lyceum seal

The Timpson Lyceum · History of Philosophy (2024)

Euclid of Alexandria – Lecture 31 (History of Philosophy)

Overview

Euclid of Alexandria (fl. c. 300 BC) worked in the great intellectual capital that Ptolemy I — a general and successor of Alexander the Great, and, like Alexander, a product of the Aristotelian tradition — built up around the Museum and Library of Alexandria after Alexander's empire fragmented among his generals. Almost nothing is known of Euclid's life beyond a handful of anecdotes, yet his textbook, the Elements, is arguably the most influential single work in the history of mathematics: the standard geometry text from roughly 300 BC to the late nineteenth century, second only to the Bible among books printed in the West, and studied by everyone from Archimedes to Abraham Lincoln.

The lecture's real subject is not any one theorem but the axiomatic method the Elements introduced — begin from a small stock of definitions, postulates, and common notions, then deduce everything else by logic. This template became the model for every systematic body of knowledge that followed: Newton's Principia and Spinoza's Ethics are conscious imitations of it. Euclid inherits Aristotle's habit of treating geometry as literally describing physical reality (rather than as an abstract formal system built from undefined terms — a distinction not clarified until the nineteenth century), so his definitions aim at intuition rather than rigor. Even so, the deductive architecture he assembled was so sound that its few gaps went essentially unimproved for nearly two thousand years.

Key Concepts

Worked Example

Euclid's proof of the infinitude of primes (Elements IX.20). The claim: there is no largest prime — the primes go on forever. The proof is a model of the axiomatic style, arguing by contradiction from the definition of a prime.

  1. A prime is a whole number greater than 11 whose only positive divisors are 11 and itself. The fundamental fact used is that every integer greater than 11 has at least one prime divisor.
  2. Suppose, for contradiction, that there are only finitely many primes. List them all:

p1,  p2,  …,  pn.p_1,\; p_2,\; \dots,\; p_n.

  1. Form the number obtained by multiplying them all together and adding one:

N=p1p2⋯pn+1.N = p_1 p_2 \cdots p_n + 1.

  1. Consider dividing NN by any prime pip_i on the list. Since pip_i divides the product p1p2⋯pnp_1 p_2 \cdots p_n exactly, it leaves remainder 11 when dividing NN:

N≡1(modpi)for every i=1,…,n.N \equiv 1 \pmod{p_i} \quad \text{for every } i = 1, \dots, n.

  1. Hence no pip_i divides NN. But by step 1, N>1N > 1 must have some prime divisor qq.
  2. That prime qq cannot be any of p1,…,pnp_1, \dots, p_n (none of them divides NN), so qq is a prime missing from our supposedly complete list.
  3. This contradicts the assumption that p1,…,pnp_1, \dots, p_n were all the primes. Therefore no finite list can contain every prime — the primes are infinite in number. ■\blacksquare

Note the shape: a precise definition, an assumption made only to be destroyed, a concrete construction (NN), and a clean contradiction — exactly the deductive discipline the Elements taught the West.

Summary