This shows that the intervals (0,1) and [0,1] are equivalent.

Click For Summary
SUMMARY

The intervals (0,1) and [0,1] are equivalent through the establishment of a bijection between their rational elements. The discussion highlights the use of a function that maps rationals in [0,1] to those in (0,1), specifically defining a sequence for the rationals. The supremum and infimum of both intervals are confirmed as 1 and 0, respectively, reinforcing their equivalence. Additionally, the delta-epsilon method is suggested for a rigorous proof of this equivalence.

PREREQUISITES
  • Understanding of bijections in set theory
  • Familiarity with rational and irrational numbers
  • Knowledge of delta-epsilon proofs in analysis
  • Basic concepts of supremum and infimum
NEXT STEPS
  • Research the construction of bijections between sets
  • Study delta-epsilon proofs in real analysis
  • Explore the properties of countable and uncountable sets
  • Learn about the topology of real numbers and interval equivalence
USEFUL FOR

Mathematicians, students of real analysis, and anyone interested in understanding the properties of intervals and set equivalence in mathematics.

tink
Messages
13
Reaction score
0
Show that the intervals (0,1) and [0,1] are equivalent. (Hint: consider rationals and irrationals separately).

I'm able to find a function that shows a bijection between (0,1) an [0,1] under the irrationals, but i can't figure out the rationals. Also... the next step (i believe) would be to find a bijection between these two functions. If anybody can help me figure out an answer to this problem that would be so awesome! Thanks so much, guys!
 
Physics news on Phys.org
i'm not really good at this but i think this would be relevant to the proof

In both cases the supremum (least upper bound) is 1 and the greatest lower bound is 0.

Also for all x in (0,1) 0<x<1
and for for all x in [0,1], 0<=x<=1, and it follows that 0<x<1 for this interval as well.

Thus (0,1) is a subinterval of [0,1]

If you are familiar with delta-epsilon proofs you might want to prove that

0 + delta < x < 1 + delta is equivalent to 0<=x<=1 for a suitable delta > 0.
 
The set of rational numbers is countable. That means that the set of rationals in (0,1) can be arranged in a sequence, like this:

[tex]r_2, r_3, r_4,\dots[/tex]

If you define

[tex]r_0=0[/tex]

and

[tex]r_1=1[/tex]

The function f defined by

[tex]f(r_n)=r_{n+2}[/tex]

maps the rationals in [0,1] bijectively onto the rationals in (0,1).
 

Similar threads

Replies
10
Views
2K
Replies
2
Views
2K
Replies
10
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
1
Views
2K