Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, p. 204 — D = D⁽¹⁾ + ⋯ + D⁽ˢ⁾ is compatible with the atom partition of the R_t, C_t

Proved
FriezeKannan.PseudoReg.cutSum_compatible

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

cut-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pseudo-regular-partition

Let VVV be a finite set, and let D(t)=CUT(Rt,Ct,dt)\mathbf D^{(t)}=\mathrm{CUT}(R_t,C_t,d_t)D(t)=CUT(Rt​,Ct​,dt​), t=1,…,st=1,\dots,st=1,…,s, be cut matrices on V×VV\times VV×V, with Rt,Ct⊆VR_t,C_t\subseteq VRt​,Ct​⊆V and dt∈Rd_t\in\mathbb Rdt​∈R. Let P=V1,…,Vk\mathcal P=V_1,\dots,V_kP=V1​,…,Vk​ be the coarsest partition of VVV such that each RtR_tRt​ and each CtC_tCt​ is a union of parts. Then

D=D(1)+D(2)+⋯+D(s)\mathbf D=\mathbf D^{(1)}+\mathbf D^{(2)}+\dots+\mathbf D^{(s)}D=D(1)+D(2)+⋯+D(s)

is compatible with P\mathcal PP: D(p,q)\mathbf D(p,q)D(p,q) is constant over every block Vi×VjV_i\times V_jVi​×Vj​.

This is the property of the cut decomposition that lets Lemma 7(a) be applied with M=D\mathbf M=\mathbf DM=D in the proof of claim (50).

Formalization Note. The partition is Mathlib's Finpartition.atomise of the family {R1,…,Rs,C1,…,Cs}\{R_1,\dots,R_s,C_1,\dots,C_s\}{R1​,…,Rs​,C1​,…,Cs​}, whose parts are the nonempty atoms of the family.

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

theorem cutSum_compatible {V : Type*} [Fintype V] [DecidableEq V]
    (s : ℕ) (Rs Cs : Fin s → Finset V) (d : Fin s → ℝ) :
    Compatible (atomPartition Rs Cs) (cutSum Rs Cs d) := by sorry

end FriezeKannan.PseudoReg
Source
Frieze and Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), p. 204, §5.1, "note that D is compatible with P"
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