How Does the Density of Q in R Get Proven in Rudin's Analysis?

  • Context: Graduate 
  • Thread starter Thread starter kostas230
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion focuses on the proof of the density of rational numbers (Q) in real numbers (R) as presented in Walter Rudin's "Principles of Mathematical Analysis." Specifically, it addresses the step where integers m1 and m2 are established such that -m2 < nx < m1, leading to the conclusion that there exists an integer m satisfying -m2 ≤ m ≤ m1. The proof demonstrates that by iteratively adjusting m1, one can find an integer m within a finite number of steps. Additionally, it outlines an alternative approach using decimal approximations to show that every real number is the limit of a sequence of rational numbers.

PREREQUISITES
  • Understanding of basic number theory, particularly properties of integers.
  • Familiarity with the concepts of limits and sequences in real analysis.
  • Knowledge of Walter Rudin's "Principles of Mathematical Analysis" and its notation.
  • Ability to manipulate inequalities and understand their implications in proofs.
NEXT STEPS
  • Study the proof of the density of Q in R in detail from Rudin's "Principles of Mathematical Analysis."
  • Explore the concept of sequences and limits in real analysis, focusing on convergence.
  • Learn about the properties of rational and irrational numbers, particularly their definitions and differences.
  • Investigate the use of decimal approximations in proofs and their applications in analysis.
USEFUL FOR

Students of real analysis, mathematicians interested in number theory, and anyone seeking a deeper understanding of the foundational concepts in mathematical proofs regarding the density of rational numbers in the real number line.

kostas230
Messages
96
Reaction score
3
I have a difficulty in understanding the proof on Rudin's book page 9 regarding the density of Q in R. Specifically, I don't understand this step:

After we prove that there exist two integers [itex]m_{1}[/itex], [itex]m_{2}[/itex] with [itex]m_{1}>nx[/itex] and [itex]m_{2}>-nx[/itex] such that:

[itex]-m_{2}<nx<m_{1}[/itex]​

What I don't understand is how from the above get's concludes the following:

Hence there is an integer m (with [itex]-m_{2}≤m≤m_{1}[/itex]) such that:

[itex]m-1≤nx<m[/itex]​
 
Physics news on Phys.org
If m1-1 <= nx, then set m=m1 and both inequalities are trivial.
If m1-1 > nx, consider m1-2 and so on.
As the difference between m2 and m1 is finite, you find m in a finite number of steps.
 
Another approach:

Show every Real number is the limit of a sequence of rationals:
For rationals, use the constant sequence; for irrationals x, use the decimal
approximation of x, and cut it at the n-th spot (and apend 0's to the right), i.e.

x=ao.a1a2...am... --> x':=ao.a1a2...am00000...0...

Then x' is rational, and |x-x'|< 10^{-m}

For any accuracy you want, adjust m, i.e., let it go as far as you want.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
17K
  • · Replies 5 ·
Replies
5
Views
6K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 6 ·
Replies
6
Views
5K
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • Poll Poll
  • · Replies 6 ·
Replies
6
Views
4K