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

Language invariance, closure, and syntactic finiteness for supported algebras

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

    Lemmas 56, 62, and 75 with revised Definition 6 as the algebra domain. The completion bridge transfers finite recognition, while invariance of a recognized language follows directly from invariance of its evaluation.

    Concept map
    26 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.SupportedAlgebras
    2import Lax369799.RecognitionClosure
    3import Lax369799.RecognitionProjection
    4import Lax369799.BoundedProfileRefinement
    5
    6/-!
    7---
    8title: Language invariance, closure, and syntactic finiteness for supported algebras
    9type: theorem
    10---
    11Lemmas 56, 62, and 75 with revised Definition 6 as the algebra domain.
    12The completion bridge transfers finite recognition, while invariance of
    13a recognized language follows directly from invariance of its evaluation.
    14-/
    15
    16namespace Lax369799.SupportedRecognition
    17open RankedSystems Algebras
    18
    19axiom language_invariant {A B : RankedSet} (E : SupportedAlgebras.Algebra B)
    20 (hE : SupportedAlgebras.UnfoldInvariant E) (η : RankedMap A B) (F : Set (B 0))
    21 (L : Language A) (hL : SupportedAlgebras.Recognizes E η F L) : UnfoldInvariantLanguage L
    22
    23axiom complement {A : RankedSet} (L : Language A) (h : SupportedAlgebras.Recognizable L) :
    24 SupportedAlgebras.Recognizable Lᶜ
    25
    26axiom intersection {A : RankedSet} (L K : Language A)
    27 (hL : SupportedAlgebras.Recognizable L) (hK : SupportedAlgebras.Recognizable K) :
    28 SupportedAlgebras.Recognizable (L ∩ K)
    29
    30axiom union {A : RankedSet} (L K : Language A)
    31 (hL : SupportedAlgebras.Recognizable L) (hK : SupportedAlgebras.Recognizable K) :
    32 SupportedAlgebras.Recognizable (L ∪ K)
    33
    34axiom inverse_relabel {A B : RankedSet} (η : RankedMap A B) (L : Language B)
    35 (hL : SupportedAlgebras.Recognizable L) :
    36 SupportedAlgebras.Recognizable {S | relabelSystem η S ∈ L}
    37
    38axiom projection {A B : RankedSet} (η : RankedMap A B)
    39 (hη : ∀ n, Function.Surjective (η n)) (L : Language A)
    40 (hL : SupportedAlgebras.Recognizable L) :
    41 SupportedAlgebras.Recognizable (RecognitionProjection.Projected η L)
    42
    43axiom syntactic_rankwise_finite {A : RankedSet} (L : Language A)
    44 (hL : UnfoldInvariantLanguage L) (hrec : SupportedAlgebras.Recognizable L) :
    45 RankwiseFinite (FiniteContextualOrder.Carrier (FiniteAcceptance.Accepting L))
    46
    47end Lax369799.SupportedRecognition
    48
    Show ProofShow 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…