A lemma is a proved statement in mathematics introduced principally to help establish another result. It has the same logical status as a theorem: both require a valid mathematical proof from stated assumptions and previously established results. The difference is chiefly one of purpose and presentation. A lemma usually isolates a useful intermediate step, although some lemmas become major results in their own right. The standard plural is lemmas; lemmata is also used.
Role in mathematical reasoning
A long proof often contains several distinct tasks. Rather than combine all of them into one argument, an author may prove one or more lemmas and then invoke them in the main proof. This organization can:
- separate technical details from the central idea;
- identify a fact used repeatedly;
- make assumptions and dependencies explicit;
- allow a useful intermediate result to be applied elsewhere.
For example, suppose a main result follows from a hypothesis through two intermediate statements and . The argument may be organized as
Here and can be presented as lemmas, while is presented as the main theorem. Each implication still requires justification; naming a statement a lemma does not establish its truth.
An especially useful lemma may be stated more generally than the immediate application requires. Conversely, a lemma may be tailored to one proof and have little independent interest. Neither generality nor difficulty determines whether the label is appropriate.
Relationship to other mathematical statements
Mathematical writing uses several labels for statements:
| Label | Usual function |
|---|---|
| Theorem | A result treated as a principal or significant conclusion |
| Lemma | An auxiliary result used to prove another result |
| Proposition | A proved result, often presented without the prominence assigned to a theorem |
| Corollary | A result following relatively directly from an established result |
| Axiom | A statement accepted as a starting assumption within a theory |
These distinctions, apart from the difference between assumptions and proved conclusions, are largely expository conventions. There is no universal formal scale on which a lemma is less important than a proposition or theorem. The same statement may be a lemma in one text and a theorem in another.
An axiom need not be proved within the theory in which it is assumed. A lemma, by contrast, must be justified relative to the assumptions in force. A conjecture is also different: it is proposed as true but has not yet been established in the relevant setting.
An elementary example: Euclid’s lemma
Euclid’s lemma states that if a prime number divides a product of integers , then it divides at least one of the factors:
One proof uses Bézout’s identity. Suppose and . Because is prime, the greatest common divisor of and is . Bézout’s identity therefore gives integers such that
Multiplying by yields
Both terms on the left are divisible by , so .
The lemma is a key ingredient in proving the uniqueness part of the fundamental theorem of arithmetic. If an integer has two prime factorizations, a prime in one factorization divides the product in the other. Repeated application of the lemma shows that it must equal one of the primes in that other factorization. Cancelling matching factors and continuing establishes uniqueness up to their order.
The primality assumption is essential. For example, , but divides neither nor . This illustrates why a lemma’s hypotheses must be checked whenever it is applied.
Major results called lemmas
Some statements retain the name “lemma” despite their broad significance.
Zorn’s lemma
Zorn’s lemma states that a nonempty partially ordered set has a maximal element if every chain has an upper bound in the set. A chain is a subset whose elements are pairwise comparable under the partial order.
Over Zermelo–Fraenkel set theory, Zorn’s lemma is equivalent to the axiom of choice. It is widely used in existence proofs, including the proof that every vector space has a basis. Its status as a foundational principle demonstrates that the name “lemma” does not imply a minor result.
Fatou’s lemma
In measure theory, Fatou’s lemma states that for a sequence of nonnegative measurable functions on a measure space,
It provides a fundamental comparison between integration and limiting operations and is closely related to convergence results such as the dominated convergence theorem.
Lemmas in formal proofs
In a formal system, a proved lemma can be reused by referring to its derivation rather than reproducing it each time. In a proof assistant, a named lemma commonly becomes an entry in a library of verified results, with its precise assumptions and conclusion recorded.
The logical system generally does not assign a weaker truth status to a lemma than to a theorem. Such labels may help organize a library, but the underlying requirement is the same: the statement must have an acceptable formal proof. This reuse supports formal verification by making large developments more modular.
A lemma may depend on other lemmas, producing a network of proof dependencies. Legitimate reuse requires avoiding circular reasoning: a result cannot be justified solely through another result whose proof already presupposes it.
Terminology and historical usage
The word derives from the Greek lēmma, meaning something taken or received, and came to designate an auxiliary proposition in mathematical argument. The practice of establishing subsidiary results belongs to the long tradition of deductive mathematics.
The name attached to a result is not a reliable guide to its present importance. A statement introduced to support one argument may later become useful throughout a field while retaining its original designation as a lemma.