SUMMARY
The supremum and infimum of the set S = {√n − [√n] : n ∈ N} are conclusively determined to be 1 and 0, respectively. The proof for the infimum involves demonstrating that 0 is a lower bound and using an epsilon argument to show it is the greatest lower bound. For the supremum, it is established that 1 is an upper bound, and through a similar epsilon argument, it is shown that any number less than 1 cannot serve as an upper bound, confirming that 1 is indeed the least upper bound of the set.
PREREQUISITES
- Understanding of the floor function, denoted as [x], which represents the largest integer less than or equal to x.
- Familiarity with the concept of supremum and infimum in real analysis.
- Knowledge of epsilon-delta arguments used in mathematical proofs.
- Basic understanding of sequences and their properties in the context of real numbers.
NEXT STEPS
- Study the properties of the floor function and its implications on real-valued sequences.
- Learn about epsilon-delta proofs in real analysis to strengthen proof-writing skills.
- Explore the concept of bounded sets and their supremum and infimum in greater detail.
- Investigate examples of sequences that converge to their supremum and infimum for practical understanding.
USEFUL FOR
Students of real analysis, mathematicians focusing on set theory, and anyone interested in mastering the concepts of supremum and infimum in mathematical proofs.