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

The closed extremal witness

Lax369799.ClosedExtremal · concepts/Lax369799/ClosedExtremal.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 rank-zero case of Lemma 91 retains the hole and its incoming unary piece, makes the hole initial, and retains the former initial vertices as roots. No direction copy or output edge is needed. Testing this closed witness forces every component of an accepting context above the original extremal datum. Minimality then identifies its value with the hole value.

    Concept map
    60 concepts
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceThe closed extremal witnessContext 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 deterministicwitnessesExtremal accepted situations in the syntacticalgebraUnary 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 presentationsFinite iteration of context-preserving localchoicesMorphisms 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 finitepresentationsSimultaneous deterministic replacements infinite presentationsYield 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 A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.ExtremalSituations
    2
    3/-!
    4---
    5title: The closed extremal witness
    6type: theorem
    7---
    8The rank-zero case of Lemma 91 retains the hole and its incoming unary
    9piece, makes the hole initial, and retains the former initial vertices
    10as roots. No direction copy or output edge is needed. Testing this closed
    11witness forces every component of an accepting context above the original
    12extremal datum. Minimality then identifies its value with the hole value.
    13-/
    14
    15namespace Lax369799.ClosedExtremal
    16open RankedSystems (RankedSet)
    17open FinitePresentations FiniteContextualOrder FiniteSyntacticAlgebra
    18open FiniteAcceptance ExpandedSyntacticAlgebra
    19open ExtremalContexts (Data)
    20open FiniteExtremal (Accepts value DataBelow)
    21
    22def witness {A : RankedSet} (x : Data A 0) (a : A 0) : FiniteSystem A 0 where
    23 size := 2
    24 graph := {
    25 label := Fin.cases ⟨0, a⟩ (fun i => ⟨1, x.2 i⟩)
    26 initial := {0}
    27 root := fun v => v = 1 ∨ (v = 0 ∧ x.1.root)
    28 edge := fun v d t => v = 1 ∧ d = 0 ∧ t = .inl 0
    29 direction_valid := by
    30 rintro v d t ⟨rfl, rfl, _⟩
    31 exact Nat.zero_lt_one }
    32
    33axiom comparison {A : RankedSet} (L : Algebras.Language A)
    34 (E : SyntacticAlgebra L) (x y : Data (Carrier (Accepting L)) 0)
    35 (a : Carrier (Accepting L) 0)
    36 (hx : Lax369799.FiniteExtremal.IsExtremal (Accepting L) E.algebra a x)
    37 (hy : Accepts (Accepting L) E.algebra (E.algebra.eval 0 (witness x a)) y) :
    38 DataBelow (Accepting L) x y
    39
    40axiom in_context {A : RankedSet} (L : Algebras.Language A)
    41 (E : SyntacticAlgebra L) (x : Data (Carrier (Accepting L)) 0)
    42 (a : Carrier (Accepting L) 0) :
    43 ClassBelow (Accepting L) (value E.algebra a x)
    44 (value E.algebra (E.algebra.eval 0 (witness x a)) x)
    45
    46axiom below {A : RankedSet} (L : Algebras.Language A)
    47 (E : SyntacticAlgebra L) (x : Data (Carrier (Accepting L)) 0)
    48 (a : Carrier (Accepting L) 0)
    49 (hx : Lax369799.FiniteExtremal.IsExtremal (Accepting L) E.algebra a x) :
    50 ClassBelow (Accepting L) (E.algebra.eval 0 (witness x a)) a
    51
    52axiom witness_value {A : RankedSet} (L : Algebras.Language A)
    53 (E : SyntacticAlgebra L) (x : Data (Carrier (Accepting L)) 0)
    54 (a : Carrier (Accepting L) 0)
    55 (hx : Lax369799.ExtremalSituations.IsExtremal (Accepting L) E.algebra (x, a)) :
    56 E.algebra.eval 0 (witness x a) = a
    57
    58axiom normal_test {A : RankedSet} (L : Algebras.Language A)
    59 (E : SyntacticAlgebra L) (x : Data (Carrier (Accepting L)) 0)
    60 (a : Carrier (Accepting L) 0)
    61 (hx : Lax369799.ExtremalSituations.IsExtremal (Accepting L) E.algebra (x, a))
    62 (y : Data (Carrier (Accepting L)) 0) :
    63 Accepts (Accepting L) E.algebra a y ↔ DataBelow (Accepting L) x y
    64
    65end Lax369799.ClosedExtremal
    66
    Show ProofShow ProofShow ProofShow ProofShow 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…