Study guide

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

TExES Mathematics 4-8 115

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview & Foundation

1.1 TExES 115 Exam Format, Scoring, Testing Tools & Certification Path 1.2 The Texas Essential Knowledge and Skills (TEKS) Framework & Mathematical Process Standards

2 Chapter 2: Number Systems & Quantity (Domain I)

2.1 Real and Complex Number Systems: Subsets, Closures & Representations 2.2 Place Value, Scientific Notation, Magnitude & Density Property 2.3 Properties of Real Numbers, Field Axioms & Inverse Operations

3 Chapter 3: Operations, Algorithms & Number Theory (Domain I)

3.1 Standard and Non-Standard Computational Algorithms for Rational Numbers 3.2 Laws of Exponents, Radicals, Rational Exponents & Mental Estimation 3.3 Number Theory: Prime Factorization, GCF, LCM & Divisibility Rules

4 Chapter 4: Patterns, Expressions & Algebraic Reasoning (Domain II)

4.1 Inductive Reasoning, Sequences, Arithmetic & Geometric Patterns 4.2 Algebraic Expressions, Polynomial Operations & Translating Verbal Statements 4.3 Solving Multi-Step Equations, Inequalities & Absolute Value Relations

5 Chapter 5: Linear Functions & Modeling (Domain II)

5.1 Slope, Rate of Change & Multiple Representations of Linear Functions 5.2 Linear Equation Forms (Slope-Intercept, Point-Slope, Standard) & Parallel/Perpendicular Lines 5.3 Systems of Linear Equations, Inequalities & Direct Variation Modeling

6 Chapter 6: Nonlinear Functions & Calculus Foundations (Domain II)

6.1 Quadratic Functions: Factoring, Vertex Form, Quadratic Formula & Parabolas 6.2 Exponential Growth/Decay, Inverse Variation & Rational Functions 6.3 Conceptual Foundations of Calculus: Limits, Rates of Change & Area Under Curves 6.4 Function Families & Transformations: Radical, Absolute Value, Piecewise, Logarithmic Functions and Quadratic Systems

7 Chapter 7: Measurement Systems & Trigonometric Ratios (Domain III)

7.1 Customary and Metric Systems, Conversion & Dimensional Analysis 7.2 Precision, Accuracy, Significant Figures & Measurement Error 7.3 The Pythagorean Theorem, Special Right Triangles & Right-Triangle Trigonometric Ratios

8 Chapter 8: Euclidean Geometry & Axiomatic Reasoning (Domain III)

8.1 Axiomatic Foundations: Points, Lines, Angles & Parallel Lines Cut by Transversals 8.2 Triangle Congruence Criteria (SSS, SAS, ASA, AAS, HL) & Deductive Proofs 8.3 Triangle Similarity (AA, SAS, SSS), Indirect Measurement & Scale Factors 8.4 Geometric Constructions with Compass, Straightedge & Reflection Devices

9 Chapter 9: Two- and Three-Dimensional Figures (Domain III)

9.1 Properties and Formulas for Polygons & Circles 9.2 Three-Dimensional Figures: Prisms, Pyramids, Cylinders, Cones & Spheres 9.3 Surface Area, Volume & Scale Factor Effects on Length, Area (k²), and Volume (k³)

10 Chapter 10: Transformational & Coordinate Geometry (Domain III)

10.1 Rigid Transformations: Translations, Reflections, Rotations & Symmetry 10.2 Non-Rigid Dilations, Scale Factors & Tessellations 10.3 Coordinate Geometry: Distance Formula, Midpoint Formula & Analytic Proofs 10.4 The Unit Circle, Radian Measure & Trigonometric Functions

11 Chapter 11: Data Exploration & Numerical Techniques (Domain IV)

11.1 Data Representations: Frequency Tables, Histograms, Stem-and-Leaf, Dot Plots & Box Plots 11.2 Measures of Central Tendency (Mean, Median, Mode) & Spread (Range, IQR, Standard Deviation) 11.3 Skewed Distributions, Outlier Effects & Bivariate Scatter Plots (Trend Lines & Correlation)

12 Chapter 12: Probability Theory & Statistical Inference (Domain IV)

