Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.2 — Structure and exact sizes of the hard family F_L

Open
MTWalkSAT3CNF.TwoOcc.Supplement.proposition_4_2

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

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-algorithmssatisfiability

For every integer L≥40L\ge40L≥40, the formula FLF_LFL​ of (7)–(11) is satisfiable, has no repeated clauses even after forgetting literal order, has maximum variable occurrence exactly three, and has three distinct variables in every clause. Its counts are

m=12L2−6L−5,n=12L2−3L−6.m=12L^2-6L-5,\qquad n=12L^2-3L-6.m=12L2−6L−5,n=12L2−3L−6.

The variable count is stated both for the constructed carrier and for variables that actually occur. This establishes the structural properties of the hard family.

Differences from the source:

  • encoding: one-based branch/module indices and indexed conjunctions → zero-based Fin indices and a bijective reindexing of the constructed clause family, retaining duplicate clauses; reason: only variable and clause labels change; every source instance is preserved
Preamble
import Definitions.Def_MTWalkSAT3CNF_TwoOcc_Supplement_Hard

set_option autoImplicit false
open MeasureTheory
open scoped ENNReal
Formal statement
namespace MTWalkSAT3CNF.TwoOcc.Supplement

theorem proposition_4_2 (L : ℕ) (hL : 40 ≤ L) :
    Satisfiable (hardFormula L hL) ∧ NoRepeated (hardFormula L hL) ∧
    MaxOccThree (hardFormula L hL) ∧
    (∀ i, Function.Injective ((hardFormula L hL) i).var) ∧
    Fintype.card (HardIndex L) = 12*L^2-6*L-5 ∧
    Fintype.card (HardVar L) = 12*L^2-3*L-6 ∧
    numOccVars (hardFormula L hL) = 12*L^2-3*L-6 := by sorry

end MTWalkSAT3CNF.TwoOcc.Supplement
Source
Minbo Gao, Kun He, Tao Jiang, STOC 2027 submission #914 (October 2026), Proposition 4.2, p. 18; https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/914.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