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

Compressed transitions and their clone closure

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

    Lemma 108 compresses each block of directions by taking the meet of its unary labels, retains the compressed tuples occurring infinitely often, and closes them under uniform duplication. The closure is a clone table, and one threshold controls all compressed transition families appearing in a finite input system.

    Concept map
    60 concepts; 2 descendants hidden
    100%
    Algebraic decomposition with boundary dataAlgebras and recognitionDeterministic elements and the earlierreplacement propertyClone-automataBounded profiles refine finite contextualequivalenceCompressed transitions and their cloneclosureContext 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 presentationsFinite meets in a set-algebraAutomaton 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 presentationsMorphisms of unpruned finite presentationsUnary normal forms without pruningOrdered syntactic algebras of finitepresentationsFinite presentations without reachabilitypruningSmall profiles of finite presentationsEventual membership in finite familiesFinite 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 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 verticesSyntactic set-algebras and rankwise finitenessYield-syntactic order and quotientEvaluation and variable renaming inregular-tree algebrasRanked encodings of transition systemsFinite transition systems and bisimulationUnfold-automata and regular-tree acceptanceCompression of variable maps by finiteobservationsContinuity of yields in a context
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

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

    Lean source view on GitHub

    1import Lax369799.BisimAutomata
    2import Lax369799.FiniteRecurrence
    3import Lax369799.FiniteAlgebraMeets
    4import Mathlib.Logic.Equiv.Fin.Basic
    5
    6/-!
    7---
    8title: Compressed transitions and their clone closure
    9type: theorem
    10---
    11Lemma 108 compresses each block of directions by taking the meet of its
    12unary labels, retains the compressed tuples occurring infinitely often,
    13and closes them under uniform duplication. The closure is a clone table,
    14and one threshold controls all compressed transition families appearing
    15in a finite input system.
    16-/
    17
    18namespace Lax369799.CloneTransitions
    19open RankedSystems (RankedSet)
    20open SetSystemAlgebras BisimAutomata UnfoldAutomata TransitionEncoding
    21
    22def Closure {H : Type} (B : ∀ n, Set (Fin n → H)) (n : ℕ) : Set (Fin n → H) :=
    23 {b | ∃ p m, 0 < p ∧ 0 < m ∧ ∃ h : p * m = n,
    24 ∃ c ∈ B p, b = fun i => Duplicate c (Fin.cast h.symm i)}
    25
    26def compress {A : RankedSet} (E : SetAlgebra A) {n k : ℕ}
    27 (b : Fin (n * k) → A 1) : Fin n → A 1 :=
    28 fun i => FiniteAlgebraMeets.value E (fun j : Fin k => b (finProdFinEquiv (i, j)))
    29
    30def alpha {A : RankedSet} {V : Type} (E : SetAlgebra A)
    31 (T : V → ∀ n, Set (Fin (n + 1) → A 1)) (ν : V) (n k : ℕ) : Set (Fin n → A 1) :=
    32 {c | ∃ (l : ℕ) (h : n * k = l + 1) (b : Fin (l + 1) → A 1),
    33 b ∈ T ν l ∧ compress E (fun i => b (Fin.cast h i)) = c}
    34
    35def beta {A : RankedSet} {V : Type} (E : SetAlgebra A)
    36 (T : V → ∀ n, Set (Fin (n + 1) → A 1)) (ν : V) (n : ℕ) : Set (Fin n → A 1) :=
    37 FiniteRecurrence.Recurrent (alpha E T ν n)
    38
    39noncomputable def automaton {P H : Type} [Fintype H] {z : ℕ}
    40 (B : Set P → ∀ n, Set (Fin n → H)) (leaves : Set P → Set (Fin z))
    41 (D : WordCondition (Fintype.card H) z) : UnfoldAutomaton (TransitionAlphabet P) where
    42 unary := Fintype.card H
    43 nullary := z
    44 transition := fun n ν => {b | (fun i => (Fintype.equivFin H).symm (b i)) ∈ Closure (B ν) (n + 1)}
    45 leafTransition := leaves
    46 condition := D
    47
    48axiom closure_closed {H : Type} (B : ∀ n, Set (Fin n → H)) {n m : ℕ}
    49 (b : Fin n → H) (hb : b ∈ Closure B n) (hm : 0 < m) : Duplicate b ∈ Closure B (n * m)
    50
    51axiom component {A : RankedSet} (E : SetAlgebra A) {n k : ℕ}
    52 (b : Fin (n * k) → A 1) (i : Fin n) (j : Fin k) :
    53 Below E (compress E b i) (b (finProdFinEquiv (i, j)))
    54
    55axiom stabilizes {A : RankedSet} {V : Type} (E : SetAlgebra A) [Finite (A 1)]
    56 (T : V → ∀ n, Set (Fin (n + 1) → A 1)) (ν : V) (n : ℕ) :
    57 ∃ N, ∀ k, N ≤ k → alpha E T ν n k ⊆ beta E T ν n
    58
    59axiom uniform_stabilization {A : RankedSet} {V I : Type} (E : SetAlgebra A)
    60 [Finite (A 1)] [Finite I] (T : V → ∀ n, Set (Fin (n + 1) → A 1))
    61 (ν : I → V) (arity : I → ℕ) :
    62 ∃ N, ∀ i k, N ≤ k → alpha E T (ν i) (arity i) k ⊆ beta E T (ν i) (arity i)
    63
    64axiom clone_automaton {P H : Type} [Fintype H] {z : ℕ}
    65 (B : Set P → ∀ n, Set (Fin n → H)) (leaves : Set P → Set (Fin z))
    66 (D : WordCondition (Fintype.card H) z) : IsBisimAutomaton (automaton B leaves D)
    67
    68axiom refinement {A : RankedSet} {V : Type} (E : SetAlgebra A)
    69 (T : V → ∀ n, Set (Fin (n + 1) → A 1)) (ν : V) {n : ℕ}
    70 (b : Fin n → A 1) (hb : b ∈ Closure (beta E T ν) n) :
    71 ∃ (l : ℕ) (c : Fin (l + 1) → A 1), c ∈ T ν l ∧
    72 ∃ σ : Fin (l + 1) → Fin n, Function.Surjective σ ∧
    73 ∀ i, Below E (b (σ i)) (c i)
    74
    75end Lax369799.CloneTransitions
    76
    Show 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…