12.1 Theoretical vs. Experimental Probability, Sample Spaces & Counting Principles (Permutations/Combinations) 12.2 Compound Events, Independent/Dependent Events & Conditional Probability 12.3 Random Sampling, Bias, Simulations, Expected Value & Population Predictions 12.4 Binomial, Geometric & Normal Distributions, Experiments and Confidence Intervals

13 Chapter 13: Mathematical Processes & Financial Literacy (Domain V)

13.1 Polya's Problem-Solving Model & Mathematical Heuristics (Visualizing, Tables, Working Backward) 13.2 Deductive Logic, Inductive Reasoning, Counterexamples & Proof by Contradiction 13.3 Multiple Representations, Cross-Disciplinary Connections & Personal Financial Literacy in TEKS

14 Chapter 14: Mathematical Learning & Student Cognition (Domain VI)

14.1 Cognitive Development in Middle School: Piaget, Vygotsky & Bruner's CPA Framework 14.2 Vertical TEKS Mathematics Progression Across Grades 4 through 8 14.3 Diagnosing and Remediating Persistent Student Mathematical Misconceptions

15 Chapter 15: Instruction, Assessment & Technology in Mathematics (Domain VI)

15.1 Planning Inquiry-Centered Math Lessons & Productive Discourse/Questioning 15.2 Effective Use of Concrete Manipulatives, Graphing Technology & Digital Tools 15.3 Formative vs. Summative Assessment, Rubrics, STAAR Context & Data-Driven Differentiation

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

Key Takeaways Explain This Topic AI

Inductive reasoning generalizes from specific empirical cases to formulate conjectures, but empirical observations alone never constitute formal mathematical proof.

Deductive reasoning establishes incontrovertible mathematical truths by deriving conclusions through valid logical rules (such as Modus Ponens and Syllogism) applied to accepted axioms, definitions, and proven theorems.

A single valid counterexample is mathematically sufficient to disprove a universal statement (e.g., ∀x, P(x)), whereas confirming millions of positive examples cannot prove it.

For any conditional statement p → q, the contrapositive (~q → ~p) is logically equivalent and always shares its truth value, while the converse (q → p) and inverse (~p → ~q) are logically equivalent to each other but not to the original statement.

Proof by contradiction (reductio ad absurdum) establishes the truth of proposition P by assuming its negation ~P and deductively deriving a logical impossibility or contradiction with established mathematical axioms.

Last updated: September 2026

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 = 1 = 1^2 1 = 1 = 1 2
  • 1 + 3 = 4 = 2 2 1 + 3 = 4 = 2^2 1 + 3 = 4 = 2 2
  • 1 + 3 + 5 = 9 = 3 2 1 + 3 + 5 = 9 = 3^2 1 + 3 + 5 = 9 = 3 2
  • 1 + 3 + 5 + 7 = 16 = 4 2 1 + 3 + 5 + 7 = 16 = 4^2 1 + 3 + 5 + 7 = 16 = 4 2

From these specific cases, students inductively formulate the conjecture: The sum of the first n n n positive odd integers is equal to n 2 n^2 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

Fermat's Conjecture on Primes:

Pierre de Fermat examined the sequence of numbers F n = 2 2 n + 1 F_n = 2^{2^n} + 1 F n ​ = 2 2 n + 1 . He observed:

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

Fermat conjectured that F n F_n F n ​ is prime for all non-negative integers n n n . However, in 1732, Leonhard Euler proved that for n = 5 n = 5 n = 5 : F 5 = 2 32 + 1 = 4 , 294 , 967 , 297 = 641 × 6 , 700 , 417 F_5 = 2^{32} + 1 = 4,294,967,297 = 641 \times 6,700,417 F 5 ​ = 2 32 + 1 = 4 , 294 , 967 , 297 = 641 × 6 , 700 , 417

The conjecture was completely false; F 5 F_5 F 5 ​ is composite.

Euler's Polynomial Generating Primes:

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

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

The Decisive Power of Counterexamples

In formal logic, a universal proposition claims that a property P ( x ) P(x) P ( x ) holds for all elements x x x in a set S S S : ∀ x ∈ S , P ( x ) \forall x \in S, \quad P(x) ∀ x ∈ S , 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 : ∃ x ∈ S such that ∼ P ( x ) \exists x \in S \quad \text{such that} \quad \sim P(x) ∃ x ∈ S such that ∼ 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

