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

Automaton property of the unpruned syntactic algebra

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

    If the unary contextual sort is finite, every value in an accepting context can be replaced by a deterministic value below it while preserving acceptance. The proof uses the unpruned normal form and its boundary data, without a yield-continuity axiom.

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

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

    Lean source view on GitHub

    1import Lax369799.FiniteExtremal
    2
    3/-!
    4---
    5title: Automaton property of the unpruned syntactic algebra
    6type: theorem
    7---
    8If the unary contextual sort is finite, every value in an accepting
    9context can be replaced by a deterministic value below it while preserving
    10acceptance. The proof uses the unpruned normal form and its boundary data,
    11without a yield-continuity axiom.
    12-/
    13namespace Lax369799.FiniteAutomatonProperty
    14open RankedSystems (RankedSet)
    15open FinitePresentations FiniteContexts FiniteContextualOrder FiniteSyntacticAlgebra
    16open FiniteAcceptance FiniteExtremal
    17
    18axiom automaton_property {A : RankedSet} (L : Algebras.Language A)
    19 (E : Algebra (Carrier (Accepting L)))
    20 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    21 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    22 (hfinite : Finite (Carrier (Accepting L) 1))
    23 {k : ℕ} (C : Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k)
    24 (ha : AcceptingClass (Accepting L) (E.eval 0 (plug C (atomic a)))) :
    25 ∃ δ, Deterministic E δ ∧ ClassBelow (Accepting L) δ a ∧
    26 AcceptingClass (Accepting L) (E.eval 0 (plug C (atomic δ)))
    27
    28axiom recognizable_automaton_property {A : RankedSet} (L : Algebras.Language A)
    29 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    30 (E : Algebra (Carrier (Accepting L)))
    31 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    32 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    33 {k : ℕ} (C : Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k)
    34 (ha : AcceptingClass (Accepting L) (E.eval 0 (plug C (atomic a)))) :
    35 ∃ δ, Deterministic E δ ∧ ClassBelow (Accepting L) δ a ∧
    36 AcceptingClass (Accepting L) (E.eval 0 (plug C (atomic δ)))
    37
    38end Lax369799.FiniteAutomatonProperty
    39
    Show ProofShow Proof

    Discussion

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

    Loading discussion…