429 字
2 分鐘
06 Set And Functions

課程總覽

Cardinality#

Notation.

S\left| S \right|

Function#

Notation.

f:STf: S \to T

Injection, Surjection, Bijection#

Definition. Injection:

x,yS, xy    f(x)f(y).\forall x, y \in S,\ x \ne y \implies f(x) \ne f(y).

Definition. Surjection:

yT, xS s.t. f(x)=y.\forall y \in T,\ \exists x \in S\ \text{s.t.}\ f(x) = y.

Same Cardinality#

Definition. 若兩集合等勢,則

S=T    f:ST\left| S \right| = \left| T \right| \implies \exists f : S \to T

where ff is a bijection.

Countability#

Definition. 一個集合SS可數,則這個集合有限,或者

S=N.\left| S \right| = \left| N \right| .

Proof. N=Z\left| N \right| = \left| Z \right|.

f(n)={n12, n is oddn2, otherwisef(n) = \left\{\begin{aligned} & \frac{n-1}{2},\ n\ \text{is odd} \\ & - \frac{n}{2},\ \text{otherwise} \end{aligned}\right.

where nNn \in \mathbb{N}. injection proof 兩個相異數字,證明他們的函數值不相等:

  1. 奇數對奇數
  2. 偶數對偶數
  3. 基數對偶數(必對應到正負,必不相等)

surjection proof 任何z都可找到n使得f(n)=zf(n)=z.

  1. 非負整數
  2. 負整數 各自解方程式。

Proof. N=Z{\left| \mathbb{N} \right| = \left| \mathbb{Z} \right|}(2)

f(x)={2x, f(x)>0.2x+1, otherwise.f(x) = \left\{\begin{aligned} & 2x,\ f(x) >0. \\ & -2x + 1,\ \text{otherwise}. \end{aligned}\right.

where xNx \in \mathbb{N}. injection proof.

  1. 正數對零負
  2. 正數對正數
  3. 零負對零負

surjection proof 任何z都可找到n使得f(n)=zf(n)=z.

  1. 非負整數
  2. 負整數 各自解方程式。

Proof. N=Q+{\left| N \right| = \left| Q^{+} \right|}. 對角化

Proof. NR{\left| \mathbb{N} \right| \ne \left| \mathbb{R} \right|}.

  1. 設反敘述為真,則存在bijection.
  2. 將實數rr切成整數跟小數部份,r10.r11r12r_{10}.r_{11}r_{12}\dots
  3. 非onto:構建一個rr^{*},每一位數都「刻意找碴」:
ri={1 if rii=22 otherwise{r_{i}}^{*} = \left\{\begin{aligned} & 1\ \text{if}\ r_{ii} = 2 \\ & 2\ \text{otherwise} \end{aligned}\right.
  1. 則這個例外因為不等於任何rir_{i},故也找不到相對應的輸入值。矛盾

Cardinality Comparison#

Definition. AB{\left| A \right| \le \left| B \right|}:

f:AB\exists f : A \to B

where ff is an injection.

Definition. A<B{\left| A \right| < \left| B \right|}:

ABAB.\left| A \right| \le \left| B \right| \land \left| A \right| \ne \left| B \right| .

Example. N<R{\left| \mathbb{N} \right| < \left| \mathbb{R} \right|}:

f:NR; NR.\exists f: \mathbb{N} \to \mathbb{R};\ \left| \mathbb{N} \right| \ne \left| \mathbb{R} \right| .

Theorem. Schroder-Bernstein

ABBA    A=B.\left| A \right| \le \left| B \right| \land \left| B \right| \le \left| A \right| \implies \left| A \right| = \left| B \right| .
06 Set And Functions
https://blade520.com/posts/discrete-mathematics/ch6-set-and-functions/
作者
Blade/磯江
發佈於
2025-06-06
許可協議
CC BY-NC-SA 4.0