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

Unary types selected by extremal refinement

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

    Unary values can themselves be refined by the extremal construction. The selected types retain acceptance in a prescribed context and lie below the original value. Their tests in normal contexts are principal filters of the unary context data.

    Concept map
    56 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsUnary normal form of deterministic elementsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesUnary types selected by extremal refinementYield acceptance of finite presentationsAutomaton property of the unprunedsyntactic algebraContexts over finite presentationsContextual preorders on finite presentationsFinite yield approximation of contextualacceptance and orderContext decomposition without pruningExtremal unary data for finite presentationsMorphisms of unpruned finite presentationsUnary normal forms without pruningOrdered syntactic algebras of finitepresentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsFinite approximation of a flatteningresolutionNormal forms retaining split-variableresolutionsContextual quotient algebras of finitepresentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsBounded optimal flatten-resolutionsLocally surjective maps of finitepresentationsResolution values of finite presentationsTransfer of resolutions through boundedprofilesRanked sets, set-systems, and systemsRenaming variables in systems andresolutionsCompression of the variables offlatten-resolutionsFinite families of split-variable resolutionsResolutions and bounded profilesRoot entries in substituted presentationsFinite support for root observationsThe earlier continuity-bearing set-algebrainterfaceExtremal witnesses with separate rootedcomponentsSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasVariable exits of unary systemsCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.ExpandedSyntacticAlgebra
    2import Lax369799.SplitExtremal
    3
    4/-!
    5---
    6title: Unary types selected by extremal refinement
    7type: theorem
    8---
    9Unary values can themselves be refined by the extremal construction.
    10The selected types retain acceptance in a prescribed context and lie
    11below the original value. Their tests in normal contexts are principal
    12filters of the unary context data.
    13-/
    14namespace Lax369799.ExtremalUnaryTypes
    15open RankedSystems (RankedSet)
    16open FinitePresentations FiniteContexts FiniteContextualOrder FiniteAcceptance
    17open FiniteSyntacticAlgebra ExpandedSyntacticAlgebra FiniteExtremal
    18open ExtremalContexts (Data)
    19
    20def Selected {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L)
    21 (b : Carrier (Accepting L) 1) : Prop :=
    22 ∃ (a : Carrier (Accepting L) 1) (x : Data (Carrier (Accepting L)) 1),
    23 IsExtremal (Accepting L) E.algebra a x ∧
    24 b = E.algebra.eval 1 (SplitExtremal.delta x.1 x.2 a)
    25
    26axiom replacement {A : RankedSet} (L : Algebras.Language A)
    27 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    28 (E : SyntacticAlgebra L) (C : Context (Carrier (Accepting L)) 1 0)
    29 (a : Carrier (Accepting L) 1)
    30 (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic a)))) :
    31 ∃ b, Selected L E b ∧ ClassBelow (Accepting L) b a ∧
    32 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic b)))
    33
    34axiom normal_test {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L)
    35 (b : Carrier (Accepting L) 1) (hb : Selected L E b) :
    36 ∃ x : Data (Carrier (Accepting L)) 1, ∀ y,
    37 Accepts (Accepting L) E.algebra b y ↔ DataBelow (Accepting L) x y
    38
    39end Lax369799.ExtremalUnaryTypes
    40
    Show ProofShow Proof

    Discussion

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

    Loading discussion…