The Art of Writing Mathematical Proofs

Why Proof Writing Matters

Writing proofs is the central activity of mathematics. It is how mathematicians communicate ideas, verify claims, and build knowledge. A proof is not just a formal verification — it is an explanation of why something is true.

Learning to write proofs well is one of the most important skills a mathematics student can develop, and it is also one of the hardest. This guide covers the main techniques, common structures, and practical advice for writing proofs that are both correct and readable.

---

What Is a Proof?

A mathematical proof is a logical argument that establishes the truth of a statement, starting from accepted axioms, definitions, and previously proven results.

In practice, proofs are written in a mixture of formal logic and natural language. The goal is clarity: a reader with the appropriate background should be able to follow every step.

---

The Main Proof Techniques

Direct Proof

A direct proof starts from the hypotheses and works forward to the conclusion through a chain of logical implications.

Structure:

Assume $P$. Then [reasoning]... Therefore $Q$. $\square$

Example. Prove that the sum of two even integers is even.

Proof. Let $m$ and $n$ be even integers. By definition, $m = 2a$ and $n = 2b$ for some integers $a$ and $b$. Then

$$m + n = 2a + 2b = 2(a + b).$$

Since $a + b$ is an integer, $m + n$ is even. $\square$

Proof by Contradiction

Assume the negation of the statement you want to prove, and derive a contradiction.

Structure:

Suppose, for the sake of contradiction, that $\neg Q$. Then [reasoning]... This contradicts [known fact]. Therefore $Q$. $\square$

Example. Prove that $\sqrt{2}$ is irrational.

Proof. Suppose, for the sake of contradiction, that $\sqrt{2}$ is rational. Then we can write $\sqrt{2} = p/q$ where $p$ and $q$ are integers with no common factor. Squaring both sides gives $2 = p^2/q^2$, so $p^2 = 2q^2$.

This means $p^2$ is even, so $p$ is even. Write $p = 2k$. Then $4k^2 = 2q^2$, so $q^2 = 2k^2$, which means $q$ is even.

But then $p$ and $q$ are both even, contradicting our assumption that they have no common factor. Therefore $\sqrt{2}$ is irrational. $\square$

Proof by Contrapositive

To prove "if $P$ then $Q$," prove the logically equivalent statement "if $\neg Q$ then $\neg P$."

Structure:

We prove the contrapositive. Assume $\neg Q$. Then [reasoning]... Therefore $\neg P$. $\square$

Example. Prove: if $n^2$ is even, then $n$ is even.

Proof. We prove the contrapositive: if $n$ is odd, then $n^2$ is odd. Suppose $n$ is odd, so $n = 2k + 1$ for some integer $k$. Then

$$n^2 = (2k+1)^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1,$$

which is odd. $\square$

Proof by Induction

Used to prove statements about natural numbers (or more generally, well-ordered sets).

Structure:

Base case. Verify the statement for $n = 1$ (or the smallest relevant value).

Inductive step. Assume the statement holds for $n = k$. Prove it holds for $n = k + 1$.

By induction, the statement holds for all $n \ge 1$. $\square$

Example. Prove that for all $n \ge 1$,

$$1 + 2 + \cdots + n = \frac{n(n+1)}{2}.$$

Proof. Base case. For $n = 1$: $1 = 1 \cdot 2 / 2 = 1$. ✓

Inductive step. Assume $1 + 2 + \cdots + k = k(k+1)/2$. Then

$$1 + 2 + \cdots + k + (k+1) = \frac{k(k+1)}{2} + (k+1) = \frac{k(k+1) + 2(k+1)}{2} = \frac{(k+1)(k+2)}{2}.$$

This is the formula with $n = k+1$. By induction, the result holds for all $n \ge 1$. $\square$

Proof by Construction

Prove that an object exists by explicitly constructing it.

Example. Prove that there exists an irrational number $r$ such that $r^r$ is rational.

Proof. Consider $\sqrt{2}^{\sqrt{2}}$. If this is rational, we are done with $r = \sqrt{2}$.

If it is irrational, set $r = \sqrt{2}^{\sqrt{2}}$. Then

$$r^{\sqrt{2}} = \left(\sqrt{2}^{\sqrt{2}}\right)^{\sqrt{2}} = \sqrt{2}^{(\sqrt{2} \cdot \sqrt{2})} = \sqrt{2}^2 = 2,$$

which is rational. In either case, such an $r$ exists. $\square$

---

The Structure of a Good Proof

A well-written proof has three parts:

1. Setup. State what you are going to prove, introduce notation, and identify the proof technique.
2. Body. Carry out the logical argument step by step.
3. Conclusion. State what has been established and mark the end of the proof.

Signposting

Good proofs tell the reader where they are going:

• "We proceed by contradiction."
• "We will construct a sequence that converges to the desired limit."
• "The proof has two parts: first we show existence, then uniqueness."

