Well-founded sets

A well-founded subset of an ordered type is one on which the relation < is well-founded.

Main Definitions

• Set.WellFoundedOn s r indicates that the relation r is well-founded when restricted to the set s.
• Set.IsWf s indicates that < is well-founded when restricted to s.
• Set.PartiallyWellOrderedOn s r indicates that the relation r is partially well-ordered (also known as well quasi-ordered) when restricted to the set s.
• Set.IsPwo s indicates that any infinite sequence of elements in s contains an infinite monotone subsequence. Note that this is equivalent to containing only two comparable elements.

Main Results

• Higman's Lemma, Set.PartiallyWellOrderedOn.partiallyWellOrderedOn_sublistForall₂, shows that if r is partially well-ordered on s, then List.SublistForall₂ is partially well-ordered on the set of lists of elements of s. The result was originally published by Higman, but this proof more closely follows Nash-Williams.
• Set.wellFoundedOn_iff relates well_founded_on to the well-foundedness of a relation on the original type, to avoid dealing with subtypes.
• Set.IsWf.mono shows that a subset of a well-founded subset is well-founded.
• Set.IsWf.union shows that the union of two well-founded subsets is well-founded.
• Finset.isWf shows that all Finsets are well-founded.

TODO

Prove that s is partial well ordered iff it has no infinite descending chain or antichain.

References

• [Higman, Ordering by Divisibility in Abstract Algebras][Higman52]
• [Nash-Williams, On Well-Quasi-Ordering Finite Trees][Nash-Williams63]

Relations well-founded on sets

def Set.WellFoundedOn {α : Type u_2} (s : Set α) (r : α → α → Prop) : Prop

s.WellFoundedOn r indicates that the relation r is well-founded when restricted to s.

Equations

• Set.WellFoundedOn s r = WellFounded fun a b => r ↑a ↑b

@[simp]

theorem Set.wellFoundedOn_empty {α : Type u_2} (r : α → α → Prop) : Set.WellFoundedOn ∅ r

theorem Set.wellFoundedOn_iff {α : Type u_2} {r : α → α → Prop} {s : Set α} : Set.WellFoundedOn s r ↔ WellFounded fun a b => r a b ∧ a ∈ s ∧ b ∈ s

@[simp]

theorem Set.wellFoundedOn_univ {α : Type u_2} {r : α → α → Prop} : Set.WellFoundedOn Set.univ r ↔ WellFounded r

theorem WellFounded.wellFoundedOn {α : Type u_2} {r : α → α → Prop} {s : Set α} : WellFounded r → Set.WellFoundedOn s r

@[simp]

theorem Set.wellFoundedOn_range {α : Type u_2} {β : Type u_3} {r : α → α → Prop} {f : β → α} : Set.WellFoundedOn (Set.range f) r ↔ WellFounded (r on f)

@[simp]

theorem Set.wellFoundedOn_image {α : Type u_2} {β : Type u_3} {r : α → α → Prop} {f : β → α} {s : Set β} : Set.WellFoundedOn (f '' s) r ↔ Set.WellFoundedOn s (r on f)

theorem Set.WellFoundedOn.induction {α : Type u_2} {r : α → α → Prop} {s : Set α} {x : α} (hs : Set.WellFoundedOn s r) (hx : x ∈ s) {P : α → Prop} (hP : (y : α) → y ∈ s → ((z : α) → z ∈ s → r z y → P z) → P y) : P x

