Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.13 — a safety formula is realized under A iff under the closure Ā

Proved
DistLTLSynth.Char.lemma_6_13

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

distributed-synthesisp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1safetytopology

Let φ\varphiφ be a safety formula (L(φ)L(\varphi)L(φ) a safety property) and fff a distributed algorithm. For every message adversary AAA,

f realizes φ under A  ⟺  f realizes φ under A‾,f\text{ realizes }\varphi\text{ under }A\iff f\text{ realizes }\varphi\text{ under }\overline A,f realizes φ under A⟺f realizes φ under A,

where A‾\overline AA is the closure in Γω\Gamma^\omegaΓω. Liveness guarantees of an adversary do not help safety specifications.

Differences from the source:

  • generalization: input sets X_1, X_2 are singletons (standing assumption of §6) → arbitrary finite nonempty input sets X_1, X_2; reason: the proof uses only that the first R rounds of an execution depend on the first R input signals; the singleton case X_p = Unit is an instance
  • encoding: f_p : Views_p → Y_p → f_p is a total function on the inductive type of view terms; reason: values on terms that are not process-p views never enter an execution, so the realizable specifications are the same
Preamble
import Mathlib
import Definitions.Def_DistLTLSynth_Char_Model
import Definitions.Def_DistLTLSynth_Char_LTL
Formal statement
namespace DistLTLSynth.Char

/-- Lemma 6.13: for a safety formula `ϕ` and a distributed algorithm `f`, `f` realizes `ϕ`
under `A` iff it realizes `ϕ` under the closure `Ā` of `A` in `Γ^ω`. -/
theorem lemma_6_13 {X1 X2 Y1 Y2 : Type} [Fintype X1] [Nonempty X1] [Fintype X2] [Nonempty X2]
    [Fintype Y1] [Nonempty Y1] [Fintype Y2] [Nonempty Y2]
    (A : Set (ℕ → CommGraph)) (φ : Formula X1 X2 Y1 Y2) (hφ : φ.IsSafety)
    (f : Algorithm X1 X2 Y1 Y2) :
    FRealizes f A φ ↔ FRealizes f (closure A) φ := by sorry

end DistLTLSynth.Char
Source
Bollig, Bouyer-Decitre, Függer, Ghosh, Nowak, Sznajder, Distributed LTL Synthesis under Arbitrary Message Adversaries, STOC 2027 submission (PDF sha256 71476b49…), p. 28 (PDF 29), Lemma 6.13
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me