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

Extended set-algebras and extremal accepted situations

Lax369799.ExtendedSetAlgebras · concepts/Lax369799/ExtendedSetAlgebras.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 formal unary pieces of Definition 65 consist of an ordinary unary value and a set of immediate initial/root markers. Their order compares ordinary values and reverses marker inclusion. Expanding such pieces in a closed context and then evaluating agrees with evaluating their ordinary parts first (Lemma 66). Context evaluation is monotone (Lemma 86), and finite minimality supplies extremal accepted situations (Lemma 87). These constructions apply to arbitrary set-algebras.

    Concept map
    62 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 continuityFormal unary pieces and extremal acceptedsituationsExtended set-algebras 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-algebrainterfaceSet-algebras with retained verticesExtremal 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.ExtendedContexts
    2import Lax369799.SetSystemAlgebras
    3import Lax369799.FiniteLocalReplacement
    4
    5/-!
    6---
    7title: Extended set-algebras and extremal accepted situations
    8type: theorem
    9---
    10The formal unary pieces of Definition 65 consist of an ordinary unary
    11value and a set of immediate initial/root markers. Their order compares
    12ordinary values and reverses marker inclusion. Expanding such pieces in
    13a closed context and then evaluating agrees with evaluating their ordinary
    14parts first (Lemma 66). Context evaluation is monotone (Lemma 86), and
    15finite minimality supplies extremal accepted situations (Lemma 87).
    16These constructions apply to arbitrary set-algebras.
    17-/
    18
    19namespace Lax369799.ExtendedSetAlgebras
    20open RankedSystems (RankedSet)
    21open FinitePresentations FiniteContexts
    22open SetSystemAlgebras
    23open ExtendedContexts (Piece Pieces Marker)
    24
    25def PieceBelow {A : RankedSet} (E : SetAlgebra A) (p q : Piece A) : Prop :=
    26 Below E p.1 q.1 ∧ q.2 ⊆ p.2
    27
    28def evaluatePieces {A : RankedSet} (E : SetAlgebra A) {k : ℕ}
    29 (p : Pieces (FiniteSystem A) k) : Pieces A k :=
    30 fun i => ⟨E.eval 1 (p i).1, (p i).2⟩
    31
    32noncomputable def expansion {A : RankedSet} {k : ℕ}
    33 (p : Pieces (FiniteSystem A) k) (a : A k) : FiniteSystem A 0 :=
    34 flatten (relabel (fun _r u => match u with
    35 | .inl s => s
    36 | .inr ⟨h⟩ => h ▸ atomic a) (ExtendedContexts.context p).system)
    37
    38noncomputable def value {A : RankedSet} (E : SetAlgebra A) {k : ℕ}
    39 (p : Pieces A k) (a : A k) : A 0 :=
    40 E.eval 0 (plug (ExtendedContexts.context p) (atomic a))
    41
    42def Accepted {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) {k : ℕ}
    43 (p : Pieces A k) (a : A k) : Prop := value E p a ∈ F
    44
    45def IsExtremal {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) {k : ℕ}
    46 (p : Pieces A k) (a : A k) : Prop :=
    47 Accepted E F p a ∧ ∀ q b, (∀ i, PieceBelow E (q i) (p i)) → Below E b a →
    48 Accepted E F q b → q = p ∧ b = a
    49
    50def ExtremalElement {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) {k : ℕ}
    51 (a : A k) : Prop := ∃ p, IsExtremal E F p a
    52
    53def UpwardClosed {A : RankedSet} (E : SetAlgebra A) (F : Set (A 0)) : Prop :=
    54 ∀ a b, a ∈ F → Below E a b → b ∈ F
    55
    56axiom pieces_evaluation {A : RankedSet} (E : SetAlgebra A) {k : ℕ}
    57 (p : Pieces (FiniteSystem A) k) (a : A k) :
    58 E.eval 0 (expansion p a) = value E (evaluatePieces E p) a
    59
    60axiom context_monotone {A : RankedSet} (E : SetAlgebra A) {k : ℕ}
    61 (p q : Pieces A k) (hpq : ∀ i, PieceBelow E (p i) (q i))
    62 (a b : A k) (hab : Below E a b) : Below E (value E p a) (value E q b)
    63
    64axiom extremal_choice {A : RankedSet} (E : SetAlgebra A) (hA : RankedSystems.RankwiseFinite A)
    65 (F : Set (A 0)) {k : ℕ} (p : Pieces A k) (a : A k) (ha : Accepted E F p a) :
    66 ∃ q b, IsExtremal E F q b ∧ (∀ i, PieceBelow E (q i) (p i)) ∧ Below E b a
    67
    68axiom replacement {A : RankedSet} (E : SetAlgebra A) (hA : RankedSystems.RankwiseFinite A)
    69 (F : Set (A 0)) (hF : UpwardClosed E F) {k : ℕ}
    70 (C : Context A k 0) (a : A k) (ha : E.eval 0 (plug C (atomic a)) ∈ F) :
    71 ∃ b, ExtremalElement E F b ∧ Below E b a ∧ E.eval 0 (plug C (atomic b)) ∈ F
    72
    73axiom simultaneous {A B : RankedSet} (E : SetAlgebra A) (hA : RankedSystems.RankwiseFinite A)
    74 (F : Set (A 0)) (hF : UpwardClosed E F) (P : FiniteSystem B 0)
    75 (q : ∀ v : P.Vertex, A (P.graph.label v).1) :
    76 E.eval 0 (withLabels P q) ∈ F ↔
    77 ∃ r : ∀ v : P.Vertex, A (P.graph.label v).1,
    78 (∀ v, ExtremalElement E F (r v) ∧ Below E (r v) (q v)) ∧
    79 E.eval 0 (withLabels P r) ∈ F
    80
    81end Lax369799.ExtendedSetAlgebras
    82
    Show 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…