Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.3 — h is a prefix of k iff J(k) ⊆ J(h)

Proved
DistLTLSynth.Char.lemma_2_3

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

distributed-computingp2o-gran-per-chapterp2o-plan-paperp2o-v1topology

For finite graph histories h,k∈Γ∗h,k\in\Gamma^*h,k∈Γ∗,

h is a prefix of k  ⟺  J(k)⊆J(h),h \text{ is a prefix of } k \iff J(k)\subseteq J(h),h is a prefix of k⟺J(k)⊆J(h),

where J(h)=[ j(h)/3∣h∣,(j(h)+1)/3∣h∣ ]J(h)=[\,j(h)/3^{|h|},(j(h)+1)/3^{|h|}\,]J(h)=[j(h)/3∣h∣,(j(h)+1)/3∣h∣]. It says that the intervals JJJ form a ternary subdivision tree matching the prefix order, the basis of every geometric argument about π\piπ.

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
  • 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