Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 1: rL=Δ/4−Δ/2L+4<Δ/4r_L=\Delta/4-\Delta/2^{L+4}<\Delta/4rL​=Δ/4−Δ/2L+4<Δ/4

Proved
HopRamsey.observation_1

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

graph-algorithmshop-constrainedhstmetric-embeddingsp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1ramsey-embeddings

For the radii of Figure 2 with L≥1L\ge1L≥1 phases at scale Δ>0\Delta>0Δ>0, the largest radius is

rL=Δ4−Δ2L+4<Δ4.r_L=\frac\Delta4-\frac{\Delta}{2^{L+4}}<\frac\Delta4 .rL​=4Δ​−2L+4Δ​<4Δ​.

It bounds the radius of every ball carved by Algorithm 2 and gives, through Claim 1 and Corollary 1, the halving of the diameter at every level of the recursion.

Differences from the source:

  • generalization: L = ⌈log log(|V|+1)⌉ and the scale ∆ of a call → every L ≥ 1 and every ∆ > 0; reason: the identity holds for every L ≥ 1; Figure 2's L is ≥ 1 when |V| ≥ 2
Preamble
import Mathlib
import Definitions.Def_HopRamsey_Fig2Params

open scoped ENNReal
Formal statement
namespace HopRamsey

/-- Filtser, Zuzic, *Trees with Benefits: Stochastic Hop-Constrained Ramsey-Type Embeddings with
Logarithmic Expected Distortion*, STOC 2027 submission (manuscript sha256 1ee73385…),
Observation 1, p.15 (PDF p.17): "r_L = ∆/4 − ∆/2^{L+4} < ∆/4."

**Formalization Note.** Stated for every number of phases `L ≥ 1` and every scale `∆ > 0`, with the
radii of Figure 2 (`radius L ∆ ℓ`); Figure 2's `L = ⌈log₂ log₂(|V|+1)⌉` is `≥ 1` when `|V| ≥ 2`. -/
theorem observation_1 (L : ℕ) (hL : 1 ≤ L) (Δ : ℝ) (hΔ : 0 < Δ) :
    radius L Δ L = Δ / 4 - Δ / 2 ^ (L + 4) ∧ radius L Δ L < Δ / 4 := by sorry

end HopRamsey
Source
Filtser, Zuzic, Trees with Benefits: Stochastic Hop-Constrained Ramsey-Type Embeddings with Logarithmic Expected Distortion, STOC 2027 submission (manuscript sha256 1ee73385…), Observation 1, p.15 (PDF p.17)
Human review
  • Endorsed by Shuze Chen · Nov 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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