Concatenated Nested Lifts Execute in Path Order
ProvedMonodromy.NestedContinuation.execute_transFor any two loops α,β in the punctured complex plane based at exp(1), each avoiding the point 1 at every time, and any state z in the nested exponential fiber exp(exp(z))=exp(1), actual nested execution along α concatenated with β equals execution along β from the state obtained by first executing α. The avoidance proof for the concatenated path is the one induced by the two given hypotheses.
Statement dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_trans, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute.
Original proof dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_trans, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute, Monodromy.NestedContinuation.expCover, Monodromy.NestedContinuation.nested_curve_unique, Monodromy.NestedContinuation.secondRaw, Monodromy.NestedContinuation.secondRaw_projects, Monodromy.NestedContinuation.secondRaw_start, Monodromy.NestedContinuation.sequentialPath, Monodromy.NestedContinuation.sequentialPath_projects.
Statement elaboration dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_trans, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute.
Proof elaboration dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_trans, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute, Monodromy.NestedContinuation.expCover, Monodromy.NestedContinuation.nested_curve_unique, Monodromy.NestedContinuation.secondRaw, Monodromy.NestedContinuation.secondRaw_projects, Monodromy.NestedContinuation.secondRaw_start, Monodromy.NestedContinuation.sequentialPath, Monodromy.NestedContinuation.sequentialPath_projects.
module public import Definitions.Def_Monodromy_Logarithm public import Lean.Elab.Tactic.Omega public import Mathlib.Analysis.Analytic.Constructions public import Mathlib.Analysis.Complex.CoveringMap public import Mathlib.Analysis.Real.Pi.Bounds public import Mathlib.Analysis.SpecialFunctions.Complex.Circle public import Mathlib.Logic.Function.Conjugate 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.NestedContinuation open unitInterval
theorem Monodromy.NestedContinuation.execute_trans (first second : Path base base)
(first_avoids : ∀ t, first t ≠ (⟨1, one_ne_zero⟩ : Punctured))
(second_avoids : ∀ t, second t ≠ (⟨1, one_ne_zero⟩ : Punctured)) (state : Memory) :
execute (first.trans second) (avoids_trans first second first_avoids second_avoids) state =
execute second second_avoids (execute first first_avoids state) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every two continuous loops based at , each avoiding at every time, and every complex state with , executing their standard concatenation (first , then , each at twice speed on its half interval) from equals executing from and then from the resulting state. Execution means lifting the base loop through the exponential from , regarding this first lift as a nonzero complex path by the avoidance assumption, lifting it again through the exponential from , and taking its time- endpoint in the same fiber. The concatenation is supplied with its inherited avoidance of ; neither loop needs be nonconstant or simple.
Confirmed by the mission captain (proposal self-audit).