While this submission is a draft, it cannot be used by other submissions.

Eventual membership in finite families

Lax369799.FiniteRecurrence · concepts/Lax369799/FiniteRecurrence.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural 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
    1 concept; 3 descendants hidden
    100%
    Proven claimThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Mathlib.Data.Fintype.Basic
    2import Mathlib.Data.Fintype.EquivFin
    3import Mathlib.Data.Finset.Lattice.Fold
    4
    5/-!
    6---
    7title: Eventual membership in finite families
    8type: theorem
    9---
    10For a sequence of subsets of a finite set, every sufficiently late set
    11contains only elements occurring infinitely often. One threshold works
    12for finitely many such sequences. This is the finite stabilization step
    13for the compressed transitions in Lemma 108.
    14-/
    15
    16namespace Lax369799.FiniteRecurrence
    17
    18def Recurrent {X : Type} (F : ℕ → Set X) : Set X :=
    19 {x | ∀ N, ∃ k, N ≤ k ∧ x ∈ F k}
    20
    21axiom eventual_subset {X : Type} [Finite X] (F : ℕ → Set X) :
    22 ∃ N, ∀ k, N ≤ k → F k ⊆ Recurrent F
    23
    24axiom 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
    27end Lax369799.FiniteRecurrence
    28
    Show ProofShow Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…