|
|
|
Viewing Version
2
of
'proof of Zermelo's postulate'
|
[ view 'proof of Zermelo's postulate'
|
back to history
]
| Title of object: |
proof of Zermelo's postulate |
| Canonical Name: |
ProofOfZermelosPostulate |
| Type: |
Proof |
| Created on: |
2006-09-13 00:36:16 |
| Modified on: |
2006-09-13 00:37:26 |
| Classification: |
msc:03E25 |
Preamble:
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{psfrag}
\usepackage{graphicx}
\usepackage{amsthm}
\usepackage{xypic}
|
Content:
Following is a proof that the axiom of choice implies Zermelo's postulate.
Let $\mathcal{F}$ be a disjoint family of nonempty sets. Let $\displaystyle f \colon \mathcal{F} \to \bigcup \mathcal{F}$ be a choice function. Let $A,B \in \mathcal{F}$. Since $\mathcal{F}$ is a disjoint family of sets $\displaystyle A \cap B = \emptyset$. Since $f$ is a choice function, $f(A) \in A$ and $f(B) \in B$. Thus, $f(A) \notin B$. Hence, $f(A) \neq f(B)$. It follows that $f$ is injective.
Let $\displaystyle C=\{f(B) \in \bigcup \mathcal{F} : B \in \mathcal{F} \}$. Then $C$ is a set.
Let $A \in \mathcal{F}$. Since $f$ is injective, $\displaystyle A \cap C=\{f(A)\}$, QED. |
|
|
|
|
|
