lemmington_steele

u/lemmington_steele@lemmy.world
2 posts · 74 comments

Recent posts

Recent comments

technically yes, but the proof would usually show that this works by constructing the bijection of [0,1] and (0,1) and then you'd say the cardinalities are the same by the Schröder-Berstein theorem, because the proof of the latter is likely not something you want to demonstrate every day

no, there aren't enough integers to map onto the interval (0,1).

probably the most famous proof for this is Cantor's diagonalisation argument. though as it usually shows how the cardinality of the naturals is small than this interval, you'll also need to prove that the cardinality of the integers is the same as that of the naturals too (which is usually seen when you go about constructing the set of integers to begin with)

actually you can for each real number you can exhaustively map a uninque number from the interval (0,1) onto it. (there are many such examples, you can find one way by playing around with the function tanx)

this means these two sets are of the same size by the mathematical definition of cardinality :)

on Uncle Rule · c/196 · 4 pts · 2y

well yeah, there's only so much sexy to go around. how else do you propose we save some for spiders?