Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 3.8 — exact θt(Ps,t3)\theta_t(P^3_{s,t})θt​(Ps,t3​) (corrected: odd case excludes (s,t) = (1,1))

Open
MajorityDepthThree.Exact.Supplement.construction_count

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

circuit-complexityextremal-combinatoricsp2o-batch-stoc27sp2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-v1

For an integer sss and a natural number ttt, let V={0,…,3t−s−1}V=\{0,\dots,3t-s-1\}V={0,…,3t−s−1} and let θt(Ps,t3)\theta_t(P^3_{s,t})θt​(Ps,t3​) be the number of satisfying assignments of the construction Ps,t3P^3_{s,t}Ps,t3​ on VVV with exactly ttt variables set to one. Then

θt(Ps,t3)={3ts≤0, t≥0,(23)s/23ts even, 1≤s≤t,79(23)(s−1)/23ts odd, 1≤s≤t, (s,t)≠(1,1).\theta_t(P^3_{s,t})=\begin{cases}3^t & s\le0,\ t\ge0,\\ \left(\tfrac23\right)^{s/2}3^t & s\text{ even},\ 1\le s\le t,\\ \tfrac79\left(\tfrac23\right)^{(s-1)/2}3^t & s\text{ odd},\ 1\le s\le t,\ (s,t)\ne(1,1).\end{cases}θt​(Ps,t3​)=⎩⎨⎧​3t(32​)s/23t97​(32​)(s−1)/23t​s≤0, t≥0,s even, 1≤s≤t,s odd, 1≤s≤t, (s,t)=(1,1).​

These are exact equalities of real numbers. They give the lower bounds of Theorem 3.10 for the monotone maximum Φ0(s,t)\Phi_0(s,t)Φ0​(s,t) via the witness of Fact 3.7.

Differences from the source:

  • correction: odd case for all 1 ≤ s ≤ t → odd case for 1 ≤ s ≤ t except (s,t) = (1,1); reason: at s = t = 1 the printed value is 7/3, not an integer, so no count can equal it; P^3_{1,1} is moreover undefined
  • encoding: n = 3t − s variables → the variable set {0, …, 3t − s − 1} ⊂ ℕ, with 3t − s computed in ℤ; reason: relabeling changes no count; on the stated ranges 3t − s ≥ 0
  • encoding: exponents s/2 and (s − 1)/2 → natural-number exponents (toNat s)/2 and (toNat s − 1)/2; reason: in their cases s ≥ 1 and the divisions are exact
Preamble
import Definitions.Def_MajorityDepthThree_Exact_Supplement_Constructions

set_option autoImplicit false
Formal statement
namespace MajorityDepthThree.Exact.Supplement

open MajorityDepthThree.Exact

/-- Fact 3.8 (p. 9): the exact number of `t`-transversals of `P^3_{s,t}` on the
variables `range (3t - s)`. Corrected: the odd case excludes `(s,t) = (1,1)`, where
the printed value `7/3` is not an integer (and `P^3_{1,1}` is undefined). -/
theorem construction_count :
    (∀ (s : ℤ) (t : ℕ), s ≤ 0 →
      (theta (Finset.range (3 * (t : ℤ) - s).toNat) (P3 s t) t : ℝ) = 3 ^ t) ∧
    (∀ (s : ℤ) (t : ℕ), Even s → 1 ≤ s → s ≤ t →
      (theta (Finset.range (3 * (t : ℤ) - s).toNat) (P3 s t) t : ℝ) =
        (2 / 3 : ℝ) ^ (s.toNat / 2) * 3 ^ t) ∧
    (∀ (s : ℤ) (t : ℕ), Odd s → 1 ≤ s → s ≤ t → ¬ (s = 1 ∧ t = 1) →
      (theta (Finset.range (3 * (t : ℤ) - s).toNat) (P3 s t) t : ℝ) =
        (7 / 9 : ℝ) * (2 / 3 : ℝ) ^ ((s.toNat - 1) / 2) * 3 ^ t) := by sorry

end MajorityDepthThree.Exact.Supplement
Source
Mohit Gurumukhani, Daniel Kleber, Ramamohan Paturi, Christopher Rosin, Michael Saks, Navid Talebanfard, STOC 2027 submission #677 (October 2026), p.9, Fact 3.8

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