Not sure which lesson to do first? Find your level and get a plan →

Math · Sets & Logic · Grade 9-12

Direct Proof

A direct proof establishes 'if P then Q' by taking P as given and moving forward through valid steps until Q appears — no assuming the opposite, no detours.


Quick Answer

A direct proof establishes 'if P then Q' by taking P as given and moving forward through valid steps until Q appears — no assuming the opposite, no detours. Write down what P means using definitions (even means n=2k, a multiple of 3 means n=3m), work with that form using algebra and known facts, and stop when the expression matches the definition of Q. It is the first technique to try whenever the hypothesis gives you something concrete to build on.

Why This Matters

Most proofs in algebra, number theory and geometry are direct, so this is the form you will write most often. Because each line follows from the one before, a direct proof shows why Q happens, not just that it can't fail. Without the habit of unpacking definitions, students stare at "prove that…" with nothing to write.

Intuitive Explanation

Claim: if n leaves remainder 1 when divided by 3, then so does n2. Start with what the hypothesis means: n=3k+1 for some integer k. Now there is material to work with: n2=(3k+1)2=9k2+6k+1=3(3k2+2k)+1. The bracket is an integer, so n2 is 3 times an integer plus 1, which is exactly what "remainder 1" means. You started at P, walked forward through algebra and arrived at Q. For n=7: 49=3⋅16+1.

The shape is always the same: assume P for an arbitrary object, rewrite P with its definition, transform, and recognise the definition of Q at the end. "Arbitrary" is what makes it a proof: k could be any integer, so the argument covers every such n at once, which checking n=4,7,10 never could. Write down the target before you start ("I need 3(integer)+1") so you know which form to steer toward.

Two things look similar but are not direct proofs. Starting from Q and working back to P proves the converse, a different statement. Assuming Q is false and hunting for an impossibility is proof by contradiction. In a direct proof Q is never assumed; it is only the destination. If the forward road stalls, as it does for "if n2 is even, then n is even", switch to the contrapositive.

Think of it like this. A direct proof is like cooking from the ingredients you were handed: start with what P gives you, apply one allowed step at a time, and stop when the dish matches the picture of Q. Unlike cooking, you can't taste a few batches and call it done; the steps must work for any ingredients that fit P.

Core idea. A direct proof assumes the hypothesis P is true and chains definitions, algebra, and known theorems forward until it reaches the conclusion Q.


When to Use

Try a direct proof first whenever the claim is an if-then and the hypothesis can be unpacked into a formula: even (2k), odd (2k+1), a multiple of m (mj), a divides b (b=ak), or a geometric fact you can write as an equation. Aim at the definition of the conclusion. If the hypothesis gives no grip but the negated conclusion does, use the contrapositive; for "there is no…" or irrationality claims, use contradiction; for "every integer n≥1" built step by step, use induction.

Tip. Ask: Can I start from the hypothesis and reach the conclusion using only forward steps, never assuming the conclusion is false?

How to Recognize It

Before starting, write the hypothesis and the conclusion on separate lines and translate each one into symbols using its definition.

  1. Does the hypothesis turn into a formula you can work with, such as m=2k+1 for odd?

    If yes, a direct proof has material from its first line. If the hypothesis gives you nothing to compute with, as in 'if n2 is even', try the contrapositive, where 'n is odd' gives n=2k+1.

  2. Can you write the conclusion as a target form, such as twice an integer or 3 times an integer?

    If yes, aim every step at that form; once you reach 3(…) with an integer inside the brackets, you are done. If you cannot say what the target looks like, rewrite the conclusion's definition before going on.

  3. Are you working with a particular number, such as n=4, instead of a letter that could stand for any number?

    If yes, you are checking an example, not proving. Replace it with an arbitrary integer and keep the argument general. An example is enough only when the claim says 'there exists'.

  4. Does your argument begin by supposing the conclusion is false and then use that supposition?

    If yes, it is a proof by contradiction or a contrapositive proof, not a direct proof. If the 'suppose not' is never used, delete it; the argument underneath was direct all along.

Direct Proof compared with Proof by contradiction, Contrapositive proof, and Mathematical induction

All four rows are ways to prove a claim, and each uses forward steps somewhere inside. Ask what you assume at the start: the hypothesis, the negation of the whole claim, the negation of the conclusion, or a base case plus a step.

