Reasoning and proof Knowledge-Based Study
Math topic explanations on Reasoning and proof.
Study notes
Inductive vs. Deductive Reasoning
Mathematical arguments in geometry rely on two primary modes of reasoning: inductive reasoning and deductive reasoning.
Inductive Reasoning and Conjectures
Inductive reasoning is the process of looking for patterns, observing specific examples, and arriving at a generalized conclusion called a conjecture.
- A conjecture is an unproven statement that is based on observations.
- To show that a conjecture is false, you only need to provide one counterexample—a single specific case for which the conjecture fails.
- Example: If a student observes that four different right triangles each have acute angles measuring and , claiming that “all right triangles contain a angle” is a conjecture. A right triangle with acute angles measuring and serves as a counterexample disproving the conjecture.
Deductive Reasoning
Deductive reasoning uses known facts, definitions, accepted postulates, and confirmed theorems to form a logical argument. Unlike inductive reasoning, deductive reasoning guarantees that if the premises are true, the conclusion must also be true.
Structure of Conditional Statements
A conditional statement is a logical statement that has two parts: a hypothesis and a conclusion. In standard form, it is written as an “if-then” statement: (read “if , then ”).
- Hypothesis (): The phrase immediately following the word “if”.
- Conclusion (): The phrase immediately following the word “then”.
Related Conditionals
Given the original statement , three related conditionals can be formed:
- Converse (): Formed by switching the hypothesis and conclusion.
- Inverse (): Formed by negating both the hypothesis and the conclusion.
- Contrapositive (): Formed by negating and switching both the hypothesis and the conclusion.
Logical Equivalence and Biconditionals
Statements that share the same truth value are logically equivalent. A conditional statement is always logically equivalent to its contrapositive, while the converse is logically equivalent to the inverse.
When a conditional statement and its converse are both true, they can be combined using the phrase “if and only if” to form a biconditional statement, denoted symbolically as .
Fundamental Laws of Deductive Inference
Valid deductive reasoning relies on established logical laws to derive conclusions from true conditional statements.
The Law of Detachment
If a conditional statement is true and the hypothesis is true, then the conclusion is true.
- Premise 1: If two lines intersect to form a right angle, then they are perpendicular.
- Premise 2: Line and line intersect to form a right angle.
- Conclusion: Line and line are perpendicular.
The Law of Syllogism
The Law of Syllogism allows you to draw a conclusion from two conditional statements when the conclusion of one is the hypothesis of the other.
If is true and is true, then is also true.
- Premise 1: If a polygon is a regular pentagon, then it has five congruent sides.
- Premise 2: If a polygon has five congruent sides, then it has five congruent interior angles.
- Conclusion: If a polygon is a regular pentagon, then it has five congruent interior angles.
Constructing Formal Proofs
A geometric proof is a logical sequence of statements, each supported by an accepted reason, demonstrating that a conjecture is universally true.
Algebraic and Geometric Properties
Proofs frequently cite algebraic properties applied to geometric quantities (such as segment lengths or angle measures) as well as equivalence properties of congruence:
- Reflexive Property: or .
- Symmetric Property: If , then ; if , then .
- Transitive Property: If and , then .
- Substitution Property: If , then may be replaced by in any expression or equation.
Two-Column Proofs
A standard two-column proof organizes the argument into two parallel lists: Statements on the left (the mathematical assertions) and Reasons on the right (the definitions, postulates, given information, or previously proven theorems that justify each step).
Every proof begins with the Given conditions and concludes when the target statement is derived through direct deductive steps.

