Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Counting large cliques with arithmetic circuits

Proved
VWZClique.count_large_cliques_arithmetic

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

arithmetic-circuitsfine-grained-complexityk-cliquematrix-multiplication

There are absolute constants δ>0\delta>0δ>0 and KKK such that the following holds for every characteristic-zero field FFF and every fixed k≥Kk\ge Kk≥K. On the adjacency entries of an undirected simple graph with n≥1n\ge1n≥1 labeled vertices, one arithmetic circuit counts its unordered kkk-cliques using at most

DF,k n(ω(F)−δ)k/3D_{F,k}\,n^{(\omega(F)-\delta)k/3}DF,k​n(ω(F)−δ)k/3

arithmetic operations. The circuit can depend on F,k,nF,k,nF,k,n. Every graph at that size uses the same circuit. The cost includes construction of the grouped weights from the adjacency entries.

Preamble
import Definitions.Def_VWZClique_Count
import Definitions.Def_OAI_MatrixMultiplication_Arithmetic_omega

open OAI.MatrixMultiplication.Arithmetic VWZClique Classical
Formal statement
theorem VWZClique.count_large_cliques_arithmetic :
    ∃ δ : ℝ, 0 < δ ∧ ∃ K : ℕ, ∀ (F : Type*) [Field F] [CharZero F], ∀ k ≥ K,
      ∃ D : ℝ, 0 < D ∧ ∀ n : ℕ, 1 ≤ n →
        ∃ (r : ℕ) (p : Program F (Fin n × Fin n) r) (o : Fin r),
          (p.cost : ℝ) ≤ D * (n : ℝ)^((omega F - δ) * (k : ℝ) / 3) ∧
          ∀ G : SimpleGraph (Fin n),
            p.eval (fun ij => if G.Adj ij.1 ij.2 then 1 else 0) o = (count G k : F) := by sorry
Source
Virginia Vassilevska Williams and Or Zamir, The k-Clique hypothesis is dead, for good, https://zamir.prof/kclq.pdf, Section 3, proof of Theorem 1.1 (p. 14). Arithmetic-circuit corollary with sorted, padded vertex blocks.

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