An Unmarked Phase-Zero Address Completes a Positive Stage Run
ProvedMonodromy.StagedProgram.cycle_reachesFor positive naturals c,d, any stages P:Fin c→Program d, Boolean marks b:Fin d→Bool, integers ℓ,r,q and address j∈Fin d with b(j)=false, there is a nonempty successful step run of the marked staged compiler from the phase-zero embedding of prepare(ℓ,r,dq+j) to the phase-zero embedding obtained by applying all stage advances in their listed order to that prepared state.
Statement dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare, Monodromy.StagedProgram.embed, Monodromy.StagedProgram.markedCompile.
Original proof dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare, Monodromy.StagedProgram.advance_embed, Monodromy.StagedProgram.compile, Monodromy.StagedProgram.cycle_ofFn, Monodromy.StagedProgram.embed, Monodromy.StagedProgram.interior_step, Monodromy.StagedProgram.iterate_embed, Monodromy.StagedProgram.markedCompile, Monodromy.StagedProgram.positive_reaches_iterate, Monodromy.StagedProgram.rotated_zero_ne_zero, Monodromy.StagedProgram.step_embed.
Statement elaboration dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare, Monodromy.StagedProgram.embed, Monodromy.StagedProgram.markedCompile.
Proof elaboration dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare, Monodromy.StagedProgram.advance_embed, Monodromy.StagedProgram.compile, Monodromy.StagedProgram.cycle_ofFn, Monodromy.StagedProgram.embed, Monodromy.StagedProgram.interior_step, Monodromy.StagedProgram.iterate_embed, Monodromy.StagedProgram.markedCompile, Monodromy.StagedProgram.positive_reaches_iterate, Monodromy.StagedProgram.rotated_zero_ne_zero, Monodromy.StagedProgram.step_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_reaches (stages : Fin count → Program degree) (mark : Fin degree → Bool)
(left right quotient : ℤ) (index : Fin degree) (unmarked : mark index = false) :
StateTransition.Reaches₁ (markedCompile count degree stages mark).step
(embed count 0 (prepare left right ((degree : ℤ) * quotient + index.val)))
(embed count 0 ((List.ofFn stages).foldl (fun point stage => stage.advance point)
(prepare left right ((degree : ℤ) * quotient + index.val)))) := 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 such stage family, every Boolean mark on the rows, all integers , and every row with , there is a nonempty finite sequence of present optional steps of the marked staged program from to . The endpoint may be marked and the integer labels may be negative. The statement gives positive-step reachability, not an exact step count or a claim that the endpoint has no successor; the initial unmarked-row hypothesis is explicit, while no unmarked assumption is imposed on the individual stages' output rows.
Confirmed by the mission captain (proposal self-audit).