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

The subalgebra generated by a recognizing alphabet

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

    Retain exactly the algebra values realized by systems over the original alphabet. This forms a subalgebra, since associativity evaluates a system of realized values by substituting their witnesses. Restricting to these values preserves recognition and rankwise finiteness.

    Concept map
    5 concepts; 1 descendant hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.Algebras
    2
    3/-!
    4---
    5title: The subalgebra generated by a recognizing alphabet
    6type: theorem
    7---
    8Retain exactly the algebra values realized by systems over the original
    9alphabet. This forms a subalgebra, since associativity evaluates a system
    10of realized values by substituting their witnesses. Restricting to these
    11values preserves recognition and rankwise finiteness.
    12-/
    13namespace Lax369799.GeneratedAlgebra
    14open RankedSystems Algebras
    15
    16def Carrier {A B : RankedSet} (E : Algebra B) (η : RankedMap A B) : RankedSet :=
    17 fun n => {b : B n // ∃ S : System A n, E.eval n (relabelSystem η S) = b}
    18
    19def projection {A B : RankedSet} (E : Algebra B) (η : RankedMap A B) : RankedMap (Carrier E η) B :=
    20 fun _ b => b.val
    21
    22def letter {A B : RankedSet} (E : Algebra B) (η : RankedMap A B) : RankedMap A (Carrier E η) :=
    23 fun n a => ⟨η n a, atomicSystem a, E.unit n (η n a)⟩
    24
    25axiom algebra {A B : RankedSet} (E : Algebra B) (η : RankedMap A B) :
    26 ∃ G : Algebra (Carrier E η), ∀ n (S : System (Carrier E η) n),
    27 (G.eval n S).val = E.eval n (relabelSystem (projection E η) S)
    28
    29axiom finite_carrier {A B : RankedSet} (E : Algebra B) (η : RankedMap A B)
    30 (hB : RankwiseFinite B) : RankwiseFinite (Carrier E η)
    31
    32axiom recognition {A B : RankedSet} (E : Algebra B) (η : RankedMap A B)
    33 (G : Algebra (Carrier E η))
    34 (hG : ∀ n (S : System (Carrier E η) n), (G.eval n S).val = E.eval n (relabelSystem (projection E η) S))
    35 (F : Set (B 0)) (L : Language A) (hL : Recognizes E η F L) :
    36 Recognizes G (letter E η) {b | b.val ∈ F} L
    37
    38end Lax369799.GeneratedAlgebra
    39
    Show ProofShow ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…