Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma B.2 (used in the proof of Theorem 6.2) — both gadget count bounds

Open
CNFLearning873.Valiant.Supplement.lemma_B_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

cnf-learningcombinatoricsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

For integers k≥3k\ge3k≥3 and ℓ>0\ell>0ℓ>0, let NℓN_\ellNℓ​ count the satisfying assignments of the unrestricted gadget of Definition B.1, and let λk=2k−1−1+2k−1(2k−1−k)\lambda_k=2^{k-1}-1+\sqrt{2^{k-1}(2^{k-1}-k)}λk​=2k−1−1+2k−1(2k−1−k)​. Then both bounds hold:

λkℓ≤Nℓ≤2λkℓ.\lambda_k^\ell\le N_\ell\le2\lambda_k^\ell.λkℓ​≤Nℓ​≤2λkℓ​.

The count refers to the actual layered CNF, including all unrestricted first-layer assignments. The estimate supports the information-theoretic lower bound of Theorem 6.2.

Differences from the source:

  • encoding: k variables in each of ell named layers → flattened variables Fin (k*ell), with printed layer i+1 encoded as i; reason: a bijective relabeling preserves the actual CNF and both exact count bounds
Preamble
import Definitions.Def_CNFLearning873_Valiant_Supplement_GadgetB
Formal statement
namespace CNFLearning873.Valiant.Supplement

/-- Lemma B.2, p.36 = PDF p.36, for the actual unrestricted gadget of Definition B.1. -/
theorem lemma_B_2 (k ℓ : ℕ) (hk : 3 ≤ k) (hℓ : 0 < ℓ) :
    eigenvalue k ^ ℓ ≤ (gadgetCount k ℓ : ℝ) ∧
    (gadgetCount k ℓ : ℝ) ≤ 2 * eigenvalue k ^ ℓ := by sorry

end CNFLearning873.Valiant.Supplement
Source
Weiming Feng, Yixiao Yu, Yiyao Zhang, STOC 2027 submission #873 (October 2026), Lemma B.2, printed p.36 = 1-based PDF p.36; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/873.pdf

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