Documentation

Cslib.Foundations.Order.FixedPoints

Extensions to Mathlib's fixed point API #

theorem OrderHom.nextFixed_bot_coe {α : Type u} [CompleteLattice α] (f : α →o α) :
↑(f.nextFixed ⊥ ⋯) = lfp f
theorem OrderHom.prevFixed_top_coe {α : Type u} [CompleteLattice α] (f : α →o α) :
↑(f.prevFixed ⊤ ⋯) = gfp f
theorem OrderHom.nextFixed_le_of_map_le {α : Type u} [CompleteLattice α] (f : α →o α) {x y : α} (hx : x ≤ f x) (hxy : x ≤ y) (hy : f y ≤ y) :
↑(f.nextFixed x hx) ≤ y

Generalisation of OrderHom.nextFixed_le to prefixed points.

theorem OrderHom.le_prevFixed_of_map_ge {α : Type u} [CompleteLattice α] (f : α →o α) {x y : α} (hx : f x ≤ x) (hxy : y ≤ x) (hy : y ≤ f y) :
y ≤ ↑(f.prevFixed x hx)

Generalisation of OrderHom.le_prevFixed to postfixed points.

theorem OrderHom.nextFixed_induction {α : Type u} [CompleteLattice α] (f : α →o α) {x : α} (hx : x ≤ f x) {p : α → Prop} (base : p x) (step : ∀ (a : α), p a → x ≤ a → a ≤ ↑(f.nextFixed x hx) → p (f a)) (hSup : ∀ (s : Set α), (∀ a ∈ s, p a) → p (sSup s)) :
p ↑(f.nextFixed x hx)

Analogue of OrderHom.lfp_induction for OrderHom.nextFixed.

theorem OrderHom.prevFixed_induction {α : Type u} [CompleteLattice α] (f : α →o α) {x : α} (hx : f x ≤ x) {p : α → Prop} (base : p x) (step : ∀ (a : α), p a → a ≤ x → ↑(f.prevFixed x hx) ≤ a → p (f a)) (hInf : ∀ (s : Set α), (∀ a ∈ s, p a) → p (sInf s)) :
p ↑(f.prevFixed x hx)

Analogue of OrderHom.gfp_induction for OrderHom.prevFixed.