Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Concatenated Nested Lifts Execute in Path Order

Proved
Monodromy.NestedContinuation.execute_trans

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

For 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.

Preamble
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

Formal statement
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
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/Logarithm.lean (file SHA-256 7c717767a34b9975b34b033cf81fed276c1e642f6bb7abceab23baba8a3ee1d1): Monodromy.NestedContinuation.execute_trans at L574-L590 [UTF-8 26103:27305].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

For every two continuous loops γ,δ:[0,1]→C∗\gamma,\delta:[0,1]\to\mathbb C^*γ,δ:[0,1]→C∗ based at e=exp⁡(1)e=\exp(1)e=exp(1), each avoiding 111 at every time, and every complex state www with exp⁡(exp⁡(w))=e\exp(\exp(w))=eexp(exp(w))=e, executing their standard concatenation (first γ\gammaγ, then δ\deltaδ, each at twice speed on its half interval) from www equals executing γ\gammaγ from www and then δ\deltaδ from the resulting state. Execution means lifting the base loop through the exponential from exp⁡(w)\exp(w)exp(w), regarding this first lift as a nonzero complex path by the avoidance assumption, lifting it again through the exponential from www, and taking its time-111 endpoint in the same fiber. The concatenation is supplied with its inherited avoidance of 111; neither loop needs be nonconstant or simple.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me