Transition tables for the algebra with expanded continuity
Lax369799.ExpandedTransitions · concepts/Lax369799/ExpandedTransitions.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The split extremal construction supplies parallel transitions in accepting contexts, after rank-one refinement of every component. Legal transitions require these selected unary types, which preserve binary choices of closed continuations. A run assigns their values to the input vertices. Pointwise comparison then transfers acceptance of that evaluated run to the input. Every accepted input also admits a legal run with an accepted evaluated value. The separate implication from a word condition to acceptance of the run value is not assumed here.
Concept map
Evidence
This concept declares 5 statements. Each proof establishes one of them relative to its assumptions.
1 accepting_transition proven
2 edge_preserves_choices proven
3 evaluated_run_exists proven
4 evaluated_run_sound proven
5 run_label_below proven
Lean source view on GitHub
Used by
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments