A Complete Packed Cycle Executes the Ordered Stage Tuple
ProvedMonodromy.StagedProgram.cycle_ofFnFor positive natural numbers c,d, any stage tuple P:Fin c→Program d, and any coupled state s, c total advances of the compiled staged program from the phase-zero embedding of s equal the phase-zero embedding of the left fold applying P_0.advance through P_{c−1}.advance to s in order. This statement concerns total advance iteration and imposes no stopping hypothesis.
Statement dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.StagedProgram.compile, Monodromy.StagedProgram.embed.
Original proof dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.StagedProgram.compile, Monodromy.StagedProgram.cycle, Monodromy.StagedProgram.embed.
Statement elaboration dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.StagedProgram.compile, Monodromy.StagedProgram.embed.
Proof elaboration dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.StagedProgram.compile, Monodromy.StagedProgram.cycle, Monodromy.StagedProgram.embed.
module public import Definitions.Def_Monodromy_Continuation public import Lean.Elab.Tactic.Omega public import Mathlib.Analysis.Analytic.Constructions public import Mathlib.Analysis.Analytic.IsolatedZeros public import Mathlib.Analysis.Analytic.Linear public import Mathlib.Analysis.Calculus.DSlope public import Mathlib.Analysis.Calculus.Deriv.Add public import Mathlib.Analysis.Calculus.Deriv.Comp public import Mathlib.Analysis.Calculus.Deriv.Mul public import Mathlib.Analysis.Calculus.Deriv.Pow public import Mathlib.Analysis.Complex.Basic public import Mathlib.Analysis.Complex.CoveringMap public import Mathlib.Analysis.Real.Pi.Bounds public import Mathlib.Analysis.SpecialFunctions.Complex.Analytic public import Mathlib.Analysis.SpecialFunctions.Complex.Circle public import Mathlib.Computability.StateTransition public import Mathlib.Data.Fin.Basic public import Mathlib.Data.Fintype.Card public import Mathlib.Logic.Equiv.Fin.Rotate public import Mathlib.Logic.Function.Conjugate public import Mathlib.RingTheory.RootsOfUnity.Complex public import Mathlib.Tactic.FieldSimp public import Mathlib.Tactic.FunProp public import Mathlib.Tactic.Linarith public import Mathlib.Tactic.Ring public import Mathlib.Topology.Homotopy.Lifting @[expose] public section open Monodromy open Monodromy.StagedProgram open CoupledContinuation open Fin.NatCast variable (count degree : ℕ) [NeZero count] [NeZero degree]
theorem Monodromy.StagedProgram.cycle_ofFn (stages : Fin count → Program degree) (state : Memory) :
((compile count degree stages).advance)^[count] (embed count 0 state) =
embed count 0 ((List.ofFn stages).foldl
(fun point program => program.advance point) state) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
Write . The memory space consists of triples with and ; the integer-labelled point is with principal complex logarithms. A native program of positive degree consists of finite words and Boolean stop flags. Letters are left shift, right shift, left zero probe, right zero probe and control shift, with forward/reverse flags. The respective drivers move one lower base coordinate along or , or the control coordinate along ; unmentioned coordinates are constant. A driver acts by lower exponential lifts starting at , followed by an upper exponential lift starting at over the product of the lower lifts and the control path, and takes the endpoint. Words concatenate these drivers in list order, reversing paths for reversed letters; the empty word is idle. Routing observes and selects values at the roots by , with the divided slope of at divided by its derivative at (the divided slope at is the derivative). Advance executes the routed word; the halt signal selects for true stop flags and otherwise. The optional step is absent exactly when this signal is , and is advance otherwise. Partial evaluation repeatedly takes present steps and returns the first state with absent step; it is undefined if there is no such finite stopping time. For , a family of degree- native programs is staged into degree by associating address with row and phase . Its table there consists of 's row- word with every probe/control letter repeated times (memory-shift letters unchanged), followed by a control word of displacement . The unmarked staged program has all stop flags false. The phase embedding sends to and is defined on all memories using the inverse of the specified label-memory bijection. Marked staging uses the same words and marks address precisely if and a supplied Boolean mark at is true. For every positive natural , every family of degree- native programs, and every memory , the -fold iterate of the staged program's advance at equals . The list fold visits the stages in increasing order, and uses their advances irrespective of their own stop flags. The cases or , empty stage words, and arbitrary memories are included; and are excluded.
Confirmed by the mission captain (proposal self-audit).