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

Direction projections of extremal elements

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

    In Section 5.3 the ith direction of a rank-k element is evaluated by retaining only its edge to the ith variable and renaming that variable to the single output. Extremal elements of positive rank equal the parallel family of their direction projections (Lemma 92), and each projection is itself an extremal unary element (Lemma 93).

    Concept map
    61 concepts; 1 descendant 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 deterministiccontextsDirection projections of extremal elementsContinuity 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 5 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.ExtendedContexts
    2
    3/-!
    4---
    5title: Direction projections of extremal elements
    6type: theorem
    7---
    8In Section 5.3 the ith direction of a rank-k element is evaluated by
    9retaining only its edge to the ith variable and renaming that variable
    10to the single output. Extremal elements of positive rank equal the
    11parallel family of their direction projections (Lemma 92), and each
    12projection is itself an extremal unary element (Lemma 93).
    13-/
    14
    15namespace Lax369799.DirectionProjections
    16open RankedSystems (RankedSet)
    17open FinitePresentations FiniteContextualOrder FiniteSyntacticAlgebra FiniteAcceptance
    18open ExpandedSyntacticAlgebra
    19
    20def projection {A : RankedSet} {k : ℕ} (a : A k) (i : Fin k) : FiniteSystem A 1 where
    21 size := 1
    22 graph := {
    23 label := fun _ => ⟨k, a⟩
    24 initial := Set.univ
    25 root := ∅
    26 edge := fun _ d t => d = i.val ∧ t = .inr 0
    27 direction_valid := by rintro _ d t ⟨rfl, _⟩; exact i.isLt }
    28
    29def direction {A : RankedSet} (E : Algebra A) {k : ℕ} (a : A k) (i : Fin k) : A 1 :=
    30 E.eval 1 (projection a i)
    31
    32def parallel {A : RankedSet} {k : ℕ} (b : Fin k → A 1) : FiniteSystem A k :=
    33 ofSetSystem (DeterministicElements.parallel b)
    34
    35axiom monotone {A : RankedSet} (L : Algebras.Language A)
    36 (E : SyntacticAlgebra L) {k : ℕ} (a b : Carrier (Accepting L) k)
    37 (hab : ClassBelow (Accepting L) a b) (i : Fin k) :
    38 ClassBelow (Accepting L) (direction E.algebra a i) (direction E.algebra b i)
    39
    40axiom reconstruction_bound {A : RankedSet} (L : Algebras.Language A)
    41 (E : SyntacticAlgebra L) {k : ℕ} (a : Carrier (Accepting L) k) :
    42 ClassBelow (Accepting L) a (E.algebra.eval k (parallel (direction E.algebra a)))
    43
    44axiom parallel_projection_bound {A : RankedSet} (L : Algebras.Language A)
    45 (E : SyntacticAlgebra L) {k : ℕ} (b : Fin k → Carrier (Accepting L) 1) (i : Fin k) :
    46 ClassBelow (Accepting L) (direction E.algebra (E.algebra.eval k (parallel b)) i) (b i)
    47
    48axiom extremal_decomposition {A : RankedSet} (L : Algebras.Language A)
    49 (E : SyntacticAlgebra L) {k : ℕ} (hk : 1 ≤ k) (a : Carrier (Accepting L) k)
    50 (ha : ExtendedContexts.ExtremalElement L E a) :
    51 E.algebra.eval k (parallel (direction E.algebra a)) = a
    52
    53axiom extremal_direction {A : RankedSet} (L : Algebras.Language A)
    54 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    55 (E : SyntacticAlgebra L) {k : ℕ} (a : Carrier (Accepting L) k)
    56 (ha : ExtendedContexts.ExtremalElement L E a) (i : Fin k) :
    57 ExtendedContexts.ExtremalElement L E (direction E.algebra a i)
    58
    59end Lax369799.DirectionProjections
    60
    Show ProofShow ProofShow ProofShow ProofShow Proof
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…