Direct Proof

Meaning
Use this when the claim is 'if P then Q' and assuming P gives you a concrete definition or value to reason forward from.
Key test
Can I start from the hypothesis and reach the conclusion using only forward steps, never assuming the conclusion is false?
Example
Prove directly: if n is an even integer, then n2 is even.

Proof by contradiction

Meaning
Assumes the conclusion is FALSE and derives an impossibility, rather than building toward it.
Key test
Use when forward reasoning has no foothold or the negation is far easier to manipulate.
Formula
Assume ¬Q, derive ⊥
Example
Assume 2=ab, reach a parity contradiction

Contrapositive proof

Meaning
Directly proves the equivalent statement '¬Q⇒¬P' instead of P⇒Q.
Key test
Use when assuming ¬Q is more concrete than assuming P.
Formula
¬Q⇒¬P
Example
To show 'n2 even ⇒n even', prove 'n odd ⇒n2 odd'

Mathematical induction

Meaning
Proves a claim for all integers by a base case plus a step linking n to n+1.
Key test
Use when the claim is indexed by integers and each case depends on the previous.
Formula
Base case + inductive step
Example
Prove a summation formula holds for every n≥1

Formula & Notation

Worked Examples

Example 1 — Even times even

Easy

Prove directly: if n is an even integer, then n2 is even.
Show the steps and the answer
  1. Assume the hypothesis: let n be an even integer.

    In a direct proof P is the starting point, and nothing is assumed about n2.

  2. Unpack "even": n=2k for some integer k.

    The definition turns a word into algebra you can manipulate.

  3. Square it: n2=(2k)2=4k2=2(2k2).

    Pulling out a factor of 2 steers the expression toward the definition of even, which is the target.

  4. Recognise the target: 2k2 is an integer, so n2 is 2 times an integer and therefore even.

    An integer times an integer is an integer, so the bracket qualifies, and Q is reached for every even n.

Answer: Therefore n2 is even

Takeaway: Unpack P with its definition, then rearrange until the result matches the definition of Q.

Example 2 — Direct road is blocked

Standard

Prove: if n2 is even, then n is even. Can you go forward from 'n2 even'?
Show the steps and the answer
  1. Try the forward road: n2=2m, so n=2m.

    The square root of an even number isn't visibly 2 times an integer, so the definition of even can't be reached this way.

  2. Form the contrapositive: "if n is not even, then n2 is not even", that is, "if n is odd, then n2 is odd".

    A statement and its contrapositive are always true or false together, so proving one proves the other.

  3. Prove it directly: n=2k+1, so n2=4k2+4k+1=2(2k2+2k)+1, which is odd.

    Now the hypothesis "odd" unpacks into a formula, and forward algebra works.

  4. Conclude: an even n2 can't come from an odd n, so n is even.

    Every integer is even or odd, and the odd case has been ruled out.

Answer: Use the contrapositive instead

Takeaway: When P gives no grip, prove the contrapositive directly; it is the same statement in a form you can start from.

Example 3 — Find the mistake: starting at the destination

Application

Claim: if n is an odd integer, then n2−1 is a multiple of 8. Ali writes: "Suppose n2−1=8m. Then n2=8m+1, which is odd, so n is odd. That matches the hypothesis, so the claim is proved." Find the mistake and correct it.
Show the steps and the answer
  1. Look at Ali's first line: it starts from n2−1=8m, which is the conclusion.

    Assuming Q and reaching P shows only "if Q then P", the converse, which is a different claim.

  2. Start from the hypothesis instead: n odd means n=2k+1, so n2−1=4k2+4k=4k(k+1).

    Unpacking P gives a formula to move forward from.

  3. Use a known fact: k and k+1 are consecutive integers, so one of them is even, and k(k+1)=2j for some integer j.

    This is the extra step that turns the factor 4 into a factor 8.

  4. Finish: n2−1=4⋅2j=8j, a multiple of 8. Check: n=7 gives 48=8⋅6.

    The argument ran from P to Q for an arbitrary odd n; the number check only confirms it.

Answer: Ali proved the converse. Direct proof: n=2k+1 gives n2−1=4k(k+1)=8j, because k(k+1) is even.

