Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1.7, pp. 12–13 — f₀(γ) ≥ 0 for γ ≥ 1 (inequality (23))

Proved
UniversalBarrier.NSC.f0_nonneg

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

moment-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-inequality

Let k≥2k\ge2k≥2 be an integer and γ≥1\gamma\ge1γ≥1. Then

f0(γ)=k(γk−1)[k(k+1)(γk+2−1)−2k(k+2)(γk+1−1)+(k+1)(k+2)(γk−1)]−(k+1)[k(γk+1−1)−(k+1)(γk−1)]2 ≥ 0.f_0(\gamma)=k(\gamma^k-1)\bigl[k(k+1)(\gamma^{k+2}-1)-2k(k+2)(\gamma^{k+1}-1)+(k+1)(k+2)(\gamma^k-1)\bigr]-(k+1)\bigl[k(\gamma^{k+1}-1)-(k+1)(\gamma^k-1)\bigr]^2\ \ge\ 0.f0​(γ)=k(γk−1)[k(k+1)(γk+2−1)−2k(k+2)(γk+1−1)+(k+1)(k+2)(γk−1)]−(k+1)[k(γk+1−1)−(k+1)(γk−1)]2 ≥ 0.

This is the algebraic inequality (23) cleared of denominators; it completes the proof of inequality (11), the equivalent form of Proposition 1's inequality (5).

Preamble
import Mathlib
import Definitions.Def_UniversalBarrier_NSC_Model
Formal statement
namespace UniversalBarrier.NSC

theorem f0_nonneg (k : ℕ) (hk : 2 ≤ k) (γ : ℝ) (hγ : 1 ≤ γ) : 0 ≤ f0 k γ := by sorry

end UniversalBarrier.NSC
Source
Lee & Yue, Universal Barrier is n-Self-Concordant, arXiv:1809.03011v4, pp. 12–13, §4.1.7, inequality (23) and the definition of f0
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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