Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 35 — Completion of a constant fraction without a logarithmic loss

Open
DistancePreserver934.Exact.Supplement.lemma_35

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

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

Fix an exponent η>0\eta>0η>0 and a uniform half-cover cost coefficient B>0B>0B>0. There is Cη,B>0C_{\eta,B}>0Cη,B​>0, independent of nnn, graph, source set, demand count, scale and error, with the following property. In a fixed graph GGG, fix an integer error β\betaβ, a nonnegative scale a=A(n,σ)a=A(n,\sigma)a=A(n,σ), and a predicate on demand sets closed under taking subsets. For every admissible residual RRR of size q>nq>\sqrt nq>n​, assume

aqη≥n,∃JR⊆G: JR satisfies at least half of R with error β,∣E(JR)∣≤Baqη.a q^\eta\ge n,\qquad\exists J_R\subseteq G:\ J_R\text{ satisfies at least half of }R\text{ with error }\beta,\quad |E(J_R)|\le B a q^\eta.aqη≥n,∃JR​⊆G: JR​ satisfies at least half of R with error β,∣E(JR​)∣≤Baqη.

Then every admissible original set PPP of size ppp has a full additive +β+\beta+β spanner with

∣E(J)∣≤Cη,B(n+apη).|E(J)|\le C_{\eta,B}(n+a p^\eta).∣E(J)∣≤Cη,B​(n+apη).

The fixed source restriction, if present, is part of the downward-closed predicate. The scale is fixed while residual demand sets change. The conclusion is not included in the half-cover premise. This is the shared completion tool for Theorems 36 and 37.

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: fixed scale A(n,σ), subset-persistent construction hypotheses and uniform O(f) cost → a nonnegative fixed real a, a downward-closed demand predicate and one coefficient B; completion coefficient chosen before all instance data; reason: for fixed graph and sources only A(n,σ) is used; the premise quantifies over every admissible residual and retains the cutoff sqrt(n)
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_35 :

  ∀ η B : ℝ, 0 < η → 0 < B → ∃ C : ℝ, 0 < C ∧
    ∀ {V : Type} [Fintype V] (G : SimpleGraph V) (β : ℕ)
      (a : ℝ) (Admissible : Finset (V × V) → Prop),
    0 ≤ a →
    (∀ R Q : Finset (V × V), Q ⊆ R → Admissible R → Admissible Q) →
    (∀ R : Finset (V × V), Admissible R →
      Real.sqrt (Fintype.card V : ℝ) < (R.card : ℝ) →
      (Fintype.card V : ℝ) ≤ a * (R.card : ℝ) ^ η ∧
      ∃ J : SimpleGraph V, HalfSatisfied G J R β ∧
        (numEdges J : ℝ) ≤ B * a * (R.card : ℝ) ^ η) →
    ∀ P : Finset (V × V), Admissible P →
    ∃ J : SimpleGraph V, IsAdditive G J P β ∧
      (numEdges J : ℝ) ≤ C * ((Fintype.card V : ℝ) + a * (P.card : ℝ) ^ η)
 := 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 35, printed p. 32 (PDF p. 33)

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