MHB Definition of $S_n$ for Cantor-Schröder-Bernstein Theorem

  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Definition
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hi! (Smile)

I am looking at the proof of the theorem of Cantor- Schröder-Bernstein, that states the following:

Let $A,B$ be sets. If $A$ is equinumerous with a subset of $B$ and $B$ is equinumerous with a subset of $A$ then $A, B$ are equinumerous. Or equivalently, if $f: A \overset{1-1}{B}$ and $g: B \overset{1-1}{A}$ then there is a $h: A \overset{\text{surjective}}{\to}B$.

Proof:

Let $f: A \overset{1-1}{\to}B$ and $g: B \overset{1-1}{\to}A$.
We define recursively the following sequence of sets:

$$S_0:=A-g(B)\\S_{n+1}=g[f[S_n]]\\ \text{ for all } n \in \omega \\ \dots$$

We define $S:=\bigcup_{n \in \omega} S_n$ and the function $h: A \to B$ as follows:

$$f(x)=x \text{ if } x \in S \\ h(x)=g^{-1}(x) \text{ if } x \in A-S$$
Could you explain me the definition of $S_n$?
 
Physics news on Phys.org
evinda said:
Hi! (Smile)

I am looking at the proof of the theorem of Cantor- Schröder-Bernstein, that states the following:

Let $A,B$ be sets. If $A$ is equinumerous with a subset of $B$ and $B$ is equinumerous with a subset of $A$ then $A, B$ are equinumerous. Or equivalently, if $f: A \overset{1-1}{B}$ and $g: B \overset{1-1}{A}$ then there is a $h: A \overset{\text{surjective}}{\to}B$.

Proof:

Let $f: A \overset{1-1}{\to}B$ and $g: B \overset{1-1}{\to}A$.
We define recursively the following sequence of sets:

$$S_0:=A-g(B)\\S_{n+1}=g[f[S_n]]\\ \text{ for all } n \in \omega \\ \dots$$

We define $S:=\bigcup_{n \in \omega} S_n$ and the function $h: A \to B$ as follows:

$$f(x)=x \text{ if } x \in S \\ h(x)=g^{-1}(x) \text{ if } x \in A-S$$
Could you explain me the definition of $S_n$?
Hi evinda.

You have defined $S_n$ inductively by declaring:

$$S_0:=A-g(B)\\S_{n+1}=g[f[S_n]]\\ \text{ for all } n \in \omega \\ \dots$$

Where exactly are you facing a problem?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top