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

Algebraic transition tables for unfold-automata

Lax369799.AlgebraicTransitions · concepts/Lax369799/AlgebraicTransitions.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 and nullary algebra elements serve as edge and leaf types. A positive-arity transition is allowed precisely when the parallel unary value lies below the letter value. The automaton property and unary normal form give an allowed transition preserving acceptance in each accepting context. The word condition is supplied separately.

    Concept map
    11 concepts; 6 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.DeterministicElements
    2import Lax369799.UnfoldAutomata
    3
    4/-!
    5---
    6title: Algebraic transition tables for unfold-automata
    7type: theorem
    8---
    9Unary and nullary algebra elements serve as edge and leaf types. A
    10positive-arity transition is allowed precisely when the parallel unary
    11value lies below the letter value. The automaton property and unary
    12normal form give an allowed transition preserving acceptance in each
    13accepting context. The word condition is supplied separately.
    14-/
    15namespace Lax369799.AlgebraicTransitions
    16open RankedSystems SetAlgebras AutomatonProperty UnfoldAutomata
    17
    18noncomputable def decodeTypes {B : RankedSet} [Fintype (B 1)] {n : ℕ}
    19 (b : Fin n → Fin (Fintype.card (B 1))) : Fin n → B 1 :=
    20 fun i => (Fintype.equivFin (B 1)).symm (b i)
    21
    22noncomputable def automaton {A B : RankedSet} [Fintype (B 1)] [Fintype (B 0)]
    23 (E : SetAlgebra B) (η : RankedMap A B)
    24 (D : WordCondition (Fintype.card (B 1)) (Fintype.card (B 0))) : UnfoldAutomaton A where
    25 unary := Fintype.card (B 1)
    26 nullary := Fintype.card (B 0)
    27 transition := fun n a => {b | Below E
    28 (E.eval (n + 1) (DeterministicElements.parallel (decodeTypes b))) (η (n + 1) a)}
    29 leafTransition := fun a => {(Fintype.equivFin (B 0)) (η 0 a)}
    30 condition := D
    31
    32axiom accepting_transition {A B : RankedSet} [Fintype (B 1)] [Fintype (B 0)]
    33 (E : SetAlgebra B) (f : B 0) (hE : HasAutomatonProperty E f) (η : RankedMap A B)
    34 (D : WordCondition (Fintype.card (B 1)) (Fintype.card (B 0)))
    35 (n : ℕ) (a : A (n + 1)) (C : Flattening.SetContext B (n + 1) 0)
    36 (h : Below E f (E.eval 0 (Flattening.plug C (atomic (η (n + 1) a))))) :
    37 ∃ b ∈ (automaton E η D).transition n a,
    38 Below E f (E.eval 0 (Flattening.plug C
    39 (atomic (E.eval (n + 1) (DeterministicElements.parallel (decodeTypes b))))))
    40
    41end Lax369799.AlgebraicTransitions
    42
    Show Proof

    Discussion

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

    Loading discussion…