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

Formal unary pieces and extremal accepted situations

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

    Definition 65 retains the immediate initial and root exits as two formal markers alongside an ordinary unary value. A closed context made from these pieces is an ordinary finite presentation: the initial marker of piece zero marks the hole initial, a root marker in any piece marks it root, and an initial marker in direction i adds a self-loop in that direction. In the syntactic algebra, planting identifies the two hole marks. Saturating their redundant formal representations relates Definition 85 exactly to minimal planted situations.

    Concept map
    60 concepts; 4 descendants hidden
    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 continuityFormal unary pieces and extremal acceptedsituationsPlanted 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 9 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ExtremalSituations
    2
    3/-!
    4---
    5title: Formal unary pieces and extremal accepted situations
    6type: theorem
    7---
    8Definition 65 retains the immediate initial and root exits as two formal
    9markers alongside an ordinary unary value. A closed context made from
    10these pieces is an ordinary finite presentation: the initial marker of
    11piece zero marks the hole initial, a root marker in any piece marks it
    12root, and an initial marker in direction i adds a self-loop in that
    13direction. In the syntactic algebra, planting identifies the two hole
    14marks. Saturating their redundant formal representations relates
    15Definition 85 exactly to minimal planted situations.
    16-/
    17
    18namespace Lax369799.ExtendedContexts
    19open RankedSystems (RankedSet)
    20open FinitePresentations FiniteContexts FiniteContextualOrder FiniteSyntacticAlgebra
    21open FiniteAcceptance ExpandedSyntacticAlgebra
    22open ExtremalContexts (Data)
    23
    24inductive Marker where
    25 | initial
    26 | root
    27 deriving DecidableEq
    28
    29instance : Fintype Marker where
    30 elems := {.initial, .root}
    31 complete := by intro m; cases m <;> simp
    32
    33abbrev Piece (A : RankedSet) := A 1 × Set Marker
    34abbrev Pieces (A : RankedSet) (k : ℕ) := Fin (k + 1) → Piece A
    35
    36def PieceBelow {A : RankedSet} (F : ClosedProperty A)
    37 (p q : Piece (Carrier F)) : Prop :=
    38 ClassBelow F p.1 q.1 ∧ q.2 ⊆ p.2
    39
    40def context {A : RankedSet} {k : ℕ} (p : Pieces A k) : Context A k 0 where
    41 system := {
    42 size := k + 2
    43 graph := {
    44 label := (ExtremalContexts.normalPresentation
    45 (A := A) ⟨False, ∅⟩ (fun i => (p i).1)).label
    46 initial := fun v => v = (0 : Fin (k + 1)).succ ∨
    47 (v = 0 ∧ Marker.initial ∈ (p 0).2)
    48 root := fun v => v = 0 ∧ ∃ i, Marker.root ∈ (p i).2
    49 edge := (ExtremalContexts.normalPresentation
    50 ⟨False, {i | Marker.initial ∈ (p i.succ).2}⟩ (fun i => (p i).1)).edge
    51 direction_valid := (ExtremalContexts.normalPresentation
    52 ⟨False, {i | Marker.initial ∈ (p i.succ).2}⟩ (fun i => (p i).1)).direction_valid } }
    53 one_hole := (ExtremalContexts.normalContext
    54 ⟨False, {i | Marker.initial ∈ (p i.succ).2}⟩ (fun i => (p i).1)).one_hole
    55
    56def normalize {A : RankedSet} {k : ℕ} (p : Pieces A k) : Data A k :=
    57 ⟨⟨Marker.initial ∈ (p 0).2 ∨ ∃ i, Marker.root ∈ (p i).2,
    58 {i | Marker.initial ∈ (p i.succ).2}⟩, fun i => (p i).1⟩
    59
    60def canonical {A : RankedSet} {k : ℕ} (x : Data A k) : Pieces A k :=
    61 fun i => ⟨x.2 i, {m | match m with
    62 | .root => x.1.root
    63 | .initial => Fin.cases x.1.root (fun j => j ∈ x.1.loops) i}⟩
    64
    65def Accepted {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L)
    66 {k : ℕ} (p : Pieces (Carrier (Accepting L)) k) (a : Carrier (Accepting L) k) : Prop :=
    67 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug (context p) (atomic a)))
    68
    69def IsExtremal {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L)
    70 {k : ℕ} (p : Pieces (Carrier (Accepting L)) k) (a : Carrier (Accepting L) k) : Prop :=
    71 Accepted L E p a ∧ ∀ q b,
    72 (∀ i, PieceBelow (Accepting L) (q i) (p i)) → ClassBelow (Accepting L) b a →
    73 Accepted L E q b → q = p ∧ b = a
    74
    75def ExtremalElement {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L)
    76 {k : ℕ} (a : Carrier (Accepting L) k) : Prop := ∃ p, IsExtremal L E p a
    77
    78axiom normalize_canonical {A : RankedSet} {k : ℕ} (x : Data A k) :
    79 normalize (canonical x) = x
    80
    81axiom canonical_order {A : RankedSet} (F : ClosedProperty A) {k : ℕ}
    82 (x : Data (Carrier F) k) (p : Pieces (Carrier F) k) :
    83 (∀ i, PieceBelow F (canonical x i) (p i)) ↔
    84 FiniteExtremal.DataBelow F x (normalize p)
    85
    86axiom acceptance_normalize {A : RankedSet} (L : Algebras.Language A)
    87 (E : SyntacticAlgebra L) {k : ℕ} (p : Pieces (Carrier (Accepting L)) k)
    88 (a : Carrier (Accepting L) k) :
    89 Accepted L E p a ↔ FiniteExtremal.Accepts (Accepting L) E.algebra a (normalize p)
    90
    91axiom extremal_iff {A : RankedSet} (L : Algebras.Language A)
    92 (E : SyntacticAlgebra L) {k : ℕ} (p : Pieces (Carrier (Accepting L)) k)
    93 (a : Carrier (Accepting L) k) :
    94 IsExtremal L E p a ↔ canonical (normalize p) = p ∧
    95 ExtremalSituations.IsExtremal (Accepting L) E.algebra (normalize p, a)
    96
    97axiom element_iff {A : RankedSet} (L : Algebras.Language A)
    98 (E : SyntacticAlgebra L) {k : ℕ} (a : Carrier (Accepting L) k) :
    99 ExtremalElement L E a ↔ ExtremalSituations.ExtremalElement (Accepting L) E.algebra a
    100
    101axiom extremal_choice {A : RankedSet} (L : Algebras.Language A)
    102 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    103 (E : SyntacticAlgebra L) {k : ℕ} (p : Pieces (Carrier (Accepting L)) k)
    104 (a : Carrier (Accepting L) k) (ha : Accepted L E p a) :
    105 ∃ q b, IsExtremal L E q b ∧
    106 (∀ i, PieceBelow (Accepting L) (q i) (p i)) ∧ ClassBelow (Accepting L) b a
    107
    108axiom replacement {A : RankedSet} (L : Algebras.Language A)
    109 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    110 (E : SyntacticAlgebra L) {k : ℕ}
    111 (C : Context (Carrier (Accepting L)) k 0) (a : Carrier (Accepting L) k)
    112 (ha : AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic a)))) :
    113 ∃ b, ExtremalElement L E b ∧ ClassBelow (Accepting L) b a ∧
    114 AcceptingClass (Accepting L) (E.algebra.eval 0 (plug C (atomic b)))
    115
    116axiom simultaneous {A B : RankedSet} (L : Algebras.Language A)
    117 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    118 (E : SyntacticAlgebra L) (P : FiniteSystem B 0)
    119 (q : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1) :
    120 AcceptingClass (Accepting L) (E.algebra.eval 0 (withLabels P q)) ↔
    121 ∃ r : ∀ v : P.Vertex, Carrier (Accepting L) (P.graph.label v).1,
    122 (∀ v, ExtremalElement L E (r v) ∧ ClassBelow (Accepting L) (r v) (q v)) ∧
    123 AcceptingClass (Accepting L) (E.algebra.eval 0 (withLabels P r))
    124
    125axiom normal_test {A : RankedSet} (L : Algebras.Language A)
    126 (E : SyntacticAlgebra L) {k : ℕ}
    127 (p q : Pieces (Carrier (Accepting L)) k) (a : Carrier (Accepting L) k)
    128 (ha : IsExtremal L E p a) :
    129 Accepted L E q a ↔ ∀ i, PieceBelow (Accepting L) (p i) (q i)
    130
    131end Lax369799.ExtendedContexts
    132
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof

    Discussion

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

    Loading discussion…