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

The path criterion and the automaton property

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

    A regular branch is a closed unary/nullary system admitting a morphism into the tested set-system. Lemma 95 says that a root-free set-system with all vertices initially reachable and with no blocked unary vertex is accepted exactly when all its regular branches are accepted, provided its unary labels are extremal. Together with canonical direction decomposition this is Definition 90. Corollary 96 establishes both conditions for the rankwise-finite yield-syntactic set-algebra.

    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 deterministiccontextsDirection projections of extremal elementsContinuity through expanded representativesSyntactic algebras with expanded continuityFormal unary pieces and extremal acceptedsituationsPlanted normal contexts and deterministicwitnessesThe path criterion and the automatonpropertyExtremal 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 3 statements. Each proof establishes one of them relative to its assumptions.

    2 selected_path_criterion proven

    3 syntactic_automaton_property proven

    Lean source view on GitHub

    1import Lax369799.DirectionProjections
    2
    3/-!
    4---
    5title: The path criterion and the automaton property
    6type: theorem
    7---
    8A regular branch is a closed unary/nullary system admitting a morphism
    9into the tested set-system. Lemma 95 says that a root-free set-system
    10with all vertices initially reachable and with no blocked unary vertex
    11is accepted exactly when all its regular branches are accepted, provided
    12its unary labels are extremal. Together with canonical direction
    13decomposition this is Definition 90. Corollary 96 establishes both
    14conditions for the rankwise-finite yield-syntactic set-algebra.
    15-/
    16
    17namespace Lax369799.ExtremalPaths
    18open RankedSystems (RankedSet System)
    19open FinitePresentations FiniteContextualOrder FiniteSyntacticAlgebra FiniteAcceptance
    20open ExpandedSyntacticAlgebra
    21
    22def Unary {A : RankedSet} (P : FiniteSystem A 0) : Prop :=
    23 ∀ v, (P.graph.label v).1 ≤ 1
    24
    25def RegularBranch {A : RankedSet} (G : FiniteSystem A 0) (B : System A 0) : Prop :=
    26 Unary (ofSetSystem B.val) ∧ Nonempty (FiniteMorphisms.Morphism (ofSetSystem B.val) G)
    27
    28def HasAutomatonProperty {A : RankedSet} (L : Algebras.Language A) (E : SyntacticAlgebra L) : Prop :=
    29 (∀ k (_hk : 1 ≤ k) (a : Carrier (Accepting L) k), ExtendedContexts.ExtremalElement L E a →
    30 E.algebra.eval k (DirectionProjections.parallel (DirectionProjections.direction E.algebra a)) = a ∧
    31 ∀ i, ExtendedContexts.ExtremalElement L E (DirectionProjections.direction E.algebra a i)) ∧
    32 (∀ G : FiniteSystem (Carrier (Accepting L)) 0, Unary G → G.graph.root = ∅ → Reachable G →
    33 (∀ v, (G.graph.label v).1 = 1 → ∃ w, G.graph.edge v 0 (.inl w)) →
    34 (∀ v (h : (G.graph.label v).1 = 1),
    35 ExtendedContexts.ExtremalElement L E (h ▸ (G.graph.label v).2)) →
    36 (AcceptingClass (Accepting L) (E.algebra.eval 0 G) ↔
    37 ∀ B, RegularBranch G B → AcceptingClass (Accepting L) (E.algebra.eval 0 (ofSetSystem B.val))))
    38
    39axiom path_criterion {A : RankedSet} (L : Algebras.Language A)
    40 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    41 (E : SyntacticAlgebra L) (G : FiniteSystem (Carrier (Accepting L)) 0)
    42 (hu : Unary G) (hr : G.graph.root = ∅) (hreach : Reachable G)
    43 (ht : ∀ v, (G.graph.label v).1 = 1 → ∃ w, G.graph.edge v 0 (.inl w))
    44 (hs : ∀ v (h : (G.graph.label v).1 = 1),
    45 ExtendedContexts.ExtremalElement L E (h ▸ (G.graph.label v).2)) :
    46 AcceptingClass (Accepting L) (E.algebra.eval 0 G) ↔
    47 ∀ B : System (Carrier (Accepting L)) 0, Unary (ofSetSystem B.val) →
    48 Nonempty (FiniteMorphisms.Morphism (ofSetSystem B.val) G) →
    49 AcceptingClass (Accepting L) (E.algebra.eval 0 (ofSetSystem B.val))
    50
    51axiom selected_path_criterion {A : RankedSet} (L : Algebras.Language A)
    52 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    53 (E : SyntacticAlgebra L) (G : FiniteSystem (Carrier (Accepting L)) 0)
    54 (hu : Unary G) (hr : G.graph.root = ∅) (hreach : Reachable G)
    55 (ht : ∀ v, (G.graph.label v).1 = 1 → ∃ w, G.graph.edge v 0 (.inl w))
    56 (hs : ∀ v (h : (G.graph.label v).1 = 1),
    57 ExtremalUnaryTypes.Selected L E (h ▸ (G.graph.label v).2)) :
    58 AcceptingClass (Accepting L) (E.algebra.eval 0 G) ↔
    59 ∀ B : System (Carrier (Accepting L)) 0, Unary (ofSetSystem B.val) →
    60 Nonempty (FiniteMorphisms.Morphism (ofSetSystem B.val) G) →
    61 AcceptingClass (Accepting L) (E.algebra.eval 0 (ofSetSystem B.val))
    62
    63axiom syntactic_automaton_property {A : RankedSet} (L : Algebras.Language A)
    64 (hL : Algebras.UnfoldInvariantLanguage L) (hrec : Algebras.Recognizable L)
    65 (E : SyntacticAlgebra L) : HasAutomatonProperty L E
    66
    67end Lax369799.ExtremalPaths
    68
    Show 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…