13.2 Deductive Logic, Inductive Reasoning, Counterexamples & Proof by Contradiction

13.2 Deductive Logic, Inductive Reasoning, Counterexamples & Proof by Contradiction

Mathematical reasoning forms the structural foundation of all quantitative knowledge. In middle-school education (Grades 4–8), students transition from empirical observations and pattern exploration to formal deductive logic and justification. The Texas Essential Knowledge and Skills (TEKS) require students to analyze mathematical relationships to connect and communicate mathematical ideas, display, explain, and justify mathematical ideas and arguments using precise mathematical language in written or oral communication.

---

Inductive Reasoning: Discovery, Conjectures, and Inherent Limitations

Inductive reasoning is the cognitive process of observing specific empirical instances, identifying underlying regularities or patterns, and formulating a generalized statement or conjecture.

The Role of Induction in Middle School

Inductive exploration is often the starting point for mathematical discovery in grades 4–8. For example, students investigating the sum of consecutive odd integers may calculate:

• $1 = 1 = 1^2$
• $1 + 3 = 4 = 2^2$
• $1 + 3 + 5 = 9 = 3^2$
• $1 + 3 + 5 + 7 = 16 = 4^2$

From these specific cases, students inductively formulate the conjecture: The sum of the first $n$ positive odd integers is equal to $n^2$.

The Fundamental Limitation of Inductive Reasoning

While induction is essential for generating hypotheses, empirical observation alone never constitutes mathematical proof. A conjecture may hold true for millions of consecutive cases, yet fail catastrophically for subsequent values. In mathematics, validity is not probabilistic; an assertion must hold across the entire infinite domain.

Classical Historical Failures of Pure Induction

1. Fermat's Conjecture on Primes:
   Pierre de Fermat examined the sequence of numbers $F_n = 2^{2^n} + 1$. He observed:

   • $F_0 = 2^1 + 1 = 3$ (prime)
   • $F_1 = 2^2 + 1 = 5$ (prime)
   • $F_2 = 2^4 + 1 = 17$ (prime)
   • $F_3 = 2^8 + 1 = 257$ (prime)
   • $F_4 = 2^{16} + 1 = 65,537$ (prime)

   Fermat conjectured that $F_n$ is prime for all non-negative integers $n$. However, in 1732, Leonhard Euler proved that for $n = 5$:

   $$F_5 = 2^{32} + 1 = 4,294,967,297 = 641 \times 6,700,417$$

   The conjecture was completely false; $F_5$ is composite.

2. Euler's Polynomial Generating Primes:
   The polynomial $P(n) = n^2 + n + 41$ produces prime numbers for every integer from $n = 0$ through $n = 39$ (forty consecutive primes). Inductive observation might lead a student to assert that $P(n)$ always yields primes. However, evaluating at $n = 40$ gives:

   $$P(40) = 40^2 + 40 + 41 = 40(40 + 1) + 41 = 40(41) + 41 = 41(40 + 1) = 41^2 = 1,681$$

   Since $1,681$ is divisible by $41$, the universal claim collapses.

---

The Decisive Power of Counterexamples

In formal logic, a universal proposition claims that a property $P(x)$ holds for all elements $x$ in a set $S$:

$$\forall x \in S, \quad P(x)$$

To prove a universal statement true, one must demonstrate that it holds for every single element in the domain—an impossible task via direct testing when the domain is infinite. However, disproving a universal statement requires only an existential negation:

$$\exists x \in S \quad \text{such that} \quad \sim P(x)$$

A single specific instance where the hypothesis is satisfied but the conclusion is false is called a counterexample. A single valid counterexample completely refutes a universal claim.

Common Middle-School Mathematical Misconceptions & Counterexamples

---

Deductive Reasoning & Formal Logical Arguments

Deductive reasoning is the process of deriving logically necessary conclusions from accepted premises, axioms, definitions, and previously established theorems. Unlike inductive reasoning, deductive reasoning guarantees absolute truth: if the premises are true and the rules of logical inference are valid, the conclusion must be true.

The Axiomatic Architecture of Mathematics

• Undefined Terms: Foundational concepts accepted intuitively without formal definition (e.g., point, line, plane, set).
• Definitions: Precise statements explaining the exact mathematical meaning of a term (e.g., a prime number is an integer greater than 1 whose only positive factors are 1 and itself).
• Axioms / Postulates: Foundational mathematical propositions accepted as universally true without proof (e.g., through any two points there exists exactly one straight line; the reflexive property $a = a$).
• Theorems: Mathematical statements whose truth has been rigorously established via deductive proof from axioms and definitions.

