Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1 — power-sum ratio bound

Proved
WangRenyiEntropy.Noninteger.power_sum_ratio

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

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1renyi-entropystatistical-estimation

Let α>1/2\alpha>1/2α>1/2, α≠1\alpha\ne1α=1 be any real order, including positive integers, and let ppp be any probability law on an alphabet of size d≥1d\ge1d≥1. Then

F2α−1(p)Fα(p)2≤d∣1−1/α∣.\frac{F_{2\alpha-1}(p)}{F_\alpha(p)^2}\le d^{|1-1/\alpha|}.Fα​(p)2F2α−1​(p)​≤d∣1−1/α∣.

Both power sums have positive order and the denominator is positive by normalization. The bound controls the relative-variance contribution without excluding zero coordinates or singleton alphabets.

Differences from the source:

  • encoding: finite alphabet and nonnegative normalized real probability coordinates → Fin d with d ≥ 1 and the published IsLaw predicate, allowing zero coordinates; reason: relabeling preserves every finite nonempty alphabet and every probability law
Preamble
import Mathlib
import Definitions.Def_WangRenyiEntropy_Noninteger_SamplingExperiment
Formal statement
namespace WangRenyiEntropy.Noninteger

/-- Lemma 2.1, printed p.6 / PDF p.8. No noninteger restriction. -/
theorem power_sum_ratio (α : ℝ) (hα : 1 / 2 < α) (hα1 : α ≠ 1)
    (d : ℕ) (hd : 1 ≤ d) (p : Law d) :
    powerSum (2 * α - 1) p / (powerSum α p) ^ 2 ≤ Real.rpow d |1 - 1 / α| := by sorry

end WangRenyiEntropy.Noninteger
Source
Qisheng Wang, STOC 2027 submission #447 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/447.pdf, printed 6 / PDF 8, Lemma 2.1
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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