Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A Left Inverse Retraces a Positive First Return

Proved
Monodromy.ReversibleReturn.inverse_firstReturn

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

computabilitycovering-spacesmonodromy-computation

For any type S, maps A,R:S→S and predicate B:S→Prop, assume R(A(s))=s for every s. If s→t is a positive first return under A to B—both endpoints lie in B and no earlier positive iterate does—then t→s is a positive first return under R to the same predicate B. A right-inverse premise is not assumed.

Statement dependencies: Monodromy.ReversibleReturn.FirstReturn.

Original proof dependencies: Monodromy.ReversibleReturn.FirstReturn.

Statement elaboration dependencies: Monodromy.ReversibleReturn.FirstReturn.

Proof elaboration dependencies: Monodromy.ReversibleReturn.FirstReturn.

Preamble
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.ReversibleReturn
variable {State : Type*}

Formal statement
theorem Monodromy.ReversibleReturn.inverse_firstReturn {advance backward : State → State} {boundary : State → Prop}
    (inverse : Function.LeftInverse backward advance) {first last : State}
    (run : FirstReturn advance boundary first last) :
    FirstReturn backward boundary last first := 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/Continuation.lean (file SHA-256 c41996cad30503403fe284de8929124f849aa5fd0aaba5433e5e0d4d36fec912): Monodromy.ReversibleReturn.inverse_firstReturn at L3145-L3163 [UTF-8 158149:159300].
Read-back

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

For any type SSS, any total maps A,R:S→SA,R:S\to SA,R:S→S satisfying only the left-inverse identity ∀x, R(A(x))=x\forall x,\ R(A(x))=x∀x, R(A(x))=x, any boundary predicate BBB on SSS, and any s,t∈Ss,t\in Ss,t∈S, if there exists n∈Nn\in\mathbb Nn∈N with n>0n>0n>0, An(s)=tA^n(s)=tAn(s)=t, B(s)B(s)B(s), B(t)B(t)B(t), and ¬B(Ak(s))\neg B(A^k(s))¬B(Ak(s)) for every natural kkk with 0<k<n0<k<n0<k<n, then there exists m∈Nm\in\mathbb Nm∈N with m>0m>0m>0, Rm(t)=sR^m(t)=sRm(t)=s, B(t)B(t)B(t), B(s)B(s)B(s), and ¬B(Rk(t))\neg B(R^k(t))¬B(Rk(t)) for every natural kkk with 0<k<m0<k<m0<k<m. These are the forward and backward first-return predicates respectively. No right-inverse or surjectivity assumption is required, no equality of the two witnessing lengths is explicitly asserted, and a positive cycle with s=ts=ts=t is allowed.

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