Universal Claim / Student Misconception Mathematical Reality Decisive Counterexample

"All prime numbers are odd." The definition of a prime requires exactly two distinct positive divisors: 1 1 1 and itself. The number 2 2 2 is prime ( 2 = 1 × 2 2 = 1 \times 2 2 = 1 × 2 ) and even.

"Multiplication always results in a product larger than both factors." True for integers > 1 > 1 > 1 , but fails for zero, proper fractions, and negative numbers. 8 × 1 2 = 4 8 \times \frac{1}{2} = 4 8 × 2 1 ​ = 4 , where 4 < 8 4 < 8 4 < 8 . Alternatively, 5 × 0 = 0 < 5 5 \times 0 = 0 < 5 5 × 0 = 0 < 5 .

"If a quadrilateral has four congruent sides, it must be a square." A quadrilateral with four congruent sides is equilateral, which defines a rhombus. A rhombus with interior angles of 60 ∘ 60^\circ 6 0 ∘ and 120 ∘ 120^\circ 12 0 ∘ has four congruent sides but is not a square.

"Increasing the perimeter of a rectangle always increases its area." Perimeter and area represent distinct geometric dimensional measures. Rectangle A ( 4 × 4 4 \times 4 4 × 4 ): P = 16 P = 16 P = 16 , A = 16 A = 16 A = 16 . Rectangle B ( 1 × 8 1 \times 8 1 × 8 ): P = 18 P = 18 P = 18 , A = 8 A = 8 A = 8 . Perimeter increased from 16 16 16 to 18 18 18 , but area decreased from 16 16 16 to 8 8 8 .

"Squaring any real number produces a number strictly greater than the original number." Holds for numbers > 1 > 1 > 1 and for all negative numbers, but fails on the interval [ 0 , 1 ] [0, 1] [ 0 , 1 ] . Let x = 0.5 x = 0.5 x = 0.5 . Then x 2 = 0.25 x^2 = 0.25 x 2 = 0.25 , and 0.25 < 0.5 0.25 < 0.5 0.25 < 0.5 . Alternatively, 0 2 = 0 0^2 = 0 0 2 = 0 and 1 2 = 1 1^2 = 1 1 2 = 1 .

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 a = a a = a ).

Theorems: Mathematical statements whose truth has been rigorously established via deductive proof from axioms and definitions.

Fundamental Rules of Logical Inference

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

  • Premise 1: p → q p \to q p → q
  • Premise 2: p p p

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

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 → q p \to q p → q
  • Premise 2: q → r q \to r q → r

Conclusion: Therefore, p → r p \to r p → r Example: If a triangle is equilateral, then it is equiangular ( p → q p \to q p → q ). If a triangle is equiangular, then each interior angle measures 60 ∘ 60^\circ 6 0 ∘ ( q → r q \to r q → r ). Therefore, if a triangle is equilateral, then each interior angle measures 60 ∘ 60^\circ 6 0 ∘ ( p → r p \to r p → r ).

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

  • Premise 1: p → q p \to q p → q
  • Premise 2: ∼ q \sim q ∼ q
  • Conclusion: Therefore, ∼ p \sim p ∼ p
  • Formal Logical Fallacies to Avoid

