User:Hakerh400/Schröder–Bernstein theorem

From Esolang
Jump to navigation Jump to search

Schröder–Bernstein theorem states that for any two sets and , if there exists an injective function from to and an injective function from to , then there exists a bijective function between and . There are many proofs of this theorem. In this article we present one of the simplest and most natural proofs. We hope this proof is easier to follow and understand than most of the other proofs. This proof has been formally verified using an interactive theorem prover.

Definitions

Given two sets and . Given injective functions and . We want to construct a bijective function .

Let and be two infinite sequences such that , and for any , is defined as

and . Notation represents the image of set under function .
Let and . We define function such that for all :

The goal is to prove that is a bijection between and .

Proof sketch

The proof consists of several steps:

  1. Prove that for all , if then and are disjoint (also applies to and )
  2. Prove that is a bijection between and for all (this holds because is an image of under , and is injective)
  3. From 2. it follows that is well-defined and also a bijection between and for all
  4. Prove that is a bijection between and (this is the hardest step)
  5. Since is disjoint from for all (also applies to and ), then is a bijection between and