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

Recurrent cuts in a linked-pair factorization

Lax369799.LinkedPairFactorizations · concepts/Lax369799/LinkedPairFactorizations.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 linked-pair factorization can be thinned so that every cut visits the same vertex of a finite graph. Absorption and idempotence preserve the prefix and block values when successive blocks are grouped.

    Concept map
    10 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.OmegaProducts
    2
    3/-!
    4---
    5title: Recurrent cuts in a linked-pair factorization
    6type: theorem
    7---
    8A linked-pair factorization can be thinned so that every cut visits the
    9same vertex of a finite graph. Absorption and idempotence preserve the
    10prefix and block values when successive blocks are grouped.
    11-/
    12
    13namespace Lax369799.LinkedPairFactorizations
    14open WordFactorization OmegaProducts
    15
    16axiom recurrent_factorization {M V : Type} [Monoid M] [Finite V] {u : ℕ}
    17 (f : Fin u → M) (P : M → M → Prop) (w : ℕ → Fin u) (v : ℕ → V)
    18 (h : Accepts f P w) :
    19 ∃ (a e : M) (c : ℕ → ℕ) (r : V), P a e ∧ e * e = e ∧ a * e = a ∧
    20 StrictMono c ∧ 0 < c 0 ∧ (∀ i, v (c i) = r) ∧
    21 (∀ i, block (f ∘ w) 0 (c i) = a) ∧
    22 (∀ i j, i < j → block (f ∘ w) (c i) (c j) = e)
    23
    24end Lax369799.LinkedPairFactorizations
    25
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…