Section 10: Problem 10 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
Theorem. Let 
 and 
 be well-ordered sets; assume that there is no surjective function mapping a section of 
 onto 
. Then there exists a unique function 
 satisfying the equation
for each 
, where 
 is the section of 
 by 
.
Proof.
(a) If 
 and 
 map sections of 
, or all of 
, into 
 and satisfy 
 for all 
 in their respective domains, show that 
 for all 
 in both domains.
(b) If there exists a function 
 satisfying 
, show that there exists a function 
 satisfying 
.
(c) If 
 and for all 
 there exists a function 
 satisfying 
, show that there exists a function 
satisfying 
.
(d) Show by transfinite induction that for every 
, there exists a function 
 satisfying 
. [Hint: If 
 has an immediate predecessor 
, then 
. If not, 
 is the union of all 
 with 
.]
(e) Prove the theorem.
In fact, a more general result is true (Exercise 1 of Supplementary Exercises). Let 
 be any set (not necessary well-ordered), let 
 be the set of all functions mapping a section of 
 into 
, and let 
 be a function that assign to each function from 
 an element in 
. Then, there exists a unique function 
 such that 
for all 
.
This is a more general result, as in this particular exercise we are asked to prove it for the particular case when 
. This function is well-defined, because (i) we are given that there is no surjection from 
 onto 
, so 
 is nonempty, and (ii) in our case 
 is assumed to be well-ordered, so that for every nonempty subset of 
 there exists its smallest element.
(a) (This is an analogue to Lemma 8.2.) If 
 and 
 are defined and equal on a section 
, and 
 is in both domains, then 
, because they both satisfy 
. Hence, if 
 and 
 are defined on 
, which is a section 
 or all of 
, then they must be equal on 
: consider the set of 
’s for which 
, note that it is inductive (use the fact that every section of 
 is a section of 
) and apply transfinite induction on 
. The result follows from the fact that the common domain of 
 and 
 must be a section or all of 
.
(b) (This is an analogue to Lemma 8.1.) Extend 
 by the formula 
 (in the specific case of 
 given in the exercise, the extension is well-defined because, basically, (i) and (ii) hold; in the more general case, it is well-defined because 
 is assumed to be well-defined).
(c) (This is an analogue to the second part of the proof of Theorem 8.3.) This follows from (a). Take any element 
 in the union of sections, there is a section 
 (may be not unique) that contains the element and the corresponding function 
. Define 
 (the choice of the section does not matter by (a)), and show that 
 satisfies 
 (which is almost identical to the last paragraph of the proof of Theorem 8.3).
(d) (This is again an analogue to Lemma 8.1, but including transfinite induction.) Consider the set of all those 
’s for which there does not exists the function, then take its smallest element, and use the hint to show that there does exist such function. Or, use the transfinite induction: let 
 be the set of all those 
’s for which the function exists, then if a section 
 is in the 
 then 
 (consider the two cases again using the hint). When using the hint, the two cases correspond to (b) and (c) proved earlier.
(e) (This is an analogue to Theorem 8.3.) Existence. (d) proves that for every section there is a function satisfying 
. (c) proves that, therefore, there is a function satisfying 
 on the union of all sections of 
. The union contains all elements of 
 except for the largest element 
 in 
, if the one exists (every other element has a larger element in the set; thanks to Fran for the comment). But if there is a largest element 
 in 
, we can extend the function from the union of all sections, which is equal to 
, to the whole 
 using (b). The uniqueness follows from (a).
