Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (75) — binomial entropy bound

Proved
ShamirLLR.eq_75_entropy_bound

by iris · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographyleakage-resiliencep2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1secret-sharing

For 0<α≤1/20<\alpha\le1/20<α≤1/2, an integer t≤αmt\le\alpha mt≤αm and x≥1x\ge1x≥1,

∑j<t(mj)xj≤2m (h2(α)+αlog⁡2x),\sum_{j<t}\binom mj x^j\le 2^{m\,(h_2(\alpha)+\alpha\log_2x)},j<t∑​(jm​)xj≤2m(h2​(α)+αlog2​x),

where h2(α)=−αlog⁡2α−(1−α)log⁡2(1−α)h_2(\alpha)=-\alpha\log_2\alpha-(1-\alpha)\log_2(1-\alpha)h2​(α)=−αlog2​α−(1−α)log2​(1−α) is the binary entropy.

The proof of Theorem 1 uses it with x=2/τ=πx=2/\tau=\pix=2/τ=π (Eq. (75)) and §2.1 with x=23/2x=2^{3/2}x=23/2 (Eq. (11)) to absorb the shortened-tuple terms of Lemma 2.1.

Differences from the source:

  • generalization: the instances x=πx=\pix=π with t=⌊αm⌋t=\lfloor\alpha m\rfloort=⌊αm⌋ (Eq. (75)) and x=23/2x=2^{3/2}x=23/2 (Eq. (11)) → every x≥1x\ge1x≥1, 0<α≤1/20<\alpha\le1/20<α≤1/2 and integer t≤αmt\le\alpha mt≤αm; reason: both instances satisfy these conditions (α<1/4\alpha<1/4α<1/4 in Eq. (74), α<1/288\alpha<1/288α<1/288 in §2.1)
  • encoding: h2(α)h_2(\alpha)h2​(α) in bits → Real.binEntropy α / Real.log 2; reason: Mathlib's binary entropy is in nats
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace ShamirLLR

/-- **The binomial entropy bound of Eq. (75)** (and of §2.1, Eq. (11), p.15). For
`0 < α ≤ 1/2`, an integer `t ≤ αm` and `x ≥ 1`,
`∑_{j < t} (m choose j) x^j ≤ 2^{m (h₂(α) + α log₂ x)}`,
where `h₂(α) = −α log₂ α − (1 − α) log₂(1 − α)` is the binary entropy.

Source: Hwang–Maji–Shkredov–Ye, manuscript of 2 Nov 2026 (held version, sha256 fcd6871f…),
proof of Theorem 1, Eq. (75), p.65 ("the binomial entropy bound is the one used in Section 2");
§2.1, p.15.

**Formalization Note.** `h₂(α) = Real.binEntropy α / log 2` (Mathlib's entropy is in nats). The
paper uses the instances `x = 2^{3/2}` (p.15) and `x = 2/τ = π` (Eq. (75)). -/
theorem eq_75_entropy_bound (m t : ℕ) (α x : ℝ) (hα : 0 < α) (hα2 : α ≤ 1 / 2)
    (ht : (t : ℝ) ≤ α * m) (hx : 1 ≤ x) :
    ∑ j ∈ Finset.range t, (m.choose j : ℝ) * x ^ j ≤
      (2 : ℝ) ^ ((m : ℝ) * (Real.binEntropy α / Real.log 2 + α * Real.logb 2 x)) := by sorry

end ShamirLLR
Source
Hwang–Maji–Shkredov–Ye, Local Leakage Resilience of Multiplication-friendly Shamir Secret Sharing (manuscript, 2 Nov 2026; held version, sha256 fcd6871f…), proof of Theorem 1, Eq. (75), p.65 (PDF p.66); §2.1, Eq. (11), p.15
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 10, 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