Skip to content
∑ Numerive

Learn

HomeTry a questionMy questsLearning SearchHomeworkUnderstand & rememberCurriculumFlashcardsUniversity

Exam preparation

Mock examsSATPSAT/NMSQTAMC 8 / 10 / 12

Your learning world

My characterAchievementsFriendsStudy groups

Family & help

Family workspace30-day reasoning planStudent sign inFor familiesContact & help
∑ NumeriveMATHUniversity mathematics
Courses & topicsSchool mathematicsLearning recordsStudent sign in
University/Introduction to Mathematical Proof

In this course

  1. 01Direct, Contrapositive & Contradiction Proofs
  2. 02Induction, Bijections & Countability

TOPIC 1 / 2

Direct, Contrapositive & Contradiction Proofs

Useful preparation: Logic, Sets & Relations
Meaning & notationConditions before calculationWhy the method worksWorked examplesPitfalls & counterexamplesCheck your understanding

For a long equation, swipe sideways inside its formula box to see every term.

Meaning & notation

A proof handles every allowed object. Track which facts are given, which assumptions are temporary, and why each step follows.

Direct proof
To prove P⇒Q\displaystyle P \Rightarrow QP⇒Q directly, start with an arbitrary object satisfying P and derive Q through justified implications.
Contrapositive proof
Instead prove ¬Q⇒¬P. This is logically equivalent to P⇒Q\displaystyle P \Rightarrow QP⇒Q, whereas the converse Q⇒P\displaystyle Q \Rightarrow PQ⇒P is generally not.
Contradiction and counterexample
Contradiction assumes the negation of the target alongside the hypotheses and derives incompatible statements. A counterexample is one allowed object satisfying the hypotheses but violating the conclusion.

Conditions before calculation

  • Declare the domain before using facts such as “not even means odd,” which is a dichotomy for integers, not arbitrary real numbers.
  • Division requires a nonzero divisor; taking square roots or reversing inequalities also needs its own stated conditions.
  • In an indirect proof, identify the temporary assumption and the precise contradiction. Do not assume the desired conclusion without a valid logical framework.

Why the method works

1. Unpack definitions

Replace descriptive words with usable equations. If an integer is divisible by a nonzero integer d, introduce an integer multiplier. The multiplier’s domain is part of the justification.

d∣n  ⟺  ∃k∈Z such that n=dkd\mid n\iff \exists k\in\mathbb Z\text{ such that }n=dkd∣n⟺∃k∈Z such that n=dk

2. Choose a helpful direction

A parity goal may be easier backwards. To establish that an even square has an even integer root, assume the root is odd and compute its square.

n=2k+1 ⟹ n2=2(2k2+2k)+1n=2k+1\ \Longrightarrow\ n^2=2(2k^2+2k)+1n=2k+1 ⟹ n2=2(2k2+2k)+1

3. Close the logical loop

Say which arbitrary choices were handled and how the last statement proves the target. For an equivalence, prove both directions separately; one implication alone is insufficient.

Worked examples

EXAMPLE 1

Prove that if a nonzero integer d divides both integers a and b, then it divides 3 a−2 b\displaystyle 3\, a - 2\, b3a−2b.

  1. Because d divides a and b, choose integers r and s with a=dr\displaystyle a = dra=dr and b=ds\displaystyle b = dsb=ds.

  2. Substitute these representations and distribute. This uses the hypotheses rather than the desired conclusion.

    3a−2b=3dr−2ds=d(3r−2s)3a-2b=3dr-2ds=d(3r-2s)3a−2b=3dr−2ds=d(3r−2s)
  3. The number 3 r−2 s\displaystyle 3\, r - 2\, s3r−2s is an integer because integers are closed under multiplication and subtraction.

Conclusion: The displayed integer multiplier proves d divides 3 a−2 b\displaystyle 3\, a - 2\, b3a−2b.

EXAMPLE 2

Prove that there is no smallest positive rational number.

  1. Assume a smallest positive rational r exists. “Smallest” means r is no larger than every positive rational.

  2. The number r2\displaystyle \frac{r}{2}2r​ is rational because rational numbers are closed under division by the nonzero integer 2.

  3. Since r is positive, 0<r2<r\displaystyle 0 < \frac{r}{2} < r0<2r​<r. This is a positive rational smaller than the supposed smallest one.

Conclusion: The assumed minimum contradicts its defining property, so it cannot exist.

Pitfalls & counterexamples

Tempting claim: A true conclusion means the argument proving it is valid.

Correction: Every implication must follow from available assumptions, even when the final statement happens to be correct.

Test the claim: “All multiples of 4 are even because 12 is even” gives one successful case but does not handle arbitrary multiples.

Check your understanding

What must be assumed first in a contrapositive proof of “if n2\displaystyle n^{2}n2 is odd, then n is odd” for integer n?

Write a reason before opening the explanation. This reflection is not graded or saved.

Compare your reasoning

Assume n is even.

Negate the conclusion, then show n2\displaystyle n^{2}n2 is even, which negates the premise.

The idea to remember

Choose a direct argument, contrapositive or contradiction, and state assumptions clearly. Examples alone do not prove a universal claim.

Remember with 2 flashcards →

Connect this idea

Proof methods support induction, limit arguments, and algebraic structure tests. Checking quantifiers and legal operations prevents the same logical errors across these subjects.

Practise this topic →Review concept flashcards

Reference reading

Use these texts to study the underlying definitions and theorems in greater depth. The explanations and examples above are written for Numerive.

  • Oscar Levin, Discrete Mathematics: Proofs
  • MIT OCW, Mathematics for Computer Science, textbook, proof chapters
← Course contentsNext topic →
∑ Numerive

Learn

HomeTry a questionMy questsLearning SearchHomeworkUnderstand & rememberCurriculumFlashcardsUniversity

Exam preparation

Mock examsSATPSAT/NMSQTAMC 8 / 10 / 12

Your learning world

My characterAchievementsFriendsStudy groups

Family & help

Family workspace30-day reasoning planStudent sign inFor familiesContact & help
Direct, Contrapositive & Contradiction Proofs: university mathematics | Numerive Math