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

Small profiles and the yield-syntactic congruence

Lax369799.SmallProfileRefinement · concepts/Lax369799/SmallProfileRefinement.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 small-map bound b_A is |A₀| + |A₁| + 1 in Section 4.3. Equality of initial and root profiles restricted to these maps determines every closed contextual acceptance test. Thus small-profile equivalence refines the yield-syntactic equivalence (Corollary 84), and has finite index in every rank when the observing algebra is rankwise finite. Contexts and substitution retain all vertices, as in Definition 68.

    Concept map
    18 concepts
    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.BoundedProfileRefinement
    2
    3/-!
    4---
    5title: Small profiles and the yield-syntactic congruence
    6type: theorem
    7---
    8The small-map bound b_A is |A₀| + |A₁| + 1 in Section 4.3. Equality of
    9initial and root profiles restricted to these maps determines every
    10closed contextual acceptance test. Thus small-profile equivalence
    11refines the yield-syntactic equivalence (Corollary 84), and has finite
    12index in every rank when the observing algebra is rankwise finite.
    13Contexts and substitution retain all vertices, as in Definition 68.
    14-/
    15
    16namespace Lax369799.SmallProfileRefinement
    17open RankedSystems Algebras FinitePresentations
    18
    19axiom refines {A B : RankedSet} (E : Algebra B) (hB : RankwiseFinite B)
    20 (hE : UnfoldInvariant E) (η : RankedMap A B) (F : Set (B 0)) (L : Language A)
    21 (hL : Recognizes E η F L) {n : ℕ} (S T : FiniteSystem A n)
    22 (h : FiniteProfiles.SmallProfileEquivalent
    23 (fun k R => E.eval k (relabelSystem η R)) S T) :
    24 FiniteContextualOrder.Equivalent (FiniteAcceptance.Accepting L) S T
    25
    26end Lax369799.SmallProfileRefinement
    27
    Show 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…