Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 34 — Both sampling reductions, with exact sample-size and half-demand guarantees

Open
DistancePreserver934.Exact.Supplement.lemma_34

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-spannersdistance-preserversgraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let p=∣P∣>0p=|P|>0p=∣P∣>0, d≥1d\ge1d≥1 be real and β≥0\beta\ge0β≥0 an integer. Both constructions provide J0⊆GJ_0\subseteq GJ0​⊆G and R⊆VR\subseteq VR⊆V with the same explicit bounds

∣E(J0)∣≤15nd,∣R∣≤p/d2.|E(J_0)|\le15nd,\qquad |R|\le p/d^2.∣E(J0​)∣≤15nd,∣R∣≤p/d2.
  1. If P⊆S×VP\subseteq S\times VP⊆S×V, then adjoining any additive +β+\beta+β spanner for the reachable pairs in S×RS\times RS×R satisfies at least half of the original PPP with additive error β+2\beta+2β+2.
  2. For arbitrary PPP, adjoining any additive +β+\beta+β spanner for the reachable pairs in R×RR\times RR×R satisfies at least half of PPP with error β+4\beta+4β+4.

Each construction chooses its own J0,RJ_0,RJ0​,R before quantification over the auxiliary spanner. The sets may differ between clauses and RRR may be empty. This deterministic reduction serves both Theorems 36 and 37. The numerical coefficient 15 is supplied by the proof on printed p. 31.

Differences from the source:

  • encoding: finite graphs on n vertices, with the section demand convention → an arbitrary finite vertex type, unordered technical demands in §4 and §7.1–7.2 and ordered demands in Definition 26 and §8; reason: the published graph and extended-distance definitions retain exactly these instances; undirected edges are counted once
  • encoding: O(nd) edges for each sampling construction → at most 15nd edges for each construction; reason: the proof gives |E(J0)|<3n ceil(4d)≤15nd, with exactly the same instances
Preamble
import Definitions.Def_DistancePreserver934_Exact_Supplement_EdgePaths
import Definitions.Def_DistancePreserver934_Exact_Supplement_Hitting
import Definitions.Def_DistancePreserver934_Exact_Supplement_Sourcewise
import Definitions.Def_DistancePreserver934_Exact_Supplement_Budgets

set_option autoImplicit false
Formal statement
namespace DistancePreserver934.Exact.Supplement

open Classical

theorem lemma_34 :

  ∀ {V : Type} [Fintype V] (G : SimpleGraph V) (P : Finset (V × V))
    (S : Finset V) (d : ℝ) (β : ℕ),
    0 < P.card → 1 ≤ d →
    ((SourceDemands S P → ∃ (J0 : SimpleGraph V) (R : Finset V),
      J0 ≤ G ∧ (numEdges J0 : ℝ) ≤ 15 * (Fintype.card V : ℝ) * d ∧
      (R.card : ℝ) ≤ (P.card : ℝ) / d ^ 2 ∧
      ∀ Jaux : SimpleGraph V, IsAdditive G Jaux (reachablePairs G S R) β →
        HalfSatisfied G (J0 ⊔ Jaux) P (β + 2)) ∧
    (∃ (J0 : SimpleGraph V) (R : Finset V),
      J0 ≤ G ∧ (numEdges J0 : ℝ) ≤ 15 * (Fintype.card V : ℝ) * d ∧
      (R.card : ℝ) ≤ (P.card : ℝ) / d ^ 2 ∧
      ∀ Jaux : SimpleGraph V, IsAdditive G Jaux (reachablePairs G R R) β →
        HalfSatisfied G (J0 ⊔ Jaux) P (β + 4)))
 := by sorry

end DistancePreserver934.Exact.Supplement
Source
Yanyu Chen, Yu Chen, Zihan Tan, Mingyang Yang, Improved Bounds on Distance Preservers, STOC 2027 submission #934 (October 2026); canonical source.pdf SHA-256 79b3d23a6e7b7fc6148c7a627181474a0129fb2f4c1d04ccd94c1da7987ed76b; Lemma 34, printed p. 30–31 (PDF p. 31–32)

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