Solved Exercises on Advanced Proofs and Reasoning in Geometry

Master advanced proofs and reasoning: proving theorems, indirect proofs, proof by contradiction, and logical reasoning through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Direct proof
Exercise 1
Prove that if two angles are complementary to the same angle, then they are equal to each other.
Definition:

Complementary Angles: Two angles whose measures sum to 90°.

Direct Proof: A proof that starts with given information and logically derives the conclusion.

Direct Proof Method:
  1. State the given information
  2. Use definitions and previously established theorems
  3. Apply logical reasoning to derive the conclusion
  4. Verify that each step follows logically
Given
α + γ = 90°, β + γ = 90°
Prove
α = β
Step 1: State the given

Let α and β be two angles that are complementary to the same angle γ.
This means: α + γ = 90° and β + γ = 90°

Step 2: Set up the equations

From the given: α + γ = 90° (equation 1)
β + γ = 90° (equation 2)

Step 3: Apply algebraic reasoning

From equation 1: α = 90° - γ
From equation 2: β = 90° - γ

Step 4: Derive the conclusion

Since both α and β equal (90° - γ), then α = β

α = β
Final answer:

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

Applied rules:

• Definition of Complementary Angles: Sum equals 90°

• Algebraic Substitution: If A = C and B = C, then A = B

• Logical Deduction: Step-by-step reasoning

2 Indirect proof
Exercise 2
Prove by contradiction that there are infinitely many prime numbers.
Definition:

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.

Method
Proof by Contradiction
Result
Infinitely many primes
Contradiction
New prime found
Step 1: Assume the opposite

Assume there are only finitely many prime numbers: p₁, p₂, p₃, ..., pₙ

Step 2: Construct a new number

Let N = p₁ × p₂ × p₃ × ... × pₙ + 1

Step 3: Analyze N

N is greater than 1, so it must have a prime divisor.

Step 4: Show contradiction

None of the primes p₁, p₂, ..., pₙ can divide N (since N leaves remainder 1 when divided by any of them).

Step 5: Conclude

Either N is prime itself or has a prime divisor not in our list, contradicting our assumption.

Infinitely many primes exist
Final answer:

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.

Applied rules:

• 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)

3 Proving geometric theorems
Exercise 3
Prove the Triangle Sum Theorem: The sum of the interior angles of a triangle equals 180°.
Definition:

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.

Theorem
∠A + ∠B + ∠C = 180°
Method
Parallel Lines
Result
Sum = 180°
Step 1: Draw triangle ABC

Consider triangle ABC with vertices A, B, and C

Step 2: Draw parallel line

Through vertex A, draw a line DE parallel to side BC

Step 3: Apply parallel line properties

∠DAB = ∠ABC (alternate interior angles)
∠EAC = ∠ACB (alternate interior angles)

Step 4: Use straight angle property

∠DAB + ∠BAC + ∠EAC = 180° (straight angle at A)

Step 5: Substitute and conclude

∠ABC + ∠BAC + ∠ACB = 180°

∠A + ∠B + ∠C = 180°
Final answer:

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.

Applied rules:

• 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

Advanced Proof Techniques and Logical Reasoning
P \Rightarrow Q \equiv \neg Q \Rightarrow \neg P
Contrapositive Equivalence
Direct Proof
P → Q
Assume P, prove Q
Proof by Contradiction
¬P → ⊥
Assume ¬P, derive contradiction
Proof by Contrapositive
¬Q → ¬P
Prove contrapositive equivalent
Key Definitions:

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.

Proof Methods:
  1. Direct Proof: Start with premises and derive conclusion
  2. Proof by Contradiction: Assume negation and find contradiction
  3. Proof by Contrapositive: Prove the contrapositive
  4. Mathematical Induction: For statements about integers
  5. Case Analysis: Consider all possible cases
Logical Equivalences: P → Q ≡ ¬Q → ¬P ≢ Q → P (converse is not equivalent).
Proof Structure: Given → Known facts → Logic → Conclusion.
Mathematical Rigor: Every step must be justified by axioms, definitions, or proven theorems.
Tip 1: Always state what you're given and what you need to prove.
Tip 2: Use precise mathematical language and notation.
Tip 3: Justify each step in your proof with a theorem, definition, or axiom.
Solution: Exercises 4 to 5
4 Proof by contrapositive
Exercise 4
Prove by contrapositive: If n² is even, then n is even. (Note: This is equivalent to proving: If n is odd, then n² is odd.)
Definition:

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.

Original
n² even → n even
Contrapositive
n odd → n² odd
Method
Direct Proof
Step 1: State the contrapositive

We will prove: If n is odd, then n² is odd

Step 2: Assume n is odd

If n is odd, then n = 2k + 1 for some integer k

Step 3: Calculate n²

n² = (2k + 1)² = 4k² + 4k + 1 = 2(2k² + 2k) + 1

Step 4: Show n² is odd

Since n² = 2(2k² + 2k) + 1, n² is of the form 2j + 1 where j = 2k² + 2k

