Is the set of terms of a sequence countable?

2.2k Views Asked by At

According to Rosen, an infinite set A is countable if $|A|= |\mathbb{Z}^+|$ which in turn can be established by finding a bijection from A to $\mathbb{Z}^+$.

Also, a sequence is defined as a function from $\mathbb{Z}^+$ (or $\{0\} \cup \mathbb{Z}^+$) to some set.

With the above, a sequence is certainly enumerable. However, it need not be a bijection, e.g. Fibonacci(1) = Fibonacci(2) = 1.

This implies that not every sequence is countable which seems counterintuitive. Are there any results in this regard? Is there a mistake in the reasoning above?

3

There are 3 best solutions below

1
On

Every sequence has a countable or a finite set of values.

Besides, you are mixing two ideas : a sequence $(u_n)_n$ is a function $n\mapsto u_n\in F$ ($F$ being any possible set) and almost never a bijection, but the set of all its values are finite or countable.

10
On

"However, it need not be a bijection"

No, it doesn't.

"This implies that not every sequence is countable"

Why do you say that?

$f: \mathbb Z^+ \to B$. If $f$ is not surjective then there are points of $B$ that are not in the image. Those to not matter. We can restrict ourselves to $f: \mathbb Z^+ \to Im(B)$.

This must be surjective.

It doesn't need to be injective however and your Fibinocci example shows.

But... so what? Than means $|Im(B)| \le |\mathbb Z^+|$.

Hence it MUST be countable (or countably finite).

Anyway, as the terms of a sequence, as opposed to a set, need not be distinct it is possible, indeed common, for a sequence to have a finite number of distinct terms infinitely repeated.

0
On

As a sequence is a set indexed by the natural numbers, there exists a surjection from the naturals to the set. Let $A$ be the set and g: $\mathbb{N}\rightarrow A$ the surjection. Then we can define a map $f:A \rightarrow \mathbb{N}$ as $f(a)=$ the minimum natural number n such that $g(n)=a$. Then f is injective and thus A must be countably infinite or finite. Further, you can similarly show that every set indexed by a countably infinite set is either finite or countably infinite.