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

Bounded profiles refine finite contextual equivalence

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

    Initial and root profiles with variable-map fibres bounded by one more than the size of the unary observing sort determine every closed contextual acceptance test. Consequently the contextual quotient of finite presentations is rankwise finite for every regular-tree recognizable language.

    Concept map
    17 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.FiniteProfiles
    2
    3/-!
    4---
    5title: Bounded profiles refine finite contextual equivalence
    6type: theorem
    7---
    8Initial and root profiles with variable-map fibres bounded by one more than
    9the size of the unary observing sort determine every closed contextual
    10acceptance test. Consequently the contextual quotient of finite presentations
    11is rankwise finite for every regular-tree recognizable language.
    12-/
    13namespace Lax369799.BoundedProfileRefinement
    14open RankedSystems Algebras FinitePresentations FiniteProfiles
    15
    16axiom refines {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E)
    17 [Finite (B 1)] (η : RankedMap A B) (F : Set (B 0)) (L : Language A)
    18 (hL : Recognizes E η F L) {n : ℕ} (S T : FiniteSystem A n)
    19 (h : BoundedProfileEquivalent (Nat.card (B 1) + 1)
    20 (fun k R => E.eval k (relabelSystem η R)) S T) :
    21 FiniteContextualOrder.Equivalent (FiniteAcceptance.Accepting L) S T
    22
    23axiom finite_carrier {A : RankedSet} (L : Language A) (hL : RegularTreeRecognizable L) :
    24 RankwiseFinite (FiniteContextualOrder.Carrier (FiniteAcceptance.Accepting L))
    25
    26axiom finite_carrier_recognizable {A : RankedSet} (L : Language A)
    27 (hL : UnfoldInvariantLanguage L) (hrec : Recognizable L) :
    28 RankwiseFinite (FiniteContextualOrder.Carrier (FiniteAcceptance.Accepting L))
    29
    30end Lax369799.BoundedProfileRefinement
    31
    Show ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…