Step 5: Conclude

Since n² is odd, we have proven the contrapositive: If n is odd, then n² is odd

n² even → n even
Final answer:

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.

Applied rules:

• Contrapositive Equivalence: P → Q ≡ ¬Q → ¬P

• Definition of Odd/Even: Odd = 2k+1, Even = 2k

• Algebraic Expansion: (a + b)² = a² + 2ab + b²

5 Mathematical induction
Exercise 5
Prove by mathematical induction that 1 + 2 + 3 + ... + n = n(n+1)/2 for all positive integers n.
Definition:

Mathematical Induction: A proof technique for statements about positive integers that involves two steps: base case and inductive step.

Formula
∑k=1 to n k = n(n+1)/2
Method
Induction
Result
True for all n ≥ 1
Step 1: Prove base case

For n = 1: Left side = 1, Right side = 1(1+1)/2 = 1
Both sides are equal, so the base case holds

Step 2: State inductive hypothesis

Assume that the formula holds for some positive integer k:
1 + 2 + 3 + ... + k = k(k+1)/2

Step 3: Prove inductive step

We need to show that the formula holds for k+1:
1 + 2 + 3 + ... + k + (k+1) = (k+1)((k+1)+1)/2

Step 4: Use inductive hypothesis

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

Step 5: Conclude

By mathematical induction, the formula holds for all positive integers n

∑k=1 to n k = n(n+1)/2
Final answer:

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.

Applied rules:

• Mathematical Induction: Base case + inductive step = proof for all n

• Inductive Hypothesis: Assume statement holds for k

• Algebraic Manipulation: Factor and simplify expressions

Complete Guide: Advanced Proofs and Reasoning
\text{If } P \text{ is true and } P \Rightarrow Q \text{, then } Q \text{ is true}
Modus Ponens
Key definitions:

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.

Complete methodology:
  1. Understand the statement: Identify what is given and what needs to be proven
  2. Choose the proof method: Direct, contradiction, contrapositive, or induction
  3. Plan the proof: Outline the logical steps needed
  4. Write the proof: Use clear, precise language with justification for each step
  5. Review: Verify that each step is valid and the conclusion follows
Tip 1: Start with a clear statement of what you're given and what you need to prove.
Tip 2: When using proof by contradiction, be explicit about what you're assuming.
Tip 3: In induction proofs, clearly label the base case and inductive step.
Tip 4: Use diagrams when they help clarify geometric arguments.
Common errors: Assuming what you're trying to prove, circular reasoning, unjustified steps.
Exam preparation: Practice all proof methods and learn common proof patterns.
Rules to know by heart:

• 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

Proof Methods Comparison
Exercise 6: Method Effectiveness
Compare effectiveness of different proof methods:
• 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

Questions & Answers

Question: How do I know which proof method to use for a particular problem? It seems like there are so many options.

Answer: Here's a systematic approach to choosing proof methods:

  • Direct Proof: Try this first if the logical path from assumptions to conclusion is clear and straightforward
  • Proof by Contrapositive: Use when the contrapositive statement seems easier to prove than the original
  • Proof by Contradiction: Use when you're proving non-existence, uniqueness, or when assuming the negation leads to something obviously false
  • Mathematical Induction: Use for statements about positive integers or recursively defined sequences

With practice, you'll develop intuition for which method works best. Start with direct proof, and if that doesn't work, consider the alternatives.

Look for clues in the statement: universal quantifiers often suggest direct proof, while existential statements might require contradiction.

Question: What's the difference between a theorem, lemma, and corollary? They all seem like things that are proven.

Answer: The differences are about importance and role in mathematical development:

  • Theorem: A major, significant result that answers an important question. Example: Pythagorean Theorem
  • Lemma: A smaller result that is used to prove a more important theorem. Think of it as a "stepping stone." Example: Euclid's Lemma
  • Corollary: A result that follows directly from a theorem with little additional proof needed. Example: Corollary to the Fundamental Theorem of Calculus

The distinction is somewhat subjective and can vary by context. A lemma in one paper might be a theorem in another if it's particularly important in that context.

Think of them as: Lemmas help prove theorems, corollaries follow from theorems.

Question: Can you explain the difference between the contrapositive and the converse? They seem similar.

Answer: Starting with the implication "If P, then Q" (P → Q), we have:

  • Original: P → Q
  • Contrapositive: ¬Q → ¬P (negate both sides and reverse)
  • Converse: Q → P (reverse the order)
  • Inverse: ¬P → ¬Q (negate both sides)

Key differences:

• The contrapositive is logically equivalent to the original statement

• The converse is NOT equivalent to the original statement

Example: "If it's raining, then the ground is wet" (P → Q)

Contrapositive: "If the ground is not wet, then it's not raining" (¬Q → ¬P) - TRUE

Converse: "If the ground is wet, then it's raining" (Q → P) - FALSE (could be dew)

This is why proof by contrapositive is valid, but proving the converse doesn't prove the original.