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

Extending supported algebras and preserving recognition

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

    The quotient of arbitrary systems by their supported-evaluation profiles is an algebra. Evaluation chooses inner representatives and flattens; substitution congruence and the deterministic substitution laws make it well defined and associative. The construction preserves finite sorts and closed recognition. Recognizability using the fully supported systems of Definition 6 is therefore equivalent to recognizability using arbitrary deterministic presentations.

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

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

    Lean source view on GitHub

    1import Lax369799.SupportEvaluation
    2
    3/-!
    4---
    5title: Extending supported algebras and preserving recognition
    6type: theorem
    7---
    8The quotient of arbitrary systems by their supported-evaluation profiles
    9is an algebra. Evaluation chooses inner representatives and flattens;
    10substitution congruence and the deterministic substitution laws make it
    11well defined and associative. The construction preserves finite sorts
    12and closed recognition. Recognizability using the fully supported systems
    13of Definition 6 is therefore equivalent to recognizability using arbitrary
    14deterministic presentations.
    15-/
    16
    17namespace Lax369799.SupportedCompletion
    18open RankedSystems Morphisms
    19open SupportEvaluation (Carrier classMap)
    20
    21axiom algebra {B : RankedSet} (E : SupportedAlgebras.Algebra B) :
    22 ∃ D : Algebras.Algebra (Carrier E), ∀ n (P : System (System B) n) (U : System B n),
    23 Lax369799.Flattening.SystemFlattening P U →
    24 D.eval n (relabelSystem (classMap E) P) = classMap E n U
    25
    26axiom legacy_recognizable {A : RankedSet} (L : Algebras.Language A)
    27 (hL : SupportedAlgebras.Recognizable L) : Algebras.Recognizable L
    28
    29axiom recognizable_iff {A : RankedSet} (L : Algebras.Language A) :
    30 SupportedAlgebras.Recognizable L ↔ Algebras.Recognizable L
    31
    32/-- Map a letter to the class of its atomic presentation. -/
    33def letter {B : RankedSet} (E : SupportedAlgebras.Algebra B) : RankedMap B (Carrier E) :=
    34 fun n b => classMap E n (atomicSystem b)
    35
    36open SupportEvaluation (Equivalent)
    37
    38axiom profile_morphism {B : RankedSet} (E : SupportedAlgebras.Algebra B)
    39 (hE : SupportedAlgebras.UnfoldInvariant E) {n : ℕ} (S T : System B n)
    40 (f : Morphism S.val T.val) : Equivalent E S T
    41
    42axiom profile_unfold {B : RankedSet} (E : SupportedAlgebras.Algebra B)
    43 (hE : SupportedAlgebras.UnfoldInvariant E) {n : ℕ} (S T : System B n)
    44 (h : UnfoldEquivalent S.val T.val) : Equivalent E S T
    45
    46axiom eval_letters {B : RankedSet} (E : SupportedAlgebras.Algebra B)
    47 (D : Algebras.Algebra (Carrier E))
    48 (hD : ∀ n (P : System (System B) n) (U : System B n),
    49 Flattening.SystemFlattening P U → D.eval n (relabelSystem (classMap E) P) = classMap E n U)
    50 {n : ℕ} (S : System B n) :
    51 D.eval n (relabelSystem (letter E) S) = classMap E n S
    52
    53axiom regular_completion {B : RankedSet} (E : SupportedAlgebras.Algebra B)
    54 (hE : SupportedAlgebras.UnfoldInvariant E) :
    55 ∃ D : Algebras.Algebra (Carrier E), Algebras.UnfoldInvariant D ∧
    56 ∀ n (S : System B n), D.eval n (relabelSystem (letter E) S) = classMap E n S
    57
    58axiom unary_card_bound {B : RankedSet} (E : SupportedAlgebras.Algebra B)
    59 (hB : RankwiseFinite B) : Nat.card (Carrier E 1) ≤ Nat.card (B 0) + Nat.card (B 1)
    60
    61end Lax369799.SupportedCompletion
    62
    Show ProofShow 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…