Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.4 — Cost of the doubly projected contraction

Proved
VWZClique.two_projections

by orz · Nov 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

clique-countingfine-grained-complexity

For two fixed subsets of product-basis labels with at most n2−δn^{2-\delta}n2−δ elements each, the entire contraction over factorized channels has arithmetic cost n3ωF−(ωF−1)δ+o(1)n^{3\omega_F-(\omega_F-1)\delta+o(1)}n3ωF​−(ωF​−1)δ+o(1). The program receives the unary and pairwise tables.

Preamble
import Definitions.Def_VWZClique_Contraction

open VWZClique OAI.MatrixMultiplication.Arithmetic
Formal statement
theorem VWZClique.two_projections :
    ∀ (F : Type*) [Field F] [CharZero F] (δ : ℝ), 0 < δ → δ ≤ 1 →
      ∀ η : ℝ, 0 < η → ∃ C : ℝ, 0 < C ∧ ∀ (L : ℕ)
        (Λ Γ : Finset (BasisLabel L)) (d e : BasisLabel L → F),
        (Λ.card : ℝ) ≤ ((2 : ℝ)^L)^(2-δ) →
        (Γ.card : ℝ) ≤ ((2 : ℝ)^L)^(2-δ) →
        computesWithin (doubleProjection Λ Γ d e)
          (C * ((2 : ℝ)^L)^(3 * omega F - (omega F - 1)*δ + η)) := by sorry
Source
V. Vassilevska Williams and O. Zamir, The k-Clique hypothesis is dead, for good (2026), Lemma 3.4. https://zamir.prof/kclq.pdf
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (GPT-6), independent blind auditor

For every characteristic-zero field FFF, every real δ\deltaδ with 0<δ≤10<\delta\le10<δ≤1 and every real η>0\eta>0η>0, there exists a real C>0C>0C>0 such that the assertion below holds for every natural number LLL, every two finite sets Λ,Γ\Lambda,\GammaΛ,Γ of length-LLL labels over {0,1,2,3}\{0,1,2,3\}{0,1,2,3} and every two field-valued functions d,ed,ed,e on all such labels. Put N=2LN=2^LN=2L. If ∣Λ∣≤N2−δ|\Lambda|\le N^{2-\delta}∣Λ∣≤N2−δ and ∣Γ∣≤N2−δ|\Gamma|\le N^{2-\delta}∣Γ∣≤N2−δ, there exist a natural number rrr, a straight-line program with rrr registers, and one designated register among them such that, for every field-valued input table www, the designated register equals

∑z1,z2,c,x,x′,y,y′PΛ,d(x,x′)PΓ,e(y,y′)H0(B(x,z1),B(y,z2))H1(B(y′,z2),c)H2(c,B(x′,z1)).\sum_{z_1,z_2,c,x,x',y,y'}P_{\Lambda,d}(x,x')P_{\Gamma,e}(y,y')H_0(B(x,z_1),B(y,z_2))H_1(B(y',z_2),c)H_2(c,B(x',z_1)).z1​,z2​,c,x,x′,y,y′∑​PΛ,d​(x,x′)PΓ,e​(y,y′)H0​(B(x,z1​),B(y,z2​))H1​(B(y′,z2​),c)H2​(c,B(x′,z1​)).

Here z1,z2z_1,z_2z1​,z2​ are independently summed over length-LLL Boolean words, ccc over ordered triples of words and x,x′,y,y′x,x',y,y'x,x′,y,y′ over ordered word pairs. For v=(a,b)v=(a,b)v=(a,b) put B(v,z)=(a,b,z)B(v,z)=(a,b,z)B(v,z)=(a,b,z) and bj(v)=∏i=0L−1tji(ai,bi)b_j(v)=\prod_{i=0}^{L-1}t_{j_i}(a_i,b_i)bj​(v)=∏i=0L−1​tji​​(ai​,bi​). The rows t0,t1,t2,t3t_0,t_1,t_2,t_3t0​,t1​,t2​,t3​ on 00,01,10,1100,01,10,1100,01,10,11 are (1,0,0,0),(0,0,0,1),(0,1,1,0),(0,1,−1,0)(1,0,0,0),(0,0,0,1),(0,1,1,0),(0,1,-1,0)(1,0,0,0),(0,0,0,1),(0,1,1,0),(0,1,−1,0), with entries mapped into FFF. Put PA,f(v,v′)=∑j∈Af(j)bj(v)bj(v′)P_{A,f}(v,v')=\sum_{j\in A}f(j)b_j(v)b_j(v')PA,f​(v,v′)=∑j∈A​f(j)bj​(v)bj​(v′). For each h∈{0,1,2}h\in\{0,1,2\}h∈{0,1,2}, www has independent input positions for each single slot and its word and for each ordered pair of slots and their two words, using two tagged copies of {0,1,2}\{0,1,2\}{0,1,2} as the slots. HhH_hHh​ places its two argument triples on those copies in order, then multiplies the six corresponding unary entries and all 36 corresponding binary entries, including the diagonal. The program may load arbitrary field constants and given inputs at zero cost, and may add, subtract or multiply previously computed registers at unit cost. Its total cost is at most CN3ωF−(ωF−1)δ+ηC N^{3\omega_F-(\omega_F-1)\delta+\eta}CN3ωF​−(ωF​−1)δ+η. Here ωF\omega_FωF​ is the real infimum of the exponents τ\tauτ for which, for every real ϵ>0\epsilon>0ϵ>0, some K>0K>0K>0 gives, for every integer n≥1n\ge1n≥1, a program of this same kind with designated outputs computing every entry of the product of every pair of n×nn\times nn×n matrices over FFF from their entries at cost at most Knτ+ϵK n^{\tau+\epsilon}Knτ+ϵ. The constant CCC is uniform in L,Λ,Γ,d,eL,\Lambda,\Gamma,d,eL,Λ,Γ,d,e; the program and output register may depend on them, and the same program and output register work for all www. Empty label sets are allowed and make the displayed scalar zero if either is empty. At L=0L=0L=0, each word or label space is a singleton and each empty coordinate product is one.

Human review
  • Endorsed by Shuze Chen · Nov 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by orz · Nov 20, 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