Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Challenge 4: disproof of the exact r=22r = 22r=22 Sidorenko benchmark statement

Proved
TenChallenges.challenge_04_r22_disproof

by kmehltretter82 · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsextremal-graph-theorygraph-theorysidorenkoten-challenges

For a nonnegative integer rrr, the parameterized Sidorenko benchmark statement of Ten Challenges 04 asserts that every finite bipartite simple graph HHH admitting a bipartition V(H)=X∪YV(H)=X\cup YV(H)=X∪Y with ∣X∣≤r|X|\le r∣X∣≤r and ∣Y∣≤r|Y|\le r∣Y∣≤r satisfies Sidorenko's homomorphism-density inequality in every nonempty finite simple host graph GGG:

t(H,G)≥t(K2,G)∣E(H)∣,t(F,G)=∣Hom⁡(F,G)∣∣V(G)∣∣V(F)∣.t(H,G) \ge t(K_2,G)^{|E(H)|}, \qquad t(F,G) = \frac{|\operatorname{Hom}(F,G)|}{|V(G)|^{|V(F)|}}.t(H,G)≥t(K2​,G)∣E(H)∣,t(F,G)=∣V(G)∣∣V(F)∣∣Hom(F,G)∣​.

At parameter r=22r=22r=22, this statement is false: there exist a finite simple graph HHH admitting a bipartition V(H)=X∪YV(H)=X\cup YV(H)=X∪Y with ∣X∣≤22|X|\le 22∣X∣≤22 and ∣Y∣≤22|Y|\le 22∣Y∣≤22, together with a nonempty finite simple graph GGG, such that

t(H,G)<t(K2,G)∣E(H)∣.t(H,G) < t(K_2,G)^{|E(H)|}.t(H,G)<t(K2​,G)∣E(H)∣.

Specifically, the (13,22)(13,22)(13,22) point-triple incidence graph HHH (13≤2213\le 2213≤22, 22≤2222\le 2222≤22, ∣E(H)∣=66|E(H)|=66∣E(H)∣=66) violates Sidorenko's inequality in a finite host graph GGG. Settling this negation refutes the exact parameterized milestone TenChallenges.statement_04 22 and implies that the parameterized Sidorenko benchmark can hold unconditionally only for r≤21r\le 21r≤21.

Formalization Note. The theorem states ¬ TenChallenges.statement_04 22 directly over Definitions.Def_TenChallenges_Challenge_04, where BipartiteBoundedBy H 22 requires H.IsBipartiteWith X Y, X ∪ Y = Set.univ, X.ncard ≤ 22, and Y.ncard ≤ 22, and SidorenkoFor H G states homDensity H G ≥ homDensity (completeGraph (Fin 2)) G ^ Nat.card H.edgeSet.

Preamble
import Definitions.Def_TenChallenges_Challenge_04
Formal statement
namespace TenChallenges
theorem challenge_04_r22_disproof : ¬ TenChallenges.statement_04 22 := by sorry
end TenChallenges
Source
OpenAI, A counterexample to Sidorenko's conjecture (bipartite pattern with shore sizes 13 and 22 and 66 edges), https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/docs/161.md ; formal finite-host theorem OAI.SidorenkoCounterexample.main (Prove2Me theorem 0ce79ce5-9403-45c0-9a5a-6c2607be713f); parameterized target TenChallenges.statement_04 22 from Ten Challenges in Combinatorics, Challenge 4, https://tenchallenges.github.io/ten-challenges/.

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