Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, proof of Theorem 7, p. 188 — if ‖W^(t)‖²_F ≤ (1 − ε²t)‖A‖²_F, either (17) holds or one more cut matrix keeps the invariant at t + 1

Proved
FriezeKannan.CutDecomp.inductive_step

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

cut-decompositionenergy-incrementfrobenius-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let AAA be a real R×CR\times CR×C matrix and ε>0\varepsilon>0ε>0. Suppose cut matrices D(j)=CUT(Rj,Cj,dj)D^{(j)}=\mathrm{CUT}(R_j,C_j,d_j)D(j)=CUT(Rj​,Cj​,dj​), j=1,…,tj=1,\dots,tj=1,…,t, have been found such that the error W(t)=A−(D(1)+⋯+D(t))W^{(t)}=A-(D^{(1)}+\dots+D^{(t)})W(t)=A−(D(1)+⋯+D(t)) satisfies

∥W(t)∥F2≤(1−ε2t) ∥A∥F2.\|W^{(t)}\|_F^2\le(1-\varepsilon^2 t)\,\|A\|_F^2 .∥W(t)∥F2​≤(1−ε2t)∥A∥F2​.

Then at least one of the following holds:

  1. W(t)W^{(t)}W(t) satisfies (17): ∣W(t)(S,T)∣≤ε∣S∣ ∣T∣ ∥A∥F|W^{(t)}(S,T)|\le\varepsilon\sqrt{|S|\,|T|}\,\|A\|_F∣W(t)(S,T)∣≤ε∣S∣∣T∣​∥A∥F​ for all S⊆RS\subseteq RS⊆R, T⊆CT\subseteq CT⊆C;
  2. there are S⊆RS\subseteq RS⊆R, T⊆CT\subseteq CT⊆C and a real d′d'd′ such that
∥W(t)−CUT(S,T,d′)∥F2≤(1−ε2(t+1)) ∥A∥F2.\|W^{(t)}-\mathrm{CUT}(S,T,d')\|_F^2\le\big(1-\varepsilon^2(t+1)\big)\,\|A\|_F^2 .∥W(t)−CUT(S,T,d′)∥F2​≤(1−ε2(t+1))∥A∥F2​.

This is the inductive step of the existence proof of cut decompositions: the invariant ∥W(t)∥F2≤(1−ε2t)∥A∥F2\|W^{(t)}\|_F^2\le(1-\varepsilon^2t)\|A\|_F^2∥W(t)∥F2​≤(1−ε2t)∥A∥F2​ cannot persist beyond t=1/ε2t=1/\varepsilon^2t=1/ε2, so the process stops with (17) after at most 1/ε21/\varepsilon^21/ε2 cut matrices.

Formalization Note The paper also assumes t<1/ε2t<1/\varepsilon^2t<1/ε2; the step does not use it, and the statement is given without it. The family D(1),…,D(t)D^{(1)},\dots,D^{(t)}D(1),…,D(t) is indexed by Fin t (so t=0t=0t=0, the empty family, is allowed), and the new cut matrix is added to their sum.

Preamble
import Mathlib
import Definitions.Def_FriezeKannan_CutDecomp_Setting
Formal statement
namespace FriezeKannan.CutDecomp

/-- §4.1, proof of Theorem 7, p. 188: if the cut matrices `D^(1), …, D^(t)` leave a remainder
`W^(t) = A - (D^(1) + ⋯ + D^(t))` with `‖W^(t)‖²_F ≤ (1 - ε² t) ‖A‖²_F`, then either `W^(t)`
already satisfies (17), or one further cut matrix keeps the invariant with `t + 1`. -/
theorem inductive_step {R C : Type*} [Fintype R] [Fintype C] [DecidableEq R] [DecidableEq C]
    (A : Matrix R C ℝ) (ε : ℝ) (hε : 0 < ε) (t : ℕ)
    (Rs : Fin t → Finset R) (Cs : Fin t → Finset C) (d : Fin t → ℝ)
    (hinv : frobNorm (A - cutSum Rs Cs d) ^ 2 ≤ (1 - ε ^ 2 * t) * frobNorm A ^ 2) :
    (∀ (S : Finset R) (T : Finset C),
        |blockSum (A - cutSum Rs Cs d) S T|
          ≤ ε * Real.sqrt ((S.card : ℝ) * T.card) * frobNorm A) ∨
      ∃ (S : Finset R) (T : Finset C) (d' : ℝ),
        frobNorm (A - (cutSum Rs Cs d + cutMatrix S T d')) ^ 2
          ≤ (1 - ε ^ 2 * (t + 1)) * frobNorm A ^ 2 := by sorry

end FriezeKannan.CutDecomp
Source
Frieze and Kannan, Quick approximation to matrices and applications, Combinatorica 19 (1999), p. 188, §4.1, proof of Theorem 7 (inductive hypothesis ‖W‖²_F ≤ (1 − ε²t)‖A‖²_F and the dichotomy)
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