Lemma 2.3 — h is a prefix of k iff J(k) ⊆ J(h)
ProvedDistLTLSynth.Char.lemma_2_3distributed-computingp2o-gran-per-chapterp2o-plan-paperp2o-v1topology
For finite graph histories ,
where . It says that the intervals form a ternary subdivision tree matching the prefix order, the basis of every geometric argument about .
Differences from the source:
- 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
Preamble
import Mathlib import Definitions.Def_DistLTLSynth_Char_Model import Definitions.Def_DistLTLSynth_Char_Geometric
Formal statement
namespace DistLTLSynth.Char /-- Lemma 2.3: for finite graph histories `h, k`, `h` is a prefix of `k` iff `J(k) ⊆ J(h)`. -/ theorem lemma_2_3 (h k : List CommGraph) : h <+: k ↔ J k ⊆ J h := 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. 7 (PDF 8), Lemma 2.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.