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

Morphisms of unpruned finite presentations

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

    Morphisms preserve labels, marks, and transitions, including at unreachable vertices. They lift through substitution in a fixed context. Since they preserve yields on reachable restrictions, they reverse acceptance and the contextual preorder defined by yield acceptance.

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

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

    Lean source view on GitHub

    1import Lax369799.FiniteAcceptance
    2import Lax369799.PresentationCovers
    3
    4/-!
    5---
    6title: Morphisms of unpruned finite presentations
    7type: theorem
    8---
    9Morphisms preserve labels, marks, and transitions, including at unreachable
    10vertices. They lift through substitution in a fixed context. Since they
    11preserve yields on reachable restrictions, they reverse acceptance and
    12the contextual preorder defined by yield acceptance.
    13-/
    14
    15namespace Lax369799.FiniteMorphisms
    16open RankedSystems (RankedSet)
    17open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    18
    19structure Morphism {A : RankedSet} {n : ℕ} (S T : FiniteSystem A n) where
    20 toFun : S.Vertex → T.Vertex
    21 initial : ∀ v, S.graph.initial v → T.graph.initial (toFun v)
    22 root : ∀ v, S.graph.root v → T.graph.root (toFun v)
    23 label : ∀ v, T.graph.label (toFun v) = S.graph.label v
    24 edge : ∀ v d t, S.graph.edge v d t → T.graph.edge (toFun v) d (Sum.map toFun id t)
    25
    26axiom accepting_morphism {A : RankedSet} (L : Algebras.Language A)
    27 {S T : FiniteSystem A 0} (f : Morphism S T) : Accepting L T → Accepting L S
    28
    29axiom contextual_morphism {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    30 {S T : FiniteSystem A n} (f : Morphism S T) : Below (Accepting L) T S
    31
    32axiom sum_lower {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    33 (S T : FiniteSystem A n) :
    34 Below (Accepting L) (sum S T) S ∧ Below (Accepting L) (sum S T) T
    35
    36axiom contextual_cover {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    37 {S T : FiniteSystem A n} (f : PresentationCovers.Cover S.graph T.graph) :
    38 Equivalent (Accepting L) S T
    39
    40axiom sum_idempotent {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    41 (S : FiniteSystem A n) : Equivalent (Accepting L) (sum S S) S
    42
    43axiom sum_meet {A : RankedSet} (L : Algebras.Language A) {n : ℕ}
    44 (R S T : FiniteSystem A n) :
    45 Below (Accepting L) R (sum S T) ↔
    46 Below (Accepting L) R S ∧ Below (Accepting L) R T
    47
    48end Lax369799.FiniteMorphisms
    49
    Show 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…