Tenth Grade Mathematics: Methods of Proof: Direct, Contradiction, and Counterexample

In empirical sciences such as physics, biology, and chemistry, a hypothesis is tested through inductive observation and repeated laboratory experiments. However, no matter how many millions of experiments confirm a scientific theory, empirical observation can never guarantee universal truth. Mathematics alone operates on deductive proof. A mathematical theorem is not merely an observation that has worked so far; it is an absolute logical certainty established through an unbroken chain of valid deductions from accepted axioms. In this chapter, we master the three primary methods of mathematical proof: direct proof, indirect proof by contradiction, and disproof by counterexample.

The Architecture of a Mathematical System

Every mathematical system is constructed hierarchically upon four structural components:

The Mathematical Hierarchy:
1. Undefined Terms: Primitive concepts accepted without formal definition
   (e.g., point, line, set).
2. Axioms (Postulates): Self-evident foundational propositions assumed to be
   true without proof (e.g., Euclid's parallel postulate, Peano axioms).
3. Definitions: Precise descriptions that introduce new mathematical concepts
   using undefined terms and established concepts.
4. Theorems: Universal propositions proven to be true through deductive logic
   from axioms, definitions, and previously established theorems.

Method 1: The Direct Proof

A direct proof establishes a conditional proposition "If P, then Q" (P ===> Q) by assuming hypothesis P is true and executing a sequence of direct algebraic or logical deductions until conclusion Q is reached:

Structure of Direct Proof:
1. State hypothesis: Assume P is TRUE.
2. Apply definitions and known axioms to express P algebraically.
3. Perform valid algebraic transformations.
4. Conclude: Therefore, Q is TRUE.

Demonstration of Direct Proof:
Theorem: The sum of any two odd integers is always an even integer.

Proof:
Step 1: Let x and y be any two arbitrary odd integers.
Step 2: By definition of odd integers, there exist integers k and m such that:
        x = 2*k + 1    and    y = 2*m + 1
Step 3: Compute the sum x + y:
        x + y = (2*k + 1) + (2*m + 1)
              = 2*k + 2*m + 2
              = 2 * (k + m + 1)
Step 4: Since integers are closed under addition, let integer p = k + m + 1.
        Then: x + y = 2*p.
Step 5: By definition of an even integer, any integer divisible by 2 is even.
        Therefore, x + y is an even integer.
This completes the direct proof.

Method 2: Indirect Proof by Contradiction (Reductio Ad Absurdum)

When direct deduction from hypothesis P proves difficult, indirect proof by contradiction establishes the truth of P by demonstrating that assuming P is false leads inexorably to a logical impossibility.

Structure of Proof by Contradiction:
1. Target: Prove proposition P is TRUE.
2. Assumption: Assume proposition P is FALSE (assume not-P is TRUE).
3. Deduction: Derive valid mathematical consequences from this false premise.
4. Contradiction: Arrive at an absurdity (such as 1 = 0, or that an integer is both
   odd and even, or contradicting a known axiom).
5. Conclusion: Since valid deductive logic cannot produce a false result from a
   true premise, the assumption not-P must be FALSE.
   Therefore, proposition P must be TRUE.

Demonstration of Proof by Contradiction:
Theorem: There are infinitely many prime numbers (Euclid's Theorem).

Proof:
Step 1: Assume to the contrary that there are only finitely many primes:
        P = {p1, p2, p3, ..., pn}.
Step 2: Construct the large integer N by taking the product of all primes plus one:
        N = (p1 * p2 * p3 * ... * pn) + 1.
Step 3: Since N > 1, by the Fundamental Theorem of Arithmetic, N must have at least
        one prime factor q.
Step 4: Since P contains all primes, q must be one of the primes in P: q = pi.
Step 5: Since q divides N and q divides the product (p1*p2*...*pn), q must divide
        their difference:
        q divides [N - (p1*p2*...*pn)] = 1.
Step 6: But no prime number can divide 1!
        This contradiction proves the assumption was false.
        Therefore, there are infinitely many prime numbers.

Method 3: Disproof by Counterexample

While proving a universal statement requires showing it holds for all infinite cases, DISPROVING a universal statement requires discovering only ONE SINGLE CASE where it fails:

The Counterexample Principle:
To disprove the universal proposition "For all x, P(x) is true", you must find
exactly ONE specific instance c such that P(c) is FALSE.
This single instance c is called a Counterexample.

Demonstration of Counterexample:
Claim: "For every positive integer n, the polynomial n^2 - n + 41 generates a prime number."
Testing small values:
n = 1: 1 - 1 + 41 = 41 (Prime!)
n = 2: 4 - 2 + 41 = 43 (Prime!)
n = 3: 9 - 3 + 41 = 47 (Prime!)
In fact, it produces primes for all n from 1 up to 40!
However, consider n = 41:
41^2 - 41 + 41 = 41^2 = 1681 = 41 * 41.
Because 41^2 is divisible by 41, it is a composite number!
The single value n = 41 serves as a definitive COUNTEREXAMPLE that shatters the claim.

Chapter Exercises

Exercise 1: Prove directly that the square of any odd integer is always of the form 8*k + 1 for some integer k.

Exercise 2: Prove by contradiction that if n is an integer and 3*n + 2 is odd, then n must be odd.

Exercise 3: Disprove each of the following mathematical claims by providing a specific counterexample: (a) If a number is divisible by 4 and 6, it must be divisible by 24; (b) For all real numbers x, x^2 > x; and (c) The sum of any two irrational numbers is always irrational.

Solutions and Explanations

Solution 1: Let n be any odd integer. By definition, n can be expressed as n = 2m + 1 for some integer m. Squaring both sides: n^2 = (2m + 1)^2 = 4m^2 + 4m + 1 = 4m(m + 1) + 1. Notice the product m(m + 1): m and m + 1 are two consecutive integers. In any pair of consecutive integers, one of them must be an even integer (a multiple of 2). Therefore, m(m + 1) is an even integer, which can be written as m(m + 1) = 2k for some integer k. Substitute this into the equation: n^2 = 4(2k) + 1 = 8k + 1. This completes the direct proof that the square of any odd integer is of the form 8k + 1.

Solution 2: We wish to prove that if 3n + 2 is odd, then n is odd. Assume to the contrary that n is not odd, which means n is an even integer. By definition of an even integer, n = 2k for some integer k. Substitute this into the expression 3n + 2: 3n + 2 = 3(2k) + 2 = 6k + 2 = 2(3k + 1). Since k is an integer, let integer m = 3k + 1. Then: 3n + 2 = 2m. By definition, 2m is an even integer. This implies that 3n + 2 is even. However, this directly contradicts the given hypothesis that 3*n + 2 is odd. This contradiction proves that our assumption was false. Therefore, n must be an odd integer.

Solution 3: For claim (a), consider the number 12. 12 is divisible by 4 (12 / 4 = 3) and 12 is divisible by 6 (12 / 6 = 2). However, 12 is NOT divisible by 24 (12 / 24 = 0.5). Thus, 12 is a counterexample. For claim (b), consider x = 1/2. (1/2)^2 = 1/4. But 1/4 is strictly less than 1/2 (1/4 < 1/2), contradicting x^2 > x. (Similarly, x = 1 gives 1^2 = 1, and x = 0 gives 0^2 = 0). Thus, x = 1/2 is a counterexample. For claim (c), consider the two irrational numbers x = sqrt(2) and y = -sqrt(2). Both x and y are irrational. However, their sum is x + y = sqrt(2) + (-sqrt(2)) = 0. Since 0 is a rational number, this pair serves as a counterexample disproving the claim.