Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 37 — The complete source-sensitive +2k family for every fixed integer k≥1

Open
DistancePreserver934.Exact.Supplement.theorem_37

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

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

For every integer k≥1k\ge1k≥1 there is Ck>0C_k>0Ck​>0, depending only on kkk, such that any nnn-vertex graph, source set SSS of size σ\sigmaσ, and ordered P⊆S×VP\subseteq S\times VP⊆S×V of size ppp with pσk≤n1+2k/3p\sigma^k\le n^{1+2k/3}pσk≤n1+2k/3 admit a source-sensitive additive +2k+2k+2k spanner satisfying

∣E(J)∣≤Ck(n+Fk(n,σ,p)),Fk=n(8+8k)/(9+8k)(pσk)4/(9+8k).|E(J)|\le C_k(n+F_k(n,\sigma,p)),\qquad F_k=n^{(8+8k)/(9+8k)}(p\sigma^k)^{4/(9+8k)}.∣E(J)∣≤Ck​(n+Fk​(n,σ,p)),Fk​=n(8+8k)/(9+8k)(pσk)4/(9+8k).

The same statement explicitly retains all three displayed specializations: k=1k=1k=1 gives n16/17(pσ)4/17n^{16/17}(p\sigma)^{4/17}n16/17(pσ)4/17 for pσ≤n5/3p\sigma\le n^{5/3}pσ≤n5/3; k=2k=2k=2 gives n24/25(pσ2)4/25n^{24/25}(p\sigma^2)^{4/25}n24/25(pσ2)4/25 for pσ2≤n7/3p\sigma^2\le n^{7/3}pσ2≤n7/3; k=3k=3k=3 gives n32/33(pσ3)4/33n^{32/33}(p\sigma^3)^{4/33}n32/33(pσ3)4/33 for pσ3≤n3p\sigma^3\le n^3pσ3≤n3. Each bound includes the linear nnn term. No additional p≤np\le np≤n restriction is imposed. Empty sources, arbitrary original demands and disconnected graphs remain included. This is partial source-sensitive preservation, not a claim about every pair in S×VS\times VS×V.

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_k coefficients and the family with its three displayed specializations → for every natural k≥1 a positive coefficient before all graph data, with the family and explicit k=1,2,3 consequences in one conjunction; reason: the constant can depend only on k; casting k before division preserves the rational exponents and full ranges
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 theorem_37 :

  ∀ k : ℕ, 1 ≤ k → ∃ C : ℝ, 0 < C ∧
    ∀ {V : Type} [Fintype V] (G : SimpleGraph V) (S : Finset V) (P : Finset (V × V)),
    let n := (Fintype.card V : ℝ)
    let σ := (S.card : ℝ)
    let p := (P.card : ℝ)
    SourceDemands S P →
    ((p * σ ^ k ≤ n ^ (1 + 2 * (k : ℝ) / 3) →
      ∃ J : SimpleGraph V, IsSourceSensitive G J S P (2 * k) ∧
        (numEdges J : ℝ) ≤ C * (n + F k n σ p)) ∧
    (k = 1 → p * σ ≤ n ^ ((5 : ℝ) / 3) →
      ∃ J : SimpleGraph V, IsSourceSensitive G J S P 2 ∧
        (numEdges J : ℝ) ≤ C * (n + n ^ ((16 : ℝ) / 17) * (p * σ) ^ ((4 : ℝ) / 17))) ∧
    (k = 2 → p * σ ^ 2 ≤ n ^ ((7 : ℝ) / 3) →
      ∃ J : SimpleGraph V, IsSourceSensitive G J S P 4 ∧
        (numEdges J : ℝ) ≤ C * (n + n ^ ((24 : ℝ) / 25) * (p * σ ^ 2) ^ ((4 : ℝ) / 25))) ∧
    (k = 3 → p * σ ^ 3 ≤ n ^ (3 : ℝ) →
      ∃ J : SimpleGraph V, IsSourceSensitive G J S P 6 ∧
        (numEdges J : ℝ) ≤ C * (n + n ^ ((32 : ℝ) / 33) * (p * σ ^ 3) ^ ((4 : ℝ) / 33))))
 := 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; Theorem 37, printed p. 32–33 (PDF p. 33–34)

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