I'm wondering how to approach the following exercise:
Suppose $ \kappa \geq \omega $. Consider the set of all functions $ \kappa \rightarrow 2 = \{0,1\} $ ordered lexicographically. Show that there is no strictly increasing sequence of length $ \kappa^+ $ in that set.
I think it's obvious that there is a strictly increasing sequence of length $ \kappa $. Maybe if there was one longer, it would contradict Ramsay's coloring theorem? I'm not sure in which direction to continue
Let $\beta\leq \kappa$ be least such that $\langle g_{\alpha}\restriction \beta:\alpha<\kappa^+\rangle$ is strictly increasing and has size $\kappa^+$. For each $\alpha<\kappa^+$ pick $\beta(\alpha)$ such that $g_{\alpha}\restriction \beta(\alpha)=g_{\alpha+1}\restriction \beta(\alpha)$ and $g_{\alpha}(\beta(\alpha))=0, g_{\alpha+1}(\beta(\alpha))=1$. For each $\alpha<\kappa^+$ we have $\beta(\alpha)<\beta$. Now to show there can't be any strictly increasing sequence of length $\kappa^+$, define $h:\kappa^+\to \beta$ by $h(\alpha)=\beta(\alpha)$ and notice that this function must be constant on a set of size $\kappa^+$, because if not, then letting $A_{\alpha}=\{\gamma<\kappa^+:h(\gamma)=\alpha\}$ of size at most $\kappa$ for every $\alpha$, we have $\kappa^+=\bigcup_{\alpha<\beta} A_{\alpha}$ and so $\kappa^+<\kappa$.