Theorems · Definition · logic and foundations
Part.fix
{α : Type u_1} → {β : α → Type u_2} → (((a : α) → Part (β a)) → (a : α) → Part (β a)) → (x : α) → Part (β x)The least fixed point of f.
If f is a continuous function (according to complete partial orders),
it satisfies the equations:
1. fix f = f (fix f) (is a fixed point)
2. ∀ X, f X ≤ X → fix f ≤ X (least fixed point)
- Defined in
- Mathlib.Control.Fix
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 24 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Partstatement and proof · cited by 325
- Part.Domproof · cited by 145
- Part.Fix.approxproof · cited by 11
- Part.assertproof · cited by 10
- Nat.Upto.zeroproof · cited by 1
- Part.fixAuxproof · cited by 1
Cited by9
Results whose statement or proof uses this declaration.
- Part.Fix.approx_le_fixstatement · cited by 2
- Part.fix_eq_ωSupstatement and proof · cited by 2
- Part.Fix.mem_iffstatement · cited by 2
- Part.Fix.exists_fix_le_approxstatement and proof · cited by 1
- Part.fix_defstatement · cited by 1
- Part.fix_def'statement · cited by 1
- Part.fix_eq_ωSup_of_ωScottContinuousstatement and proof · cited by 1
- Part.fix_eq_of_ωScottContinuousstatement · cited by 0
- Part.fix_lestatement · cited by 0