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

Boolean closure and inverse relabelling of recognizable languages

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

    Rankwise-finite algebraic recognition is preserved by Boolean operations and inverse relabelling. Products combine recognizing algebras; complement changes the accepting subset, and inverse relabelling composes letter maps. These are the Boolean and cylindrification clauses of Section 3.

    Concept map
    5 concepts; 1 descendant hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.Algebras
    2
    3/-!
    4---
    5title: Boolean closure and inverse relabelling of recognizable languages
    6type: theorem
    7---
    8Rankwise-finite algebraic recognition is preserved by Boolean operations
    9and inverse relabelling. Products combine recognizing algebras; complement
    10changes the accepting subset, and inverse relabelling composes letter maps.
    11These are the Boolean and cylindrification clauses of Section 3.
    12-/
    13namespace Lax369799.RecognitionClosure
    14open RankedSystems Algebras
    15
    16axiom complement {A : RankedSet} (L : Language A) (h : Recognizable L) : Recognizable Lᶜ
    17
    18axiom intersection {A : RankedSet} (L K : Language A)
    19 (hL : Recognizable L) (hK : Recognizable K) : Recognizable (L ∩ K)
    20
    21axiom union {A : RankedSet} (L K : Language A)
    22 (hL : Recognizable L) (hK : Recognizable K) : Recognizable (L ∪ K)
    23
    24axiom inverse_relabel {A B : RankedSet} (η : RankedMap A B) (L : Language B)
    25 (hL : Recognizable L) : Recognizable {S | relabelSystem η S ∈ L}
    26
    27end Lax369799.RecognitionClosure
    28
    Show ProofShow ProofShow ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…