Boundary-Avoiding Relational Runs Give Positive First Returns
ProvedMonodromy.ReversibleReturn.firstReturn_of_relationFor any type S, map A:S→S, predicate B:S→Prop and relation T on S, suppose every T(x,y) implies A(x)=y. If T(s,u), a finite possibly empty chain of T-edges from u reaches t while every departure state is outside B, and both s and t satisfy B, then there exists n>0 with Aⁿ(s)=t and no positive iterate Aᵏ(s) in B for 0<k<n. Thus s→t is a first return for A at B.
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.firstReturn_of_relation {advance : State → State} {boundary : State → Prop}
{transition : State → State → Prop}
(executes : ∀ {left right}, transition left right → advance left = right)
{first after last : State} (initial : transition first after)
(interior : Relation.ReflTransGen
(fun left right => transition left right ∧ ¬ boundary left) after last)
(marked_first : boundary first) (marked_last : boundary last) :
FirstReturn advance boundary first last := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For any type , any total map , any boundary predicate on , any binary relation on satisfying , and any states , suppose , there is a finite, possibly empty chain from to of pairs satisfying and , and and . Then there exists with , , and , and for every natural with . This is the definition of first return used in the conclusion. The initial step is required even if the subsequent chain is empty; is allowed if a positive return occurs, and need not describe every application of .
Confirmed by the mission captain (proposal self-audit).