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

Idempotent factorization of infinite words

Lax369799.WordFactorization · concepts/Lax369799/WordFactorization.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

    An infinite word in a finite monoid has a nonempty initial block of value aa, followed by nonempty blocks of a common idempotent value ee, with a∗e=aa * e = a. The increasing cuts are cofinal and every union of consecutive blocks after the first again has value ee.

    Concept map
    2 concepts
    100%
    Proven claimThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.InfiniteRamsey
    2import Mathlib.Algebra.BigOperators.Group.List.Basic
    3
    4/-!
    5---
    6title: Idempotent factorization of infinite words
    7type: theorem
    8---
    9An infinite word in a finite monoid has a nonempty initial block of value
    10`a`, followed by nonempty blocks of a common idempotent value `e`, with
    11`a * e = a`. The increasing cuts are cofinal and every union of consecutive
    12blocks after the first again has value `e`.
    13-/
    14namespace Lax369799.WordFactorization
    15
    16/-- Product of the half-open interval of letters [i,j). -/
    17def block {M : Type} [Monoid M] (w : ℕ → M) (i j : ℕ) : M :=
    18 ((List.range' i (j - i)).map w).prod
    19
    20axiom factorization {M : Type} [Monoid M] [Finite M] (w : ℕ → M) :
    21 ∃ (cut : ℕ → ℕ) (a e : M), StrictMono cut ∧ 0 < cut 0 ∧
    22 e * e = e ∧ a * e = a ∧
    23 (∀ i, block w 0 (cut i) = a) ∧
    24 (∀ i j, i < j → block w (cut i) (cut j) = e)
    25
    26end Lax369799.WordFactorization
    27
    Show Proof

    Discussion

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

    Loading discussion…