This kind of signposting makes proofs dramatically easier to follow.

---

Writing Style

Be Precise

Every variable should be introduced before it is used. If you write $f(x) < \epsilon$, the reader should already know what $f$, $x$, and $\epsilon$ are.

Bad: "Since $x$ is small, $f(x)$ is close to $L$."

Good: "Let $\epsilon > 0$ be given. Since $f$ is continuous at $a$, there exists $\delta > 0$ such that $|x - a| < \delta$ implies $|f(x) - f(a)| < \epsilon$."

Be Concise

Do not write more than necessary. Every sentence should advance the argument.

Bad: "We now note that it is the case that, by the properties of limits which we studied in the previous section, the limit of the sum is equal to the sum of the limits."

Good: "By the sum law for limits, $\lim(a_n + b_n) = \lim a_n + \lim b_n$."

Use Complete Sentences

A proof should read as grammatically correct prose, with mathematical symbols integrated into the sentences.

Bad:

$$x > 0 \Rightarrow x^2 > 0$$

Good: "Since $x > 0$, we have $x^2 > 0$."

---

Common Proof Patterns

Here are patterns that appear repeatedly across mathematics:

The $\epsilon$-$\delta$ Pattern (Analysis)

To show that $\lim_{x \to a} f(x) = L$:

Let $\epsilon > 0$ be given. Choose $\delta =$ [some expression involving $\epsilon$]. If $0 < |x - a| < \delta$, then [chain of inequalities]... $< \epsilon$.

The "Take the Supremum" Pattern

To show a bound holds for a supremum:

For every $x \in S$, we have $f(x) \le M$. Taking the supremum over all $x \in S$ gives $\sup_{x \in S} f(x) \le M$.

The Diagonal Argument

To show that a set is uncountable:

Suppose for contradiction that the elements can be listed as $a_1, a_2, a_3, \ldots$. Construct a new element $b$ that differs from $a_n$ in the $n$-th component. Then $b$ is not in the list, a contradiction.

The Pigeonhole Argument

Since we have $n+1$ objects distributed among $n$ categories, at least one category contains at least two objects.

---

How to Get Better at Proof Writing

Read Good Proofs

Study proofs by skilled authors. Some books known for exceptionally clear proof writing include:

• Walter Rudin, Principles of Mathematical Analysis
• Michael Artin, Algebra
• Serge Lang, Algebra
• Allen Hatcher, Algebraic Topology

Pay attention not just to the logical content but to the writing: how the author introduces variables, motivates steps, and structures the argument.

Write and Rewrite

Your first draft of a proof is rarely your best. After writing a proof:

1. Check each step for correctness.
2. Remove unnecessary steps.
3. Add explanation where the reasoning is not obvious.
4. Read it from the perspective of someone seeing it for the first time.

Practice Regularly

Proof writing is a craft that improves with practice. Work through exercises that require proofs, not just calculations. Books specifically designed for proof practice include Daniel Velleman's How to Prove It and Joseph Rotman's Journey into Mathematics.

---

The Difference Between Scratch Work and a Proof

When you are solving a problem, your scratch work will be messy, nonlinear, and full of dead ends. That is normal.

A proof, however, should be clean, logical, and read as if you knew the answer all along. The reader does not need to see your failed attempts.

This means the order of discovery is often the reverse of the order of presentation. You might discover the key inequality by working backward from the conclusion, but in the proof you present it as a forward deduction.

---

When You Are Stuck

If you cannot find a proof, try the following:

1. Work specific examples. If the theorem says "for all $n$," try $n = 1, 2, 3$ and see if a pattern emerges.
2. Consider the contrapositive. Sometimes "if not $Q$ then not $P$" is easier to prove.
3. Try contradiction. Assume the conclusion is false and see what breaks.
4. Simplify. Can you prove a special case first?
5. Draw a picture. Visualization often reveals the key idea, especially in geometry, topology, and analysis.
6. Sleep on it. Seriously. The subconscious mind is remarkably good at solving mathematical problems.

---

Final Thoughts

Paul Halmos once wrote:

"The best way to learn to write proofs is to write proofs."

There is no shortcut. But by studying the techniques, reading good examples, and practicing deliberately, you can improve steadily. Every mathematician once struggled with their first proof. The craft becomes natural with time.

---

References

• Daniel Velleman, How to Prove It: A Structured Approach, Cambridge University Press, 2019.
• Joseph Rotman, Journey into Mathematics: An Introduction to Proofs, Dover, 2006.
• Kevin Houston, How to Think Like a Mathematician, Cambridge University Press, 2009.
• Paul Halmos, I Want to Be a Mathematician, Springer, 1985.
• Walter Rudin, Principles of Mathematical Analysis, McGraw-Hill, 1976.
• Lara Alcock, How to Study as a Mathematics Major, Oxford University Press, 2013.