Stable factorization with recurrent vertices
Lax369799.SemigroupFactorization · concepts/Lax369799/SemigroupFactorization.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural 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
Lean source view on GitHub
| 1 | import Lax369799.WordFactorization |
| 2 | import Mathlib.Algebra.Group.WithOne.Basic |
| 3 | import Mathlib.Data.Fintype.Option |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Stable factorization with recurrent vertices |
| 8 | type: theorem |
| 9 | --- |
| 10 | A word over a finite semigroup admits stable idempotent blocks without |
| 11 | assuming an identity element. For a simultaneous sequence in a finite |
| 12 | vertex set, all block boundaries can be chosen at the same vertex. This |
| 13 | is the factorization used to turn a branch into a periodic branch in |
| 14 | Section 6.3. |
| 15 | -/ |
| 16 | namespace Lax369799.SemigroupFactorization |
| 17 | |
| 18 | /-- Product of a nonempty interval [i,j), starting with its first letter. -/ |
| 19 | def block {M : Type} [Semigroup M] (w : ℕ → M) (i j : ℕ) : M := |
| 20 | ((List.range' (i + 1) (j - i - 1)).map w).foldl (· * ·) (w i) |
| 21 | |
| 22 | axiom 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 | |
| 29 | end Lax369799.SemigroupFactorization |
| 30 |
Builds on
Used by
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments