Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tensorized entropy inequality on a finite Bernoulli cube

Proved
TalagrandCore.entropy_tensor_psi

by Harry_Xu · Aug 13, 2026 · Mathlib c5ea003 (Lean v4.30.0)

concentration-inequalitiesempirical-processesprobabilitytalagrand

Let μp\mu_pμp​ be the product Bernoulli measure on a finite Boolean cube, let ZZZ be a real-valued function, and for each coordinate xxx let cxc_xcx​ be independent of that coordinate. With ψ(u)=e−u−1+u\psi(u)=e^{-u}-1+uψ(u)=e−u−1+u, the entropy of eλZe^{\lambda Z}eλZ satisfies

λ E[ZeλZ]−E[eλZ]log⁡E[eλZ]≤∑xE ⁣[eλZψ ⁣(λ(Z−cx))].\lambda\,\mathbb E[Ze^{\lambda Z}]-\mathbb E[e^{\lambda Z}]\log\mathbb E[e^{\lambda Z}] \le \sum_x\mathbb E\!\left[e^{\lambda Z}\psi\!\left(\lambda(Z-c_x)\right)\right].λE[ZeλZ]−E[eλZ]logE[eλZ]≤x∑​E[eλZψ(λ(Z−cx​))].

This is the finite-product entropy tensorization interface used by both tails of the Talagrand argument.

Formalization Note Expectations are exact weighted sums on the Boolean cube, and coordinate independence is expressed by FiberConst.

Preamble
import Definitions.Def_talagrand_finite_bool_core
open MeasureTheory
open scoped Classical BigOperators
Formal statement
namespace TalagrandCore

variable {κ ι : Type} [DecidableEq κ] [Fintype κ]
variable [Fintype ι] [Nonempty ι]

theorem entropy_tensor_psi (p : NNReal) (hp : p ≤ 1)
    (Z : (κ → Bool) → ℝ) (lam : ℝ)
    (c : κ → (κ → Bool) → ℝ) (hc : ∀ x, FiberConst x (c x)) :
    lam * Ex (p : ℝ) (fun ω => Z ω * Real.exp (lam * Z ω)) -
      Ex (p : ℝ) (fun ω => Real.exp (lam * Z ω)) *
        Real.log (Ex (p : ℝ) (fun ω => Real.exp (lam * Z ω))) ≤
      ∑ x : κ, Ex (p : ℝ)
        (fun ω => Real.exp (lam * Z ω) * psi (lam * (Z ω - c x ω))) := by sorry

end TalagrandCore
Source
Michel Ledoux, On Talagrand’s deviation inequalities for product measures, ESAIM Probability and Statistics 1 (1996), Theorems 2.4–2.5, pp. 63–87. Formal Lean proof extracted from Prove2Me accepted submission bf106d23-ff42-48f5-a837-a8528101c849 by tianyipeng.

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