this post was submitted on 06 Jan 2024
267 points (86.0% liked)

memes

16604 readers
3631 users here now

Community rules

1. Be civilNo trolling, bigotry or other insulting / annoying behaviour

2. No politicsThis is non-politics community. For political memes please go to !politicalmemes@lemmy.world

3. No recent repostsCheck for reposts when posting a meme, you can only repost after 1 month

4. No botsNo bots without the express approval of the mods or the admins

5. No Spam/AdsNo advertisements or spam. This is an instance rule and the only way to live.

A collection of some classic Lemmy memes for your enjoyment

Sister communities

founded 2 years ago
MODERATORS
 

I considered deleting the post, but this seems more cowardly than just admitting I was wrong. But TIL something!

you are viewing a single comment's thread
view the rest of the comments
[–] fishos@lemmy.world 2 points 2 years ago* (last edited 2 years ago) (17 children)

Not quite because it's easily shown that the set of all real numbers contains the set of all real numbers between 0-1, but the set of all real numbers from 0-1 does not contain the set of all real numbers. It's like taking a piece of an infinite pie: the slice may be infinite as well, but it's a "smaller" infinite than the whole pie.

This is more like two infinite hoses, but one has a higher pressure. Ones flowing faster than the other, but they're both flowing infinitely.

[–] nodsocket@lemmy.world -5 points 2 years ago* (last edited 2 years ago) (10 children)

It's a similar problem. Both are infinity but one is a bigger infinity than the other.

[–] FishFace@lemmy.world 5 points 2 years ago (4 children)

There is a function which, for each real number, gives you a unique number between 0 and 1. For example, 1/(1+e^x). This shows that there are no more numbers between 0 and 1 than there are real numbers. The formalisation of this fact is contained in the Cantor-Schröder-Bernstein theorem.

[–] lemmington_steele@lemmy.world 1 points 2 years ago (2 children)

ah, but don't forget to prove that the cardinality of [0,1] is that same as that of (0,1) on the way!

[–] FishFace@lemmy.world 3 points 2 years ago

This is pretty trivial if you know that the cardinality of (0, 1) is the same as that of R ;)

[–] sukhmel@programming.dev 1 points 2 years ago (1 children)

Isn't cardinality of [0, 1] = cardinality of {0, 1} + cardinality of (0, 1)? One part of the sum is finite thus doesn't contribute to the result

[–] lemmington_steele@lemmy.world 2 points 2 years ago* (last edited 2 years ago)

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

load more comments (1 replies)
load more comments (6 replies)
load more comments (12 replies)