Prove that the closure of Q is equal to R

  • Thread starter Tetrinity
  • Start date
  • Tags
    closure
In summary, the problem asks to prove that the closure of the set of rational numbers is equal to the set of real numbers. The problem includes the standard definition of the rationals as {p/q | q ≠ 0, p,q ∈ Z} and also states that the closure of a set X ⊂ R is equal to the set of all its limit points. My lecturer suggested the following method: to prove that Q is dense in R, we must show that for every x in R, there exists a sequence (q_n)_n in Q, that converges to x.
  • #1
Tetrinity
6
0

Homework Statement



As the title states, the problem asks to prove that the closure of the set of rational numbers is equal to the set of real numbers. The problem includes the standard definition of the rationals as {p/q | q ≠ 0, p,q ∈ Z} and also states that the closure of a set X ⊂ R is equal to the set of all its limit points.

Our lecturer suggested the following method:

  • Show that the closure of Q is a subset of R.
  • Show that R is a subset of the closure of Q.
  • Therefore the closure of Q is equal to R

Homework Equations



I'm not sure if there's anything particularly useful here. My definition of R states that Q is a subset of R, it is ordered, the standard arithmetic operations work and it is complete (i.e. every bounded set S ⊂ R has a suprenum sup(S) ∈ R and infinum inf(S) ∈ R). It also states that every real number can be defined as a convergent sequence of rationals.

The Attempt at a Solution



I'm going to use the notation cl(X) to represent the closure of the set X.

The first step is pretty easy:

Q ⊂ R
⇒ cl(Q) ⊂ cl(R)
⇒ cl(Q) ⊂ R

(the closure of N, Z and R are already known to us at this point)


My problem lies with the second step. I know that the closure of a set X is the set of all limit points of X, and that a is a limit point to X if a is an adherent point to X\{a}. I'm just not really sure how to begin to prove the second step, and I've racked my brains to the point where I'm probably missing something obvious.

Any help with this, be it using this method or a different one, would be appreciated. Thanks.
 
Physics news on Phys.org
  • #2
Well, it isn't obvious. Some even think of this as an axiom of R. Thus something that cannot be proven, but that is assumed. So whatever proof you'll find, it will be quite informal. (unless you're working with Dedekind cuts, but I don't assume that this is the case here).

To prove that Q is dense in R, we must show that for every x in R, there exists a sequence [tex](q_n)_n[/tex] in Q, that converges to x.
To find the sequence, take x and take as qn the first n decimals of x. This is a rational numher. For example, pi is the limit of following sequence
[tex]3,~3.1,~3.14,~3.141,~3.1415,...[/tex]

I'll leave it to you to formalize the argument...
 
  • #3
micromass said:
Well, it isn't obvious. Some even think of this as an axiom of R. Thus something that cannot be proven, but that is assumed. So whatever proof you'll find, it will be quite informal. (unless you're working with Dedekind cuts, but I don't assume that this is the case here).

To prove that Q is dense in R, we must show that for every x in R, there exists a sequence [tex](q_n)_n[/tex] in Q, that converges to x.
To find the sequence, take x and take as qn the first n decimals of x. This is a rational numher. For example, pi is the limit of following sequence
[tex]3,~3.1,~3.14,~3.141,~3.1415,...[/tex]

I'll leave it to you to formalize the argument...


Couldn't he do something like this:

The closure of a set S is defined as the intersection of all closed sets containing S. Now show that the only closed set containing Q is R. Then the intersection of these sets is R.
 
  • #4
Robert1986 said:
Couldn't he do something like this:

The closure of a set S is defined as the intersection of all closed sets containing S. Now show that the only closed set containing Q is R. Then the intersection of these sets is R.

Possibly, but I don't know if it is any easier to prove...
 
  • #5
micromass said:
Possibly, but I don't know if it is any easier to prove...

A closed set contains all of its limit points. Let [tex]F[/tex] be a closed set containing [tex]Q[/tex]. Let [tex]x[/tex] be a limit point of [tex]Q[/tex]. Then [tex]x[/tex] is also a limit point of [tex]F[/tex] and hence is in [tex]F[/tex]. Sine everything in R is a limit point of Q, we must have that [tex]F \subset R[/tex]. Clearly [tex]F \subset R[/tex] we have that [tex]F=R[/tex].
 
  • #6
Robert1986 said:
Sine everything in R is a limit point of Q,

Yes, and how does one prove this?
 
  • #7
micromass said:
Well, it isn't obvious. Some even think of this as an axiom of R. Thus something that cannot be proven, but that is assumed. So whatever proof you'll find, it will be quite informal. (unless you're working with Dedekind cuts, but I don't assume that this is the case here).

