Maths Olympiad Prep

Track / Stage 6 / 14 of 400 #1014 of 1964

Problem 1014

National olympiad, first round
Combinatorics Difficulty 6.0 Prove it

Lemma 12.1.3 If the set XX is well-quasi-ordered by \leqslant, then [X]<ω[X]^{<\omega} is also well-quasi-ordered by \leqslant.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

Prove that if \leqslant is a well-quasi-ordering on a set XX, but not on [X]<ω[X]^{<\omega}, we can construct a bad sequence (An)nN\left(A_{n}\right)_{n \in \mathbb{N}} in [X]<ω[X]^{<\omega} as follows: Given nNn \in \mathbb{N}, assume inductively that for each i<ni < n, AiA_{i} has already been defined, and there exists a bad sequence in [X]<ω[X]^{<\omega} starting with A0,,An1A_{0}, \ldots, A_{n-1}. (This is clearly true for n=0n=0: by assumption, [X]<ω[X]^{<\omega} contains a bad sequence, which starts with the empty sequence.) Choose An[X]<ωA_{n} \in [X]^{<\omega} such that there is a bad sequence in [X]<ω[X]^{<\omega} starting with A0,A1,,AnA_{0}, A_{1}, \ldots, A_{n}, and An|A_{n}| is as small as possible.

Clearly, (An)nN\left(A_{n}\right)_{n \in \mathbb{N}} is a bad sequence in [X]<ω[X]^{<\omega}; in particular, for all nn, AnA_{n} \neq \emptyset. For each nn, choose an element anAna_{n} \in A_{n}, and let Bn:=An{an}B_{n} := A_{n} \setminus \{a_{n}\}.

By Corollary 12.1.2, the sequence (an)nN\left(a_{n}\right)_{n \in \mathbb{N}} contains an infinite increasing subsequence (ani)iN\left(a_{n_{i}}\right)_{i \in \mathbb{N}}. By the minimality of the choice of An0A_{n_{0}}, the sequence
A0,,An01,Bn0,Bn1,Bn2, A_{0}, \ldots, A_{n_{0}-1}, B_{n_{0}}, B_{n_{1}}, B_{n_{2}}, \ldots
is good. Consider a good pair; since (An)nN\left(A_{n}\right)_{n \in \mathbb{N}} is bad, this pair cannot have the form (Ai,Aj)\left(A_{i}, A_{j}\right) or (Ai,Bj)\left(A_{i}, B_{j}\right) (note that BjAjB_{j} \leqslant A_{j}). Therefore, it must have the form (Bi,Bj)\left(B_{i}, B_{j}\right). By extending the injection BiBjB_{i} \rightarrow B_{j} with aiaja_{i} \rightarrow a_{j}, we conclude that (Ai,Aj)\left(A_{i}, A_{j}\right) is good, which is a contradiction.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.