Fixed point

This module defines a generic fix operator for defining recursive computations that are not necessarily well-founded or productive. An instance is defined for Part.

Main definition

• class Fix
• Part.fix

class Fix (α : Type u_3) : Type u_3

Fix α provides a fix operator to define recursive computation via the fixed point of function of type α → α.

• fix : (α → α) → α

  fix f represents the computation of a fixed point for f.

def Part.Fix.approx {α : Type u_1} {β : α → Type u_2} (f : ((a : α) → Part (β a)) → (a : α) → Part (β a)) : Stream' ((a : α) → Part (β a))

A series of successive, finite approximation of the fixed point of f, defined by approx f n = f^[n] ⊥. The limit of this chain is the fixed point of f.

def Part.fixAux {α : Type u_1} {β : α → Type u_2} (f : ((a : α) → Part (β a)) → (a : α) → Part (β a)) {p : ℕ → Prop} (i : Nat.Upto p) (g : (j : Nat.Upto p) → i < j → (a : α) → Part (β a)) (a : α) : Part (β a)

loop body for finding the fixed point of f

def Part.fix {α : Type u_1} {β : α → Type u_2} (f : ((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)

theorem Part.fix_def {α : Type u_1} {β : α → Type u_2} (f : ((a : α) → Part (β a)) → (a : α) → Part (β a)) {x : α} (h' : ∃ (i : ℕ), (Fix.approx f i x).Dom) : Part.fix f x = Fix.approx f (Nat.find h').succ x

theorem Part.fix_def' {α : Type u_1} {β : α → Type u_2} (f : ((a : α) → Part (β a)) → (a : α) → Part (β a)) {x : α} (h' : ¬∃ (i : ℕ), (Fix.approx f i x).Dom) : Part.fix f x = none

instance Part.hasFix {α : Type u_1} : Fix (Part α)

instance Pi.Part.hasFix {α : Type u_1} {β : Type u_3} : Fix (α → Part β)