Fundamental Rules of Logical Inference

1. Law of Detachment (Modus Ponens): If a conditional statement $p \to q$ is true, and the hypothesis $p$ is true, then the conclusion $q$ is logically necessary.

   • Premise 1: $p \to q$
   • Premise 2: $p$
   • Conclusion: Therefore, $q$ Example: Premise 1: If a polygon is a regular hexagon, then the sum of its interior angles is $720^\circ$. Premise 2: Figure $G$ is a regular hexagon. Conclusion: The sum of the interior angles of Figure $G$ is $720^\circ$.

2. Law of Syllogism (Hypothetical Syllogism): Allows chaining two conditional statements when the conclusion of the first matches the hypothesis of the second.

   • Premise 1: $p \to q$
   • Premise 2: $q \to r$
   • Conclusion: Therefore, $p \to r$ Example: If a triangle is equilateral, then it is equiangular ($p \to q$). If a triangle is equiangular, then each interior angle measures $60^\circ$ ($q \to r$). Therefore, if a triangle is equilateral, then each interior angle measures $60^\circ$ ($p \to r$).

3. Law of Contraposition (Modus Tollens): If a conditional statement $p \to q$ is true, and the conclusion is false ($\sim q$), then the hypothesis must be false ($\sim p$).

   • Premise 1: $p \to q$
   • Premise 2: $\sim q$
   • Conclusion: Therefore, $\sim p$

Formal Logical Fallacies to Avoid

• Affirming the Consequent: Invalidly concluding $p$ from $p \to q$ and $q$. (e.g., "If it is raining, the grass is wet. The grass is wet; therefore, it is raining." This is invalid because sprinklers could have caused the wet grass).
• Denying the Antecedent: Invalidly concluding $\sim q$ from $p \to q$ and $\sim p$. (e.g., "If a figure is a square, it has four sides. Figure $T$ is not a square; therefore, Figure $T$ does not have four sides." This is invalid because a rectangle or trapezoid has four sides).

---

Conditional Statements: Converse, Inverse, and Contrapositive

A conditional statement (implication) is a proposition of the form "If $p$, then $q$", symbolized as $p \to q$.

• Hypothesis ($p$): The premise or antecedent condition.
• Conclusion ($q$): The consequent outcome.

From the primary conditional statement $p \to q$, three related conditional statements are formed:

1. Converse ($q \to p$): Swaps the hypothesis and the conclusion ("If $q$, then $p$").
2. Inverse ($\sim p \to \sim q$): Negates both the hypothesis and the conclusion ("If not $p$, then not $q$").
3. Contrapositive ($\sim q \to \sim p$): Swaps and negates both components ("If not $q$, then not $p$").

Truth Values and Logical Equivalence

Two statements are logically equivalent if and only if they produce identical truth values in every possible scenario.

Critical Truth Equivalence Principles

• The Conditional and Contrapositive are Logically Equivalent:

  $$p \to q \equiv \sim q \to \sim p$$

  If a conditional statement is mathematically true, its contrapositive is guaranteed to be true. If the conditional statement is false, its contrapositive is false.

• The Converse and Inverse are Logically Equivalent to Each Other:

  $$q \to p \equiv \sim p \to \sim q$$

  The inverse is simply the contrapositive of the converse.

• The Converse is NOT Logically Equivalent to the Original Statement:

  $$p \to q \not\equiv q \to p$$

  A true conditional statement does not imply that its converse is true! Concrete Example: Let $p \to q$ be: "If a polygon is a square ($p$), then it is a rectangle ($q$)". This statement is True.

  • Converse ($q \to p$): "If a polygon is a rectangle ($q$), then it is a square ($p$)". This statement is False (a $2 \times 5$ rectangle is not a square).
  • Inverse ($\sim p \to \sim q$): "If a polygon is not a square ($\sim p$), then it is not a rectangle ($\sim q$)". This statement is False (a rectangle that is not a square is still a rectangle).
  • Contrapositive ($\sim q \to \sim p$): "If a polygon is not a rectangle ($\sim q$), then it is not a square ($\sim p$)". This statement is True.

