Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A Visit in a Finite Orbit Occurs Before the Number of States

Proved
Monodromy.Observation.exists_bounded_visit

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

computabilitycovering-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 SSS equipped with a finite enumeration, every total map N:S→SN:S\to SN:S→S, every Boolean observation v:S→{false,true}v:S\to\{\mathrm{false},\mathrm{true}\}v:S→{false,true}, and every state s∈Ss\in Ss∈S, if there exists n∈Nn\in\mathbb Nn∈N with v(Nn(s))=truev(N^n(s))=\mathrm{true}v(Nn(s))=true, then there exists n∈Nn\in\mathbb Nn∈N with n<∣S∣n<|S|n<∣S∣ and v(Nn(s))=truev(N^n(s))=\mathrm{true}v(Nn(s))=true. Iteration at n=0n=0n=0 is the identity, so a visit at the starting state is included. There is no assumption that NNN is injective or that visits are persistent; if SSS is empty there is no state argument to instantiate the assertion.

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