Section 10: Problem 8 Solution
Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
(a) Let
and
be disjoint sets, well-ordered by
and
, respectively. Define an order relation on
by letting
either if
and
, or if
and
, or if
and
. Show that this is a well-ordering.
(b) Generalize (a) to an arbitrary family of disjoint well-ordered sets, indexed by a well-ordered set.
(a) For a nonempty subset
, if there is
then the smallest element of
is the
-smallest element of
, otherwise
, and the smallest element of
is the
-smallest element of
.
(b) Let
be a family of disjoint well-ordered (by
, respectively) sets where the index set
is well-ordered by
. Define an order relation on
such that
iff either
,
and
, or
and
. Then,
is a well-ordering on
. Indeed, for a nonempty set
, the set of indexes
is not empty, hence, there is the
-smallest element
of
. Further, the set
is not empty, and, hence, there is the
-smallest element
of
. For every
,
for some
, and either
, or
and
. In either case, we conclude that
, and
is the smallest element of
.