Proving square root of 2 is irrational with well ordering principle?

symaticc
Messages
2
Reaction score
0

Homework Statement


I know how to prove that square root of 2 is irrational using the well ordering principle but what I'm wondering is, how can we use the well ordering principle to prove this when the square root of two isn't even a subset of the natural numbers? Doesn't the well ordering principle only hold for natural numbers and not rational numbers? If we prove that the well ordering principle does not hold for the square root of 2, aren't we just proving that the square root of 2 is not a natural number?

Thanks in advance!
 
Physics news on Phys.org
Can you include the proof here?? Where exactly did you use well-ordering of rational numbers??
 
Okay so what I did was first, assume that square root of 2 is rational. let √2 = a/b
2 = a^2/b^2
2b^2 = a^2
a^2 is even therefore a is even so it can be written as 2n...
2b^2 = (2n)^2
2b^b = 4n^2
b^2 = 2n^2
2 = b^2 / n^2
√2 = b/n
Since we started with √2 = a/b and then got √2 = b/n where b/n < a/b, if we repeat the step above and keep repeating it, we will always get smaller representations of √2 which means that there is no smallest element and there for √2 is irrational by the well ordering principle which states that every non-empty subset of N has a least element.

Im wondering, if the well ordering principle is only for subsets of N and it doesn't hold for √2, doesn't that just mean that √2 is not a natural number? How does that prove that √2 is irrational?
 
By definition, a set S is well ordered if every non-empty subset of S contains a least element. The set of positive rational numbers is not well-ordered because, for example,

\{\frac{1}{2}, \frac{1}{3}, \frac{1}{4}, \dots \}

has no least element.

I take it that you've been asked to prove that \sqrt{2} is irrational by using the well ordering property of the positive integers. Here's a hint to get you started. Assume that \sqrt{2} = \frac{a}{b} where a and b are positive integers. Thus, b\sqrt{2} = a is a positive integer. This implies that the set S, defined by

S = \{n \in \mathbb{N} : n\sqrt{2} \in \mathbb{N}\}

is non-empty. What does the well ordering principle tell you about S?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top