A Visit in a Finite Orbit Occurs Before the Number of States
ProvedMonodromy.Observation.exists_bounded_visitcomputabilitycovering-spacesmonodromy-computation
For any finite type S with its Fintype enumeration, map A:S→S, Boolean test b:S→Bool and state s∈S, assume b(Aⁿ(s)) is true for some natural n. Then it is true for some natural n strictly smaller than |S|. The conclusion permits n=0 and does not require A to be injective.
Preamble
module
public import Definitions.Def_Monodromy_Observation
public import Lean.Elab.Tactic.Omega
public import Mathlib.Computability.StateTransition
public import Mathlib.Data.Fintype.Card
public import Mathlib.Data.Set.Finite.Basic
@[expose] public section
open Monodromy
open Monodromy.Observation
variable {S : Type*}
Formal statement
theorem Monodromy.Observation.exists_bounded_visit [Fintype S] (next : S → S) (visit : S → Bool) (state : S)
(eventually : ∃ rounds : ℕ, visit ((next^[rounds]) state) = true) :
∃ rounds < Fintype.card S, visit ((next^[rounds]) state) = true := 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/Observation.lean (file SHA-256 7989443c07eb69c1a560c79f678d827f7e8efd3f352ab0119eebb2cac76505bd):
Monodromy.Observation.exists_bounded_visit at L93-L117 [UTF-8 4079:5574].
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every type equipped with a finite enumeration, every total map , every Boolean observation , and every state , if there exists with , then there exists with and . Iteration at is the identity, so a visit at the starting state is included. There is no assumption that is injective or that visits are persistent; if is empty there is no state argument to instantiate the assertion.
Human review
Confirmed by the mission captain (proposal self-audit).