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

Acceptance and the syntactic preorder

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

    Acceptance is invariant under unfolding. On deterministic systems it agrees with membership in the original unfold-invariant language. The syntactic preorder reverses morphisms and preserves acceptance on closed systems, so acceptance descends to the syntactic quotient.

    Concept map
    7 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.SyntacticOrder
    2
    3/-!
    4---
    5title: Acceptance and the syntactic preorder
    6type: theorem
    7---
    8Acceptance is invariant under unfolding. On deterministic systems it
    9agrees with membership in the original unfold-invariant language. The
    10syntactic preorder reverses morphisms and preserves acceptance on closed
    11systems, so acceptance descends to the syntactic quotient.
    12-/
    13
    14namespace Lax369799.AcceptanceTheorems
    15open RankedSystems Morphisms Algebras SyntacticOrder
    16
    17axiom yield_sum {A : RankedSet} {n : ℕ} (S T U : SetSystem A n) :
    18 Yield (sum S T) U ↔ Yield S U ∨ Yield T U
    19
    20axiom accepting_sum {A : RankedSet} (L : Language A) (S T : SetSystem A 0) :
    21 Accepting L (sum S T) ↔ Accepting L S ∧ Accepting L T
    22
    23axiom accepting_system {A : RankedSet} (L : Language A)
    24 (hL : UnfoldInvariantLanguage L) (S : System A 0) :
    25 Accepting L S.val ↔ S ∈ L
    26
    27axiom accepting_unfold {A : RankedSet} (L : Language A)
    28 (S T : SetSystem A 0) (h : UnfoldEquivalent S T) :
    29 Accepting L S ↔ Accepting L T
    30
    31axiom syntactic_morphism {A : RankedSet} (L : Language A) {n : ℕ}
    32 {S T : SetSystem A n} (f : Morphism S T) : SyntacticBelow L T S
    33
    34axiom syntactic_acceptance {A : RankedSet} (L : Language A)
    35 {S T : SetSystem A 0} (h : SyntacticBelow L S T) :
    36 Accepting L S → Accepting L T
    37
    38axiom accepting_plant {A : RankedSet} (L : Language A) (S : SetSystem A 0) :
    39 Accepting L (plant S) ↔ Accepting L S
    40
    41end Lax369799.AcceptanceTheorems
    42
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

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

    Loading discussion…