A Left Root Equal to One Produces One Control Period
ProvedMonodromy.CoupledContinuation.execute_B_left_zeroFor every state s in the coupled three-coordinate fiber, if its retained left lower root equals 1, then the upper coordinate after actual execution of the fixed left conditional driver B_left is the original upper coordinate plus . The hypothesis concerns the complex root itself; the other memory root and the original upper coordinate are unrestricted.
Statement dependencies: Monodromy.CoupledContinuation.B_left, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Punctured, Monodromy.CoupledContinuation.execute, Monodromy.NestedContinuation.period.
Original proof dependencies: Monodromy.CoupledContinuation.B_left, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Punctured, Monodromy.CoupledContinuation.execute, Monodromy.CoupledContinuation.execute_B_left, Monodromy.CoupledContinuation.prepare, Monodromy.CoupledContinuation.prepare_surjective, Monodromy.CoupledContinuation.upperRoot, Monodromy.NestedContinuation.firstRoot, Monodromy.NestedContinuation.firstRoot_injective, Monodromy.NestedContinuation.period.
Statement elaboration dependencies: Monodromy.CoupledContinuation.B_left, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Punctured, Monodromy.CoupledContinuation.execute, Monodromy.NestedContinuation.period.
Proof elaboration dependencies: Monodromy.CoupledContinuation.B_left, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Punctured, Monodromy.CoupledContinuation.execute, Monodromy.CoupledContinuation.execute_B_left, Monodromy.CoupledContinuation.prepare, Monodromy.CoupledContinuation.prepare_surjective, Monodromy.CoupledContinuation.upperRoot, Monodromy.NestedContinuation.firstRoot, Monodromy.NestedContinuation.firstRoot_injective, Monodromy.NestedContinuation.period.
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.CoupledContinuation
theorem Monodromy.CoupledContinuation.execute_B_left_zero (state : Memory) (zero : state.val.1.1.val = 1) :
(execute B_left state).val.2 = state.val.2 + NestedContinuation.period 1 := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every memory point in the fiber of over , so , and , assume specifically that . Executing the driver whose left base loop is , whose right base loop stays at , and whose control base loop stays at , changes the upper coordinate to exactly . Execution here first continuously lifts each lower loop through the complex exponential from its retained lower root, forms the upper input from the product of those two actual lifts times the control loop, then lifts that upper input through the exponential from and retains its endpoint. The conclusion is solely the displayed equality of upper coordinates; it quantifies arbitrary coherent right and upper roots, without requiring them to be provided as prepared integer labels.
Confirmed by the mission captain (proposal self-audit).