#Uncountable set

48 messages · Page 1 of 1 (latest)

real pendant
#

Hi, I’m reading the notes of my Professor and he says that if we prove that ]0,1[ is an uncountable set then |R is also an uncountable set. Can you explain why?

nova elmBOT
#
  1. Do not ping the Moderators, unless someone is breaking the rules.
  2. Do not ping the Helper Moderators, unless there is a conflict between helpers.
  3. Do not ping other members randomly for help.
  4. Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
  5. Wait patiently for a helper to come along.
  6. If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:

+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:

real pendant
#

My doubt comes cause ]0,1[ has also irrational numbers

versed crescent
#

Consider the function $\tan(\pi\left(x+\frac{1}{2}\right))$. It's a bijection between which two sets?

radiant cloudBOT
#

mPear Category Theorem

versed crescent
#

Alternatively, suppose that $\mathbb{R}$ were countable. Then we would have some bijection $\phi:\mathbb{N}\to\mathbb{R}$. But, $]0,1[\subseteq\mathbb{R}$; so there is some subset $S\subseteq\mathbb{N}$ such that $\phi(S)=]0,1[$.

radiant cloudBOT
#

mPear Category Theorem

odd grove
real pendant
#

Was thinking of R as Q

odd grove
lost temple
#

$$|(0,1)| \leqslant |\mathbb R| \leqslant |(0,1)| $$

radiant cloudBOT
lost temple
#

cantor bernstein schroeder shenanigans

real pendant
#

What?

lost temple
#

in other words, it's enough to find an injective function R -> (0,1)

real pendant
#

R<=0,1 ??

real pendant
lost temple
#

the first inequality is obvious

real pendant
#

Yes

lost temple
#

$$ \mathbb R \to (-\pi/2, \pi/2) \to (0,1) $$

radiant cloudBOT
lost temple
#

these injections can also be found

real pendant
#

I can see the injections on the inverse order not in bigger sets going to smaller sets

lost temple
#

arctan x is injective (bijective even)

#

and then (-pi/2,pi/2) -> (0,1) injection is easy enough

odd grove
#

I mean, I just agree with mPear's proposition - just take a bijective function with the given sets as the domain and range. Pretty easy in this case.

real pendant
lost temple
#

so you have injections (0,1)->R and R->(0,1)

#

assuming you have proved R is uncountable, you're done

real pendant
#

Ok thanks so in general if A,B are uncountable A<= B<=A is always possible?

lost temple
#

no

#

|A|< |P(A)| for any set

real pendant
#

Can you give a simple example?

lost temple
#

R and P(R)

#

both are uncountable

#

but one is strictly bigger in cardinality than the other

real pendant
#

What is P(R)?

lost temple
#

$$ \mathcal P(A) = {X \subseteq A} $$

radiant cloudBOT
lost temple
#

power set

#

if what is a function?

#

functions don't have cardinalities

real pendant
hasty wraith
#

Just like how the prime numbers are a strict subset of the integers, therefore a proof of infinitely many primes is a proof of infinitely many integers.

inland oliveBOT
#

@real pendant

:HelpIcon:| Help Reminder

Hello 1984.dystopia, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.