A question from Real and Complex Analysis (Rudin's).

Click For Summary
SUMMARY

The discussion focuses on demonstrating that the sequence of functions \(\varphi_n(t)\) is monotonic increasing as outlined in Theorem 1.17 of Walter Rudin's "Principles of Mathematical Analysis" (1987 edition). The key insight involves using the function \(k_n(t) = \text{floor}(2^n t)\) and the property \(\text{floor}(2x)/2 \ge \text{floor}(x)\). The proof requires analyzing three cases for \(t\): \(0 \le t < n\), \(n \le t < n+1\), and \(n+1 \le t\), with the first case being the primary focus for establishing the monotonicity.

PREREQUISITES
  • Understanding of monotonic functions in real analysis
  • Familiarity with the floor function and its properties
  • Knowledge of sequences and limits in mathematical analysis
  • Basic concepts from Walter Rudin's "Principles of Mathematical Analysis"
NEXT STEPS
  • Study the properties of monotonic sequences in real analysis
  • Explore the implications of the floor function in mathematical proofs
  • Review Theorem 1.17 in Rudin's "Principles of Mathematical Analysis" for deeper understanding
  • Practice proving monotonicity for other sequences of functions
USEFUL FOR

Students and educators in real analysis, mathematicians interested in function properties, and anyone studying Walter Rudin's work on mathematical analysis.

MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
I am trying to understand theorem 1.17 in page 15-16 international edition 1987.
How do you show that [tex]\phi_n(t)[/tex] is a monotonic increasing sequence of functions?
 
Physics news on Phys.org
It might be easier if you note that

[tex]k_n(t)=\text{floor}(2^nt)[/tex]

and [tex]\text{floor}(2x)/2\ge \text{floor}(x)[/tex].

Then, when you want to show that [tex]\varphi_n(t)\le\varphi_{n+1}(t)[/tex] consider the cases where [tex]0\le t<n[/tex], [tex]n\le t<n+1[/tex] and [tex]n+1\le t[/tex] separately.
 
Thanks, got it, basically I only need to check for t in [0,n) the other case is trivial.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 24 ·
Replies
24
Views
7K
  • · Replies 4 ·
Replies
4
Views
5K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K