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

Choice preservation of extremally selected unary types

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

    Rank-one extremal selection makes acceptance in normal contexts a principal test on their data. The data for a sum of closed continuations are the meet of the separate data. Contextual order separation therefore gives preservation of binary choices by every selected unary type.

    Concept map
    59 concepts; 7 descendants hidden
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceUnary types preserving explicit choicesContext 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 algebraFinite-state evaluation of terminating branchwordsContexts 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 observationsChoice preservation of extremally selectedunary typesThe 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 A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ExtremalUnaryTypes
    2import Lax369799.ChoicePreservingUnary
    3
    4/-!
    5---
    6title: Choice preservation of extremally selected unary types
    7type: theorem
    8---
    9Rank-one extremal selection makes acceptance in normal contexts a
    10principal test on their data. The data for a sum of closed continuations
    11are the meet of the separate data. Contextual order separation therefore
    12gives preservation of binary choices by every selected unary type.
    13-/
    14namespace Lax369799.SelectedChoicePreservation
    15open RankedSystems (RankedSet)
    16open FiniteContextualOrder FiniteAcceptance ExpandedSyntacticAlgebra
    17
    18axiom selected_preserves_choices {A : RankedSet} (L : Algebras.Language A)
    19 (E : SyntacticAlgebra L) (b : Carrier (Accepting L) 1)
    20 (hb : ExtremalUnaryTypes.Selected L E b) :
    21 ChoicePreservingUnary.PreservesChoices E.algebra b
    22
    23end Lax369799.SelectedChoicePreservation
    24
    Show Proof

    Discussion

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

    Loading discussion…