Finite iteration and terminal reachability
DefinitionNewMathDiscovery_RankedCoalescenceSounddynamical-systemsformal-verificationsodelin-newmath
For a type and transition , define the -fold iterate recursively for by and . For a designated terminal , finite reachability is
This interface supports abstract ranked-coalescence soundness. Reachability itself imposes no fixed-point hypothesis; that hypothesis appears explicitly in the theorems that transfer reachability along orbit tails.
Definition code
import Std
import Init.Grind.Ordered.Module
namespace NewMathDiscovery.RankedCoalescence
/-- Exact finite iteration, with the zeroth iterate equal to the input. -/
def iterate {α : Type} (f : α → α) : Nat → α → α
| 0 => fun x => x
| k + 1 => fun x => f (iterate f k x)
/-- `x` reaches the distinguished terminal element under finite iteration. -/
def Reaches {α : Type} (f : α → α) (one x : α) : Prop :=
∃ k : Nat, iterate f k x = one
end NewMathDiscovery.RankedCoalescence
Source