Blog Archive

Friday, July 28, 2023

Cantor theorem

Consider a subset S of R , those number look like 0.100101..., each decimal point comes from {0,1}.

That's just the binary system of R.

We can consider a isomorphism from S to 2N, that is, the free module F2N≅P(N).

Then S is not countable ⟺2N is not countable.

 

If 2N is countable, write them as 0.11001110101010....0.01111110010001....0.01111000010001....

View it as a matrix, and consider the (b0b1b2...=(a00a11a22...+(0.1.1... This will turn 0↦1,1↦0.

For example, (010...+(0.11...=(0.01...

And (b00b11b22... is not in this table, since ∀i∈N,bi≠aii⇒∀i∈N,(b0b1b2...≠(ai0ai1ai2....

In general, |X|≠|2X|, since if there exists a bijection f:X→2X

Consider A:={x∈X:x∉f(x)} Remark. f(x)⊆X, thus A=X−⋃x∈Af(x)=⋂x∈Af(x)―

But since f is a bijection, ∃a∈X,f(a)=A, thus A≠⋂x∈Af(x)―.

Since A∩⋂x∈Af(x)―=A∩A―∩⋂x∈A,x≠af(x)―=∅. ◻

 

No comments:

Post a Comment

Popular Posts