Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8, proof of Theorem 12, p. 217 — if |w(S,T)| > ε‖f‖₂ then subtracting CUT(S,T,d) lowers ‖w‖²₂ by at least ε²‖f‖²₂

Proved
FriezeKannan.Continuum.l2_drop_le

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

cut-decompositionl2-spacep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-regularity

Let fff and www be real functions on [0,1]2[0,1]^2[0,1]2 with www square integrable, let ϵ>0\epsilon>0ϵ>0, and let S,T⊆[0,1]S,T\subseteq[0,1]S,T⊆[0,1] be measurable sets with

∣w(S,T)∣>ϵ∥f∥2.|w(S,T)|>\epsilon\|f\|_2 .∣w(S,T)∣>ϵ∥f∥2​.

Put d=w(S,T)/(∣S∣ ∣T∣)d=w(S,T)/(|S|\,|T|)d=w(S,T)/(∣S∣∣T∣), where ∣S∣|S|∣S∣ is the Lebesgue measure of SSS. Then

∥w−CUT(S,T,d)∥22−∥w∥22≤−ϵ2∥f∥22.\|w-\mathrm{CUT}(S,T,d)\|_2^2-\|w\|_2^2\le-\epsilon^2\|f\|_2^2 .∥w−CUT(S,T,d)∥22​−∥w∥22​≤−ϵ2∥f∥22​.

In the proof of Theorem 12, w=wtw=w_tw=wt​ is the current error and fff the function being decomposed; each new cut function lowers the squared error by at least ϵ2∥f∥22\epsilon^2\|f\|_2^2ϵ2∥f∥22​, which bounds the number of steps by 1/ϵ21/\epsilon^21/ϵ2.

Formalization Note. ϵ>0\epsilon>0ϵ>0 is the paper's implicit range of the error parameter. No positivity of ∣S∣ ∣T∣|S|\,|T|∣S∣∣T∣ is assumed: it follows from the hypothesis, since w(S,T)=0w(S,T)=0w(S,T)=0 when ∣S∣ ∣T∣=0|S|\,|T|=0∣S∣∣T∣=0. No hypothesis on fff is needed beyond what ∥f∥2\|f\|_2∥f∥2​ means; ∥f∥2\|f\|_2∥f∥2​ is the square root of ∫f2\int f^2∫f2.

Preamble
import Mathlib
import Definitions.Def_FriezeKannan_Continuum_Setting

open MeasureTheory
Formal statement
namespace FriezeKannan.Continuum

theorem l2_drop_le (f w : Sq → ℝ) (hw : MemLp w 2) (ε : ℝ) (hε : 0 < ε)
    (S T : Set unitInterval) (hS : MeasurableSet S) (hT : MeasurableSet T)
    (h : ε * l2Norm f < |rectInt w S T|) :
    let d := rectInt w S T / ((volume S).toReal * (volume T).toReal)
    l2Norm (fun p => w p - cutFun S T d p) ^ 2 - l2Norm w ^ 2 ≤ -ε ^ 2 * l2Norm f ^ 2 := by sorry

end FriezeKannan.Continuum
Source
Frieze and Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), p. 217, §8, proof of Theorem 12 (final inequality of the displayed computation)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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