Admissible Based Homotopies Preserve Complete Native Execution
ProvedMonodromy.CoupledContinuation.execute_homotopicFor any two coupled drivers whose restricted based paths are homotopic with endpoints fixed, and every state s in the coupled fiber, their actual lifted executions have the same complete endpoint state: execute(first,s)=execute(second,s). The homotopy is taken in the restricted base used by the matching lower and upper coverings.
Statement dependencies: Monodromy.CoupledContinuation.Driver, Monodromy.CoupledContinuation.Driver.restrictedPath, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.execute, Monodromy.CoupledContinuation.restrictedBase, Monodromy.CoupledPullback.Base, Monodromy.CoupledPullback.Punctured, Monodromy.NestedRestricted.baseSet.
Original proof dependencies: Monodromy.CoupledContinuation.Driver, Monodromy.CoupledContinuation.Driver.restrictedPath, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.execute, Monodromy.CoupledContinuation.forgetPoint, Monodromy.CoupledContinuation.intermediateCurve, Monodromy.CoupledContinuation.intermediateCurve_actual_lift, Monodromy.CoupledContinuation.intermediatePath, Monodromy.CoupledContinuation.restrictedBase, Monodromy.CoupledContinuation.restrictedState, Monodromy.CoupledContinuation.restrictedState_over_base, Monodromy.CoupledContinuation.restrictedTrajectory, Monodromy.CoupledContinuation.restrictedTrajectory_actual_lift, Monodromy.CoupledPullback.Base, Monodromy.CoupledPullback.Lower, Monodromy.CoupledPullback.Point, Monodromy.CoupledPullback.Punctured, Monodromy.CoupledPullback.Root, Monodromy.CoupledPullback.lowerCovering, Monodromy.CoupledPullback.lowerProjection, Monodromy.CoupledPullback.upperCovering, Monodromy.CoupledPullback.upperProjection, Monodromy.NestedRestricted.baseSet.
Statement elaboration dependencies: Monodromy.CoupledContinuation.Driver, Monodromy.CoupledContinuation.Driver.restrictedPath, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.execute, Monodromy.CoupledContinuation.restrictedBase, Monodromy.CoupledPullback.Base, Monodromy.CoupledPullback.Punctured, Monodromy.NestedRestricted.baseSet.
Proof elaboration dependencies: Monodromy.CoupledContinuation.Driver, Monodromy.CoupledContinuation.Driver.restrictedPath, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.execute, Monodromy.CoupledContinuation.forgetPoint, Monodromy.CoupledContinuation.intermediateCurve, Monodromy.CoupledContinuation.intermediateCurve_actual_lift, Monodromy.CoupledContinuation.intermediatePath, Monodromy.CoupledContinuation.restrictedBase, Monodromy.CoupledContinuation.restrictedState, Monodromy.CoupledContinuation.restrictedState_over_base, Monodromy.CoupledContinuation.restrictedTrajectory, Monodromy.CoupledContinuation.restrictedTrajectory_actual_lift, Monodromy.CoupledPullback.Base, Monodromy.CoupledPullback.Lower, Monodromy.CoupledPullback.Point, Monodromy.CoupledPullback.Punctured, Monodromy.CoupledPullback.Root, Monodromy.CoupledPullback.lowerCovering, Monodromy.CoupledPullback.lowerProjection, Monodromy.CoupledPullback.upperCovering, Monodromy.CoupledPullback.upperProjection, Monodromy.NestedRestricted.baseSet.
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_homotopic (first second : Driver)
(deformation : first.restrictedPath.Homotopic second.restrictedPath) (state : Memory) :
execute first state = execute second state := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every pair of drivers and every memory , if their restricted based paths are homotopic with endpoints fixed, then executing on and executing on give equal complete memory points. A driver is a triple of continuous loops: two loops in based at , each avoiding at every parameter, and a control loop in based at ; the restricted path is their product loop in based at . A memory is a triple with , , and . Execution lifts the two lower component loops through the complex exponential from , forms their product multiplied by the control component as a nonzero upper input path, lifts that path from , and retains all three endpoints. The homotopy hypothesis concerns the full restricted product paths, and the equality is of all retained coordinates; there is no differentiability, word representation, prepared-state or halting assumption.
Confirmed by the mission captain (proposal self-audit).