Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1: the penalized optimum approximates distance

Proved
TriFreeEst247.Main.lemma_2_1

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

graph-theoryp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1property-testingquery-complexity

Let GGG be any graph on n≥1n\ge1n≥1 vertices, let 0<ε<10<\varepsilon<10<ε<1, and let λ≥R△(ε)\lambda\ge R_\triangle(\varepsilon)λ≥R△​(ε). With distance normalized by n2n^2n2 and JλJ_\lambdaJλ​ as above,

OPTλ(G)≤dist⁡(G,TF)≤OPTλ(G)+ε.\mathrm{OPT}_\lambda(G)\le\operatorname{dist}(G,\mathrm{TF})\le\mathrm{OPT}_\lambda(G)+\varepsilon.OPTλ​(G)≤dist(G,TF)≤OPTλ​(G)+ε.

This compares the penalized optimum with the original distance and retains both inequalities.

Differences from the source:

  • encoding: finite graphs and their vertex sets → simple graphs on Fin n, with unordered edges and triangles; reason: relabeling preserves every source instance and all normalized quantities
  • encoding: λ ≥ R△(ε) → removalParameter ε ≤ ENNReal.ofReal λ; reason: the extended parameter retains infinity; the comparison forces a finite nonnegative weight at least one
Preamble
import Mathlib
import Definitions.Def_TriFreeEst247_Main_Score

open scoped ENNReal
Formal statement
namespace TriFreeEst247.Main

theorem lemma_2_1 {n : ℕ} (hn : 1 ≤ n) (G : Graph n) (ε lam : ℝ)
    (hε : 0 < ε ∧ ε < 1) (hlam : removalParameter ε ≤ ENNReal.ofReal lam) :
    scoreOpt G lam ≤ distance G ∧ distance G ≤ scoreOpt G lam + ε := by sorry

end TriFreeEst247.Main
Source
Asaf Shapira, Nick Kushnir, Triangle-Freeness: Estimation Is as Easy as Testing, STOC 2027 submission #247 (October 2026), source.pdf SHA-256 c24a6ad41f5c2465027e143e0aa757c3288add8cceb703078b9c0c2e18a0c3ad, p.7, Lemma 2.1
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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