Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.2 — moment certificates: Σ v(x)^{2K} < R₀^{2K} forces |v| < R₀, and conversely when √2 R′ < R₀

Proved
SymThrWires.Main.lemma_7_2

by Shuze Chen · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

circuit-lower-boundsp2o-gran-per-chapterp2o-plan-paperp2o-v1threshold-circuits

Let K≥1K\ge1K≥1 be an integer, VVV a finite set with ∣V∣≤2K|V|\le2^K∣V∣≤2K, v:V→Zv:V\to\mathbb Zv:V→Z, and R0≥1R_0\ge1R0​≥1 an integer. If

∑x∈Vv(x)2K<R02K,\sum_{x\in V}v(x)^{2K}<R_0^{2K},x∈V∑​v(x)2K<R02K​,

then ∣v(x)∣<R0|v(x)|<R_0∣v(x)∣<R0​ for all x∈Vx\in Vx∈V. Conversely, if ∣v∣≤R′|v|\le R'∣v∣≤R′ on VVV and 2 R′<R0\sqrt2\,R'<R_02​R′<R0​, then ∑x∈Vv(x)2K<R02K\sum_{x\in V}v(x)^{2K}<R_0^{2K}∑x∈V​v(x)2K<R02K​.

A single power sum certifies a uniform bound on a whole column of integer values, and honest values pass the test; this is how the algorithm checks guessed digits without trusting the witness.

Differences from the source: none.

Preamble
import Mathlib
Formal statement
namespace SymThrWires.Main

/-- **Lemma 7.2** (Moment certificates, p. 21). Let `K ≥ 1`, `V` a finite set with `|V| ≤ 2^K`,
`v : V → Z` and `R₀ ≥ 1` an integer. If `Σ_x v(x)^{2K} < R₀^{2K}` then `|v(x)| < R₀` for all `x`;
conversely, if `|v| ≤ R′` on `V` and `√2 R′ < R₀`, then `Σ_x v(x)^{2K} < R₀^{2K}`. -/
theorem lemma_7_2 {V : Type} [Fintype V] (K : ℕ) (hK : 1 ≤ K) (hV : Fintype.card V ≤ 2 ^ K)
    (v : V → ℤ) (R₀ : ℤ) (hR₀ : 1 ≤ R₀) :
    (∑ x, v x ^ (2 * K) < R₀ ^ (2 * K) → ∀ x, |v x| < R₀) ∧
    (∀ R' : ℝ, (∀ x, |(v x : ℝ)| ≤ R') → Real.sqrt 2 * R' < (R₀ : ℝ) →
      ∑ x, v x ^ (2 * K) < R₀ ^ (2 * K)) := by sorry

end SymThrWires.Main
Source
Dev Nag, Near-Cubic Gate and Near-Quartic Wire Lower Bounds for SYM∘THR Circuits, STOC 2027 submission, Zenodo doi:10.5281/zenodo.23847026 (sha256 02f54f02…), p. 21, Lemma 7.2
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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