Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gaussian and Rademacher scalar laws; Gaussian-series tail

Definition
TroppMatrixConcentration_ch4_scalar_laws

by tc · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-concentrationrandom-matrices

For a real function ggg on a measure space with measure μ\muμ, standardGaussianLaw μ g means its pushforward measure is the real Gaussian probability measure with mean zero and variance one. rademacherLaw μ g means its pushforward is 12δ1+12δ−1\tfrac12\delta_1+\tfrac12\delta_{-1}21​δ1​+21​δ−1​. Measurability is imposed separately in theorem statements. For a natural dimension ddd and real v,tv,tv,t, gaussianSeriesTail d v t is dexp⁡(−t2/(2v))d\exp(-t^2/(2v))dexp(−t2/(2v)) when v≠0v\ne0v=0. At v=0v=0v=0 it is ddd if t=0t=0t=0 and zero otherwise. Concentration statements use this expression only for v,t≥0v,t\ge0v,t≥0 and positive dimensions. The piecewise definition avoids totalized division in the zero-series case; it assumes no bound on any random matrix.

Definition code
import Definitions.Def_TroppMatrixConcentration_probability
import Mathlib.Probability.Distributions.Gaussian.Real

open MeasureTheory ProbabilityTheory

noncomputable section
namespace TroppMatrixConcentration

def standardGaussianLaw {Ω : Type*} [MeasurableSpace Ω]
    (μ : Measure Ω) (g : Ω → ℝ) : Prop :=
  Measure.map g μ = gaussianReal 0 1

def rademacherLaw {Ω : Type*} [MeasurableSpace Ω]
    (μ : Measure Ω) (r : Ω → ℝ) : Prop :=
  Measure.map r μ = (1 / 2 : ENNReal) • Measure.dirac (1 : ℝ) +
    (1 / 2 : ENNReal) • Measure.dirac (-1 : ℝ)

def gaussianSeriesTail (dimension : ℕ) (v t : ℝ) : ℝ :=
  if v = 0 then (if t = 0 then (dimension : ℝ) else 0)
  else (dimension : ℝ) * Real.exp (-(t ^ 2) / (2 * v))

end TroppMatrixConcentration
Source
Joel A. Tropp, An Introduction to Matrix Concentration Inequalities, arXiv:1501.01571v1 (7 January 2015); https://arxiv.org/abs/1501.01571v1; Section 2.2.2, printed p. 26; Theorem 4.1.1, equations (4.1.3–6), printed p. 42; Theorem 4.6.1, printed p. 51.
Read-back

What the Lean code literally says, in plain math · gpt-6

TroppMatrixConcentration.standardGaussianLaw: For any type Ω\OmegaΩ equipped with a measurable space, any measure μ\muμ on Ω\OmegaΩ, and any function g:Ω→Rg:\Omega\to\mathbb Rg:Ω→R, this predicate means that the pushforward of μ\muμ by ggg equals the Gaussian probability measure on the Borel real line with mean 000 and variance 111, namely the measure with Lebesgue density (2π)−1/2exp⁡(−x2/2)(2\pi)^{-1/2}\exp(-x^2/2)(2π)−1/2exp(−x2/2). Here pushforward is formed using a measurable representative equal to ggg almost everywhere when such a representative exists, and is defined to be the zero measure otherwise. No probability-measure or measurability assumption is imposed as an input; equality to the specified nonzero probability measure entails that ggg has such a representative and that μ(Ω)=1\mu(\Omega)=1μ(Ω)=1. The predicate is consequently false when μ\muμ is the zero measure, when Ω\OmegaΩ is empty, or when ggg is not almost everywhere measurable.

TroppMatrixConcentration.rademacherLaw: For any type Ω\OmegaΩ equipped with a measurable space, any measure μ\muμ on Ω\OmegaΩ, and any function r:Ω→Rr:\Omega\to\mathbb Rr:Ω→R, this predicate means that the pushforward of μ\muμ by rrr is 12δ1+12δ−1\tfrac12\delta_1+\tfrac12\delta_{-1}21​δ1​+21​δ−1​ on the Borel real line, where δa\delta_aδa​ is the Dirac probability measure at aaa and both weights are the finite number 1/21/21/2 in the extended nonnegative reals. Thus the specified measure places mass 1/21/21/2 at each of 111 and −1-1−1 and no mass elsewhere. Here pushforward is formed using a measurable representative equal to rrr almost everywhere when such a representative exists, and is defined to be the zero measure otherwise. No probability-measure or measurability assumption is imposed as an input; the predicate entails that rrr is almost everywhere measurable and that μ(Ω)=1\mu(\Omega)=1μ(Ω)=1, and it is false for a zero measure, an empty domain, or a function that is not almost everywhere measurable.

TroppMatrixConcentration.gaussianSeriesTail: For every natural number ddd, including 000, and every pair of real numbers v,tv,tv,t, this defines a real number equal to ddd if v=0v=0v=0 and t=0t=0t=0, equal to 000 if v=0v=0v=0 and t≠0t\ne0t=0, and equal to dexp⁡(−t2/(2v))d\exp(-t^2/(2v))dexp(−t2/(2v)) if v≠0v\ne0v=0, with ddd interpreted as a real number. There are no sign restrictions on vvv or ttt: the exponential branch applies also to negative vvv, and both positive and negative ttt are admitted. The value is 000 for every v,tv,tv,t when d=0d=0d=0, and is ddd for every vvv when t=0t=0t=0; the explicit v=0v=0v=0 branch fixes the value there without evaluating the displayed quotient.

Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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