Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.1 — Exact low-degree advantage bound for arbitrary planted hypergraphs

Open
ExpandingCodes.PolynomialStretch.Supplement.low_degree_bound

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

combinatoricscryptographyinformation-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be any fixed simple kkk-uniform hypergraph on [n][n][n] with mmm edges. Fix an integer D≥1D\ge1D≥1, 0<p<10<p<10<p<1, N≥nN\ge nN≥n and 0<γ≤10<\gamma\le10<γ≤1. Assume every F⊆E(H)F\subseteq E(H)F⊆E(H) of size at most DDD spans at least γk∣F∣\gamma k|F|γk∣F∣ vertices, and kD<N−1kD<N-1kD<N−1. The null law QQQ is Gk(N,p)G_k(N,p)Gk​(N,p); the planted law PHP_HPH​ adjoins an independently uniformly injected copy of all nnn vertices of HHH.

The maximal normalized difference of means over real polynomials fff of total degree at most DDD with Var⁡Q(f)>0\operatorname{Var}_Q(f)>0VarQ​(f)>0 obeys

Adv⁡≤D(PH,Q)≤[exp⁡(k!m2(1−p)p(N−kD)γk)−1]1/2.\operatorname{Adv}_{\le D}(P_H,Q)\le\left[\exp\left(\frac{k!m^2(1-p)}{p(N-kD)^{\gamma k}}\right)-1\right]^{1/2}.Adv≤D​(PH​,Q)≤[exp(p(N−kD)γkk!m2(1−p)​)−1]1/2.

The maximum is attained: its defining set is nonempty and bounded, and an admissible maximizing polynomial exists. Coefficients may depend arbitrarily on HHH. The power in the denominator is a real power. Empty HHH, isolated vertices and D>mD>mD>m remain allowed.

This unconditional companion theorem gives the non-asymptotic low-degree estimate for arbitrary planted hypergraphs; it does not assert hardness against general algorithms and is not used to prove the code-construction goal.

Differences from the source:

  • encoding: the maximum normalized mean difference over real degree-D polynomials with positive null variance → a real supremum together with explicit nonemptiness, boundedness, and attainment in the conclusion; reason: prevents default supremum values from weakening the source maximum
  • encoding: simple hypergraphs on [n], probabilities 0<p<1, and the exact bound (9) → finite edge-indicator coordinates, unit-interval probabilities with strict endpoint exclusions, finite expectations and Real.rpow; reason: retains all finite instances, all n vertices and the exact constants without integral or natural-subtraction defaults
Preamble
import Definitions.Def_ExpandingCodes_PolynomialStretch_Supplement_Algebra
set_option autoImplicit false
Formal statement
namespace ExpandingCodes.PolynomialStretch.Supplement

/-- Theorem 5.1. The maximum's nonemptiness, boundedness and attainment are explicit,
so the supremum cannot exploit a default value on an empty or unbounded set. -/
theorem low_degree_bound (n N k D : ℕ) (H : Hypergraph n k)
    (hD : 1 ≤ D) (p : unitInterval) (hp : 0 < (p : ℝ)) (hp1 : (p : ℝ) < 1)
    (hN : n ≤ N) (γ : ℝ) (hγ : 0 < γ) (hγ1 : γ ≤ 1)
    (hexpand : PatternExpansion H D γ) (hcut : k * D < N - 1) :
    (advantageValues (N := N) H p D).Nonempty ∧
    BddAbove (advantageValues (N := N) H p D) ∧
    (∃ f : TestPolynomial N k, f.totalDegree ≤ D ∧ 0 < nullVariance p f ∧
      normalizedAdvantage H p f = degreeAdvantage (N := N) H p D) ∧
    degreeAdvantage (N := N) H p D ≤
      Real.sqrt (Real.exp ((Nat.factorial k : ℝ) * (edgeCount H : ℝ) ^ 2 * (1 - (p : ℝ)) /
        ((p : ℝ) * Real.rpow ((N : ℝ) - (k * D : ℕ)) (γ * k))) - 1) := by sorry

end ExpandingCodes.PolynomialStretch.Supplement
Source
Isaac M Hair, Amit Sahai, Expanding Codes with Polynomial Stretch, STOC 2027 submission #824 (October 2026), printed p. 24 / PDF p. 25, Theorem 5.1

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