Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 10.1, p. 223 — π is a projection 𝒮⁰ → 𝒮 with X⁰_m := π⁻¹(X_m), φ⁰ := φ∘π

Proved
RamadgeWonham.Quotient.thm_10_1_pi_projection

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrete-event-systemsp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1supervisory-control

Under the hypotheses of Theorem 10.1 (G\mathcal GG trim over a finite Σ\SigmaΣ; S=(S,ϕ)\mathcal S = (S, \phi)S=(S,ϕ) complete with SSS accessible, K3K_3K3​-reduced and K3K_3K3​-trim, where K3=L(S/G)K_3 = L(\mathcal S/\mathcal G)K3​=L(S/G); S^0=(X0,Σ,ξ0,x00,X0)\hat S^0 = (X^0, \Sigma, \xi^0, x^0_0, X^0)S^0=(X0,Σ,ξ0,x00​,X0) a trim recognizer for K3K_3K3​), there is a map π:X0→X\pi : X^0 \to Xπ:X0→X with

π(ξ0(s,x00))=ξ(s,x0)for all s∈K3,\pi\big(\xi^0(s, x^0_0)\big) = \xi(s, x_0) \qquad \text{for all } s \in K_3,π(ξ0(s,x00​))=ξ(s,x0​)for all s∈K3​,

and, with Xm0:=π−1(Xm)X^0_m := \pi^{-1}(X_m)Xm0​:=π−1(Xm​) and ϕ0:=ϕ∘π\phi^0 := \phi \circ \piϕ0:=ϕ∘π, π\piπ is a projection from S0=(S0,ϕ0)\mathcal S^0 = (S^0, \phi^0)S0=(S0,ϕ0), S0=(X0,Σ,ξ0,x00,Xm0)S^0 = (X^0, \Sigma, \xi^0, x^0_0, X^0_m)S0=(X0,Σ,ξ0,x00​,Xm0​), to S\mathcal SS.

This is part (ii) of the quotient structure theorem, and it fixes the marker set and feedback map of S0\mathcal S^0S0.

Preamble
import Mathlib
import Definitions.Def_RamadgeWonham_Quotient_Projection
import Definitions.Def_RamadgeWonham_Quotient_Reduced
import Definitions.Def_RamadgeWonham_Quotient_Recognizer
Formal statement
namespace RamadgeWonham.Quotient

open Shared.Generator

/-- Proof of Theorem 10.1 (p. 223, third paragraph): there is a map `π : X⁰ → X` with
`π(ξ⁰(s, x⁰₀)) = ξ(s, x₀)` for every `s ∈ K₃`, and with `X⁰_m := π⁻¹(X_m)` and `φ⁰ := φ ∘ π` it is a
projection `π : 𝒮⁰ → 𝒮`. -/
theorem thm_10_1_pi_projection
    {α : Type} [Fintype α] {Ec : Set α} (𝒢 : Shared.Generator α) (h𝒢 : 𝒢.L = Shared.pre 𝒢.Lm)
    (𝒮 : Shared.Supervisor α Ec) (h𝒮acc : 𝒮.S.Accessible) (h𝒮 : Shared.Complete 𝒢 𝒮)
    (hred : KReduced 𝒮.S (Shared.Lsup 𝒢 𝒮)) (htrim : KTrim 𝒮.S (Shared.Lsup 𝒢 𝒮))
    (R : Shared.Generator α) (hRrec : IsRecognizer R (Shared.Lsup 𝒢 𝒮)) (hRtrim : R.IsTrim)
    (hRQm : R.Qm = Set.univ) :
    ∃ π : R.Q → 𝒮.S.Q,
      (∀ s ∈ Shared.Lsup 𝒢 𝒮, ∀ x0 : R.Q, R.run s = some x0 → 𝒮.S.run s = some (π x0)) ∧
      IsProjection (ofRecognizer R (π ⁻¹' 𝒮.S.Qm) (fun x0 => 𝒮.φ (π x0))) 𝒮 π := by sorry

end RamadgeWonham.Quotient
Source
Ramadge and Wonham, Supervisory Control of a Class of Discrete Event Processes, SIAM J. Control Optim. 25(1), 1987, p. 223, proof of Theorem 10.1, first and third paragraphs
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me