Affirming the Consequent: Invalidly concluding p p p from p → q p \to q p → q and q q 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 ∼ q \sim q ∼ q from p → q p \to q p → q and ∼ p \sim p ∼ p . (e.g., "If a figure is a square, it has four sides. Figure T T T is not a square; therefore, Figure T T 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 p p , then q q q ", symbolized as p → q p \to q p → q .

Hypothesis ( p p p ): The premise or antecedent condition.

Conclusion ( q q q ): The consequent outcome.

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

Converse ( q → p q \to p q → p ): Swaps the hypothesis and the conclusion ("If q q q , then p p p ").

Inverse ( ∼ p → ∼ q \sim p \to \sim q ∼ p →∼ q ): Negates both the hypothesis and the conclusion ("If not p p p , then not q q q ").

Contrapositive ( ∼ q → ∼ p \sim q \to \sim p ∼ q →∼ p ): Swaps and negates both components ("If not q q q , then not p p p ").

Truth Values and Logical Equivalence

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

p p p q q q Conditional: p → q p \to q p → q Converse: q → p q \to p q → p Inverse: ∼ p → ∼ q \sim p \to \sim q ∼ p →∼ q Contrapositive: ∼ q → ∼ p \sim q \to \sim p ∼ q →∼ p

  • T T T T T T
  • T F F T T F
  • F T T F F T
  • F F T T T T
  • Critical Truth Equivalence Principles

The Conditional and Contrapositive are Logically Equivalent: p → q ≡ ∼ q → ∼ p p \to q \equiv \sim q \to \sim p p → q ≡∼ q →∼ 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 → p ≡ ∼ p → ∼ q q \to p \equiv \sim p \to \sim q q → p ≡∼ p →∼ q

The inverse is simply the contrapositive of the converse.

The Converse is NOT Logically Equivalent to the Original Statement: p → q ≢ q → p p \to q \not\equiv q \to p p → q  ≡ q → p

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

Converse ( q → p q \to p q → p ): "If a polygon is a rectangle ( q q q ), then it is a square ( p p p )". This statement is False (a 2 × 5 2 \times 5 2 × 5 rectangle is not a square).

Inverse ( ∼ p → ∼ q \sim p \to \sim q ∼ p →∼ q ): "If a polygon is not a square ( ∼ p \sim p ∼ p ), then it is not a rectangle ( ∼ q \sim q ∼ q )". This statement is False (a rectangle that is not a square is still a rectangle).

Contrapositive ( ∼ q → ∼ p \sim q \to \sim p ∼ q →∼ p ): "If a polygon is not a rectangle ( ∼ q \sim q ∼ q ), then it is not a square ( ∼ p \sim p ∼ p )". This statement is True .

Biconditional Statements ( p ↔ q p \leftrightarrow q p ↔ q ):

When both a conditional statement p → q p \to q p → q and its converse q → p q \to p q → p are true simultaneously, they form a biconditional statement: " p p p if and only if q q q " ( p ⟺ q p \iff q p ⟺ 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 p p , assumed to be true, and uses a sequential chain of definitions, axioms, and previously proven theorems to arrive at the desired conclusion q q q .

Direct Proof Example: Sum of Two Odd Integers

Theorem: If x x x and y y y are odd integers, then their sum x + y x + y x + y is an even integer.

Deductive Proof:

By definition, an integer x x x is odd if there exists an integer k k k such that x = 2 k + 1 x = 2k + 1 x = 2 k + 1 .

Let x = 2 m + 1 x = 2m + 1 x = 2 m + 1 and y = 2 n + 1 y = 2n + 1 y = 2 n + 1 for some integers m , n ∈ Z m, n \in \mathbb{Z} m , n ∈ Z .

Sum the expressions: x + y = ( 2 m + 1 ) + ( 2 n + 1 ) = 2 m + 2 n + 2 x + y = (2m + 1) + (2n + 1) = 2m + 2n + 2 x + y = ( 2 m + 1 ) + ( 2 n + 1 ) = 2 m + 2 n + 2

Factor out a 2 using the distributive property: x + y = 2 ( m + n + 1 ) x + y = 2(m + n + 1) x + y = 2 ( m + n + 1 )

Since the set of integers is closed under addition, m + n + 1 m + n + 1 m + n + 1 is an integer. Let p = m + n + 1 p = m + n + 1 p = m + n + 1 , where p ∈ Z p \in \mathbb{Z} p ∈ Z .

Thus, x + y = 2 p x + y = 2p x + y = 2 p . By definition, any integer that can be expressed as 2 times an integer is even.

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:

To prove that a proposition P P P is true, begin by assuming that its negation ∼ P \sim P ∼ P is true.

Proceed through rigorous deductive steps, treating ∼ P \sim P ∼ P as a valid premise.

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 0 = 1 0 = 1 , or demonstrating that an integer is simultaneously even and odd).

Conclude that because deductive reasoning preserves truth, the contradiction must stem from the flawed assumption ∼ P \sim P ∼ P .

Therefore, ∼ P \sim P ∼ P is false, which proves that the original proposition P P P must be true.

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

Theorem: The number 2 \sqrt{2} 2 ​ is irrational.

Proof by Contradiction:

Assume the negation is true: suppose 2 \sqrt{2} 2 ​ is a rational number.

By definition of rational numbers, 2 \sqrt{2} 2 ​ can be written as the ratio of two integers in simplest form: 2 = a b where a , b ∈ Z + , b ≠ 0 , and gcd ⁡ ( a , b ) = 1 \sqrt{2} = \frac{a}{b} \quad \text{where } a, b \in \mathbb{Z}^+, \quad b \ne 0, \quad \text{and } \gcd(a, b) = 1 2 ​ = b a ​ where a , b ∈ Z + , b  = 0 , and g cd ( a , b ) = 1 (That is, the fraction a b \frac{a}{b} b a ​ is fully reduced, sharing no common factors other than 1).

Square both sides of the equation: 2 = a 2 b 2 ⟹ a 2 = 2 b 2 2 = \frac{a^2}{b^2} \implies a^2 = 2b^2 2 = b 2 a 2 ​ ⟹ a 2 = 2 b 2

Because a 2 = 2 b 2 a^2 = 2b^2 a 2 = 2 b 2 , a 2 a^2 a 2 is a multiple of 2, meaning a 2 a^2 a 2 is an even integer. A known theorem of number theory dictates that if a 2 a^2 a 2 is even, then a a a must also be even (since the square of an odd integer is always odd).

Because a a a is even, it can be written as a = 2 k a = 2k a = 2 k for some integer k k k .

Substitute a = 2 k a = 2k a = 2 k back into the equation a 2 = 2 b 2 a^2 = 2b^2 a 2 = 2 b 2 : ( 2 k ) 2 = 2 b 2 ⟹ 4 k 2 = 2 b 2 ⟹ 2 k 2 = b 2 (2k)^2 = 2b^2 \implies 4k^2 = 2b^2 \implies 2k^2 = b^2 ( 2 k ) 2 = 2 b 2 ⟹ 4 k 2 = 2 b 2 ⟹ 2 k 2 = b 2

Because b 2 = 2 k 2 b^2 = 2k^2 b 2 = 2 k 2 , b 2 b^2 b 2 is an even integer, which implies that b b b must also be an even integer.

The Contradiction: In step 4, we proved that a a a is even (divisible by 2). In step 7, we proved that b b b is even (divisible by 2). Therefore, both a a a and b b b share a common factor of 2. However, this directly contradicts our initial condition in step 2 that gcd ⁡ ( a , b ) = 1 \gcd(a, b) = 1 g cd ( a , b ) = 1 (that a b \frac{a}{b} b a ​ was in simplest form).

Because our assumption that 2 \sqrt{2} 2 ​ is rational leads to an unavoidable contradiction, that assumption must be false.

Therefore, 2 \sqrt{2} 2 ​ is irrational. Q.E.D.

Reference Summary: Conditional Statement Relationships

Form Name Symbolic Representation Natural Language Formulation Logical Equivalence

Conditional Statement p → q p \to q p → q "If a figure is a square, then it is a polygon." Equivalent to Contrapositive ( p → q ≡ ∼ q → ∼ p p \to q \equiv \sim q \to \sim p p → q ≡∼ q →∼ p )

Converse q → p q \to p q → p "If a figure is a polygon, then it is a square." Equivalent to Inverse ( q → p ≡ ∼ p → ∼ q q \to p \equiv \sim p \to \sim q q → p ≡∼ p →∼ q )

Inverse ∼ p → ∼ q \sim p \to \sim q ∼ p →∼ q "If a figure is not a square, then it is not a polygon." Equivalent to Converse ( ∼ p → ∼ q ≡ q → p \sim p \to \sim q \equiv q \to p ∼ p →∼ q ≡ q → p )

Contrapositive ∼ q → ∼ p \sim q \to \sim p ∼ q →∼ p "If a figure is not a polygon, then it is not a square." Equivalent to Conditional ( ∼ q → ∼ p ≡ p → q \sim q \to \sim p \equiv p \to q ∼ q →∼ p ≡ p → q )

Biconditional p ↔ q p \leftrightarrow q p ↔ q "A figure is a square if and only if it is a regular four-sided polygon." True only when p → q p \to q p → q and q → p q \to p q → p are both true

Loading diagram... Logical Equivalence Architecture of Conditional Statements and Proof Pathways