Cardinality of infinite sequences of real numbers

[Berrius]

I have to prove that the cardinality of the set of infinite sequences of real numbers is equal to the cardinality of the set of real numbers. So:
$$A := |\mathbb{R}^\mathbb{N}|=|\mathbb{R}| =: B$$

My plan was to define 2 injective maps, 1 from A to B, and 1 from B to A.
B <= A is trivial, just map a real number x on the sequence (xxxxxxxxx...). But I can't find a injective map from A to B. Can someone help?

 

[mfb]

You could reduce it to an easier problem first, for example. Something like $$|[0,1]^\mathbb{N}|=|[0,1]|$$

 

[hapefish]

I would start by thinking about why the cardinality of $[0,1)^2$ is equal to the cardinality $[0,1)$. To do this you think realize that any element of $[0,1)^2$ can be written as $(x,y)$ where $x$ and $y$ have infinite decimal expansions $x = a_1 a_2 a_3 ...$ and $y = b_1 b_2 b_3 ...$, then you can combine these into a unique real number $z = a_1 b_1 a_2 b_2 a_3 b_3 ...$ .

From here, you can generalize this proof to show that $|[0,1)^\mathbb{N}| = |[0,1)|$ by recalling the proof that the rational and natural numbers have the same cardinality. At this point you should be almost home.

Good Luck!

 

[jbunniii]

I would start by thinking about $| \mathbb(R) ^{2} | = | \mathbb{R} |$. it is much easier to think about $|[0,1)^2| = |[0,1)|$. To do this you think realize that any element of $[0,1)^2$ can be written as $(x,y)$ where $x$ and $y$ have infinite decimal expansions [itex] x = a_1 a_2 a_3 ... [/tex] and $y = b_1 b_2 b_3 ...$, then you can combine these into a unique real number $z = a_1 b_1 a_2 b_2 a_3 b_3 ...$.

You need to be careful here because a real number can have more than one decimal expansion (for example, 0.5000... = 0.4999...) so the mapping as written is not well defined. I believe this problem can be avoided by always choosing the expansion that does not terminate. This of course necessitates a bit of work to show that every real number has exactly one nonterminating decimal expansion.

 

[hapefish]

You need to be careful here because a real number can have more than one decimal expansion (for example, 0.5000... = 0.4999...) so the mapping as written is not well defined. I believe this problem can be avoided by always choosing the expansion that does not terminate. This of course necessitates a bit of work to show that every real number has exactly one nonterminating decimal expansion.

Great point, jbunniii, we should definitely make sure to deal with multiple expansions.

(By the way, I'm sorry that I have edited and updated my post multiple times. I'm still trying to figure out how to use the Tex features properly.)

 

[ImaLooser]

I have to prove that the cardinality of the set of infinite sequences of real numbers is equal to the cardinality of the set of real numbers.

You mean countably infinite, right?

 

[jbunniii]

You mean countably infinite, right?

The real numbers are not countable.

 

[mfb]

The real numbers are not countable.

Sure, but the number of elements in the sequences is.

"the cardinality of the set of ([countable] infinite) sequences of real numbers"
I added "()" to clarify the structure.

 

[jbunniii]

Sure, but the number of elements in the sequences is.

"the cardinality of the set of ([countable] infinite) sequences of real numbers"
I added "()" to clarify the structure.

I hadn't thought to parse it that way. It makes more sense, but doesn't "infinite sequence" always mean "countably infinite sequence"?

 

[WWGD]

How about this:



If you accept that the Reals are uncountable and the rationals are countable, and that a
number is rational iff it has an eventually-periodic exoansion:

First show that the set , say S , of sequences in ℝ^N that are eventually-periodic are countable, and then set up a bijection between
ℝ^N\S and the irrationals, sending a sequence to its "natural" decimal expansion.

 

[pwsnafu]

Sure, but the number of elements in the sequences is.

"the cardinality of the set of ([countable] infinite) sequences of real numbers"
I added "()" to clarify the structure.

By definition, a sequence is a function whose domain is a countable totally ordered set.

 

[hapefish]

By definition, a sequence is a function whose domain is a countable totally ordered set.

Mathematicians do occasionally discuss "transfinite sequences" or sequences with an arbitrary index that may the uncountable. If the sequence is of real numbers and an uncountable number of the terms are nonzero, then the sum of the sequence necessarily diverges.

 

[pwsnafu]

Mathematicians do occasionally discuss "transfinite sequences" or sequences with an arbitrary index that may the uncountable. If the sequence is of real numbers and an uncountable number of the terms are nonzero, then the sum of the sequence necessarily diverges.

The proper concept for that is to use the theory of nets.

Edit: just because "transfinite sequence" has the word sequence in it, does not mean it is in fact a "sequence" in the technical sense.