Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 8.1 (iii), p. 219 — the quotient of a complete supervisor is complete

Proved
RamadgeWonham.Quotient.prop_8_1_iii

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

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

Let G\mathcal GG be a trim generator over a finite alphabet Σ\SigmaΣ with controllable events Σc\Sigma_cΣc​. Let S\mathcal SS and S^\hat{\mathcal S}S^ be supervisors with accessible automata, let S\mathcal SS be complete with respect to G\mathcal GG, and let π:S→S^\pi : \mathcal S \to \hat{\mathcal S}π:S→S^ be a projection. Then

S^ is complete with respect to G.\hat{\mathcal S} \text{ is complete with respect to } \mathcal G.S^ is complete with respect to G.

Formalization Note Standing assumptions as hypotheses: Σ\SigmaΣ finite, G\mathcal GG trim, both supervisor automata accessible.

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

open Shared.Generator

/-- Proposition 8.1 (iii) (p. 219): if `𝒮` is complete with respect to `𝒢` and `π : 𝒮 → 𝒮̂` is a
projection, then `𝒮̂` is complete with respect to `𝒢`. -/
theorem prop_8_1_iii
    {α : Type} [Fintype α] {Ec : Set α} (𝒢 : Shared.Generator α) (h𝒢 : 𝒢.L = Shared.pre 𝒢.Lm)
    (𝒮 𝒮h : Shared.Supervisor α Ec) (h𝒮acc : 𝒮.S.Accessible) (h𝒮hacc : 𝒮h.S.Accessible)
    (h𝒮 : Shared.Complete 𝒢 𝒮)
    (π : 𝒮.S.Q → 𝒮h.S.Q) (hπ : IsProjection 𝒮 𝒮h π) :
    Shared.Complete 𝒢 𝒮h := 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. 219, Proposition 8.1 (iii)
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