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

Monotonicity of algebraic branch conditions

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

    Unary application and finite branch evaluation are monotone. For a finite unary sort, increasing every letter of an accepted infinite word also preserves acceptance. A common subsequence of factorization cuts compares the accepting linked pairs. These comparisons underlie the rerouting construction of Lemma 108.

    Concept map
    64 concepts; 1 descendant hidden
    100%
    Algebraic decomposition with boundary dataThe algebraic condition on infinite branchwordsAlgebras and recognitionDeterministic elements and the earlierreplacement propertyBounded profiles refine finite contextualequivalenceMonotonicity of algebraic branch conditionsContext decomposition with hole boundarydataRelabelling and deterministic contextsubstitutionFinite resolution approximation in a contextSmallification preserving identitycontinuationsDeterministic normal forms with identitycontinuationsUnary continuations of deterministiccontextsContinuity through expanded representativesSyntactic algebras with expanded continuityPlanted normal contexts and deterministicwitnessesYield acceptance of finite presentationsAutomaton property of the unprunedsyntactic algebraFinite-state evaluation of terminating branchwordsContexts over finite presentationsContextual preorders on finite presentationsFinite yield approximation of contextualacceptance and orderContext decomposition without pruningExtremal unary data for finite presentationsMorphisms 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 finitepresentationsYield continuity for finite-presentationcontextsFinite sums are contextual meetsFlattening and contextsFlattening, resolutions, and yield congruenceInfinite Ramsey theorem for pairsFinite support for initial observationsMorphisms, unfoldings, and yieldsBounded profiles in root-free substitutionpatternsDeterminization of infinite-word automataRegular infinite products of linked pairsBounded 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 observationsStable factorization with recurrent verticesThe earlier continuity-bearing set-algebrainterfaceSet-algebras with retained verticesSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasThe unary semigroup and its actionStable factorization of algebraic branchwordsUnfold-automata and regular-tree acceptanceCompression of variable maps by finiteobservationsIdempotent factorization of infinite wordsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.SetSystemAlgebras
    2import Lax369799.AlgebraicOmegaWords
    3
    4/-!
    5---
    6title: Monotonicity of algebraic branch conditions
    7type: theorem
    8---
    9Unary application and finite branch evaluation are monotone. For a finite
    10unary sort, increasing every letter of an accepted infinite word also
    11preserves acceptance. A common subsequence of factorization cuts compares
    12the accepting linked pairs. These comparisons underlie the rerouting
    13construction of Lemma 108.
    14-/
    15namespace Lax369799.BranchMonotonicity
    16open RankedSystems (RankedSet)
    17open FinitePresentations SetSystemAlgebras UnaryComposition UnaryFactorization
    18
    19def ConditionMonotone {A : RankedSet} (E : SetAlgebra A)
    20 [Fintype (A 1)] [Fintype (A 0)]
    21 (D : UnfoldAutomata.WordCondition (Fintype.card (A 1)) (Fintype.card (A 0))) : Prop :=
    22 (∀ w v a b, List.Forall₂ (fun x y => Below E
    23 ((Fintype.equivFin (A 1)).symm x) ((Fintype.equivFin (A 1)).symm y)) w v →
    24 Below E ((Fintype.equivFin (A 0)).symm a) ((Fintype.equivFin (A 0)).symm b) →
    25 D.AcceptsFinite w a → D.AcceptsFinite v b) ∧
    26 (∀ w v, (∀ i, Below E ((Fintype.equivFin (A 1)).symm (w i))
    27 ((Fintype.equivFin (A 1)).symm (v i))) →
    28 D.AcceptsInfinite w → D.AcceptsInfinite v)
    29
    30axiom condition {A : RankedSet} (E : SetAlgebra A) [Fintype (A 1)] [Fintype (A 0)]
    31 (F : Set (A 0)) (hF : ∀ a b, a ∈ F → Below E a b → b ∈ F)
    32 (D : UnfoldAutomata.WordCondition (Fintype.card (A 1)) (Fintype.card (A 0)))
    33 (hD : (∀ w a, D.AcceptsFinite w a ↔
    34 FiniteBranchWords.value E.toAlgebra (w.map (Fintype.equivFin (A 1)).symm)
    35 ((Fintype.equivFin (A 0)).symm a) ∈ F) ∧
    36 (∀ w, D.AcceptsInfinite w ↔ AlgebraicOmegaWords.Accepts E.toAlgebra F
    37 (fun n => (Fintype.equivFin (A 1)).symm (w n)))) : ConditionMonotone E D
    38
    39axiom act_mono {A : RankedSet} (E : SetAlgebra A) {n : ℕ}
    40 {a a' : A 1} {b b' : A n} (ha : Below E a a') (hb : Below E b b') :
    41 Below E (act E.toAlgebra a b) (act E.toAlgebra a' b')
    42
    43axiom product_mono {A : RankedSet} (E : SetAlgebra A)
    44 {a a' b b' : A 1} (ha : Below E a a') (hb : Below E b b') :
    45 Below E (product E.toAlgebra a b) (product E.toAlgebra a' b')
    46
    47axiom block_mono {A : RankedSet} (E : SetAlgebra A)
    48 (w v : ℕ → A 1) (h : ∀ i, Below E (w i) (v i)) (i j : ℕ) :
    49 Below E (block E.toAlgebra w i j) (block E.toAlgebra v i j)
    50
    51axiom finite_mono {A : RankedSet} (E : SetAlgebra A)
    52 {w v : List (A 1)} (h : List.Forall₂ (Below E) w v)
    53 {a b : A 0} (hab : Below E a b) :
    54 Below E (FiniteBranchWords.value E.toAlgebra w a)
    55 (FiniteBranchWords.value E.toAlgebra v b)
    56
    57axiom block_append {A : RankedSet} (E : FiniteSyntacticAlgebra.Algebra A)
    58 (w : ℕ → A 1) {i j k : ℕ} (hij : i < j) (hjk : j < k) :
    59 block E w i k = product E (block E w i j) (block E w j k)
    60
    61axiom lasso_mono {A : RankedSet} (E : SetAlgebra A)
    62 {a a' e e' : A 1} (ha : Below E a a') (he : Below E e e') :
    63 Below E (E.eval 0 (lasso a e)) (E.eval 0 (lasso a' e'))
    64
    65axiom infinite_mono {A : RankedSet} (E : SetAlgebra A) [Finite (A 1)]
    66 (F : Set (A 0)) (hF : ∀ a b, a ∈ F → Below E a b → b ∈ F)
    67 (w v : ℕ → A 1) (h : ∀ i, Below E (w i) (v i))
    68 (hw : AlgebraicOmegaWords.Accepts E.toAlgebra F w) :
    69 AlgebraicOmegaWords.Accepts E.toAlgebra F v
    70
    71end Lax369799.BranchMonotonicity
    72
    Show 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…