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

Normal data for a unary type with a closed continuation

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

    After removing a unary hole, a closed continuation is an isolated nullary component of each unary piece. It is initial only in the outgoing piece. The incoming testing prefix is planted in both pieces. These data turn a binary sum of continuations into the meet of the two normal data.

    Concept map
    25 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.ClosedUnaryLift
    2import Lax369799.SplitExtremal
    3
    4/-!
    5---
    6title: Normal data for a unary type with a closed continuation
    7type: theorem
    8---
    9After removing a unary hole, a closed continuation is an isolated nullary
    10component of each unary piece. It is initial only in the outgoing piece.
    11The incoming testing prefix is planted in both pieces. These data turn a
    12binary sum of continuations into the meet of the two normal data.
    13-/
    14namespace Lax369799.UnaryTestContexts
    15open RankedSystems (RankedSet)
    16open FinitePresentations FiniteSyntacticAlgebra FiniteContextualOrder FiniteAcceptance
    17open ExtremalContexts (Data)
    18
    19noncomputable def data {A : RankedSet} (E : Algebra A) (root : Prop) (t : A 1) (c : A 0) : Data A 1 :=
    20 (⟨root, ∅⟩, fun i => sumValue E (E.eval 1 (plant (atomic t)))
    21 (ClosedUnaryLift.value E (i == 1) c))
    22
    23axiom data_sum {A : RankedSet} (L : Algebras.Language A)
    24 (E : Algebra (Carrier (Accepting L)))
    25 (hE : ∀ n (S : FiniteSystem (FiniteSystem A) n),
    26 E.eval n (relabel (quotientMap (Accepting L)) S) = quotientMap (Accepting L) n (flatten S))
    27 (root : Prop) (t : Carrier (Accepting L) 1) (c d : Carrier (Accepting L) 0) :
    28 data E root t (sumValue E c d) = SplitExtremal.meetData E (data E root t c) (data E root t d)
    29
    30end Lax369799.UnaryTestContexts
    31
    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…