theorem Set.WellFoundedOn.mono {α : Type u_2} {r : α → α → Prop} {r' : α → α → Prop} {s : Set α} {t : Set α} (h : Set.WellFoundedOn t r') (hle : r ≤ r') (hst : s ⊆ t) : Set.WellFoundedOn s r

theorem Set.WellFoundedOn.mono' {α : Type u_2} {r : α → α → Prop} {r' : α → α → Prop} {s : Set α} (h : (a : α) → a ∈ s → (b : α) → b ∈ s → r' a b → r a b) : Set.WellFoundedOn s r → Set.WellFoundedOn s r'

theorem Set.WellFoundedOn.subset {α : Type u_2} {r : α → α → Prop} {s : Set α} {t : Set α} (h : Set.WellFoundedOn t r) (hst : s ⊆ t) : Set.WellFoundedOn s r

theorem Set.WellFoundedOn.acc_iff_wellFoundedOn {α : Type u_6} {r : α → α → Prop} {a : α} : List.TFAE [Acc r a, Set.WellFoundedOn {b | Relation.ReflTransGen r b a} r, Set.WellFoundedOn {b | Relation.TransGen r b a} r]

a is accessible under the relation r iff r is well-founded on the downward transitive closure of a under r (including a or not).

instance Set.IsStrictOrder.subset {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} : IsStrictOrder α fun a b => r a b ∧ a ∈ s ∧ b ∈ s

Equations

• @Set.IsStrictOrder.subset = @Set.IsStrictOrder.subset.proof_1

theorem Set.wellFoundedOn_iff_no_descending_seq {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} : Set.WellFoundedOn s r ↔ ∀ (f : (fun x x_1 => x > x_1) ↪r r), ¬∀ (n : ℕ), ↑f n ∈ s

theorem Set.WellFoundedOn.union {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} {t : Set α} (hs : Set.WellFoundedOn s r) (ht : Set.WellFoundedOn t r) : Set.WellFoundedOn (s ∪ t) r

@[simp]

theorem Set.wellFoundedOn_union {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} {t : Set α} : Set.WellFoundedOn (s ∪ t) r ↔ Set.WellFoundedOn s r ∧ Set.WellFoundedOn t r

Sets well-founded w.r.t. the strict inequality

def Set.IsWf {α : Type u_2} [LT α] (s : Set α) : Prop

s.IsWf indicates that < is well-founded when restricted to s.

Equations

• Set.IsWf s = Set.WellFoundedOn s fun x x_1 => x < x_1

@[simp]

theorem Set.isWf_empty {α : Type u_2} [LT α] : Set.IsWf ∅

theorem Set.isWf_univ_iff {α : Type u_2} [LT α] : Set.IsWf Set.univ ↔ WellFounded fun x x_1 => x < x_1

theorem Set.IsWf.mono {α : Type u_2} [LT α] {s : Set α} {t : Set α} (h : Set.IsWf t) (st : s ⊆ t) : Set.IsWf s

theorem Set.IsWf.union {α : Type u_2} [Preorder α] {s : Set α} {t : Set α} (hs : Set.IsWf s) (ht : Set.IsWf t) : Set.IsWf (s ∪ t)

@[simp]

theorem Set.isWf_union {α : Type u_2} [Preorder α] {s : Set α} {t : Set α} : Set.IsWf (s ∪ t) ↔ Set.IsWf s ∧ Set.IsWf t

theorem Set.isWf_iff_no_descending_seq {α : Type u_2} [Preorder α] {s : Set α} : Set.IsWf s ↔ ∀ (f : ℕ → α), StrictAnti f → ¬∀ (n : ℕ), f (↑OrderDual.toDual n) ∈ s

Partially well-ordered sets

A set is partially well-ordered by a relation r when any infinite sequence contains two elements where the first is related to the second by r. Equivalently, any antichain (see IsAntichain) is finite, see Set.partiallyWellOrderedOn_iff_finite_antichains.

def Set.PartiallyWellOrderedOn {α : Type u_2} (s : Set α) (r : α → α → Prop) : Prop

A subset is partially well-ordered by a relation r when any infinite sequence contains two elements where the first is related to the second by r.

Equations

• Set.PartiallyWellOrderedOn s r = ∀ (f : ℕ → α), (∀ (n : ℕ), f n ∈ s) → ∃ m n, m < n ∧ r (f m) (f n)

theorem Set.PartiallyWellOrderedOn.mono {α : Type u_2} {r : α → α → Prop} {s : Set α} {t : Set α} (ht : Set.PartiallyWellOrderedOn t r) (h : s ⊆ t) : Set.PartiallyWellOrderedOn s r

@[simp]

theorem Set.partiallyWellOrderedOn_empty {α : Type u_2} (r : α → α → Prop) : Set.PartiallyWellOrderedOn ∅ r

theorem Set.PartiallyWellOrderedOn.union {α : Type u_2} {r : α → α → Prop} {s : Set α} {t : Set α} (hs : Set.PartiallyWellOrderedOn s r) (ht : Set.PartiallyWellOrderedOn t r) : Set.PartiallyWellOrderedOn (s ∪ t) r

@[simp]

theorem Set.partiallyWellOrderedOn_union {α : Type u_2} {r : α → α → Prop} {s : Set α} {t : Set α} : Set.PartiallyWellOrderedOn (s ∪ t) r ↔ Set.PartiallyWellOrderedOn s r ∧ Set.PartiallyWellOrderedOn t r

theorem Set.PartiallyWellOrderedOn.image_of_monotone_on {α : Type u_2} {β : Type u_3} {r : α → α → Prop} {r' : β → β → Prop} {f : α → β} {s : Set α} (hs : Set.PartiallyWellOrderedOn s r) (hf : (a₁ : α) → a₁ ∈ s → (a₂ : α) → a₂ ∈ s → r a₁ a₂ → r' (f a₁) (f a₂)) : Set.PartiallyWellOrderedOn (f '' s) r'

theorem IsAntichain.finite_of_partiallyWellOrderedOn {α : Type u_2} {r : α → α → Prop} {s : Set α} (ha : IsAntichain r s) (hp : Set.PartiallyWellOrderedOn s r) : Set.Finite s

theorem Set.Finite.partiallyWellOrderedOn {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] (hs : Set.Finite s) : Set.PartiallyWellOrderedOn s r

theorem IsAntichain.partiallyWellOrderedOn_iff {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] (hs : IsAntichain r s) : Set.PartiallyWellOrderedOn s r ↔ Set.Finite s

@[simp]

theorem Set.partiallyWellOrderedOn_singleton {α : Type u_2} {r : α → α → Prop} [IsRefl α r] (a : α) : Set.PartiallyWellOrderedOn {a} r

theorem Set.Subsingleton.partiallyWellOrderedOn {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] (hs : Set.Subsingleton s) : Set.PartiallyWellOrderedOn s r

@[simp]

theorem Set.partiallyWellOrderedOn_insert {α : Type u_2} {r : α → α → Prop} {s : Set α} {a : α} [IsRefl α r] : Set.PartiallyWellOrderedOn (insert a s) r ↔ Set.PartiallyWellOrderedOn s r

theorem Set.PartiallyWellOrderedOn.insert {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] (h : Set.PartiallyWellOrderedOn s r) (a : α) : Set.PartiallyWellOrderedOn (insert a s) r

theorem Set.partiallyWellOrderedOn_iff_finite_antichains {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] [IsSymm α r] : Set.PartiallyWellOrderedOn s r ↔ ∀ (t : Set α), t ⊆ s → IsAntichain r t → Set.Finite t

theorem Set.PartiallyWellOrderedOn.exists_monotone_subseq {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] [IsTrans α r] (h : Set.PartiallyWellOrderedOn s r) (f : ℕ → α) (hf : ∀ (n : ℕ), f n ∈ s) : ∃ g, (m n : ℕ) → m ≤ n → r (f (↑g m)) (f (↑g n))

theorem Set.partiallyWellOrderedOn_iff_exists_monotone_subseq {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsRefl α r] [IsTrans α r] : Set.PartiallyWellOrderedOn s r ↔ ∀ (f : ℕ → α), (∀ (n : ℕ), f n ∈ s) → ∃ g, (m n : ℕ) → m ≤ n → r (f (↑g m)) (f (↑g n))

theorem Set.PartiallyWellOrderedOn.prod {α : Type u_2} {β : Type u_3} {r : α → α → Prop} {r' : β → β → Prop} {s : Set α} [IsRefl α r] [IsTrans α r] {t : Set β} (hs : Set.PartiallyWellOrderedOn s r) (ht : Set.PartiallyWellOrderedOn t r') : Set.PartiallyWellOrderedOn (s ×ˢ t) fun x y => r x.fst y.fst ∧ r' x.snd y.snd

theorem Set.PartiallyWellOrderedOn.wellFoundedOn {α : Type u_2} {r : α → α → Prop} {s : Set α} [IsPreorder α r] (h : Set.PartiallyWellOrderedOn s r) : Set.WellFoundedOn s fun a b => r a b ∧ ¬r b a

def Set.IsPwo {α : Type u_2} [Preorder α] (s : Set α) : Prop

A subset of a preorder is partially well-ordered when any infinite sequence contains a monotone subsequence of length 2 (or equivalently, an infinite monotone subsequence).

Equations

• Set.IsPwo s = Set.PartiallyWellOrderedOn s fun x x_1 => x ≤ x_1

theorem Set.IsPwo.mono {α : Type u_2} [Preorder α] {s : Set α} {t : Set α} (ht : Set.IsPwo t) : s ⊆ t → Set.IsPwo s

theorem Set.IsPwo.exists_monotone_subseq {α : Type u_2} [Preorder α] {s : Set α} (h : Set.IsPwo s) (f : ℕ → α) (hf : ∀ (n : ℕ), f n ∈ s) : ∃ g, Monotone (f ∘ ↑g)

theorem Set.isPwo_iff_exists_monotone_subseq {α : Type u_2} [Preorder α] {s : Set α} : Set.IsPwo s ↔ ∀ (f : ℕ → α), (∀ (n : ℕ), f n ∈ s) → ∃ g, Monotone (f ∘ ↑g)

theorem Set.IsPwo.isWf {α : Type u_2} [Preorder α] {s : Set α} (h : Set.IsPwo s) : Set.IsWf s

theorem Set.IsPwo.prod {α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] {s : Set α} {t : Set β} (hs : Set.IsPwo s) (ht : Set.IsPwo t) : Set.IsPwo (s ×ˢ t)

theorem Set.IsPwo.image_of_monotoneOn {α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] {s : Set α} (hs : Set.IsPwo s) {f : α → β} (hf : MonotoneOn f s) : Set.IsPwo (f '' s)

theorem Set.IsPwo.image_of_monotone {α : Type u_2} {β : Type u_3} [Preorder α] [Preorder β] {s : Set α} (hs : Set.IsPwo s) {f : α → β} (hf : Monotone f) : Set.IsPwo (f '' s)

theorem Set.IsPwo.union {α : Type u_2} [Preorder α] {s : Set α} {t : Set α} (hs : Set.IsPwo s) (ht : Set.IsPwo t) : Set.IsPwo (s ∪ t)

@[simp]

theorem Set.isPwo_union {α : Type u_2} [Preorder α] {s : Set α} {t : Set α} : Set.IsPwo (s ∪ t) ↔ Set.IsPwo s ∧ Set.IsPwo t

theorem Set.Finite.isPwo {α : Type u_2} [Preorder α] {s : Set α} (hs : Set.Finite s) : Set.IsPwo s

@[simp]

theorem Set.isPwo_of_finite {α : Type u_2} [Preorder α] {s : Set α} [Finite α] : Set.IsPwo s

@[simp]

theorem Set.isPwo_singleton {α : Type u_2} [Preorder α] (a : α) : Set.IsPwo {a}

@[simp]

theorem Set.isPwo_empty {α : Type u_2} [Preorder α] : Set.IsPwo ∅

theorem Set.Subsingleton.isPwo {α : Type u_2} [Preorder α] {s : Set α} (hs : Set.Subsingleton s) : Set.IsPwo s

@[simp]

theorem Set.isPwo_insert {α : Type u_2} [Preorder α] {s : Set α} {a : α} : Set.IsPwo (insert a s) ↔ Set.IsPwo s

theorem Set.IsPwo.insert {α : Type u_2} [Preorder α] {s : Set α} (h : Set.IsPwo s) (a : α) : Set.IsPwo (insert a s)

theorem Set.Finite.isWf {α : Type u_2} [Preorder α] {s : Set α} (hs : Set.Finite s) : Set.IsWf s

@[simp]

theorem Set.isWf_singleton {α : Type u_2} [Preorder α] {a : α} : Set.IsWf {a}

theorem Set.Subsingleton.isWf {α : Type u_2} [Preorder α] {s : Set α} (hs : Set.Subsingleton s) : Set.IsWf s

@[simp]

theorem Set.isWf_insert {α : Type u_2} [Preorder α] {s : Set α} {a : α} : Set.IsWf (insert a s) ↔ Set.IsWf s

theorem Set.IsWf.insert {α : Type u_2} [Preorder α] {s : Set α} (h : Set.IsWf s) (a : α) : Set.IsWf (insert a s)

theorem Set.Finite.wellFoundedOn {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} (hs : Set.Finite s) : Set.WellFoundedOn s r

@[simp]

theorem Set.wellFoundedOn_singleton {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {a : α} : Set.WellFoundedOn {a} r

theorem Set.Subsingleton.wellFoundedOn {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} (hs : Set.Subsingleton s) : Set.WellFoundedOn s r

@[simp]

theorem Set.wellFoundedOn_insert {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} {a : α} : Set.WellFoundedOn (insert a s) r ↔ Set.WellFoundedOn s r

theorem Set.WellFoundedOn.insert {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] {s : Set α} (h : Set.WellFoundedOn s r) (a : α) : Set.WellFoundedOn (insert a s) r

theorem Set.IsWf.isPwo {α : Type u_2} [LinearOrder α] {s : Set α} (hs : Set.IsWf s) : Set.IsPwo s

theorem Set.isWf_iff_isPwo {α : Type u_2} [LinearOrder α] {s : Set α} : Set.IsWf s ↔ Set.IsPwo s

In a linear order, the predicates Set.IsWf and Set.IsPwo are equivalent.

@[simp]

theorem Finset.partiallyWellOrderedOn {α : Type u_2} {r : α → α → Prop} [IsRefl α r] (s : Finset α) : Set.PartiallyWellOrderedOn (↑s) r

@[simp]

theorem Finset.isPwo {α : Type u_2} [Preorder α] (s : Finset α) : Set.IsPwo ↑s

@[simp]

theorem Finset.isWf {α : Type u_2} [Preorder α] (s : Finset α) : Set.IsWf ↑s

@[simp]

theorem Finset.wellFoundedOn {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] (s : Finset α) : Set.WellFoundedOn (↑s) r

theorem Finset.wellFoundedOn_sup {ι : Type u_1} {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] (s : Finset ι) {f : ι → Set α} : Set.WellFoundedOn (Finset.sup s f) r ↔ ∀ (i : ι), i ∈ s → Set.WellFoundedOn (f i) r

theorem Finset.partiallyWellOrderedOn_sup {ι : Type u_1} {α : Type u_2} {r : α → α → Prop} (s : Finset ι) {f : ι → Set α} : Set.PartiallyWellOrderedOn (Finset.sup s f) r ↔ ∀ (i : ι), i ∈ s → Set.PartiallyWellOrderedOn (f i) r

theorem Finset.isWf_sup {ι : Type u_1} {α : Type u_2} [Preorder α] (s : Finset ι) {f : ι → Set α} : Set.IsWf (Finset.sup s f) ↔ ∀ (i : ι), i ∈ s → Set.IsWf (f i)

theorem Finset.isPwo_sup {ι : Type u_1} {α : Type u_2} [Preorder α] (s : Finset ι) {f : ι → Set α} : Set.IsPwo (Finset.sup s f) ↔ ∀ (i : ι), i ∈ s → Set.IsPwo (f i)

@[simp]

theorem Finset.wellFoundedOn_bUnion {ι : Type u_1} {α : Type u_2} {r : α → α → Prop} [IsStrictOrder α r] (s : Finset ι) {f : ι → Set α} : Set.WellFoundedOn (⋃ (i : ι) (_ : i ∈ s), f i) r ↔ ∀ (i : ι), i ∈ s → Set.WellFoundedOn (f i) r

@[simp]

theorem Finset.partiallyWellOrderedOn_bUnion {ι : Type u_1} {α : Type u_2} {r : α → α → Prop} (s : Finset ι) {f : ι → Set α} : Set.PartiallyWellOrderedOn (⋃ (i : ι) (_ : i ∈ s), f i) r ↔ ∀ (i : ι), i ∈ s → Set.PartiallyWellOrderedOn (f i) r

@[simp]

theorem Finset.isWf_bUnion {ι : Type u_1} {α : Type u_2} [Preorder α] (s : Finset ι) {f : ι → Set α} : Set.IsWf (⋃ (i : ι) (_ : i ∈ s), f i) ↔ ∀ (i : ι), i ∈ s → Set.IsWf (f i)

@[simp]

theorem Finset.isPwo_bUnion {ι : Type u_1} {α : Type u_2} [Preorder α] (s : Finset ι) {f : ι → Set α} : Set.IsPwo (⋃ (i : ι) (_ : i ∈ s), f i) ↔ ∀ (i : ι), i ∈ s → Set.IsPwo (f i)

noncomputable def Set.IsWf.min {α : Type u_2} [Preorder α] {s : Set α} (hs : Set.IsWf s) (hn : Set.Nonempty s) : α

Set.IsWf.min returns a minimal element of a nonempty well-founded set.

Equations

• Set.IsWf.min hs hn = ↑(WellFounded.min hs Set.univ (_ : Set.Nonempty Set.univ))

theorem Set.IsWf.min_mem {α : Type u_2} [Preorder α] {s : Set α} (hs : Set.IsWf s) (hn : Set.Nonempty s) : Set.IsWf.min hs hn ∈ s

theorem Set.IsWf.not_lt_min {α : Type u_2} [Preorder α] {s : Set α} {a : α} (hs : Set.IsWf s) (hn : Set.Nonempty s) (ha : a ∈ s) : ¬a < Set.IsWf.min hs hn

@[simp]

theorem Set.isWf_min_singleton {α : Type u_2} [Preorder α] (a : α) {hs : Set.IsWf {a}} {hn : Set.Nonempty {a}} : Set.IsWf.min hs hn = a

theorem Set.IsWf.min_le {α : Type u_2} [LinearOrder α] {s : Set α} {a : α} (hs : Set.IsWf s) (hn : Set.Nonempty s) (ha : a ∈ s) : Set.IsWf.min hs hn ≤ a

theorem Set.IsWf.le_min_iff {α : Type u_2} [LinearOrder α] {s : Set α} {a : α} (hs : Set.IsWf s) (hn : Set.Nonempty s) : a ≤ Set.IsWf.min hs hn ↔ ∀ (b : α), b ∈ s → a ≤ b

theorem Set.IsWf.min_le_min_of_subset {α : Type u_2} [LinearOrder α] {s : Set α} {t : Set α} {hs : Set.IsWf s} {hsn : Set.Nonempty s} {ht : Set.IsWf t} {htn : Set.Nonempty t} (hst : s ⊆ t) : Set.IsWf.min ht htn ≤ Set.IsWf.min hs hsn

theorem Set.IsWf.min_union {α : Type u_2} [LinearOrder α] {s : Set α} {t : Set α} (hs : Set.IsWf s) (hsn : Set.Nonempty s) (ht : Set.IsWf t) (htn : Set.Nonempty t) : Set.IsWf.min (_ : Set.IsWf (s ∪ t)) (_ : Set.Nonempty (s ∪ t)) = min (Set.IsWf.min hs hsn) (Set.IsWf.min ht htn)

def Set.PartiallyWellOrderedOn.IsBadSeq {α : Type u_2} (r : α → α → Prop) (s : Set α) (f : ℕ → α) : Prop

In the context of partial well-orderings, a bad sequence is a nonincreasing sequence whose range is contained in a particular set s. One exists if and only if s is not partially well-ordered.

Equations

• Set.PartiallyWellOrderedOn.IsBadSeq r s f = ((∀ (n : ℕ), f n ∈ s) ∧ ∀ (m n : ℕ), m < n → ¬r (f m) (f n))

theorem Set.PartiallyWellOrderedOn.iff_forall_not_isBadSeq {α : Type u_2} (r : α → α → Prop) (s : Set α) : Set.PartiallyWellOrderedOn s r ↔ ∀ (f : ℕ → α), ¬Set.PartiallyWellOrderedOn.IsBadSeq r s f

def Set.PartiallyWellOrderedOn.IsMinBadSeq {α : Type u_2} (r : α → α → Prop) (rk : α → ℕ) (s : Set α) (n : ℕ) (f : ℕ → α) : Prop

This indicates that every bad sequence g that agrees with f on the first n terms has rk (f n) ≤ rk (g n).

Equations

• Set.PartiallyWellOrderedOn.IsMinBadSeq r rk s n f = ∀ (g : ℕ → α), (∀ (m : ℕ), m < n → f m = g m) → rk (g n) < rk (f n) → ¬Set.PartiallyWellOrderedOn.IsBadSeq r s g

noncomputable def Set.PartiallyWellOrderedOn.minBadSeqOfBadSeq {α : Type u_2} (r : α → α → Prop) (rk : α → ℕ) (s : Set α) (n : ℕ) (f : ℕ → α) (hf : Set.PartiallyWellOrderedOn.IsBadSeq r s f) : { g // (∀ (m : ℕ), m < n → f m = g m) ∧ Set.PartiallyWellOrderedOn.IsBadSeq r s g ∧ Set.PartiallyWellOrderedOn.IsMinBadSeq r rk s n g }

Given a bad sequence f, this constructs a bad sequence that agrees with f on the first n terms and is minimal at n.

Equations

• One or more equations did not get rendered due to their size.

theorem Set.PartiallyWellOrderedOn.exists_min_bad_of_exists_bad {α : Type u_2} (r : α → α → Prop) (rk : α → ℕ) (s : Set α) : (∃ f, Set.PartiallyWellOrderedOn.IsBadSeq r s f) → ∃ f, Set.PartiallyWellOrderedOn.IsBadSeq r s f ∧ ∀ (n : ℕ), Set.PartiallyWellOrderedOn.IsMinBadSeq r rk s n f

theorem Set.PartiallyWellOrderedOn.iff_not_exists_isMinBadSeq {α : Type u_2} {r : α → α → Prop} (rk : α → ℕ) {s : Set α} : Set.PartiallyWellOrderedOn s r ↔ ¬∃ f, Set.PartiallyWellOrderedOn.IsBadSeq r s f ∧ ∀ (n : ℕ), Set.PartiallyWellOrderedOn.IsMinBadSeq r rk s n f

theorem Set.PartiallyWellOrderedOn.partiallyWellOrderedOn_sublistForall₂ {α : Type u_2} (r : α → α → Prop) [IsRefl α r] [IsTrans α r] {s : Set α} (h : Set.PartiallyWellOrderedOn s r) : Set.PartiallyWellOrderedOn {l | ∀ (x : α), x ∈ l → x ∈ s} (List.SublistForall₂ r)

Higman's Lemma, which states that for any reflexive, transitive relation r which is partially well-ordered on a set s, the relation List.SublistForall₂ r is partially well-ordered on the set of lists of elements of s. That relation is defined so that List.SublistForall₂ r l₁ l₂ whenever l₁ related pointwise by r to a sublist of l₂.

theorem WellFounded.isWf {α : Type u_2} [LT α] (h : WellFounded fun x x_1 => x < x_1) (s : Set α) : Set.IsWf s

theorem Pi.isPwo {ι : Type u_1} {α : ι → Type u_6} [(i : ι) → LinearOrder (α i)] [∀ (i : ι), IsWellOrder (α i) fun x x_1 => x < x_1] [Finite ι] (s : Set ((i : ι) → α i)) : Set.IsPwo s

A version of Dickson's lemma any subset of functions Π s : σ, α s is partially well ordered, when σ is a Fintype and each α s is a linear well order. This includes the classical case of Dickson's lemma that ℕ ^ n is a well partial order. Some generalizations would be possible based on this proof, to include cases where the target is partially well ordered, and also to consider the case of Set.PartiallyWellOrderedOn instead of Set.IsPwo.

theorem WellFounded.prod_lex_of_wellFoundedOn_fiber {α : Type u_2} {β : Type u_3} {γ : Type u_4} {rα : α → α → Prop} {rβ : β → β → Prop} {f : γ → α} {g : γ → β} (hα : WellFounded (rα on f)) (hβ : ∀ (a : α), Set.WellFoundedOn (f ⁻¹' {a}) (rβ on g)) : WellFounded (Prod.Lex rα rβ on fun c => (f c, g c))

Stronger version of WellFounded.prod_lex. Instead of requiring rβ on g to be well-founded, we only require it to be well-founded on fibers of f.

theorem Set.WellFoundedOn.prod_lex_of_wellFoundedOn_fiber {α : Type u_2} {β : Type u_3} {γ : Type u_4} {rα : α → α → Prop} {rβ : β → β → Prop} {f : γ → α} {g : γ → β} {s : Set γ} (hα : Set.WellFoundedOn s (rα on f)) (hβ : ∀ (a : α), Set.WellFoundedOn (s ∩ f ⁻¹' {a}) (rβ on g)) : Set.WellFoundedOn s (Prod.Lex rα rβ on fun c => (f c, g c))

theorem WellFounded.sigma_lex_of_wellFoundedOn_fiber {ι : Type u_1} {γ : Type u_4} {π : ι → Type u_5} {rι : ι → ι → Prop} {rπ : (i : ι) → π i → π i → Prop} {f : γ → ι} {g : (i : ι) → γ → π i} (hι : WellFounded (rι on f)) (hπ : ∀ (i : ι), Set.WellFoundedOn (f ⁻¹' {i}) (rπ i on g i)) : WellFounded (Sigma.Lex rι rπ on fun c => { fst := f c, snd := g (f c) c })

Stronger version of PSigma.lex_wf. Instead of requiring rπ on g to be well-founded, we only require it to be well-founded on fibers of f.

theorem Set.WellFoundedOn.sigma_lex_of_wellFoundedOn_fiber {ι : Type u_1} {γ : Type u_4} {π : ι → Type u_5} {rι : ι → ι → Prop} {rπ : (i : ι) → π i → π i → Prop} {f : γ → ι} {g : (i : ι) → γ → π i} {s : Set γ} (hι : Set.WellFoundedOn s (rι on f)) (hπ : ∀ (i : ι), Set.WellFoundedOn (s ∩ f ⁻¹' {i}) (rπ i on g i)) : Set.WellFoundedOn s (Sigma.Lex rι rπ on fun c => { fst := f c, snd := g (f c) c })