Lemma 5.2 — consensus is solvable in bounded time under A iff π(A) is not dense in [0, 1]
ProvedDistLTLSynth.Char.lemma_5_2consensusmessage-adversaryp2o-gran-per-chapterp2o-plan-paperp2o-v1topology
Fix a finite proposal set with . For every message adversary ,
i.e. iff . A common decision bound requires a whole interval missing from the image, not just one point.
Differences from the source:
- encoding: π(A) is not dense in [0, 1] → closure (piMap '' A) ≠ Set.Icc 0 1 (closure in ℝ); reason: π(A) ⊆ [0, 1] and [0, 1] is closed, so its closure in [0, 1] and in ℝ agree
- 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)
Preamble
import Mathlib import Definitions.Def_DistLTLSynth_Char_Model import Definitions.Def_DistLTLSynth_Char_Geometric import Definitions.Def_DistLTLSynth_Char_Consensus
Formal statement
namespace DistLTLSynth.Char
/-- Lemma 5.2: consensus is solvable in bounded time under `A` iff `π(A)` is not dense in
`[0, 1]`, i.e. iff the closure of `π(A) ⊆ [0, 1]` is not all of `[0, 1]`. -/
theorem lemma_5_2 (V : Type) [Fintype V] [DecidableEq V] (hV : 2 ≤ Fintype.card V)
(A : Set (ℕ → CommGraph)) :
ConsensusSolvableBounded V A ↔ closure (piMap '' A) ≠ Set.Icc (0 : ℝ) 1 := 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. 17 (PDF 18), Lemma 5.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.