Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convolution of Gaussians: N(μ,v)∗N(ν,w)=N(μ+ν,v+w)\mathcal{N}(\mu,v)*\mathcal{N}(\nu,w)=\mathcal{N}(\mu+\nu,v+w)N(μ,v)∗N(ν,w)=N(μ+ν,v+w)

Proved
StatUnlearn.gaussianReal_conv_gaussianReal

by 2017Advanced@ · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

measure-theoryprobabilitystatistics

For real means μ,ν\mu,\nuμ,ν and variances v,w≥0v,w\ge0v,w≥0, the convolution of the two Gaussians on the line is Gaussian with the parameters added:

N(μ,v)∗N(ν,w)=N(μ+ν, v+w).\mathcal{N}(\mu,v)*\mathcal{N}(\nu,w)=\mathcal{N}(\mu+\nu,\ v+w).N(μ,v)∗N(ν,w)=N(μ+ν, v+w).

In other words, the Gaussian family is closed under convolution: adding independent Gaussian noise to a Gaussian observation yields another Gaussian, with the variances adding. The proof identifies both sides by their characteristic functions — φN(μ,v)(t)=eitμ−vt2/2\varphi_{\mathcal{N}(\mu,v)}(t)=e^{it\mu-vt^2/2}φN(μ,v)​(t)=eitμ−vt2/2, the characteristic function of a convolution is the product of the characteristic functions, and two finite Borel measures on the line with the same characteristic function coincide — after which the identity reduces to the exponential law eAeB=eA+Be^Ae^B=e^{A+B}eAeB=eA+B.

This is the algebraic fact that makes "add independent noise" a Markov kernel on the Gaussian baselines. It is what converts the data-processing inequality for trade-off functions into monotonicity in the shift parameter: from N(μ,v)\mathcal{N}(\mu,v)N(μ,v) and N(ν,v)\mathcal{N}(\nu,v)N(ν,v) one can reach a pair of Gaussians with a smaller separation, never a larger one.

Preamble
import Mathlib.Probability.Distributions.Gaussian.Real
import Mathlib.MeasureTheory.Measure.CharacteristicFunction
open MeasureTheory ProbabilityTheory
Formal statement
namespace StatUnlearn

theorem gaussianReal_conv_gaussianReal (μ ν : ℝ) (v w : NNReal) :
    (gaussianReal μ v).conv (gaussianReal ν w) = gaussianReal (μ + ν) (v + w) := by
  sorry

end StatUnlearn
Source
Pandey, Kulkarni, "Statistical Unlearning of Distributions: A Hypothesis Testing Approach", arXiv:2605.16645, Appendix A.2, Lemma A.1 (`lem: GTOF`): the closure of the Gaussian baselines under adding independent noise, used for monotonicity (A.1)

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