• Biconditional Statements ($p \leftrightarrow q$):
  When both a conditional statement $p \to q$ and its converse $q \to p$ are true simultaneously, they form a biconditional statement: "$p$ if and only if $q$" ($p \iff q$). All valid mathematical definitions are reversible biconditionals.

---

Direct vs. Indirect Proof (Proof by Contradiction)

1. Direct Proof

A direct proof begins with the known hypothesis $p$, assumed to be true, and uses a sequential chain of definitions, axioms, and previously proven theorems to arrive at the desired conclusion $q$.

Direct Proof Example: Sum of Two Odd Integers

• Theorem: If $x$ and $y$ are odd integers, then their sum $x + y$ is an even integer.
• Deductive Proof:
  1. By definition, an integer $x$ is odd if there exists an integer $k$ such that $x = 2k + 1$.
  2. Let $x = 2m + 1$ and $y = 2n + 1$ for some integers $m, n \in \mathbb{Z}$.
  3. Sum the expressions: $$x + y = (2m + 1) + (2n + 1) = 2m + 2n + 2$$
  4. Factor out a 2 using the distributive property: $$x + y = 2(m + n + 1)$$
  5. Since the set of integers is closed under addition, $m + n + 1$ is an integer. Let $p = m + n + 1$, where $p \in \mathbb{Z}$.
  6. Thus, $x + y = 2p$. By definition, any integer that can be expressed as 2 times an integer is even.
  7. Therefore, the sum of two odd integers is always even. Q.E.D.

2. Indirect Proof (Proof by Contradiction / Reductio Ad Absurdum)

An indirect proof by contradiction rests upon the fundamental logical principle of the Law of the Excluded Middle: any mathematical proposition is either true or false; it cannot be both, and it cannot be neither.

Procedural Structure of Proof by Contradiction:

1. To prove that a proposition $P$ is true, begin by assuming that its negation $\sim P$ is true.
2. Proceed through rigorous deductive steps, treating $\sim P$ as a valid premise.
3. Arrive at a logical contradiction—a statement that directly contradicts an established mathematical axiom, a known theorem, or the initial premise itself (e.g., deriving $0 = 1$, or demonstrating that an integer is simultaneously even and odd).
4. Conclude that because deductive reasoning preserves truth, the contradiction must stem from the flawed assumption $\sim P$.
5. Therefore, $\sim P$ is false, which proves that the original proposition $P$ must be true.

Classical Proof: The Irrationality of $\sqrt{2}$

• Theorem: The number $\sqrt{2}$ is irrational.
• Proof by Contradiction:
  1. Assume the negation is true: suppose $\sqrt{2}$ is a rational number.
  2. By definition of rational numbers, $\sqrt{2}$ can be written as the ratio of two integers in simplest form: $$\sqrt{2} = \frac{a}{b} \quad \text{where } a, b \in \mathbb{Z}^+, \quad b \ne 0, \quad \text{and } \gcd(a, b) = 1$$ (That is, the fraction $\frac{a}{b}$ is fully reduced, sharing no common factors other than 1).
  3. Square both sides of the equation: $$2 = \frac{a^2}{b^2} \implies a^2 = 2b^2$$
  4. Because $a^2 = 2b^2$, $a^2$ is a multiple of 2, meaning $a^2$ is an even integer. A known theorem of number theory dictates that if $a^2$ is even, then $a$ must also be even (since the square of an odd integer is always odd).
  5. Because $a$ is even, it can be written as $a = 2k$ for some integer $k$.
  6. Substitute $a = 2k$ back into the equation $a^2 = 2b^2$: $$(2k)^2 = 2b^2 \implies 4k^2 = 2b^2 \implies 2k^2 = b^2$$
  7. Because $b^2 = 2k^2$, $b^2$ is an even integer, which implies that $b$ must also be an even integer.
  8. The Contradiction: In step 4, we proved that $a$ is even (divisible by 2). In step 7, we proved that $b$ is even (divisible by 2). Therefore, both $a$ and $b$ share a common factor of 2. However, this directly contradicts our initial condition in step 2 that $\gcd(a, b) = 1$ (that $\frac{a}{b}$ was in simplest form).
  9. Because our assumption that $\sqrt{2}$ is rational leads to an unavoidable contradiction, that assumption must be false.
  10. Therefore, $\sqrt{2}$ is irrational. Q.E.D.

---

Reference Summary: Conditional Statement Relationships