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

Ordered syntactic algebras of finite presentations

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

    For yield acceptance, binary disjoint union induces meet on the contextual quotient. The substitution algebra recognizes the original language on reachable deterministic systems.

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

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

    Lean source view on GitHub

    1import Lax369799.FiniteMorphisms
    2
    3/-!
    4---
    5title: Ordered syntactic algebras of finite presentations
    6type: theorem
    7---
    8For yield acceptance, binary disjoint union induces meet on the
    9contextual quotient. The substitution algebra recognizes the original
    10language on reachable deterministic systems.
    11-/
    12
    13namespace Lax369799.FiniteOrderedAlgebra
    14open RankedSystems (RankedSet)
    15open FinitePresentations FiniteContextualOrder FiniteAcceptance FiniteSyntacticAlgebra
    16
    17axiom sum_value_meet {A : RankedSet} (L : Algebras.Language A)
    18 (E : Algebra (Carrier (Accepting L)))
    19 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    20 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    21 {n : ℕ} (a b c : Carrier (Accepting L) n) :
    22 ClassBelow (Accepting L) c (sumValue E a b) ↔
    23 ClassBelow (Accepting L) c a ∧ ClassBelow (Accepting L) c b
    24
    25axiom language_recognition {A : RankedSet} (L : Algebras.Language A)
    26 (hL : Algebras.UnfoldInvariantLanguage L) :
    27 ∃ E : Algebra (Carrier (Accepting L)), ∃ P : Set (Carrier (Accepting L) 0),
    28 ∀ S : RankedSystems.System A 0,
    29 E.eval 0 (relabel (fun r a => quotientMap (Accepting L) r (atomic a))
    30 (ofSetSystem S.val)) ∈ P ↔ S ∈ L
    31
    32axiom principal_acceptance {A : RankedSet} (L : Algebras.Language A)
    33 (E : Algebra (Carrier (Accepting L)))
    34 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    35 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    36 (hfinite : Finite (Carrier (Accepting L) 0)) :
    37 ∃ p, ∀ a, AcceptingClass (Accepting L) a ↔ ClassBelow (Accepting L) p a
    38
    39axiom evaluation_morphism {A : RankedSet} (L : Algebras.Language A)
    40 (E : Algebra (Carrier (Accepting L)))
    41 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    42 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    43 {n : ℕ} {S T : FiniteSystem (Carrier (Accepting L)) n} (f : FiniteMorphisms.Morphism S T) :
    44 ClassBelow (Accepting L) (E.eval n T) (E.eval n S)
    45
    46axiom evaluation_cover {A : RankedSet} (L : Algebras.Language A)
    47 (E : Algebra (Carrier (Accepting L)))
    48 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    49 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    50 {n : ℕ} {S T : FiniteSystem (Carrier (Accepting L)) n}
    51 (f : PresentationCovers.Cover S.graph T.graph) (hf : Function.Surjective f.toFun) :
    52 E.eval n S = E.eval n T
    53
    54end Lax369799.FiniteOrderedAlgebra
    55
    Show ProofShow ProofShow 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…