scratch

§ Cantor Schroder Bernstein via Fixpoint

created 2022-09-07 · last edited 2022-09-28
  • Given two injections f:S→Tf: S \to Tf:S→T, g:T→Sg: T \to Sg:T→S, we want to create a bijection.
  • Suppose we have S=T=NS = T = NS=T=N, and f(n)=g(n)=n+1f(n) = g(n) = n + 1f(n)=g(n)=n+1.
  • If fff were surjective, we are done, for then fff is the bijection.
  • In this case, fff is not surjective, because T−f(S)=0T-f(S) = {0}T−f(S)=0. So 000 has no preimage under fff.
  • We will create a new function f′f'f′ by perturbing fff, such that it does map some element in XXX to 000 [which is currently missed ].
  • Start with f′≡ff' \equiv ff′≡f. This means that f′f'f′ misses 000.
  • We can "force" a pre-image for 000. How? Consider g(0)=1g(0) = 1g(0)=1, and set f′(g(0))≡0f'(g(0)) \equiv 0f′(g(0))≡0, or f′(1)≡0f'(1) \equiv 0f′(1)≡0.
  • Whoops, but we have now "lost" a preimage for f(1)=2f(1) = 2f(1)=2, as now 222 is not in the image of f′f'f′.
  • Let's repeat the same process and fix it the same way. f′(g(2))≡2f'(g(2)) \equiv 2f′(g(2))≡2, or f′(3)≡2f'(3) \equiv 2f′(3)≡2.
  • Now we have lost a pre-image for f(3)f(3)f(3). Well, we just repeat the construction. For how long?
  • Well, this is where we invoke the glory of a fixpoint theorem!
  • See that we definitely need to reverse the arrows for (T−f(S))(T-f(S))(T−f(S)). If we start with a set Y⊆TY \subseteq TY⊆T that we will reverse the arrows to, we will then need to reverse the arrows for Y∪F(G(Y))Y \cup F(G(Y))Y∪F(G(Y)).
  • Thus, the set that we need to fiddle in f′f'f′ is Y↦(T−f(S))∪F(G(Y))Y \mapsto (T-f(S))\cup F(G(Y))Y↦(T−f(S))∪F(G(Y)).
❦
Newer ৪ Blog ৪ Older