-well-quasi-ordering is monotone in
ProvedTenChallenges.isAlphaWQO_monobqoorder-theoryten-challengeswqo
Let be a set with a binary relation and let be ordinals. If is -well-quasi-ordered, then it is -well-quasi-ordered:
Here is the Nash-Williams cumulative hierarchy (nonempty subsets at successor levels, disjoint unions at limit levels) with the game relation , as in the definition IsAlphaWQO.
So the -WQO properties form a hierarchy of strengthenings of well-quasi-ordering (-WQO), with better-quasi-ordering at the top. For the minor order this means, for instance, that each rung of Challenge 6 implies the lower rungs of the same parity; in particular implies .
Preamble
import Definitions.Def_TenChallenges_AlphaWQO universe u
Formal statement
namespace TenChallenges
theorem isAlphaWQO_mono {Q : Type u} (le : Q → Q → Prop) {α β : Ordinal.{u}} (h : β ≤ α) :
IsAlphaWQO le α → IsAlphaWQO le β := by sorry
end TenChallengesSource
Standard property of the α-WQO hierarchy (Marcone, 'Foundations of bqo theory', Trans. AMS 345 (1994)); stated for the hierarchy and game relation of the definition TenChallenges_AlphaWQO, used by Ten Challenges 06.