« Section 3: Problem 10 Solution

Section 3: Problem 12 Solution »

Section 3: Problem 11 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
Show that an element in an ordered set has at most one immediate successor and at most one immediate predecessor. Show that a subset of an ordered set has at most one smallest element and at most one largest element.
If there are two different immediate successors of , , then , , and and are both empty, but since for the order either or , one of the sets or is non-empty, contradiction. Similarly for immediate predecessors. "At most one smallest or largest element"-part follows from a similar argument as well (for example, if there are two different smallest elements of a set, then one has to be smaller than the other).