Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2 — Edge loss and transformed weight tables

Proved
VWZClique.fold_to_smaller_pattern

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

clique-countingfine-grained-complexity

A single shared arithmetic program constructs all weights of a nine-position pattern in quadratic arithmetic cost. One binary factor is saved per active wedge, and the transformed weighted sum equals the partial-swap contribution on every input.

Preamble
import Definitions.Def_VWZClique_FoldedSum

open VWZClique OAI.MatrixMultiplication.Arithmetic
Formal statement
theorem VWZClique.fold_to_smaller_pattern :
    ∃ C : ℕ, ∀ (F : Type*) [Field F] [CharZero F] (L : ℕ)
      (E : Finset EdgeSlot) (a b : Option (Mask L)),
      (a.isSome = true → wedgePlaced E 0 2) →
      (b.isSome = true → wedgePlaced E 1 0) →
      ∃ (H : SimpleGraph V) (r : ℕ) (P : Program F (ChannelKey L) r)
        (out : WeightKey (2^L) → Fin r),
        (Nat.card H.edgeSet + a.isSome.toNat + b.isSome.toNat ≤ E.card) ∧
        P.cost ≤ C * (2^L)^2 ∧ ∀ w,
          weightedSum H (fun i => P.eval w (out i)) = placedFold E a b w := by sorry
Source
V. Vassilevska Williams and O. Zamir, The k-Clique hypothesis is dead, for good (2026), Lemma 3.2. https://zamir.prof/kclq.pdf
Read-back

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

There exists a natural number CCC such that the following holds for every field FFF of characteristic zero, natural number LLL, finite E⊆{0,1,2}×S2E\subseteq\{0,1,2\}\times S^2E⊆{0,1,2}×S2, and optional masks a,ba,ba,b, where S={ℓ0,ℓ1,ℓ2,r0,r1,r2}S=\{\ell_0,\ell_1,\ell_2,r_0,r_1,r_2\}S={ℓ0​,ℓ1​,ℓ2​,r0​,r1​,r2​}. If aaa is present, assume (0,ℓ0,ℓ2),(2,r1,r2)∈E(0,\ell_0,\ell_2),(2,r_1,r_2)\in E(0,ℓ0​,ℓ2​),(2,r1​,r2​)∈E. If bbb is present, assume (1,ℓ0,ℓ2),(0,r1,r2)∈E(1,\ell_0,\ell_2),(0,r_1,r_2)\in E(1,ℓ0​,ℓ2​),(0,r1​,r2​)∈E. An absent mask imposes no membership condition. Put B={0,1}LB=\{0,1\}^LB={0,1}L, n=2Ln=2^Ln=2L, V={0,…,8}V=\{0,\ldots,8\}V={0,…,8} and D={0,…,n−1}D=\{0,\ldots,n-1\}D={0,…,n−1}. There exist a simple undirected graph HHH on VVV, a natural register count rrr, an rrr-register straight-line arithmetic program PPP over FFF, and a map from every vertex key (i,u)∈V×D(i,u)\in V\times D(i,u)∈V×D and ordered pair key (i,j,u,v)∈V2×D2(i,j,u,v)\in V^2\times D^2(i,j,u,v)∈V2×D2 to a register. The graph satisfies ∣E(H)∣+1a present+1b present≤∣E∣|E(H)|+\mathbf1_{a\text{ present}}+\mathbf1_{b\text{ present}}\le |E|∣E(H)∣+1a present​+1b present​≤∣E∣. Each register holds a field constant, an input, or the sum, difference or product of two earlier registers, and at most Cn2Cn^2Cn2 registers perform arithmetic. For every simultaneous assignment of field inputs w(h,i,u)w(h,i,u)w(h,i,u) and w(h,i,j,u,v)w(h,i,j,u,v)w(h,i,j,u,v) for h∈{0,1,2}h\in\{0,1,2\}h∈{0,1,2}, i,j∈Si,j\in Si,j∈S, and u,v∈Bu,v\in Bu,v∈B, write Ui,uU_{i,u}Ui,u​ and Qi,j,u,vQ_{i,j,u,v}Qi,j,u,v​ for the register values selected by the corresponding vertex and ordered pair keys. For A,D′∈B3A,D'\in B^3A,D′∈B3, set tℓk=Akt_{\ell_k}=A_ktℓk​​=Ak​, trk=Dk′t_{r_k}=D'_ktrk​​=Dk′​ for k=0,1,2k=0,1,2k=0,1,2 and let Ch(A,D′)=∏i∈Sw(h,i,ti)∏(h′,i,j)∈E, h′=hw(h,i,j,ti,tj)C_h(A,D')=\prod_{i\in S}w(h,i,t_i)\prod_{(h',i,j)\in E,\,h'=h}w(h,i,j,t_i,t_j)Ch​(A,D′)=∏i∈S​w(h,i,ti​)∏(h′,i,j)∈E,h′=h​w(h,i,j,ti​,tj​). For p,q∈B2p,q\in B^2p,q∈B2, an absent mask mmm gives Km(p,q)=1p=qK_m(p,q)=\mathbf1_{p=q}Km​(p,q)=1p=q​. A present mask assigns each coordinate either a blank or a quadruple of bits, and Km(p,q)K_m(p,q)Km​(p,q) is the indicator that at every blank the two bits of qqq reverse those of ppp, and at every specified coordinate (p1,p2,q1,q2)(p_1,p_2,q_1,q_2)(p1​,p2​,q1​,q2​) there equals its prescribed quadruple. With T(p,z)=(p1,p2,z)T(p,z)=(p_1,p_2,z)T(p,z)=(p1​,p2​,z), the same graph, program and register map give the equality

∑f:V→D∏i∈VUi,f(i)∏i<j{i,j}∈E(H)Qi,j,f(i),f(j)=∑z1,z2∈B ∑c∈B3 ∑x,x′,y,y′∈B2Ka(x,x′)Kb(y,y′) C0(T(x,z1),T(y,z2)) C1(T(y′,z2),c) C2(c,T(x′,z1)).\sum_{f:V\to D}\prod_{i\in V}U_{i,f(i)}\prod_{\substack{i<j\\\{i,j\}\in E(H)}}Q_{i,j,f(i),f(j)}=\sum_{z_1,z_2\in B}\ \sum_{c\in B^3}\ \sum_{x,x',y,y'\in B^2} K_a(x,x')K_b(y,y')\,C_0(T(x,z_1),T(y,z_2))\,C_1(T(y',z_2),c)\,C_2(c,T(x',z_1)).f:V→D∑​i∈V∏​Ui,f(i)​i<j{i,j}∈E(H)​∏​Qi,j,f(i),f(j)​=z1​,z2​∈B∑​ c∈B3∑​ x,x′,y,y′∈B2∑​Ka​(x,x′)Kb​(y,y′)C0​(T(x,z1​),T(y,z2​))C1​(T(y′,z2​),c)C2​(c,T(x′,z1​)).

The left sum includes repeated vertex labels. At L=0L=0L=0 each side has one summand and both mask indicators are one, while the edge bound still counts each present mask.

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