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

The unary semigroup and its action

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

    Unary values compose by evaluating a two-vertex chain. Associativity of the algebra makes this composition associative, and the same operation acts on every sort. This supplies the finite semigroup used to factor infinite unary branch words in Section 6.3.

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

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

    Lean source view on GitHub

    1import Lax369799.FiniteBranchWords
    2
    3/-!
    4---
    5title: The unary semigroup and its action
    6type: theorem
    7---
    8Unary values compose by evaluating a two-vertex chain. Associativity of
    9the algebra makes this composition associative, and the same operation
    10acts on every sort. This supplies the finite semigroup used to factor
    11infinite unary branch words in Section 6.3.
    12-/
    13
    14namespace Lax369799.UnaryComposition
    15open RankedSystems (RankedSet)
    16open FinitePresentations FiniteSyntacticAlgebra
    17
    18def application {A : RankedSet} {n : ℕ} (b : A 1) (a : A n) : FiniteSystem A n where
    19 size := 2
    20 graph := {
    21 label := Fin.cases ⟨1, b⟩ (fun _ => ⟨n, a⟩)
    22 initial := {0}
    23 root := ∅
    24 edge := fun v d t =>
    25 (v = 0 ∧ d = 0 ∧ t = .inl 1) ∨
    26 (v = 1 ∧ ∃ j : Fin n, d = j.val ∧ t = .inr j)
    27 direction_valid := by
    28 rintro v d t (⟨rfl, rfl, _⟩ | ⟨rfl, j, rfl, _⟩)
    29 · exact Nat.zero_lt_one
    30 · exact j.isLt }
    31
    32def act {A : RankedSet} (E : Algebra A) {n : ℕ} (b : A 1) (a : A n) : A n :=
    33 E.eval n (application b a)
    34
    35def product {A : RankedSet} (E : Algebra A) (a b : A 1) : A 1 := act E a b
    36
    37axiom action_law {A : RankedSet} (E : Algebra A) {n : ℕ}
    38 (a b : A 1) (c : A n) : act E (product E a b) c = act E a (act E b c)
    39
    40axiom associative {A : RankedSet} (E : Algebra A) (a b c : A 1) :
    41 product E (product E a b) c = product E a (product E b c)
    42
    43axiom nullary_action {A : RankedSet} (E : Algebra A) (b : A 1) (a : A 0) :
    44 act E b a = FiniteBranchWords.act E b a
    45
    46end Lax369799.UnaryComposition
    47
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…