Lemma 3.2 — repeated bounded-time consensus iff π(A) is nowhere dense; uniform bound for ω-regular A
ProvedDistLTLSynth.Char.lemma_3_2consensusmessage-adversaryp2o-gran-per-chapterp2o-plan-paperp2o-v1topology
Fix a finite proposal set with . For every message adversary : consensus is repeatedly solvable in bounded time under (solvable in bounded time under every left quotient , ) if and only if is nowhere dense,
In this case, if is ω-regular, consensus is repeatedly solvable in uniformly bounded time (one bound for all ). It links the decidability boundary to consensus.
Differences from the source:
- encoding: A is ω-regular (given by a parity automaton) → A is the language of a deterministic parity automaton with a finite state type (least priority seen infinitely often is even); reason: the paper's own standing assumption (§1.1, §3.3, Def. 7.6); deterministic parity automata recognize exactly the ω-regular languages
- 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)
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.2: consensus is repeatedly solvable in bounded time under `A` iff `π(A)` is
nowhere dense; in this case, if `A` is ω-regular, consensus is repeatedly solvable in
uniformly bounded time. -/
theorem lemma_3_2 (V : Type) [Fintype V] [DecidableEq V] (hV : 2 ≤ Fintype.card V)
(A : Set (ℕ → CommGraph)) :
(RepeatedlySolvableBounded V A ↔ IsNowhereDense (piMap '' A)) ∧
(IsNowhereDense (piMap '' A) →
∀ (S : Type) [Fintype S] (M : DPA S CommGraph), M.lang = A →
RepeatedlySolvableUniform V 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. 8 (PDF 9), Lemma 3.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.