Path Reversal Restores the Complete Nested-Lift State
ProvedMonodromy.NestedContinuation.execute_reverseFor every loop α in the punctured complex plane based at exp(1) that avoids 1, and every state z in the nested exponential fiber exp(exp(z))=exp(1), executing α and then its reversed path by the two actual logarithmic lifts returns exactly z. Both executions use the corresponding stated avoidance proofs.
Statement dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_symm, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute.
Original proof dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_symm, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute, Monodromy.NestedContinuation.executionPath, Monodromy.NestedContinuation.executionPath_projects, Monodromy.NestedContinuation.expCover, Monodromy.NestedContinuation.nested_curve_unique, Monodromy.NestedContinuation.secondRaw, Monodromy.NestedContinuation.secondRaw_projects, Monodromy.NestedContinuation.secondRaw_start.
Statement elaboration dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_symm, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute.
Proof elaboration dependencies: Monodromy.NestedContinuation.Memory, Monodromy.NestedContinuation.Punctured, Monodromy.NestedContinuation.avoids_symm, Monodromy.NestedContinuation.base, Monodromy.NestedContinuation.execute, Monodromy.NestedContinuation.executionPath, Monodromy.NestedContinuation.executionPath_projects, Monodromy.NestedContinuation.expCover, Monodromy.NestedContinuation.nested_curve_unique, Monodromy.NestedContinuation.secondRaw, Monodromy.NestedContinuation.secondRaw_projects, Monodromy.NestedContinuation.secondRaw_start.
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_reverse (path : Path base base)
(avoids : ∀ t, path t ≠ (⟨1, one_ne_zero⟩ : Punctured)) (state : Memory) :
execute path.symm (avoids_symm path avoids) (execute path avoids state) = state := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every continuous loop based at and avoiding at every time, and every complex state satisfying , execution followed by execution along the reversed loop returns exactly as a point of that fiber. Here execution first lifts through the complex exponential starting at , regards that lift as a path in (using avoidance of ), lifts it again through the exponential starting at , and takes the second lift's time- endpoint; the reversal has parameter and inherits the same avoidance hypothesis. The assertion includes constant and non-simple loops, with no winding restriction.
Confirmed by the mission captain (proposal self-audit).