Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rademacher contraction from squared to linear coordinate sums

Proved
TalagrandCore.contraction_main

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

concentration-inequalitiesempirical-processesprobabilitytalagrand

For coefficients ua(x)u_a(x)ua​(x) bounded by one in absolute value, replacing selected signed quadratic terms by twice the corresponding signed linear terms can only increase the expected finite supremum. In particular,

Eεmax⁡a(∑x∈Sεxua(x)2+∑x∉S2εxua(x))≤Eεmax⁡a∑x2εxua(x).\mathbb E_\varepsilon\max_a\left(\sum_{x\in S}\varepsilon_xu_a(x)^2+ \sum_{x\notin S}2\varepsilon_xu_a(x)\right) \le \mathbb E_\varepsilon\max_a\sum_x2\varepsilon_xu_a(x).Eε​amax​​x∈S∑​εx​ua​(x)2+x∈/S∑​2εx​ua​(x)​≤Eε​amax​x∑​2εx​ua​(x).

This is the induction form of the Rademacher contraction principle needed for the variance-process bound.

Formalization Note Rademacher signs are encoded by Boolean coordinates with parameter 1/21/21/2.

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 contraction_main (u : ι → κ → ℝ) (hu : ∀ a x, |u a x| ≤ 1) (S : Finset κ) :
    Ex (1/2 : ℝ) (fun s : κ → Bool =>
        Finset.univ.sup' Finset.univ_nonempty (fun a : ι =>
          (∑ x ∈ S, sg (s x) * u a x ^ 2) + ∑ x ∈ Sᶜ, sg (s x) * (2 * u a x))) ≤
      Ex (1/2 : ℝ) (fun s : κ → Bool =>
        Finset.univ.sup' Finset.univ_nonempty
          (fun a : ι => ∑ x : κ, sg (s x) * (2 * u a 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