Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6 — from A_adv one can compute a uniform consensus bound D ≥ 1

Proved
DistLTLSynth.Char.lemma_3_6

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

automata-theorycomputabilityconsensusp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Fix a finite proposal set VVV with ∣V∣≥2|V|\ge2∣V∣≥2. There is a computable function DDD on codes of deterministic parity automata such that for every automaton Aadv\mathcal A_{\mathrm{adv}}Aadv​ recognizing a message adversary AAA with nowhere-dense image π(A)\pi(A)π(A),

D(Aadv)≥1  and consensus is solvable within D(Aadv) rounds under h−1A  for every h∈Pref(A).D(\mathcal A_{\mathrm{adv}})\ge1\ \text{ and consensus is solvable within } D(\mathcal A_{\mathrm{adv}}) \text{ rounds under } h^{-1}A\ \text{ for every } h\in\mathrm{Pref}(A).D(Aadv​)≥1  and consensus is solvable within D(Aadv​) rounds under h−1A  for every h∈Pref(A).

DDD is the block length of the decision procedure.

Differences from the source:

  • encoding: 'from A_adv, one can compute a D ≥ 1' → ∃ D : DPACode → ℕ, Computable D, correct on every code whose language has nowhere-dense image; reason: Mathlib's computability on finite codes of automata
  • encoding: π(A) nowhere dense in [0, 1] → IsNowhereDense (piMap '' A) in ℝ; reason: π(A) ⊆ [0, 1] and [0, 1] is closed in ℝ, so nowhere density in the subspace and in ℝ coincide
  • encoding: j(h) is the left-to-right index of h's edge in the inputless round-|h| view complex; π(h) is the common point of the nested intervals J(h[...r]) → j is defined by the recursion of Lemma 4.4 (jIdx), and piMap w is the supremum of the left endpoints j(w[...r])/3^r; reason: Lemma 4.4 proves the recursion for the geometric index; the left endpoints of nested intervals of length 3^{-r} increase to their common point
  • 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
  • reading: (1) all non-⊥ outputs are irrevocable → irrevocability is required in every execution whose graph history is in A (the executions considered for solvability); reason: §5.1 quantifies the bounded-time clause over 'all executions considered for solvability'; the two readings give the same solvability notion (a process can latch its first decision, which is in its view)
  • generalization: §3.3.1 (p. 12) assumes A ≠ ∅ before Lemma 3.6 → every code, A = ∅ included; reason: for A = ∅, Pref(A) = ∅ and the claim reduces to D ≥ 1, so the paper's case A ≠ ∅ is an instance
Preamble
import Mathlib
import Definitions.Def_DistLTLSynth_Char_Model
import Definitions.Def_DistLTLSynth_Char_Geometric
import Definitions.Def_DistLTLSynth_Char_Automata
import Definitions.Def_DistLTLSynth_Char_Consensus
Formal statement
namespace DistLTLSynth.Char

/-- Lemma 3.6: from a deterministic parity automaton `A_adv` for `A` with nowhere-dense image
`π(A)`, one can compute a `D ≥ 1` such that consensus is solvable within `D` rounds under
`h⁻¹A` for every `h ∈ Pref(A)`. -/
theorem lemma_3_6 (V : Type) [Fintype V] [DecidableEq V] (hV : 2 ≤ Fintype.card V) :
    ∃ D : DPACode → ℕ, Computable D ∧
      ∀ c : DPACode, IsNowhereDense (piMap '' c.lang) →
        1 ≤ D c ∧
          ∀ h ∈ Pref c.lang, ConsensusSolvableWithin V (leftQuot h c.lang) (D c) := 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. 12 (PDF 13), Lemma 3.6
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