Proof of Integer Parts of Real numbers

Click For Summary
SUMMARY

The discussion focuses on the proof of the existence of a unique integer part of real numbers, specifically demonstrating that there exists a unique integer n in Z such that nx < n + 1. The proof utilizes the set A = {k ∈ Z : kx}, which is a non-empty subset of R that is bounded above by the supremum α. The confusion arises from the understanding of the boundedness of A, which is clarified by noting that A consists of all integers less than x, thus confirming it is indeed bounded above.

PREREQUISITES
  • Understanding of real numbers and their properties
  • Familiarity with the concept of supremum in set theory
  • Basic knowledge of integer sets and their characteristics
  • Experience with mathematical proofs and logical reasoning
NEXT STEPS
  • Study the properties of supremum and infimum in real analysis
  • Learn about the completeness property of real numbers
  • Explore integer partitions and their applications in number theory
  • Review examples of proofs involving bounded sets in mathematics
USEFUL FOR

Mathematics students, educators, and anyone interested in real analysis and number theory, particularly those studying the properties of integer parts of real numbers.

TaliskerBA
Messages
26
Reaction score
0
I am struggling to understand the proof for integer parts of real numbers. I have used to mean less than or equal to because I could not work out how to type it in. I need to show that:

∃ unique n ∈ Z s.t. nx<n+1

The proof given is the following:

Let

A={k∈Z : kx}

This is a non-empty subset of R that is bounded above. Let α = sup A. There is an n ∈ A such that n > a - 1/2. n>α−1. Then nx and,since n+1>α+1>α, n+1̸∈A. Hence,n+1>x.

In particular I don't understand how A is bounded above, because I thought A = [k,∞) which has no upper bound. Where have I gone wrong?
 
Physics news on Phys.org
A consists of all integers < x, so it is bounded from above.
 

Similar threads

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