Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite state orbit periodic

Proved
ModularCFDynamics.finite_state_orbit_periodic

by raver1975 · Sep 16, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogbridges

Formal statement of ModularCFDynamics.finite_state_orbit_periodic from the Aether Catalog (Bridges). The mathematical content is given by the Lean statement below; a human-readable write-up is pending.

theorem ModularCFDynamics.finite_state_orbit_periodic{α : Type*} [Fintype α] [DecidableEq α]
    (F : α → α) (x₀ : α) :
    ∃ N T, IsEventuallyPeriodic (fun n => F^[n] x₀) N T ∧
      N + T ≤ Fintype.card α := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Bridges/GraphTheory/ModularCFDynamics.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Bridges/GraphTheory/ModularCFDynamics.lean
import Mathlib
import Definitions.Def_Bridges_GraphTheory_ModularCFDynamics
/-
Copyright (c) 2025 Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/

/-!
# Modular Continued-Fraction Dynamics and Periodicity Detection

## Overview

This file develops a theory connecting continued-fraction expansions to modular
dynamics, establishing that eventually periodic CF sequences produce eventually
periodic convergent sequences modulo any modulus, and that graph-theoretic
invariants built from these modular convergents inherit the periodicity.

## Main Definitions

- `CFState`: State of the CF convergent recurrence (p_{n-1}, p_n, q_{n-1}, q_n)
- `IsEventuallyPeriodic`: A sequence that becomes periodic after some index
- `ModularCFGraph`: Novel structure encoding the filtered graph built from
  convergents mod p
- `FilteredGraphSeq`: Sequence of graphs with periodicity properties

## Main Results

- `eventually_periodic_comp`: Composition preserves eventual periodicity
- `consecutive_pair_periodic`: Periodicity transfers through pair functions
- `transition_count_eventually_periodic`: Graph edge counts inherit periodicity
- `modular_cf_graph_vertex_bound`: Bounded vertex count for modular CF graphs
- `betti_periodic_of_edge_periodic`: Cross-domain bridge to topology
- `finite_state_orbit_periodic`: Pigeonhole-based orbit periodicity on finite types
-/

open Finset Function

open ModularCFDynamics

/-! ## §1. Eventually Periodic Sequences -/








/-! ## §2. Continued Fraction Convergent Recurrence -/







/-! ## §3. Modular CF Dynamics -/



/-! ## §4. Modular CF Graph (Novel Structure) -/





/-! ## §5. Periodicity Transfer Theorems -/



/-! ## §6. Pigeonhole-Based Finite Orbit Periodicity -/

/-
**Finite state orbit periodicity**: On a finite type, iterating any function
    produces an eventually periodic sequence.

    Proof by pigeonhole: among the first `card α + 1` iterates, two must be equal.
    This gives the cycle detection that powers the modular CF periodicity theorem.
-/
Formal statement
theorem ModularCFDynamics.finite_state_orbit_periodic{α : Type*} [Fintype α] [DecidableEq α]
    (F : α → α) (x₀ : α) :
    ∃ N T, IsEventuallyPeriodic (fun n => F^[n] x₀) N T ∧
      N + T ≤ Fintype.card α := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Bridges/GraphTheory/ModularCFDynamics.lean#L248

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