Class Notes On Topology-I(PSMATC-104)

Semester-I, 2021
Unit-I
Dr. Anu Kumari Khanna
Department of Mathematics,
University of Jammu,Jammu,
J & K, India.

March 7, 2021

Theorem: The well ordering principle implies the axiom of choice.

Proof: Let {Ai : i ∈ ∆} be a non empty family of non empty sets.

Let A = ∪i∈∆ Ai , then A 6= φ.

By the well ordering principle, A can be a well ordered; i.e there is a relation ≤ on A such
that (A, ≤) is a well ordered set.
Since each Ai is a non empty subset of A and A is a well ordered set, Ai has the least element;
i.e ∃ai ∈ Ai such that ai ≤ a, ∀a ∈ Ai .
Define a function, f : ∆ → ∪i∈∆ Ai such that f (i) = ai , ∀i ∈ ∆.
Clearly, f (i) = ai ∈ Ai , ∀i ∈ ∆.
Thus f is a choice function for the family {Ai : i ∈ ∆}.
This implies the axiom of choice.


Principle of transfinite induction: Let (X, ≤) be a well ordered set and suppose P (x)
be a statement for every x ∈ X. Suppose for each x ∈ X, P (y) is true for each y < x; i.e y ∈ Xx
implies P (x) is true. Then P (x) is true for each x ∈ X.

Proof: Suppose the result is not true. Then ∃ x ∈ X such that P (x) is false.

Let B = {x ∈ X : P (x) is false}.

Clearly, B is a non-empty subset of X. But X is a well ordered set so B has the least element;
i.e ∃ a unique x0 ∈ B such that x0 ≤ b, ∀b ∈ B.
(D.O.M/ ∗ 2021)

1
 Now let x0 ∈ B =⇒ P (x0 ) is false.
Let y < x0 , then P (y) is true.
Thus for each y < x0 , P (y) is true and so by the hypothesis P (x0 ) is true, which is a contradic-
tion to the fact that x0 ∈ B. Therefore, our supposition is wrong. Hence P (x) is true for each
x ∈ X.


0
Definition: Let (A, ≤) and (B, ≤ ) be two well ordered sets. A function f : A → B is said
0
to be an increasing function if a1 ≤ a2 in A implies f (a1 ) ≤ f (a2 ) in B.

0
Definition: Let (A, ≤) and (B, ≤ ) be two well ordered sets. A function f : A → B is said
0
to be strictly increasing function if a1 < a2 in A implies f (a1 ) < f (a2 ) in B.

(D.O.M/ ∗ 2021)