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

Syntactic algebras with expanded continuity

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

    The syntactic quotient is a substitution algebra of finite presentations. Its continuity law resolves base-alphabet representatives after expansion. It applies to every lower bound and every choice of representatives. Finite resolution normal forms retain entire branching components.

    Concept map
    52 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsAutomaton property of the unprunedsyntactic algebraContexts over finite presentationsContextual preorders on finite presentationsFinite yield approximation of contextualacceptance and orderContext decomposition without pruningExtremal unary data for finite presentationsMorphisms of unpruned finite presentationsUnary normal forms without pruningOrdered syntactic algebras of finitepresentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsBounded optimal flatten-resolutionsLocally surjective maps of finitepresentationsResolution values of finite presentationsTransfer of resolutions through boundedprofilesRanked sets, set-systems, and systemsRenaming variables in systems andresolutionsCompression of the variables offlatten-resolutionsFinite families of split-variable resolutionsResolutions and bounded profilesRoot entries in substituted presentationsFinite support for root observationsThe earlier continuity-bearing set-algebrainterfaceSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

    Lean source view on GitHub

    1import Lax369799.ExpandedContinuity
    2import Lax369799.FiniteAutomatonProperty
    3import Lax369799.FiniteResolutionNormalForms
    4
    5/-!
    6---
    7title: Syntactic algebras with expanded continuity
    8type: theorem
    9---
    10The syntactic quotient is a substitution algebra of finite presentations.
    11Its continuity law resolves base-alphabet representatives after expansion.
    12It applies to every lower bound and every choice of representatives.
    13Finite resolution normal forms retain entire branching components.
    14-/
    15namespace Lax369799.ExpandedSyntacticAlgebra
    16open RankedSystems (RankedSet SetSystem System trim)
    17open FinitePresentations FiniteContextualOrder FiniteAcceptance
    18open FiniteSyntacticAlgebra ExpandedContinuity
    19
    20structure SyntacticAlgebra {A : RankedSet} (L : Algebras.Language A) where
    21 algebra : Algebra (Carrier (Accepting L))
    22 evaluates : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    23 algebra.eval n (relabel (quotientMap (Accepting L)) S) =
    24 quotientMap (Accepting L) n (flatten S)
    25 continuity : ∀ {n} (P : FiniteSystem (Carrier (Accepting L)) n)
    26 (q : Representatives L P), Represents L P q → ∀ a : Carrier (Accepting L) n,
    27 ClassBelow (Accepting L) a (algebra.eval n P) ↔
    28 ∀ T : SetSystem A n, Morphisms.Yield (trim (expansion L P q).graph) T →
    29 ClassBelow (Accepting L) a (quotientMap (Accepting L) n (ofSetSystem T))
    30
    31axiom syntactic_algebra_exists {A : RankedSet} (L : Algebras.Language A) :
    32 Nonempty (SyntacticAlgebra L)
    33
    34axiom representatives_exist {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    35 (P : FiniteSystem (Carrier (Accepting L)) n) :
    36 ∃ q : Representatives L P, Represents L P q
    37
    38axiom recognition {A : RankedSet} (L : Algebras.Language A)
    39 (hL : Algebras.UnfoldInvariantLanguage L) (T : System A 0) :
    40 AcceptingClass (Accepting L) (quotientMap (Accepting L) 0 (ofSetSystem T.val)) ↔ T ∈ L
    41
    42axiom expanded_normal_form {A B : RankedSet} (L : Algebras.Language A)
    43 (E : SyntacticAlgebra L) (D : Algebras.Algebra B)
    44 (hD : Algebras.UnfoldInvariant D) (hB : RankedSystems.RankwiseFinite B)
    45 (η : RankedSystems.RankedMap A B) (F : Set (B 0))
    46 (hL : Algebras.Recognizes D η F L) {n : ℕ}
    47 (P : FiniteSystem (Carrier (Accepting L)) n)
    48 (q : Representatives L P) (hq : Represents L P q) :
    49 ∃ (k : ℕ) (c : Fin k → FiniteResolutionNormalForms.Component (trim (expansion L P q).graph)),
    50 E.algebra.eval n P = quotientMap (Accepting L) n (FiniteResolutionNormalForms.family c)
    51
    52axiom automaton_property {A : RankedSet} (L : Algebras.Language A)
    53 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    54 (E : SyntacticAlgebra L) {k : ℕ}
    55 (C : FiniteContexts.Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k)
    56 (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (FiniteContexts.plug C (atomic a)))) :
    57 ∃ δ, FiniteExtremal.Deterministic E.algebra δ ∧ ClassBelow (Accepting L) δ a ∧
    58 AcceptingClass (Accepting L) (E.algebra.eval 0 (FiniteContexts.plug C (atomic δ)))
    59
    60axiom expanded_yield_order {A : RankedSet} (L : Algebras.Language A)
    61 (E : SyntacticAlgebra L) {n : ℕ}
    62 (P Q : FiniteSystem (Carrier (Accepting L)) n)
    63 (p : Representatives L P) (q : Representatives L Q)
    64 (hp : Represents L P p) (hq : Represents L Q q)
    65 (h : Morphisms.YieldBelow (trim (expansion L P p).graph) (trim (expansion L Q q).graph)) :
    66 ClassBelow (Accepting L) (E.algebra.eval n Q) (E.algebra.eval n P)
    67
    68axiom syntactic_automaton_property {A : RankedSet} (L : Algebras.Language A)
    69 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L) :
    70 ∃ E : SyntacticAlgebra L, ∀ {k : ℕ}
    71 (C : FiniteContexts.Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k),
    72 AcceptingClass (Accepting L) (E.algebra.eval 0 (FiniteContexts.plug C (atomic a))) →
    73 ∃ δ, FiniteExtremal.Deterministic E.algebra δ ∧ ClassBelow (Accepting L) δ a ∧
    74 AcceptingClass (Accepting L) (E.algebra.eval 0 (FiniteContexts.plug C (atomic δ)))
    75
    76end Lax369799.ExpandedSyntacticAlgebra
    77
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…