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

Existential projection of recognizable languages

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

    Forgetting vertex marks preserves recognizability. More generally, a surjective rank-preserving letter map induces an existential projection: a system is accepted if its vertices admit labels above their old labels that form an accepted system. Nonempty powerset evaluation records all possible evaluations of these choices.

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

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.NonemptyPowersets
    2
    3/-!
    4---
    5title: Existential projection of recognizable languages
    6type: theorem
    7---
    8Forgetting vertex marks preserves recognizability. More generally, a
    9surjective rank-preserving letter map induces an existential projection:
    10a system is accepted if its vertices admit labels above their old labels
    11that form an accepted system. Nonempty powerset evaluation records all
    12possible evaluations of these choices.
    13-/
    14namespace Lax369799.RecognitionProjection
    15open RankedSystems Algebras PolynomialContexts
    16
    17def Projected {A B : RankedSet} (η : RankedMap A B) (L : Language A) : Language B :=
    18 {S | ∃ q : ∀ v, A (S.val.graph.label v).1,
    19 (∀ v, η _ (q v) = (S.val.graph.label v).2) ∧ withLabels S q ∈ L}
    20
    21axiom recognizable {A B : RankedSet} (η : RankedMap A B)
    22 (hη : ∀ n, Function.Surjective (η n)) (L : Language A) (hL : Recognizable L) :
    23 Recognizable (Projected η L)
    24
    25end Lax369799.RecognitionProjection
    26
    Show Proof

    Discussion

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

    Loading discussion…