Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7(a), p. 203 — if Q refines P and M is compatible with P, then sup|A(S,T) − A_Q(S,T)| ≤ 2 sup|A(S,T) − M(S,T)|

Proved
FriezeKannan.PseudoReg.lemma_7a

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

block-averagecut-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pseudo-regular-partition

Let VVV be a finite set, A\mathbf AA and M\mathbf MM real V×VV\times VV×V matrices, P\mathcal PP a partition of VVV, and Q=W1,…,Wℓ\mathcal Q=W_1,\dots,W_\ellQ=W1​,…,Wℓ​ a refinement of P\mathcal PP. If M\mathbf MM is compatible with P\mathcal PP, then

sup⁡S,T⊆V∣A(S,T)−AQ(S,T)∣≤2sup⁡S,T⊆V∣A(S,T)−M(S,T)∣.\sup_{S,T\subseteq V}|\mathbf A(S,T)-\mathbf A_{\mathcal Q}(S,T)|\le 2\sup_{S,T\subseteq V}|\mathbf A(S,T)-\mathbf M(S,T)|.S,T⊆Vsup​∣A(S,T)−AQ​(S,T)∣≤2S,T⊆Vsup​∣A(S,T)−M(S,T)∣.

Here AQ\mathbf A_{\mathcal Q}AQ​ is the block average of A\mathbf AA over the blocks Wi×WjW_i\times W_jWi​×Wj​, and both suprema range over all pairs of subsets of VVV (a finite family, so they are maxima).

The lemma says that, up to a factor 2 in the cut norm, block-averaging A\mathbf AA over any refinement of P\mathcal PP approximates A\mathbf AA as well as the best matrix that is constant on the blocks of P\mathcal PP.

Formalization Note. The inequality between suprema is stated in the equivalent form: for every real ccc, if ∣A(S,T)−M(S,T)∣≤c|\mathbf A(S,T)-\mathbf M(S,T)|\le c∣A(S,T)−M(S,T)∣≤c for all S,T⊆VS,T\subseteq VS,T⊆V, then ∣A(S,T)−AQ(S,T)∣≤2c|\mathbf A(S,T)-\mathbf A_{\mathcal Q}(S,T)|\le 2c∣A(S,T)−AQ​(S,T)∣≤2c for all S,T⊆VS,T\subseteq VS,T⊆V. In Section 5.1 A\mathbf AA is an adjacency matrix; the lemma uses nothing about it and is stated for every real matrix A\mathbf AA. "Q\mathcal QQ refines P\mathcal PP" is Mathlib's order on Finpartition (Q≤P\mathcal Q\le\mathcal PQ≤P: every part of Q\mathcal QQ lies in a part of P\mathcal PP).

Preamble
import Mathlib
import Definitions.Def_FriezeKannan_PseudoReg_Setting
Formal statement
namespace FriezeKannan.PseudoReg

theorem lemma_7a {V : Type*} [Fintype V] [DecidableEq V]
    (A M : Matrix V V ℝ) (P Q : Finpartition (Finset.univ : Finset V)) (hQP : Q ≤ P)
    (hM : Compatible P M) (c : ℝ)
    (hc : ∀ S T : Finset V, |blockSum (A - M) S T| ≤ c) :
    ∀ S T : Finset V, |blockSum (A - blockAvg Q A) S T| ≤ 2 * c := by sorry

end FriezeKannan.PseudoReg
Source
Frieze and Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), p. 203, Lemma 7(a)
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