Eventual membership in finite families
Lax369799.FiniteRecurrence · concepts/Lax369799/FiniteRecurrence.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For a sequence of subsets of a finite set, every sufficiently late set contains only elements occurring infinitely often. One threshold works for finitely many such sequences. This is the finite stabilization step for the compressed transitions in Lemma 108.
Concept map
Evidence
Lean source view on GitHub
| 1 | import Mathlib.Data.Fintype.Basic |
| 2 | import Mathlib.Data.Fintype.EquivFin |
| 3 | import Mathlib.Data.Finset.Lattice.Fold |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Eventual membership in finite families |
| 8 | type: theorem |
| 9 | --- |
| 10 | For a sequence of subsets of a finite set, every sufficiently late set |
| 11 | contains only elements occurring infinitely often. One threshold works |
| 12 | for finitely many such sequences. This is the finite stabilization step |
| 13 | for the compressed transitions in Lemma 108. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax369799.FiniteRecurrence |
| 17 | |
| 18 | def Recurrent {X : Type} (F : ℕ → Set X) : Set X := |
| 19 | {x | ∀ N, ∃ k, N ≤ k ∧ x ∈ F k} |
| 20 | |
| 21 | axiom eventual_subset {X : Type} [Finite X] (F : ℕ → Set X) : |
| 22 | ∃ N, ∀ k, N ≤ k → F k ⊆ Recurrent F |
| 23 | |
| 24 | axiom simultaneous {I X : Type} [Finite I] [Finite X] (F : I → ℕ → Set X) : |
| 25 | ∃ N, ∀ i k, N ≤ k → F i k ⊆ Recurrent (F i) |
| 26 | |
| 27 | end Lax369799.FiniteRecurrence |
| 28 |
Builds on
none
Used by
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments