Theorems · Definition · order theory
WellQuasiOrdered
{α : Type u_1} → (α → α → Prop) → PropA well quasi-order or WQO is a relation such that any infinite sequence contains an infinite
monotonic subsequence, or equivalently, two elements f m and f n with m < n and
r (f m) (f n).
For a preorder, this is equivalent to having a well-founded order with no infinite antichains.
Despite the nomenclature, we don't require the relation to be preordered. Moreover, a well
quasi-order will not in general be a well-order.
- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 15 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by18
Results whose statement or proof uses this declaration.
- Set.PartiallyWellOrderedOnproof · cited by 34
- WellQuasiOrdered.exists_monotone_subseqstatement and proof · cited by 4
- WellQuasiOrdered.wellFoundedstatement and proof · cited by 2
- WellQuasiOrderedLE.wqostatement · cited by 2
- RelIso.wellQuasiOrdered_iffstatement · cited by 2
- Finite.wellQuasiOrderedstatement · cited by 2
- wellQuasiOrderedLE_defstatement and proof · cited by 2
- Set.partiallyWellOrderedOn_univ_iffstatement · cited by 2
- wellQuasiOrdered_iff_exists_monotone_subseqstatement and proof · cited by 2
- wellQuasiOrdered_lestatement · cited by 2
- WellQuasiOrdered.of_surjectivestatement and proof · cited by 1
- WellQuasiOrderedLE.casesOnstatement and proof · cited by 1