Takeaway: In a direct proof the conclusion is where you finish, never where you start; begin by unpacking the hypothesis.

Where You'll See It

  • Barcodes that catch a misread digit

    A UPC barcode's last digit is chosen so that a weighted sum of all the digits (weights 3 and 1) is a multiple of 10. A short direct proof shows that changing one digit by d changes the sum by d or 3d, and for d from 1 to 9 neither is a multiple of 10, so every single-digit misread is caught.

  • Casting out nines to check sums

    Why does a multiple of 9 have digits adding to a multiple of 9? Directly: 432=4⋅99+3⋅9+(4+3+2), and the first two parts are multiples of 9, so 432 and its digit sum 9 leave the same remainder. Bookkeepers used this to check long additions by hand.

Common Mistakes

  1. The slip: Secretly assuming the conclusion Q and reasoning toward the hypothesis

    Instead: in a direct proof Q is the destination, never an assumption.

  2. The slip: Skipping the definition of the hypothesis

    Instead: unpack what P actually means (e.g. 'even' means n=2k) so you have material to work with.

  3. The slip: Treating one worked example as the proof

    Instead: a direct proof must use an arbitrary object satisfying P, not a single number.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Prove directly: if n is odd, then n+5 is even.

    Hint: Unpack "odd" as n=2k+1.

  2. Prove directly: if a is a multiple of 3 and b is a multiple of 6, then a+b is a multiple of 3.

    Hint: Write a and b using their definitions, then factor out a 3.

  3. Prove directly: if x>3, then x2−2x>3.

    Hint: Factor x2−2x and use what x>3 tells you about each factor.

  4. Prove directly: if two integers each leave remainder 1 when divided by 4, their product also leaves remainder 1.

    Hint: Write the numbers as 4a+1 and 4b+1, then multiply out.

  5. Claim: "If 3n+2 is odd, then n is odd." Starting from "3n+2 is odd" gives little to work with. Direct proof or contrapositive?

    Hint: Flip and negate both parts. Does starting from "n is even" give more to work with?

  6. To prove "if n is even, then n+4 is even", Lu writes: "Assume n+4 is even. Then n=(n+4)−4 is even." Correct her proof.

    Hint: Which statement did she assume, and which was she supposed to reach?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

What does 'without loss of generality' mean in a proof?

It means a choice you make does not shrink what the proof covers. If you must prove something about two integers aa and bb and their roles are interchangeable, you may write 'without loss of generality, a≤ba \le b', since the other order is the same argument with the letters swapped. It saves writing the case twice. Use it only when the skipped case really is identical.

Why must I prove that the product of two odd numbers is odd when it is obvious?

Because obvious facts are where hidden assumptions live, and short proofs are practice for long ones. Here the proof is one line: (2a+1)(2b+1)=4ab+2a+2b+1=2(2ab+a+b)+1(2a + 1)(2b + 1) = 4ab + 2a + 2b + 1 = 2(2ab + a + b) + 1, which is odd. The same unpacking, writing the hypothesis as a formula and aiming at the conclusion's form, is the whole method for claims that are far from obvious.

Can a direct proof use a theorem I already know?

Yes, any result already proved is fair to use, and naming it keeps the proof short. To show the hypotenuse of a right triangle is longer than either leg, cite the Pythagorean theorem: c2=a2+b2>a2c^2 = a^2 + b^2 > a^2 because b>0b > 0, and since lengths are positive, c>ac > a. What you may not use is the claim itself, or a result that depends on it.

What do I do when a direct proof gets stuck halfway?

Work backward from the conclusion on scrap paper: ask what you would need one step before it, then one step before that, until you meet something you already have. Then write the steps in forward order for the final proof. If the backward search also stalls, the hypothesis may be too weak to grip, which is the signal to try the contrapositive.

Learning Path

Direct Proof

You are here

Next →

Nothing after this yet
You need Logical Statement, Conditional Statement ("if P then Q" and why it differs from its converse) and Proof (Intuition) first. Direct proof adds the core routine: assume P, unpack it with definitions, transform, and land on Q. The other techniques are built on it: a contrapositive proof is a direct proof of "not Q implies not P", and each step of induction is a small direct proof.

See Also