Math 2.0

Number theory Proof

Proof of the irrationality of square roots of non-squares

Builds on Fundamental theorem of arithmeticIrrational number

Proof

  1. Suppose first that nn is a perfect square, say n=m2n = m^2 with m≥0m \ge 0 an integer. Then n=m\sqrt{n} = m is rational, so it is not irrational.
  2. Now suppose that nn is not a perfect square. Then n≥2n \ge 2, since 0=020 = 0^2 and 1=121 = 1^2. We argue by contradiction.
  3. Assume n=a/b\sqrt{n} = a/b with integers aa and bb, b≠0b \ne 0. Since n>0\sqrt{n} > 0, we may take a>0a > 0 and b>0b > 0.
  4. Squaring gives a2=nb2a^2 = n b^2.
  5. For a prime pp and a positive integer mm, let vp(m)v_p(m) be the exponent of pp in the prime factorization of mm. It is well defined by the fundamental theorem of arithmetic.
  6. Uniqueness of factorization gives vp(uv)=vp(u)+vp(v)v_p(uv) = v_p(u) + v_p(v) for positive integers uu and vv: concatenating factorizations of uu and vv gives the factorization of uvuv.
  7. By steps 4 and 6, 2vp(a)=vp(n)+2vp(b)2 v_p(a) = v_p(n) + 2 v_p(b) for each prime pp. So vp(n)=2(vp(a)−vp(b))v_p(n) = 2(v_p(a) - v_p(b)) is even.
  8. Put kp=vp(n)/2k_p = v_p(n)/2, a natural number, and m=∏ppkpm = \prod_p p^{k_p}, a finite product over the primes dividing nn.
  9. Then m2=∏ppvp(n)=nm^2 = \prod_p p^{v_p(n)} = n, so nn is a perfect square. This contradicts step 2.
  10. So n\sqrt{n} is irrational when nn is not a perfect square. With step 1, n\sqrt{n} is irrational if and only if nn is not a perfect square.

Idea

If n=a/b\sqrt{n} = a/b, then nb2=a2n b^2 = a^2. In a2a^2 and in b2b^2 every prime appears to an even power, so the same holds in nn, and then nn is a square.

Reading path

To understand this page from the ground up, read these 38 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof of the generalized Euclid's lemma, Proof of the commutativity of addition by induction, Proof of Euclid's lemma, Proof of strong induction from ordinary induction, Proof of the fundamental theorem of arithmetic, Proof of the existence of prime factorization, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the existence of a prime divisor.

Show the path as a graph
Definition by recursion, concept, no evidence levelDefinition by recursi…conceptDivisibility, definition, no evidence levelDivisibilitydefinitionMathematical induction, concept, no evidence levelMathematical inductionconceptNatural numbers, object, no evidence levelNatural numbersobjectPeano axioms, concept, no evidence levelPeano axiomsconceptRational numbers, object, no evidence levelRational numbersobjectReal numbers, object, no evidence levelReal numbersobjectGreatest common divisor, definition, no evidence levelGreatest common divis…definitionPrime number, definition, no evidence levelPrime numberdefinitionSuccessor function, definition, no evidence levelSuccessor functiondefinitionIrrational number, definition, no evidence levelIrrational numberdefinitionCoprime integers, definition, no evidence levelCoprime integersdefinitionPrime factorization, definition, no evidence levelPrime factorizationdefinitionAddition of natural numbers, definition, no evidence levelAddition of natural n…definitionThe successor function is injective, statement, no evidence levelThe successor functio…statementZero is not a successor, statement, no evidence levelZero is not a success…statementProof of the commutativity of addition by induction, proof, no evidence levelProof of the commutat…proofOrder on the natural numbers, definition, no evidence levelOrder on the natural …definitionCommutativity of addition, statement, no evidence levelCommutativity of addi…statementProof of strong induction from ordinary induction, proof, no evidence levelProof of strong induc…proofStrong induction, statement, no evidence levelStrong inductionstatementProof of the well-ordering principle from strong induction, proof, no evidence levelProof of the well-ord…proofWell-ordering principle, statement, no evidence levelWell-ordering princip…statementProof of the division algorithm, proof, no evidence levelProof of the division…proofProof of the existence of a prime divisor, proof, no evidence levelProof of the existenc…proofDivision algorithm, statement, no evidence levelDivision algorithmstatementExistence of a prime divisor, statement, no evidence levelExistence of a prime …statementProof of Bézout's identity, proof, no evidence levelProof of Bézout's ide…proofProof of the existence of prime factorization, proof, no evidence levelProof of the existenc…proofBézout's identity, statement, no evidence levelBézout's identitystatementExistence of prime factorization, statement, no evidence levelExistence of prime fa…statementProof of the generalized Euclid's lemma, proof, no evidence levelProof of the generali…proofGeneralized Euclid's lemma, statement, no evidence levelGeneralized Euclid's …statementProof of Euclid's lemma, proof, no evidence levelProof of Euclid's lem…proofEuclid's lemma, statement, no evidence levelEuclid's lemmastatementProof of the fundamental theorem of arithmetic, proof, no evidence levelProof of the fundamen…proofFundamental theorem of arithmetic, statement, no evidence levelFundamental theorem o…statementProof of the irrationality of square roots of non-squares, proof, no evidence levelProof of the irration…proof
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Definition by recursion concept
  2. Divisibility definition
  3. Mathematical induction concept
  4. Natural numbers object
  5. Peano axioms concept
  6. Rational numbers object
  7. Real numbers object
  8. Greatest common divisor definition
  9. Prime number definition
  10. Successor function definition
  11. Irrational number definition
  12. Coprime integers definition
  13. Prime factorization definition
  14. Addition of natural numbers definition
  15. The successor function is injective statement
  16. Zero is not a successor statement
  17. Proof of the commutativity of addition by induction proof
  18. Order on the natural numbers definition
  19. Commutativity of addition statement
  20. Proof of strong induction from ordinary induction proof
  21. Strong induction statement
  22. Proof of the well-ordering principle from strong induction proof
  23. Well-ordering principle statement
  24. Proof of the division algorithm proof
  25. Proof of the existence of a prime divisor proof
  26. Division algorithm statement
  27. Existence of a prime divisor statement
  28. Proof of Bézout's identity proof
  29. Proof of the existence of prime factorization proof
  30. Bézout's identity statement
  31. Existence of prime factorization statement
  32. Proof of the generalized Euclid's lemma proof
  33. Generalized Euclid's lemma statement
  34. Proof of Euclid's lemma proof
  35. Euclid's lemma statement
  36. Proof of the fundamental theorem of arithmetic proof
  37. Fundamental theorem of arithmetic statement
  38. Proof of the irrationality of square roots of non-squares proof

Where this leads

14 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Quadratic_irrational_number, Square root of non-square is irrational
About this page
TagWG6EAWSCCP
URIm2://WG6EAWSCCP
Kindproof
WritingW0 stub
MSC11J72
ProvesIrrationality of square roots of non-squares
UsesFundamental theorem of arithmetic, Irrational number
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.