Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Post History

#1: Initial revision by user avatar Derek Elkins‭ · 2023-01-14T15:46:25Z (almost 2 years ago)
By definition $\mathbb R^\mathbb R \subset \mathbf 2^{\mathbb R\times\mathbb R}$. So all we need is a surjection $\mathbb R \twoheadrightarrow \mathbb R \times \mathbb R$ of which there are plenty such as [space filling curves](https://en.wikipedia.org/wiki/Space-filling_curve). If you have a bijection between $\mathbf 2^\mathbb N$ and $\mathbb R$, then a lot of this stuff is easier to do in terms of $\mathbf 2^\mathbb N$. For example, $\mathbf 2^\mathbb N \times \mathbf 2^\mathbb N \cong \mathbf 2^{\mathbb N + \mathbb N} \cong \mathbf 2^\mathbb N$ with the last bijection via the straightforward one showing $\mathbb N \cong \mathbb N + \mathbb N$ (where $+$ represents the disjoint union/coproduct).

That said, you should be able to fairly directly extract a bijection from a proof using cardinal arithmetic. Of course, there's no real reason to apply Schröder-Bernstein at that point.