Q is dense in R question about proof

  • Thread starter Thread starter A_B
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The proof that the rational numbers (Q) are dense in the real numbers (R) is established in Rudin's "Principles of Mathematical Analysis." The theorem states that for any two real numbers x and y where x < y, there exists a rational number p such that x < p < y. The proof utilizes the Archimedean property to demonstrate the existence of integers m_1 and m_2, leading to the conclusion that there exists an integer m satisfying m-1 ≤ nx < m, thus proving the density of Q in R. The discussion also highlights the necessity of understanding the well-ordering principle and the properties of integers.

PREREQUISITES
  • Understanding of the Archimedean property in real analysis
  • Familiarity with the well-ordering principle
  • Basic knowledge of integer properties and definitions
  • Experience with mathematical proofs and inequalities
NEXT STEPS
  • Study the Archimedean property in detail
  • Learn about the well-ordering principle and its implications
  • Explore properties of integers and their definitions in set theory
  • Read additional resources on mathematical analysis, focusing on proofs involving density
USEFUL FOR

Mathematics students, educators, and anyone seeking a deeper understanding of real analysis, particularly those interested in the properties of rational and real numbers.

A_B
Messages
87
Reaction score
1
Hi,

In Rudin's Principles of Mathematical Analysis there's the following proof that Q is dense in R.

Theorem: If x,y\in \mathbb{R} and x &lt; y there exists a p \in \mathbb{Q} such that x&lt;p&lt;y.

Proof: Since x&lt;y, we have y-x&gt;0. It follow from the Archimedian property that there is a positive integer n such that
n(y-x)&gt;1.
We again apply the Archimedian property to find positive integers m_1 a,d m_2 such that m_1&gt;nx and m_2&gt;-nx. Then
-m_2&lt;nx&lt;m_1.
Hence there is an integer m (with -m_2\leq m\leq m_1) such that
m-1\leq nx &lt; m.
We combine the inequalities to get
nx &lt; m \leq 1+nx &lt; ny.
n is positive so
x &lt; \frac{m}{n} &lt; y.
Which proves that \mathbb{Q} is dense in \mathbb{R}.


How one concludes that the m in the red bit exists is what's troubling me.

Thanks
 
Physics news on Phys.org
Hmm, you're not the first one to ask that very question.

Anyway, the key is to define

m=\min\{k\in \mathbb{Z}~\vert~nx&lt;k\}

However, there are some things we need to show:

- Does the minimum exist?? I.e. is the set \{k\in \mathbb{Z}~\vert~nx&lt;k\} non-empty, does it have a lower bound? Why is the infimum a minimum?
- does m-1\leq nx&lt;m hold.
 
i.e. are you aware of the well ordering principle?
 
Thanks for the replies, seems I don't know enough about integers yet, so I've been looking into them.
I've found another book on analysis which does introduce the integers, it defines them as "those real numbers which are in every inductive set."

But this isn't how the integers are usually introduced is it?

What's a good book to learn enough about integers (and maybe a little more)?

Thanks
 
This is self evident .Any real number must lie between two successive integers . When You have the natural number system ,Irrationals fill the gaps between any 2 successive integers . It's very simple.
 
As shown by this animation, the fibers of the Hopf fibration of the 3-sphere are circles (click on a point on the sphere to visualize the associated fiber). As far as I understand, they never intersect and their union is the 3-sphere itself. I'd be sure whether the circles in the animation are given by stereographic projection of the 3-sphere from a point, say the "equivalent" of the ##S^2## north-pole. Assuming the viewpoint of 3-sphere defined by its embedding in ##\mathbb C^2## as...

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 38 ·
2
Replies
38
Views
5K