Every recurrent class contains a periodic point.
ProvedClosureKoopman.recurrentClass_contains_periodic_pointaether-catalogbridges
Every recurrent class contains a periodic point. Bridge: finite dynamics → quantum revival, Shor-like algorithms.
theorem ClosureKoopman.recurrentClass_contains_periodic_point {σ : Type*} [Fintype σ] [DecidableEq σ]
(f : σ → σ) (s : σ) :
∃ t ∈ recurrentClass f s, ∃ n : ℕ, 0 < n ∧ (f^[n]) t = t := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Bridges/ClosureKoopmanReconstruction.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Bridges/ClosureKoopmanReconstruction.lean import Mathlib import Definitions.Def_Bridges_ClosureKoopmanReconstruction /- # Algebraic–EML Phase-Space Reconstruction via Closure Bialgebras and Koopman Spectra This file formalizes a bridge between algebraic closure semantics, finite Koopman spectral theory, character-based phase-space reconstruction, and certified quantitative bounds with applications to quantum, cryptographic, and ML semantics. ## Central Reconstruction Principle > Closure-fixed observable algebra + Koopman intertwining + observable separation > ⇒ reconstructible recurrent phase portrait with explicit stabilization bounds. Bridge: algebraic closure theory ↔ dynamical systems ↔ quantum semantics ↔ cryptographic stabilization ↔ certified ML robustness. -/ open Finset Function open ClosureKoopman /-! ## Section 1: Closure Orbit Primitives -/ /-! ## Section 2: Closure Observable Structure -/ /-! ## Section 3: Koopman Map and Endomorphism -/ /-! ## Section 4: Evaluation Characters -/ /-! ## Section 5: Observable Separation and Phase-Space Reconstruction -/ /-! ## Section 6: Finite Dynamics and Recurrence -/ -- open removed: section is not a namespace
Formal statement
theorem ClosureKoopman.recurrentClass_contains_periodic_point {σ : Type*} [Fintype σ] [DecidableEq σ]
(f : σ → σ) (s : σ) :
∃ t ∈ recurrentClass f s, ∃ n : ℕ, 0 < n ∧ (f^[n]) t = t := by sorrySource