Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(47), p. 203 — A(S,T) = e(S,T), A_Q(S,T) = Σ d_{i,j}|S_i||T_j|, and A(S,T) − A_Q(S,T) = Δ_Q(S,T)

Proved
FriezeKannan.PseudoReg.eq_47

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

graph-densityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pseudo-regular-partition

Let G=(V,E)G=(V,E)G=(V,E) be a finite simple graph with adjacency matrix A\mathbf AA, let Q=W1,…,Wq\mathcal Q=W_1,\dots,W_qQ=W1​,…,Wq​ be a partition of VVV with index set KKK, and let di,jd_{i,j}di,j​ be the density between WiW_iWi​ and WjW_jWj​. For disjoint S,T⊆VS,T\subseteq VS,T⊆V, with Si=S∩WiS_i=S\cap W_iSi​=S∩Wi​ and Tj=T∩WjT_j=T\cap W_jTj​=T∩Wj​,

A(S,T)=e(S,T),AQ(S,T)=∑i∈K∑j∈Kdi,j∣Si∣∣Tj∣,\mathbf A(S,T)=e(S,T),\qquad \mathbf A_{\mathcal Q}(S,T)=\sum_{i\in K}\sum_{j\in K}d_{i,j}|S_i||T_j|,A(S,T)=e(S,T),AQ​(S,T)=i∈K∑​j∈K∑​di,j​∣Si​∣∣Tj​∣,

and consequently

A(S,T)−AQ(S,T)=ΔQ(S,T).\mathbf A(S,T)-\mathbf A_{\mathcal Q}(S,T)=\Delta_{\mathcal Q}(S,T).A(S,T)−AQ​(S,T)=ΔQ​(S,T).

The identity rewrites the deviation from regularity ΔQ\Delta_{\mathcal Q}ΔQ​ as a block sum of the matrix A−AQ\mathbf A-\mathbf A_{\mathcal Q}A−AQ​, which turns pseudo-regularity into a statement about the cut norm of A−AQ\mathbf A-\mathbf A_{\mathcal Q}A−AQ​.

Formalization Note. e(S,T)e(S,T)e(S,T) is the number of ordered adjacent pairs in S×TS\times TS×T (Mathlib's interedges), which for disjoint S,TS,TS,T is the number of edges between them. The diagonal densities di,id_{i,i}di,i​ are block averages A(Wi,Wi)/∣Wi∣2\mathbf A(W_i,W_i)/|W_i|^2A(Wi​,Wi​)/∣Wi​∣2, as explained in the definitions item; with the paper's printed d(A,A)=e(A,A)/(∣A∣2)d(A,A)=e(A,A)/\binom{|A|}{2}d(A,A)=e(A,A)/(2∣A∣​) the identity fails. The disjointness hypothesis is kept as on the page.

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

theorem eq_47 {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj]
    (Q : Finpartition (Finset.univ : Finset V)) (S T : Finset V) (hST : Disjoint S T) :
    blockSum (G.adjMatrix ℝ) S T = ((G.interedges S T).card : ℝ) ∧
    blockSum (blockAvg Q (G.adjMatrix ℝ)) S T =
      ∑ Vi ∈ Q.parts, ∑ Vj ∈ Q.parts,
        (G.edgeDensity Vi Vj : ℝ) * ((S ∩ Vi).card : ℝ) * ((T ∩ Vj).card : ℝ) ∧
    blockSum (G.adjMatrix ℝ) S T - blockSum (blockAvg Q (G.adjMatrix ℝ)) S T =
      delta G Q S T := by sorry

end FriezeKannan.PseudoReg
Source
Frieze and Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), p. 203, §5.1, display (47) and the two equalities before it
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