Lemma 31 — The parameterized +2 demand-removal construction
OpenDistancePreserver934.Exact.Supplement.lemma_31additive-spannersdistance-preserversgraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
For one absolute , every finite undirected unweighted graph with vertices, arbitrary ordered demand set of size , and real parameters , admit an additive spanner satisfying
All original demands and distances remain those of , including trivial and unreachable pairs. The parameters and original stay fixed. This is an unconditional existence result for the full demand set, used by Theorem 27, with no or private-length restriction.
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: absolute O and Ω coefficients → positive existential real coefficients before every graph, demand and real parameter; reason: this makes the source uniformity explicit without selecting unsupported numerical constants
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_31 :
∃ C : ℝ, 0 < C ∧ ∀ {V : Type} [Fintype V]
(G : SimpleGraph V) (P : Finset (V × V)) (d r : ℝ),
Real.sqrt 6 ≤ d → 6 ≤ r → r ≤ d ^ 2 →
∃ J : SimpleGraph V, IsAdditive G J P 2 ∧
(numEdges J : ℝ) ≤ C * ((P.card : ℝ) * r + (Fintype.card V : ℝ) * d +
(Fintype.card V : ℝ) * (P.card : ℝ) / (d ^ 2 * Real.sqrt r) +
(P.card : ℝ) * Real.sqrt ((Fintype.card V : ℝ) * r) / d)
:= 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 31, printed p. 28 (PDF p. 29)