Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, (39), p. 8 — max_r |x_r + a₂x_r² + … + a_kx_r^k| ≥ 1/k at x_r = cos(πr/k), k odd

Proved
QAOAE3Lin2.General.eq_39

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

chebyshevmax-e3lin2p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-inequality

Let kkk be an odd positive integer and xr=cos⁡(πr/k)x_r=\cos(\pi r/k)xr​=cos(πr/k) for r=0,1,…,kr=0,1,\dots,kr=0,1,…,k. For all real a2,…,aka_2,\dots,a_ka2​,…,ak​,

max⁡r=0,1,…,k∣xr+a2xr2+⋯+akxrk∣≥1k.\max_{r=0,1,\dots,k}\big|x_r+a_2x_r^2+\dots+a_kx_r^k\big|\ge\frac1k .r=0,1,…,kmax​​xr​+a2​xr2​+⋯+ak​xrk​​≥k1​.

A polynomial with linear coefficient 111 cannot be uniformly small on the k+1k+1k+1 Chebyshev extreme points. The paper cites it as Corollary 2.7 of Dinur–Friedgut–Kindler–O'Donnell and uses it to find a grid angle where the main term of (37) is large.

Formalization Note. The maximum over a finite set is stated as the existence of an r∈{0,…,k}r\in\{0,\dots,k\}r∈{0,…,k} attaining the bound. Both the absolute value and the oddness of kkk are essential: for even k=6k=6k=6 the statement is false.

Preamble
import Mathlib
import Definitions.Def_QAOAE3Lin2_General_Setting
Formal statement
namespace QAOAE3Lin2.General

theorem eq_39 (k : ℕ) (hk : Odd k) (a : ℕ → ℝ) :
    ∃ r ∈ Finset.range (k + 1), 1 / (k : ℝ) ≤
      |Real.cos (Real.pi * r / k) + ∑ j ∈ Finset.Icc 2 k, a j * Real.cos (Real.pi * r / k) ^ j| := by sorry

end QAOAE3Lin2.General
Source
Farhi, Goldstone, Gutmann, A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem, arXiv:1412.6062v2, p. 8, Section II, (39) (citing Dinur, Friedgut, Kindler, O'Donnell, Corollary 2.7)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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