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

Regular-tree recognition from unfold-invariant recognition

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

    An unfold-invariant language recognized by a rankwise-finite algebra has a rankwise-finite unfolding-invariant recognizing algebra. First restrict to values realized by systems over the original alphabet. Then quotient by all closed polynomial acceptance tests.

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

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

    Lean source view on GitHub

    1import Lax369799.GeneratedAlgebra
    2import Lax369799.PolynomialUnfolding
    3
    4/-!
    5---
    6title: Regular-tree recognition from unfold-invariant recognition
    7type: theorem
    8---
    9An unfold-invariant language recognized by a rankwise-finite algebra has
    10a rankwise-finite unfolding-invariant recognizing algebra. First restrict
    11to values realized by systems over the original alphabet. Then quotient by
    12all closed polynomial acceptance tests.
    13-/
    14namespace Lax369799.Regularization
    15open RankedSystems Algebras
    16
    17axiom generated_closed_invariant {A B : RankedSet} (E : Algebra B) (η : RankedMap A B)
    18 (G : Algebra (GeneratedAlgebra.Carrier E η))
    19 (hG : ∀ n (S : System (GeneratedAlgebra.Carrier E η) n),
    20 (G.eval n S).val = E.eval n (relabelSystem (GeneratedAlgebra.projection E η) S))
    21 (F : Set (B 0)) (L : Language A) (hL : UnfoldInvariantLanguage L) (hrec : Recognizes E η F L) :
    22 PolynomialUnfolding.ClosedInvariant G {b | b.val ∈ F}
    23
    24axiom regular_tree_recognizable {A : RankedSet} (L : Language A)
    25 (hL : UnfoldInvariantLanguage L) (hrec : Recognizable L) : RegularTreeRecognizable L
    26
    27end Lax369799.Regularization
    28
    Show 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…