To prove that Q is dense in R, we must show that for every x in R, there exists a sequence [tex](q_n)_n[/tex] in Q, that converges to x.
To find the sequence, take x and take as qn the first n decimals of x. This is a rational numher. For example, pi is the limit of following sequence
[tex]3,~3.1,~3.14,~3.141,~3.1415,...[/tex]

I'll leave it to you to formalize the argument...

I am not working with Dedekind cuts. I must admit my understanding of them is somewhat limited, but the topic has not arisen in my course thus far, so I would assume they are not required.

I can find such a sequence by setting qn = a1a2a3...ak-1.akak+1...an where ai is the ith digit of x.

Then if we assume that qn is known, we can find an+1 by setting it such that qn+1 < x and setting it to be 1 higher causes qn+1 ≥ x. This can be done for any x ∈ R.

Does this complete the proof that the closure of Q is R? I know it's not amazingly clear, but I can't think of any other way to represent the decimal.

Robert1986 said:
Couldn't he do something like this:

The closure of a set S is defined as the intersection of all closed sets containing S. Now show that the only closed set containing Q is R. Then the intersection of these sets is R.

Interesting... I wasn't actually aware of this definition. I guess solving the problem this way would involve a proof by contradiction with a closed set X ≠ R that contains Q?

And as a side-note: wrong gender. :)
 
  • #8
Tetrinity said:
I am not working with Dedekind cuts. I must admit my understanding of them is somewhat limited, but the topic has not arisen in my course thus far, so I would assume they are not required.

I can find such a sequence by setting qn = a1a2a3...ak-1.akak+1...an where ai is the ith digit of x.

Then if we assume that qn is known, we can find an+1 by setting it such that qn+1 < x and setting it to be 1 higher causes qn+1 ≥ x. This can be done for any x ∈ R.

Does this complete the proof that the closure of Q is R? I know it's not amazingly clear, but I can't think of any other way to represent the decimal.



Interesting... I wasn't actually aware of this definition. I guess solving the problem this way would involve a proof by contradiction with a closed set X ≠ R that contains Q?
Oh, what is the def of closure that you're working with? But if you can show that the only closed set containing Q is R, then the intersection of these sets is just R. So R \in cls(Q). Clearly cls(Q) \in R so R = cls(Q).

And as a side-note: wrong gender. :)
Ohh, my mistake; though "he" is the neuter pronoun in English, so technically, I was correct :)
 
  • #9
Tetrinity said:
I am not working with Dedekind cuts. I must admit my understanding of them is somewhat limited, but the topic has not arisen in my course thus far, so I would assume they are not required.

I can find such a sequence by setting qn = a1a2a3...ak-1.akak+1...an where ai is the ith digit of x.

Then if we assume that qn is known, we can find an+1 by setting it such that qn+1 < x and setting it to be 1 higher causes qn+1 ≥ x. This can be done for any x ∈ R.

Does this complete the proof that the closure of Q is R? I know it's not amazingly clear, but I can't think of any other way to represent the decimal.

Yes, I think that this is about the best you can do. However, you might want to prove that the qn converge to x. It isn't that hard, I think...
 
  • #10
micromass said:
Yes, and how does one prove this?

Every neighborhood of any point r \in R has at least one point of Q distinct from r. Since we are dealing in R, this just ammounts to saying that there is always a rational number between any two real numbers.
 
  • #11
Robert1986 said:
Ohh, my mistake; though "he" is the neuter pronoun in English, so technically, I was correct :)

Actually, "it" is the neuter pronoun. However, I use "he" when referring to someone whose gender I do not know, as I am a "he" and so I tend to think I'm talking to other "he"s.

Hmm...
 
  • #12
Robert1986 said:
Every neighborhood of any point r \in R has at least one point of Q distinct from r. Since we are dealing in R, this just ammounts to saying that there is always a rational number between any two real numbers.

Yes, but the statement that between every two reals is a rational, is equivalent to the density of Q. So if you want to prove the density of Q in R, from scratch, then you will have to prove this somehow. And I see no easy method in proving this thing...
 
  • #13
Robert1986 said:
Oh, what is the def of closure that you're working with? But if you can show that the only closed set containing Q is R, then the intersection of these sets is just R. So R \in cls(Q). Clearly cls(Q) \in R so R = cls(Q).

The only definition of closure I have is the one stated in the original post - that the closure of a set X is the set of all of its limit points. Looking further into this, there seem to be a LOT of definitions of "closure" in mathematics...

