A Left Inverse Retraces a Positive First Return
ProvedMonodromy.ReversibleReturn.inverse_firstReturnFor 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.
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*}
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
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For any type , any total maps satisfying only the left-inverse identity , any boundary predicate on , and any , if there exists with , , , , and for every natural with , then there exists with , , , , and for every natural with . 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 is allowed.
Confirmed by the mission captain (proposal self-audit).