Direct Proof

How to prove a statement by starting from the actual assumptions, applying definitions and known facts, and walking cleanly to the desired conclusion.
Modified

April 26, 2026

Keywords

direct proof, assumptions, want-to-show, definition use, proof structure

1 Role

Direct proof is the baseline proof method.

It is what you use when the structure of the statement already points forward: assume the hypothesis, unpack the relevant definitions, and derive the conclusion without reversing direction or assuming the theorem is false.

2 First-Pass Promise

Read this page after Statements and Quantifiers.

If you stop here, you should still understand:

  • when a direct proof is the right tool
  • how to set up a direct proof cleanly
  • how to use a definition on the current objects instead of repeating it abstractly
  • how to tell whether the last line really proves the theorem

3 Why It Matters

Even though later proof methods look fancier, direct proof is still the backbone of most mathematical writing.

It shows up whenever you want to prove:

  • closure properties
  • divisibility statements
  • subset relations
  • simple bounds
  • algebraic identities
  • local steps inside larger theorems

Many advanced proofs are really built from short direct-proof fragments stitched together.

4 Prerequisite Recall

  • a theorem usually has assumptions and a target
  • you should already know the domain and logical shape of the statement you are proving
  • definitions are meant to be applied to the current objects, not restated in the abstract

5 Intuition

A direct proof is the cleanest method when the theorem already points from left to right.

If the theorem says

\[ P \Rightarrow Q, \]

and the assumption \(P\) has a usable structure, then the natural move is:

  1. assume \(P\)
  2. unpack what \(P\) means
  3. manipulate or combine facts
  4. land exactly at \(Q\)

The main discipline is that every step must move the argument forward. A proof is not a place to state everything true in the neighborhood.

6 Formal Core

Definition 1 (Definition) A direct proof of an implication starts from the actual assumptions of the theorem and proceeds by valid deductions until the desired conclusion is reached.

Proposition 1 (Standard Template) For a theorem of the form

\[ \forall x \in S,\; (P(x) \Rightarrow Q(x)), \]

the usual direct-proof structure is:

  1. choose an arbitrary \(x \in S\) satisfying \(P(x)\)
  2. state that the goal is to prove \(Q(x)\)
  3. apply definitions and known facts
  4. conclude that \(Q(x)\) holds

This is the proof-writing version of “start where you are allowed to start, and end where you are required to end.”

Proposition 2 (Key Strategy) Direct proof is usually the right choice when:

  • the hypothesis already gives a concrete form you can work with
  • the conclusion is naturally reachable by algebraic or logical manipulation
  • there is no need to reverse the statement or assume falsity

If the direct route feels awkward, that is often the signal to try contrapositive, contradiction, or induction instead.

7 Worked Example

Prove:

If an integer \(n\) is divisible by \(6\), then it is divisible by \(3\).

We use a direct proof.

Choose any integer \(n\) divisible by \(6\). We will show that \(n\) is divisible by \(3\).

Since \(n\) is divisible by \(6\), there exists an integer \(k\) such that

\[ n = 6k. \]

Rewrite this as

\[ n = 3(2k). \]

Because \(2k\) is an integer, this shows that \(n\) has the form \(3m\) for an integer \(m\), namely \(m=2k\).

Therefore \(n\) is divisible by \(3\), as required.

This proof works because the hypothesis gave an explicit algebraic representation. Once we had that, the conclusion became a matter of rewriting.

8 Computation Lens

A good direct-proof checklist is:

  1. state the assumptions clearly
  2. state the target clearly
  3. introduce variables only when a definition guarantees they exist
  4. justify each nontrivial algebraic or logical step
  5. end by matching the theorem’s conclusion exactly

This is especially important when proofs involve several definitions in a row. If you lose track of which variable came from which assumption, the proof gets muddy fast.

9 Application Lens

Direct proof patterns show up everywhere:

  • proving a set is closed under an operation
  • checking that an invariant is preserved after one algorithm step
  • proving one matrix identity from another
  • establishing a simple lemma before a larger contradiction or induction argument

So even if you later prefer more sophisticated methods, direct proof is still the tool you will use most often sentence by sentence.

10 Stop Here For First Pass

If you can now explain:

  • how a direct proof starts and ends
  • how to use a definition on the current objects
  • why every sentence should move the proof forward
  • when direct proof is the natural method

then this page has done its main job.

11 Go Deeper

The next proofs-spine pages are:

12 Optional Paper Bridge

13 Optional After First Pass

If you want more practice before moving on:

  • prove a simple divisibility fact using only definitions
  • rewrite a direct proof and remove every sentence that is true but unused
  • compare a direct proof with an indirect proof of the same theorem and ask which one is cleaner

14 Common Mistakes

  • failing to state the target of the proof
  • restating a definition instead of applying it
  • introducing a variable without explaining where it came from
  • piling up equations without telling the reader why they matter
  • ending with a nearby fact instead of the theorem itself

15 Exercises

  1. Prove directly: if an integer \(n\) is divisible by \(8\), then it is divisible by \(4\).
  2. Prove directly: if sets \(A\) and \(B\) satisfy \(A \subseteq B\) and \(x \in A\), then \(x \in B\).
  3. Take a short direct proof you know and identify its assumptions, target, introduced variables, and final conclusion.

16 Sources and Further Reading

Sources checked online on 2026-04-24:

  • Stanford CS103 Guide to Proofs
  • Stanford CS103 Proofwriting Checklist
  • MIT proof notes
  • MIT proof guidelines
Back to top