Theorems · Definition · order theory
OrderHom.nextFixed
{α : Type u} → [inst : CompleteLattice α] → (f : α →o α) → (x : α) → x ≤ f x → ↑(Function.fixedPoints ⇑f)Next fixed point of a monotone map. If f is a monotone self-map of a complete lattice and
x is a point such that x ≤ f x, then f.nextFixed x hx is the least fixed point of f
that is greater than or equal to x.
- Defined in
- Mathlib.Order.FixedPoints
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Quot.sound
- Assumes
- CompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- Set.Elemstatement and proof · cited by 7,166
- CompleteLatticestatement and proof · cited by 1,048
- OrderHomstatement and proof · cited by 934
- Function.fixedPointsstatement and proof · cited by 90
- OrderHom.dualproof · cited by 48
- OrderHom.lfpproof · cited by 17
- OrderHom.constproof · cited by 8
- OrderHom.prevFixedproof · cited by 4
Cited by4
Results whose statement or proof uses this declaration.
- OrderHom.nextFixed_lestatement · cited by 2
- OrderHom.le_nextFixedstatement · cited by 2
- OrderHom.nextFixed_le_iffstatement and proof · cited by 1
- OrdinalApprox.nextFixed_eq_iSup_lfpApproxstatement and proof · cited by 1