Proofs of Irrationality in Algebra 1

Master proofs of irrationality: proof by contradiction, proving √2 is irrational, and extending to other numbers through these 5 detailed exercises with comprehensive summary.

Solution: Exercises 1 to 3
1 Classic proof of √2
Exercise 1
Prove that \(\sqrt{2}\) is irrational using proof by contradiction.
Definition:

Rational number: A number that can be expressed as \(\frac{p}{q}\) where \(p\) and \(q\) are integers and \(q \neq 0\).

Irrational number: A number that cannot be expressed as a fraction of two integers.

Proof by contradiction method:
  1. Assume the opposite of what you want to prove
  2. Use logical reasoning to derive a contradiction
  3. Conclude that the original assumption must be false
Assume
\(\sqrt{2} = \frac{p}{q}\)
Square
\(2 = \frac{p^2}{q^2}\)
Cross
\(2q^2 = p^2\)
Contradiction
Both even
Step 1: Assume \(\sqrt{2}\) is rational

Suppose \(\sqrt{2} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors (fraction in lowest terms)

Step 2: Square both sides

\((\sqrt{2})^2 = \left(\frac{p}{q}\right)^2\)

\(2 = \frac{p^2}{q^2}\)

Step 3: Cross multiply

\(2q^2 = p^2\)

This means \(p^2\) is even, so \(p\) must be even

Step 4: Express p as even

Since \(p\) is even, we can write \(p = 2k\) for some integer \(k\)

Substituting: \(2q^2 = (2k)^2 = 4k^2\)

So \(q^2 = 2k^2\), which means \(q^2\) is even

Step 5: Derive contradiction

If \(q^2\) is even, then \(q\) must be even

But this means both \(p\) and \(q\) are even, so they share a common factor of 2

This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms

Step 6: Conclude

Since our assumption led to a contradiction, \(\sqrt{2}\) cannot be rational

Therefore, \(\sqrt{2}\) is irrational

\(\sqrt{2}\) is irrational
Final answer:

\(\sqrt{2}\) is irrational because assuming it is rational leads to a contradiction.

Applied rules:

• Proof by contradiction: Assume opposite, derive contradiction

• Even number property: If \(n^2\) is even, then \(n\) is even

• Coprime condition: Any rational can be expressed in lowest terms

2 Proof for √3
Exercise 2
Prove that \(\sqrt{3}\) is irrational using proof by contradiction.
Definition:

Prime number: A natural number greater than 1 that has no positive divisors other than 1 and itself.

Prime property: If a prime divides a product, it must divide at least one of the factors.

Assume
\(\sqrt{3} = \frac{p}{q}\)
Square
\(3 = \frac{p^2}{q^2}\)
Cross
\(3q^2 = p^2\)
Contradiction
Both multiples of 3
Step 1: Assume \(\sqrt{3}\) is rational

Suppose \(\sqrt{3} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors

Step 2: Square both sides

\((\sqrt{3})^2 = \left(\frac{p}{q}\right)^2\)

\(3 = \frac{p^2}{q^2}\)

Step 3: Cross multiply

\(3q^2 = p^2\)

This means \(3\) divides \(p^2\)

Step 4: Apply prime property

Since 3 is prime and divides \(p^2 = p \cdot p\), it must divide \(p\)

So we can write \(p = 3k\) for some integer \(k\)

Step 5: Substitute back

Substituting: \(3q^2 = (3k)^2 = 9k^2\)

So \(q^2 = 3k^2\), which means \(3\) divides \(q^2\)

Step 6: Apply prime property again

Since 3 divides \(q^2\), it must also divide \(q\)

So both \(p\) and \(q\) are multiples of 3

Step 7: Derive contradiction

If both \(p\) and \(q\) are multiples of 3, they share a common factor of 3

This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms

\(\sqrt{3}\) is irrational
Final answer:

\(\sqrt{3}\) is irrational because assuming it is rational leads to a contradiction.

Applied rules:

• Prime divisor property: If prime \(p\) divides \(ab\), then \(p\) divides \(a\) or \(p\) divides \(b\)

• Proof by contradiction: Assume rational, derive contradiction

• Lowest terms: Coprime numerator and denominator

3 Proof for √6
Exercise 3
Prove that \(\sqrt{6}\) is irrational using proof by contradiction.
Definition:

Composite number: A positive integer that has at least one positive divisor other than 1 and itself.

Fundamental theorem of arithmetic: Every integer greater than 1 has a unique prime factorization.

Assume
\(\sqrt{6} = \frac{p}{q}\)
Square
\(6 = \frac{p^2}{q^2}\)
Cross
\(6q^2 = p^2\)
Contradiction
Both even
Step 1: Assume \(\sqrt{6}\) is rational

Suppose \(\sqrt{6} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors

Step 2: Square both sides

\((\sqrt{6})^2 = \left(\frac{p}{q}\right)^2\)

\(6 = \frac{p^2}{q^2}\)

Step 3: Cross multiply

\(6q^2 = p^2\)

This means \(6\) divides \(p^2\), so \(2\) and \(3\) both divide \(p^2\)

Step 4: Apply prime property

Since 2 is prime and divides \(p^2\), it must divide \(p\)

Since 3 is prime and divides \(p^2\), it must divide \(p\)

So we can write \(p = 6k\) for some integer \(k\)

Step 5: Substitute back

Substituting: \(6q^2 = (6k)^2 = 36k^2\)

So \(q^2 = 6k^2\), which means \(6\) divides \(q^2\)

Step 6: Apply prime property to q

Since 2 and 3 divide \(q^2\), they both divide \(q\)

So both \(p\) and \(q\) are multiples of 6

Step 7: Derive contradiction

If both \(p\) and \(q\) are multiples of 6, they share a common factor

This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms

\(\sqrt{6}\) is irrational
Final answer:

\(\sqrt{6}\) is irrational because assuming it is rational leads to a contradiction.

Applied rules:

• Fundamental theorem: Prime factorization is unique

• Prime divisor property: Extends to composite numbers

• Contradiction method: Assume rational, show impossible

Comprehensive Summary: Proofs of Irrationality
PROOFS OF IRRATIONALITY: COMPLETE GUIDE
Definitions

Rational Number: A number expressible as \(\frac{p}{q}\) where \(p, q\) are integers and \(q \neq 0\)

Irrational Number: A number that cannot be expressed as a ratio of integers

Proof by Contradiction: Assume the opposite of what you want to prove, show it leads to a contradiction

Prime Number: A natural number greater than 1 with no divisors other than 1 and itself

Core Rules & Laws

Even/Odd Property: If \(n^2\) is even, then \(n\) is even

Prime Divisor Property: If prime \(p\) divides \(ab\), then \(p\) divides \(a\) or \(p\) divides \(b\)

Lowest Terms: Any rational number can be expressed as \(\frac{p}{q}\) with \(\gcd(p,q) = 1\)

Fundamental Theorem: Every integer > 1 has unique prime factorization

Proof Methods

1. Assume rational: \(\sqrt{n} = \frac{p}{q}\) in lowest terms

2. Square both sides: Eliminate the square root

3. Cross multiply: Obtain an equation relating \(p\) and \(q\)

4. Apply properties: Use prime divisor or even/odd properties

5. Derive contradiction: Show \(p\) and \(q\) share a common factor

6. Conclude: Original assumption was false

Tips & Tricks

Prime vs Composite: Use prime divisor property for primes, factor for composites

Even/odd: Useful for \(\sqrt{2}\) and multiples

Lowest terms: Always assume fraction is in lowest terms

Unique factorization: Leverage for composite numbers

_ASSUME
Assume
Rational
📏
Square
Eliminate root
↔️
Cross
Multiply
🔍
Apply
Properties
❌
Contradict
Show impossible
✅
Conclude
Irrational
\(\sqrt{p} \text{ is irrational if } p \text{ is prime}\)
Prime Square Root Theorem
Proof by Contradiction
Assume → Derive → Contradiction → Conclusion
Logical method
Prime Divisor Property
p|ab → p|a or p|b
For prime p
Even/Odd Property
n² even → n even
Key insight
Tip 1: Always assume the fraction is in lowest terms (coprime numerator and denominator).
Tip 2: For primes, use the prime divisor property directly.
Tip 3: For \(\sqrt{2}\), the even/odd property is especially useful.
Tip 4: Look for the contradiction in shared factors.
Common errors: Forgetting lowest terms assumption, misapplying prime properties, not clearly identifying the contradiction.
Memory aids: "Assume rational, derive contradiction, conclude irrational."
Solution: Exercises 4 to 5
4 Proof for √5
Exercise 4
Prove that \(\sqrt{5}\) is irrational using proof by contradiction.
Definition:

Modular arithmetic: A system of arithmetic for integers that considers remainders after division.

Quadratic residues: Numbers that can be expressed as squares modulo a given modulus.

Assume
\(\sqrt{5} = \frac{p}{q}\)
Square
\(5 = \frac{p^2}{q^2}\)
Cross
\(5q^2 = p^2\)
Contradiction
Both multiples of 5
Step 1: Assume \(\sqrt{5}\) is rational

Suppose \(\sqrt{5} = \frac{p}{q}\) where \(p\) and \(q\) are integers with no common factors

Step 2: Square both sides

\((\sqrt{5})^2 = \left(\frac{p}{q}\right)^2\)

\(5 = \frac{p^2}{q^2}\)

Step 3: Cross multiply

\(5q^2 = p^2\)

This means \(5\) divides \(p^2\)

Step 4: Apply prime divisor property

Since 5 is prime and divides \(p^2 = p \cdot p\), it must divide \(p\)

So we can write \(p = 5k\) for some integer \(k\)

Step 5: Substitute back

Substituting: \(5q^2 = (5k)^2 = 25k^2\)

So \(q^2 = 5k^2\), which means \(5\) divides \(q^2\)

Step 6: Apply prime divisor property again

Since 5 divides \(q^2\), it must also divide \(q\)

So both \(p\) and \(q\) are multiples of 5

Step 7: Derive contradiction

If both \(p\) and \(q\) are multiples of 5, they share a common factor of 5

This contradicts our assumption that \(\frac{p}{q}\) is in lowest terms

\(\sqrt{5}\) is irrational
Final answer:

\(\sqrt{5}\) is irrational because assuming it is rational leads to a contradiction.

Applied rules:

• Prime divisor property: If prime \(p\) divides \(ab\), then \(p\) divides \(a\) or \(p\) divides \(b\)

• Proof by contradiction: Assume rational, derive contradiction

• Lowest terms: Coprime numerator and denominator

5 Generalization
Exercise 5
Prove that \(\sqrt{n}\) is irrational when \(n\) is a positive integer that is not a perfect square.
Definition:

Perfect square: A positive integer that can be expressed as \(k^2\) for some integer \(k\).

Fundamental theorem of arithmetic: Every integer greater than 1 has a unique prime factorization.

Assume
\(\sqrt{n} = \frac{p}{q}\)
Square
\(n = \frac{p^2}{q^2}\)
Cross
\(nq^2 = p^2\)
Contradiction
Prime appears odd times
Step 1: Assume \(\sqrt{n}\) is rational

Suppose \(\sqrt{n} = \frac{p}{q}\) where \(p\) and \(q\) are positive integers with no common factors

Step 2: Square both sides

\((\sqrt{n})^2 = \left(\frac{p}{q}\right)^2\)

\(n = \frac{p^2}{q^2}\)

Step 3: Cross multiply

\(nq^2 = p^2\)

Step 4: Consider prime factorization

Since \(n\) is not a perfect square, in its prime factorization, at least one prime appears an odd number of times

Let \(n = p_1^{a_1} \cdot p_2^{a_2} \cdot ... \cdot p_k^{a_k}\) where at least one \(a_i\) is odd

Step 5: Analyze the equation

In the equation \(nq^2 = p^2\), the prime \(p_i\) appears an odd number of times in \(n\)

Since \(q^2\) contributes an even number of each prime to the left side, the total count of \(p_i\) on the left side is odd

Step 6: Apply fundamental theorem

On the right side, \(p^2\) has each prime appearing an even number of times

This contradicts the fundamental theorem of arithmetic since the same number cannot have different prime factorizations

Step 7: Conclude

Therefore, our assumption that \(\sqrt{n}\) is rational must be false

So \(\sqrt{n}\) is irrational when \(n\) is not a perfect square

\(\sqrt{n}\) is irrational when n is not a perfect square
Final answer:

\(\sqrt{n}\) is irrational for any positive integer \(n\) that is not a perfect square.

Applied rules:

• Fundamental theorem: Unique prime factorization

• Perfect square criterion: All prime exponents even

• Contradiction method: Assume rational, show impossible

Advanced Concepts and Extensions
\(\sqrt{n} \text{ is rational} \iff n \text{ is a perfect square}\)
Complete Classification Theorem
Advanced Properties:

Algebraic numbers: Numbers that are roots of non-zero polynomial equations with rational coefficients.

Transcendental numbers: Numbers that are not algebraic (like \(\pi\) and \(e\)).

Density property: Between any two real numbers, there exists both a rational and an irrational number.

Cardinality: The set of irrational numbers is uncountably infinite, while rationals are countably infinite.

Extended Proof Strategy:
  1. Classify the number: Determine if it's likely to be rational or irrational
  2. Choose appropriate method: Direct proof, contradiction, or contrapositive
  3. Apply relevant theorems: Prime divisor property, fundamental theorem of arithmetic
  4. Derive logical consequences: Follow the chain of implications
  5. Identify contradiction: Show the assumption leads to impossibility
  6. State conclusion: Clearly articulate the final result
Tip 1: For \(\sqrt{n}\), check if \(n\) is a perfect square first.
Tip 2: Use prime factorization for general results about square roots.
Tip 3: The contradiction should involve the lowest terms assumption.
Tip 4: Practice with different primes to see the pattern.
Common errors: Forgetting the coprime assumption, misapplying prime properties, not clearly identifying the contradiction.
Advanced insight: These proofs connect to deeper number theory concepts.
Key Theorems:

• \(\sqrt{p}\) is irrational for any prime \(p\)

• \(\sqrt{n}\) is rational if and only if \(n\) is a perfect square

• \(\sqrt{ab} = \sqrt{a}\sqrt{b}\) (for positive \(a, b\))

• If \(r\) is rational and \(i\) is irrational, then \(r + i\) and \(ri\) (if \(r \neq 0\)) are irrational

• The sum of two irrationals may be rational or irrational

Questions & Answers

Question: Why does the proof that \(\sqrt{2}\) is irrational work? What makes it so powerful?

Answer: The proof is powerful because it uses a fundamental logical principle: proof by contradiction. Here's why it works:

  • Contradiction: We assume \(\sqrt{2}\) is rational, then show this leads to an impossible situation
  • Core contradiction: We prove that if \(\sqrt{2} = \frac{p}{q}\), then both \(p\) and \(q\) must be even, contradicting our assumption that the fraction is in lowest terms
  • Relies on prime properties: The key insight is that if 2 divides \(p^2\), then 2 must divide \(p\)
  • Universal applicability: The same method works for other primes and non-perfect squares

The proof is elegant because it doesn't rely on computing decimal expansions, but instead on the fundamental properties of integers.

Question: Does the same proof work for \(\sqrt{4}\)? Why doesn't it prove that \(\sqrt{4}\) is irrational?

Answer: No, the same proof doesn't work for \(\sqrt{4}\), and here's why:

If we try to apply the proof to \(\sqrt{4}\):

  • We'd assume \(\sqrt{4} = \frac{p}{q}\) in lowest terms
  • This gives us \(4 = \frac{p^2}{q^2}\), so \(4q^2 = p^2\)
  • This means 4 divides \(p^2\), but unlike the \(\sqrt{2}\) case, this doesn't force a contradiction

The key difference is that 4 is a perfect square (\(4 = 2^2\)), so \(\sqrt{4} = 2\), which is rational. The proof only works when the number under the square root is not a perfect square, because that's when the contradiction actually occurs.

For perfect squares, the proof doesn't lead to a contradiction because no contradiction exists!

Question: Why do we need to assume the fraction is in lowest terms? What happens if we don't?

Answer: The "lowest terms" assumption is crucial for the contradiction to work. Here's why:

Without the lowest terms assumption, we couldn't conclude that both \(p\) and \(q\) being even creates a contradiction. For example, if we had \(\frac{4}{6}\), both numerator and denominator are even, but this doesn't mean the fraction is invalid—it just means it's not in lowest terms.

However, if we assume \(\frac{p}{q}\) is in lowest terms (meaning \(\gcd(p,q) = 1\)), then showing that both \(p\) and \(q\) are divisible by the same prime creates an impossible situation. This is the core of the contradiction.

We can always reduce any fraction to lowest terms, so the assumption is valid and doesn't lose generality.

Question: Can you prove that cube roots are irrational using the same method? Like \(\sqrt[3]{2}\)?

Answer: Yes, the same general method works for cube roots, but with modifications! Here's how to prove \(\sqrt[3]{2}\) is irrational:

Assume \(\sqrt[3]{2} = \frac{p}{q}\) in lowest terms.

Cubing both sides: \(2 = \frac{p^3}{q^3}\), so \(2q^3 = p^3\).

This means 2 divides \(p^3\), so 2 divides \(p\) (by the prime divisor property).

Write \(p = 2k\), so \(2q^3 = (2k)^3 = 8k^3\).

This gives us \(q^3 = 4k^3\), so 2 divides \(q^3\), which means 2 divides \(q\).

Now both \(p\) and \(q\) are even, contradicting the lowest terms assumption.

So \(\sqrt[3]{2}\) is irrational. The method extends to any \(n\)-th root!

Question: Why do we care about proving numbers are irrational? Isn't it enough to know that \(\sqrt{2} \approx 1.41421356...\)?

Answer: Proofs of irrationality are important for several reasons:

  • Mathematical rigor: Approximations don't tell us about the true nature of numbers
  • Foundational knowledge: Understanding the structure of real numbers
  • Problem solving: Knowing a number is irrational helps in solving equations
  • Historical significance: These proofs were revolutionary in mathematics history
  • Logical reasoning: Learning proof techniques applicable elsewhere

For example, knowing that \(\sqrt{2}\) is irrational tells us that the equation \(x^2 = 2\) has no rational solution, which is crucial for understanding the completeness of the real number system.

The proof method also teaches logical thinking and mathematical reasoning skills that extend far beyond just irrational numbers!