User:IssaRice/Schröder–Bernstein theorem: Difference between revisions

From Machinelearning
Line 39: Line 39:
===Definitions of the bijection in various books===
===Definitions of the bijection in various books===


* Book of Proof:
* Book of Proof: h(x) = f(x) if x is of type 3; <math>g^{-1}(x)</math> if x is of type 1,2,4
* Cornell page:
* Cornell page:
* Tao:
* Tao:

Revision as of 20:51, 31 August 2020

questions:

  • are the ancestor proof and the iterated partition proof actually different, or do they just look different on the surface? btw this is a very nice writeup of the ancestor proof (much clearer than wikipedia's version); HT Satira. UPDATE: these are actually basically the same proof, just written in different notation.
  • what is the proof that uses axiom of choice, and how does choice simplify the proof?
  • is the result a fixed point result? (if so how can we phrase it as such?) or is it just that some of the proofs makes use of the fixed point ideas?

Unified notation

Let A,B be sets. (In Tao's book we assume AB but this isn't the case in the other proofs.)

f:AB (In Tao's book we assume that f=ιAB is the inclusion map that sends each xA to itself.)

g:BA

C0=Ag(B)

Cn+1=(gf)(Cn) for all n0

D0=Bf(A)

Dn+1=(fg)(Dn) for all n0 (In Tao's book, since f is just the inclusion map and g maps into A, we have fg=g which is why Tao can write Dn+1=g(Dn). Note that Tao uses "f" instead of "g" because his notation is different from everybody else's.)

Chain types

Type 1: Loop

Type 2: infinitely goes backwards without repeating

Type 3: Chain stops in A, with g1 eventually undefined.

  • 3a: Elements of C0 (g1 immediately undefined)
  • 3b: Elements of n=1Cn (g1 is defined, but eventually if you keep going g1 will be undefined)

Type 4: Chain stops in B, with f1 eventually undefined.

  • 4a: Elements of D0 (f1 immediately undefined)
  • 4b: Elements of n=1Dn (f1 is defined, but eventually if you keep going f1 will be undefined)

Definitions of the bijection in various books

  • Book of Proof: h(x) = f(x) if x is of type 3; g1(x) if x is of type 1,2,4
  • Cornell page:
  • Tao:
  • Wikipedia:

References