Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Source-sensitive and sourcewise numerical budgets

Definition
DistancePreserver934_Exact_Supplement_Budgets

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

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

For a nonnegative vertex count nnn, source count σ\sigmaσ, demand count ppp, and integer level kkk, define the numerical expressions

Fk(n,σ,p)=n(8+8k)/(9+8k)(pσk)4/(9+8k),Wk(n,σ)=n(8+8k)/(5+8k)σ4k/(5+8k).F_k(n,\sigma,p)=n^{(8+8k)/(9+8k)}(p\sigma^k)^{4/(9+8k)},\qquad W_k(n,\sigma)=n^{(8+8k)/(5+8k)}\sigma^{4k/(5+8k)}.Fk​(n,σ,p)=n(8+8k)/(9+8k)(pσk)4/(9+8k),Wk​(n,σ)=n(8+8k)/(5+8k)σ4k/(5+8k).

These are real powers, with kkk cast to a real number before division. They describe cost scales without asserting existence of any graph. The linear term nnn is kept separately in the theorem statements.

Definition code
import Mathlib

set_option autoImplicit false

namespace DistancePreserver934.Exact.Supplement

open Classical

/-- The nonlinear source-sensitive term of Theorem 37, defined also at level zero. -/
noncomputable def F (k : ℕ) (n σ p : ℝ) : ℝ :=
  n ^ ((8 + 8 * (k : ℝ)) / (9 + 8 * (k : ℝ))) *
    (p * σ ^ k) ^ ((4 : ℝ) / (9 + 8 * (k : ℝ)))

/-- The nonlinear complete-sourcewise term of Theorem 40. -/
noncomputable def W (k : ℕ) (n σ : ℝ) : ℝ :=
  n ^ ((8 + 8 * (k : ℝ)) / (5 + 8 * (k : ℝ))) *
    σ ^ ((4 * (k : ℝ)) / (5 + 8 * (k : ℝ)))

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 pp. 32–33 (PDF pp. 33–34); Theorem 40, printed p. 34 (PDF p. 35)

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