Contextual equivalence of deterministic systems
Lax369799.DeterministicSyntacticOrder · concepts/Lax369799/DeterministicSyntacticOrder.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Two systems are equivalent when every closed deterministic context gives the same language-membership test. Recognition by a rankwise-finite algebra makes this quotient rankwise finite, without requiring the recognizing algebra itself to be unfolding-invariant. For an unfolding-invariant language, equivalent unfoldings have the same contextual class.
Concept map
Evidence
This concept declares 5 statements. Each proof establishes one of them relative to its assumptions.
1 accepting_class proven
2 closed_membership proven
3 finite_carrier proven
4 unfold_refines proven
5 value_refines proven
Lean source view on GitHub
| 1 | import Lax369799.ContextRelabelling |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Contextual equivalence of deterministic systems |
| 6 | type: theorem |
| 7 | --- |
| 8 | Two systems are equivalent when every closed deterministic context gives |
| 9 | the same language-membership test. Recognition by a rankwise-finite algebra |
| 10 | makes this quotient rankwise finite, without requiring the recognizing |
| 11 | algebra itself to be unfolding-invariant. For an unfolding-invariant |
| 12 | language, equivalent unfoldings have the same contextual class. |
| 13 | -/ |
| 14 | namespace Lax369799.DeterministicSyntacticOrder |
| 15 | open RankedSystems Flattening Algebras Morphisms |
| 16 | |
| 17 | def Test {A : RankedSet} (L : Language A) {n : ℕ} (C : Context A n 0) (S : System A n) : Prop := |
| 18 | ∃ U : System A 0, U.val = plug C.val S.val ∧ U ∈ L |
| 19 | |
| 20 | def Equivalent {A : RankedSet} (L : Language A) {n : ℕ} (S T : System A n) : Prop := |
| 21 | ∀ C : Context A n 0, Test L C S ↔ Test L C T |
| 22 | |
| 23 | abbrev Carrier {A : RankedSet} (L : Language A) : RankedSet := fun n => Quot (@Equivalent A L n) |
| 24 | |
| 25 | axiom value_refines {A B : RankedSet} (E : Algebra B) (η : RankedMap A B) |
| 26 | (F : Set (B 0)) (L : Language A) (hL : Recognizes E η F L) |
| 27 | {n : ℕ} (S T : System A n) |
| 28 | (h : E.eval n (relabelSystem η S) = E.eval n (relabelSystem η T)) : Equivalent L S T |
| 29 | |
| 30 | axiom unfold_refines {A : RankedSet} (L : Language A) (hL : UnfoldInvariantLanguage L) |
| 31 | {n : ℕ} (S T : System A n) (h : UnfoldEquivalent S.val T.val) : Equivalent L S T |
| 32 | |
| 33 | def AcceptingClass {A : RankedSet} (L : Language A) (a : Carrier L 0) : Prop := |
| 34 | ∃ S : System A 0, Quot.mk _ S = a ∧ S ∈ L |
| 35 | |
| 36 | axiom closed_membership {A : RankedSet} (L : Language A) (hL : UnfoldInvariantLanguage L) |
| 37 | (S T : System A 0) (h : Equivalent L S T) : S ∈ L ↔ T ∈ L |
| 38 | |
| 39 | axiom accepting_class {A : RankedSet} (L : Language A) (hL : UnfoldInvariantLanguage L) |
| 40 | (S : System A 0) : AcceptingClass L (Quot.mk _ S) ↔ S ∈ L |
| 41 | |
| 42 | axiom finite_carrier {A : RankedSet} (L : Language A) (hL : Recognizable L) : RankwiseFinite (Carrier L) |
| 43 | |
| 44 | end Lax369799.DeterministicSyntacticOrder |
| 45 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments