Bisimulation-invariant MSO on finite graphs
Lax369799.FiniteBisimulationTheorem · concepts/Lax369799/FiniteBisimulationTheorem.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For a finite set of proposition letters, a property of finite reachable transition systems is MSO-definable and bisimulation-invariant if and only if it is definable in the modal mu-calculus. This is the main theorem of Colcombet, Doumane and Kuperberg, revised local manuscript of 13 November 2026. Invariance is required only between finite systems.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 effective_finite_bisimulation_invariant_mso proven
2 finite_bisimulation_invariant_mso proven
Lean source view on GitHub
| 1 | import Lax369799.EffectiveFiniteTranslation |
| 2 | import Lax369799.MonadicSecondOrder |
| 3 | import Lax369799.ModalMuCalculus |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Bisimulation-invariant MSO on finite graphs |
| 8 | type: theorem |
| 9 | --- |
| 10 | For a finite set of proposition letters, a property of finite reachable |
| 11 | transition systems is MSO-definable and bisimulation-invariant if and only |
| 12 | if it is definable in the modal mu-calculus. This is the main theorem |
| 13 | `theorem:bisim-invariant-finite` of Colcombet, Doumane and Kuperberg, |
| 14 | revised local manuscript of 13 November 2026. Invariance is required only between finite systems. |
| 15 | -/ |
| 16 | |
| 17 | namespace Lax369799.FiniteBisimulationTheorem |
| 18 | open TransitionSystems |
| 19 | |
| 20 | axiom finite_bisimulation_invariant_mso {P : Type} [Finite P] |
| 21 | (L : Set (TransitionSystem P)) : |
| 22 | (MonadicSecondOrder.Definable L ∧ BisimulationInvariant L) ↔ |
| 23 | ModalMuCalculus.Definable L |
| 24 | |
| 25 | /-- A total executable translation, correct under the finite-invariance promise. -/ |
| 26 | axiom effective_finite_bisimulation_invariant_mso {P : Type} |
| 27 | [Fintype P] [Encodable P] [DecidableEq P] |
| 28 | (φ : MonadicSecondOrder.Sentence P) |
| 29 | (hφ : BisimulationInvariant {S | MonadicSecondOrder.Models S φ}) : |
| 30 | ∀ S : TransitionSystem P, MonadicSecondOrder.Models S φ ↔ |
| 31 | ModalMuCalculus.Models S (EffectiveFiniteTranslation.compile φ) |
| 32 | |
| 33 | end Lax369799.FiniteBisimulationTheorem |
| 34 |
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments