Revisiting irrational numbers
A rational number is one that can be written as , where are integers and . An irrational number is a real number that cannot be written this way. The classical examples are , , , , and . In this section we revisit why such numbers exist and learn the standard proof technique: proof by contradiction.
The key lemma
Lemma. Let be a prime number. If divides , where is a positive integer, then also divides .
This is a direct consequence of the Fundamental Theorem of Arithmetic. Write as a product of primes: Then By the uniqueness part of FTA, the prime factorisation of uses exactly the primes that appear in . So if , then must equal some , i.e., .
This is a one-line consequence of FTA but it does all the heavy lifting in the irrationality proofs.
Theorem: is irrational
Theorem. is irrational.
Proof by contradiction. Suppose, on the contrary, that is rational. Then we can write where are integers, , and (we have cancelled all common factors).
Squaring: , so .
Hence . By the lemma (with prime ), . So for some integer . Substituting: So , and again by the lemma, .
But then both and are divisible by , contradicting . The contradiction means our assumption was false. Hence is irrational.
The same script proves that , , indeed for any prime , is irrational. Just replace by throughout. The lemma needs to be prime; for composites it can fail ( but ).
Operations: rationals and irrationals
A few useful facts:
- (rational) (rational) rational.
- (rational) (irrational) irrational. Proof. If with rational and irrational, then is rational , contradiction.
- (non-zero rational) (irrational) irrational.
- (irrational) (irrational) may be rational or irrational. Example: is rational, but is irrational.
These let us conclude things like " is irrational" without redoing the full contradiction script.
Worked examples
Example 1. Prove that is irrational.
Suppose with . Then , so , hence (lemma) . Write . Substituting, , so , hence . But then , contradiction. So is irrational.
Example 2. Show that is irrational.
Suppose with rational. Then , so . The right side is rational (rationals are closed under subtraction and division by a non-zero rational). But is irrational (Example 1). Contradiction. So is irrational.
Example 3. Show that is irrational.
If were rational, say , then , which is rational. But is irrational , contradiction.
Example 4. Prove that is irrational.
Suppose with rational. Then . Squaring, (assuming ; if then which is false). The right side is rational, but is irrational. Contradiction.
Example 5. Show that is irrational.
. This is (non-zero rational) (irrational), hence irrational.
Try it yourself
- Prove that is irrational.
- Prove that is irrational.
- Prove that is irrational.
- Prove that is irrational.
- Prove that is irrational.
- If and are rationals with , show that .
- Can the sum of two irrational numbers be rational? Give one example.
- Prove that is rational. Reconcile with "irrational irrational".
- Show that is irrational.
- Prove that is irrational. (Hint: assume rational, square, use FTA on the prime , or .)
Pitfalls / Insight
- Always start "suppose, on the contrary, with ". Without coprimality the proof collapses.
- The lemma needs to be prime. Trying it for or is wrong.
- Irrational irrational is not automatically irrational. Always reduce to a known irrational like or .
Insight. Proof by contradiction has a beautiful shape: assume the opposite of what you want, follow the logic strictly, and let the universe tear itself apart. The contradiction proves your original claim. This pattern returns again and again in geometry, algebra, and beyond.