Basic Analysis I — Real Analysis · Problem 1.1.10

Real Numbers — Jiri Lebl

Mathematics — Real Analysis · ordered-sets

Problem

Let DD be the ordered set of all possible words (not just English words, all strings of letters of arbitrary length) using the Latin alphabet using only lowercase letters. The order is the lexicographic order as in a dictionary (e.g.\ aa<aaa<dog<door\text{aa} < \text{aaa} < \text{dog} < \text{door}). Let AA be the subset of DD containing the words whose first letter is `a' (e.g.\ a∈A\text{a} \in A, abcd∈A\text{abcd} \in A). Show that AA has a supremum and find what it is.

Related theory

Browse the problem library