Complementary Angles: Two angles whose measures sum to 90°.
Direct Proof: A proof that starts with given information and logically derives the conclusion.
- State the given information
- Use definitions and previously established theorems
- Apply logical reasoning to derive the conclusion
- Verify that each step follows logically
Let α and β be two angles that are complementary to the same angle γ.
This means: α + γ = 90° and β + γ = 90°
From the given: α + γ = 90° (equation 1)
β + γ = 90° (equation 2)
From equation 1: α = 90° - γ
From equation 2: β = 90° - γ
Since both α and β equal (90° - γ), then α = β
If two angles are complementary to the same angle, then they are equal. This is proven by showing that both angles equal (90° - the common angle).
• Definition of Complementary Angles: Sum equals 90°
• Algebraic Substitution: If A = C and B = C, then A = B
• Logical Deduction: Step-by-step reasoning
Prime Number: A natural number greater than 1 that has no positive divisors other than 1 and itself.
Proof by Contradiction: Assume the negation of what you want to prove and show this leads to a contradiction.
Assume there are only finitely many prime numbers: p₁, p₂, p₃, ..., pₙ
Let N = p₁ × p₂ × p₃ × ... × pₙ + 1
N is greater than 1, so it must have a prime divisor.
None of the primes p₁, p₂, ..., pₙ can divide N (since N leaves remainder 1 when divided by any of them).
Either N is prime itself or has a prime divisor not in our list, contradicting our assumption.
There are infinitely many prime numbers. This is proven by contradiction: assuming finitely many primes leads to the existence of a new prime not in the list.
• Proof by Contradiction: Assume ¬P and derive a contradiction
• Fundamental Theorem of Arithmetic: Every integer has a unique prime factorization
• Division Algorithm: If N = pq + r, then N ≡ r (mod p)
Triangle Sum Theorem: The sum of the three interior angles of any triangle is 180°.
Parallel Postulate: Through a point not on a line, there exists exactly one line parallel to the given line.
Consider triangle ABC with vertices A, B, and C
Through vertex A, draw a line DE parallel to side BC
∠DAB = ∠ABC (alternate interior angles)
∠EAC = ∠ACB (alternate interior angles)
∠DAB + ∠BAC + ∠EAC = 180° (straight angle at A)
∠ABC + ∠BAC + ∠ACB = 180°
The sum of the interior angles of a triangle equals 180°. This is proven by drawing a line through one vertex parallel to the opposite side and using properties of parallel lines.
• Parallel Line Properties: Alternate interior angles are equal
• Straight Angle Property: Angles on a straight line sum to 180°
• Logical Substitution: Replace equal angles in the equation
Mathematical Proof: A rigorous argument that establishes the truth of a mathematical statement.
Logical Implication: P → Q means "if P then Q".
Contrapositive: The contrapositive of P → Q is ¬Q → ¬P.
Converse: The converse of P → Q is Q → P.
- Direct Proof: Start with premises and derive conclusion
- Proof by Contradiction: Assume negation and find contradiction
- Proof by Contrapositive: Prove the contrapositive
- Mathematical Induction: For statements about integers
- Case Analysis: Consider all possible cases
Even Integer: An integer that can be expressed as 2k for some integer k.
Odd Integer: An integer that can be expressed as 2k+1 for some integer k.
We will prove: If n is odd, then n² is odd
If n is odd, then n = 2k + 1 for some integer k
n² = (2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1
Since n² = 2(2k² + 2k) + 1, n² is of the form 2j + 1 where j = 2k² + 2k
Since n² is odd, we have proven the contrapositive: If n is odd, then n² is odd
By proving the contrapositive, we have shown that if n² is even, then n must be even. This is because if n were odd, n² would also be odd.
• Contrapositive Equivalence: P → Q ≡ ¬Q → ¬P
• Definition of Odd/Even: Odd = 2k+1, Even = 2k
• Algebraic Expansion: (a + b)² = a² + 2ab + b²
Mathematical Induction: A proof technique for statements about positive integers that involves two steps: base case and inductive step.
For n = 1: Left side = 1, Right side = 1(1+1)/2 = 1
Both sides are equal, so the base case holds
Assume that the formula holds for some positive integer k:
1 + 2 + 3 + ... + k = k(k+1)/2
We need to show that the formula holds for k+1:
1 + 2 + 3 + ... + k + (k+1) = (k+1)((k+1)+1)/2
Left side = [1 + 2 + 3 + ... + k] + (k+1)
= k(k+1)/2 + (k+1) [by inductive hypothesis]
= (k+1)[k/2 + 1]
= (k+1)(k+2)/2
= (k+1)((k+1)+1)/2
By mathematical induction, the formula holds for all positive integers n
By mathematical induction, the sum of the first n positive integers equals n(n+1)/2 for all positive integers n. This is proven by verifying the base case and showing that if the formula holds for k, it also holds for k+1.
• Mathematical Induction: Base case + inductive step = proof for all n
• Inductive Hypothesis: Assume statement holds for k
• Algebraic Manipulation: Factor and simplify expressions
Mathematical Proof: A logical argument that establishes the truth of a mathematical statement.
Proposition: A statement that is either true or false.
Theorem: A significant proven statement.
Lemma: A proven statement used to prove other statements.
Corollary: A statement that follows easily from a proven theorem.
- Understand the statement: Identify what is given and what needs to be proven
- Choose the proof method: Direct, contradiction, contrapositive, or induction
- Plan the proof: Outline the logical steps needed
- Write the proof: Use clear, precise language with justification for each step
- Review: Verify that each step is valid and the conclusion follows
• Direct Proof: Assume P, derive Q
• Proof by Contradiction: Assume ¬P, derive contradiction
• Proof by Contrapositive: Prove ¬Q → ¬P
• Mathematical Induction: Prove P(1) and P(k) → P(k+1)
• Logical Equivalence: P → Q ≡ ¬Q → ¬P
• Direct proof
• Proof by contradiction
• Proof by contrapositive
• Mathematical induction
Analysis: Different proof methods are suited for different types of statements.
- Direct proof: When logical path is clear
- Contradiction: For proving non-existence or uniqueness
- Contrapositive: When direct proof is difficult
- Induction: For statements about integers