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

Stable factorization with recurrent vertices

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

    A word over a finite semigroup admits stable idempotent blocks without assuming an identity element. For a simultaneous sequence in a finite vertex set, all block boundaries can be chosen at the same vertex. This is the factorization used to turn a branch into a periodic branch in Section 6.3.

    Concept map
    3 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.WordFactorization
    2import Mathlib.Algebra.Group.WithOne.Basic
    3import Mathlib.Data.Fintype.Option
    4
    5/-!
    6---
    7title: Stable factorization with recurrent vertices
    8type: theorem
    9---
    10A word over a finite semigroup admits stable idempotent blocks without
    11assuming an identity element. For a simultaneous sequence in a finite
    12vertex set, all block boundaries can be chosen at the same vertex. This
    13is the factorization used to turn a branch into a periodic branch in
    14Section 6.3.
    15-/
    16namespace Lax369799.SemigroupFactorization
    17
    18/-- Product of a nonempty interval [i,j), starting with its first letter. -/
    19def block {M : Type} [Semigroup M] (w : ℕ → M) (i j : ℕ) : M :=
    20 ((List.range' (i + 1) (j - i - 1)).map w).foldl (· * ·) (w i)
    21
    22axiom factorization {M V : Type} [Semigroup M] [Finite M] [Finite V]
    23 (w : ℕ → M) (v : ℕ → V) :
    24 ∃ (cut : ℕ → ℕ) (a e : M) (r : V), StrictMono cut ∧ 0 < cut 0 ∧
    25 e * e = e ∧ a * e = a ∧ (∀ i, v (cut i) = r) ∧
    26 (∀ i, block w 0 (cut i) = a) ∧
    27 (∀ i j, i < j → block w (cut i) (cut j) = e)
    28
    29end Lax369799.SemigroupFactorization
    30
    Show Proof

    Discussion

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

    Loading discussion…