I think I may need to stick to the definition we've been given. I lost marks on a previous assignment for using a limit before they were formally introduced in the course, with no indication as to whether my proof was actually correct or not. It still seems a bit unfair, but it might be best to avoid that situation again!

micromass said:
Yes, I think that this is about the best you can do. However, you might want to prove that the qn converge to x. It isn't that hard, I think...

Alright, thank you so much for your help. :) I think I've spent more time on this single question than all of the others on the assignment put together...


Interestingly, I came across another proof of the density of Q in R while reading through my notes just now.

Let x, y ∈ R and x < y.

We can always find n ∈ N such that n > 1/(y-x)

Now let m be the smallest integer such that m/n > x (in other words, [m-1]/n ≤ x)

Then x < m/n = [1 + (m-1)]/n = 1/n + (m-1)/n

We know 1/n < y - x, and (m-1)/n ≤ x

Therefore 1/n + (m-1)/n < (y-x) + x = y

Therefore x < m/n < y (i.e. there is a rational number between any two reals)

Would that proof be better to use, since it avoids having to further prove qn converges to x? I'd been reading through my notes to remind myself of how to show a sequence converges to a limit...
 
  • #14
micromass said:
Yes, but the statement that between every two reals is a rational, is equivalent to the density of Q. So if you want to prove the density of Q in R, from scratch, then you will have to prove this somehow. And I see no easy method in proving this thing...


Let y < x be reals. Then x - y > 0. We can pick an n such that n > x-y => 1/n < 1/(x-y). Pick the largest m st m/n < y. Then (m+1)/n > y. Since 1\n < x-y, and m/n < x we have that (m+1)/n < x. Hence y < (m+1)/n < x.


I think the problem here is that our books have presented information in different orders and differntly. For example, the thing I just proved was an early result in the book I use.
 
  • #15
Tetrinity said:
Interestingly, I came across another proof of the density of Q in R while reading through my notes just now.

Let x, y ∈ R and x < y.

We can always find n ∈ N such that n > 1/(y-x)

Now let m be the smallest integer such that m/n > x (in other words, [m-1]/n ≤ x)

Then x < m/n = [1 + (m-1)]/n = 1/n + (m-1)/n

We know 1/n < y - x, and (m-1)/n ≤ x

Therefore 1/n + (m-1)/n < (y-x) + x = y

Therefore x < m/n < y (i.e. there is a rational number between any two reals)

Yes, this is also a good proof (in fact a better one). But if your professor is rigourous, he will want a proof of this:

We can always find n ∈ N such that n > 1/(y-x)

This is called the axiom of Archimedes. If it is in your course somewhere, then the above proof will be exactly what your prof wants. If it's not in your course, then maybe your prof would want a "proof" of this...
 
  • #16
micromass said:
This is called the axiom of Archimedes. If it is in your course somewhere, then the above proof will be exactly what your prof wants. If it's not in your course, then maybe your prof would want a "proof" of this...

The axiom was stated, albeit rather informally ("there is no largest natural number"), in my Analysis I class from the previous semester (this homework is for Analysis II, which has Analysis I as a pre-requisite). I think I'll go with it.

Thanks for all of your help!
 
Last edited:

1. What is the closure of Q?

The closure of Q, denoted as Q̅, is the set of all real numbers that can be obtained by taking the limit of a sequence of rational numbers in Q.

2. What is R?

R is the set of all real numbers, which includes both rational and irrational numbers.

3. How can we prove that the closure of Q is equal to R?

To prove that the closure of Q is equal to R, we need to show that every real number can be obtained as a limit of a sequence of rational numbers. This can be done through the use of decimal expansions or by using the density of rational numbers in the real numbers.

4. Why is it important to prove that the closure of Q is equal to R?

It is important to prove this because it helps us understand the relationship between rational and real numbers. It also allows us to use the properties of rational numbers to make conclusions about real numbers, which can be useful in various fields of mathematics and science.

5. Are there any practical applications of this proof?

Yes, this proof has practical applications in fields such as computer science, physics, and engineering. For example, it can be used in computer algorithms to approximate real numbers using rational numbers, which can improve efficiency and accuracy. In physics, it is used in the study of continuous systems, where real numbers are essential for describing physical quantities.

Similar threads

  • Calculus and Beyond Homework Help
Replies
20
Views
2K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
24
Views
672
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
503
  • Calculus and Beyond Homework Help
Replies
29
Views
3K
  • Calculus and Beyond Homework Help
Replies
3
Views
466
  • Calculus and Beyond Homework Help
Replies
7
Views
1K
  • Calculus and Beyond Homework Help
Replies
8
Views
1K
Back
Top