Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Case r=1r=1r=1 of Edelman's bound: P{∥g∥2≤t}\mathbb P\{\|g\|^2\le t\}P{∥g∥2≤t} is the χk2\chi^2_kχk2​ integral (equality)

Proved
GaussianMatrix.wishart_lambda_min_cdf_rank_one

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

chi-square-distributiongaussian-vectorpolar-coordinatesprobabilitysmallest-singular-value

Let k≥1k\ge1k≥1 and t≥0t\ge0t≥0. Let g=(g1,…,gk)g=(g_1,\dots,g_k)g=(g1​,…,gk​) be a standard Gaussian vector, viewed as a 1×k1\times k1×k Gaussian matrix GGG, so that λmin⁡(GG⊤)=σmin⁡(G⊤)2=∥g∥22\lambda_{\min}(GG^\top)=\sigma_{\min}(G^\top)^2=\|g\|_2^2λmin​(GG⊤)=σmin​(G⊤)2=∥g∥22​. Then

P{λmin⁡(GG⊤)≤t}=∫0t2(k−2)/2 Γ ⁣(k+12)Γ ⁣(12) Γ(k) λ(k−2)/2e−λ/2 dλ=∫0tλk/2−1e−λ/22k/2Γ(k/2) dλ.\mathbb P\big\{\lambda_{\min}(GG^\top)\le t\big\}=\int_0^t \frac{2^{(k-2)/2}\,\Gamma\!\big(\frac{k+1}{2}\big)}{\Gamma\!\big(\frac12\big)\,\Gamma(k)}\,\lambda^{(k-2)/2}e^{-\lambda/2}\,d\lambda=\int_0^t\frac{\lambda^{k/2-1}e^{-\lambda/2}}{2^{k/2}\Gamma(k/2)}\,d\lambda .P{λmin​(GG⊤)≤t}=∫0t​Γ(21​)Γ(k)2(k−2)/2Γ(2k+1​)​λ(k−2)/2e−λ/2dλ=∫0t​2k/2Γ(k/2)λk/2−1e−λ/2​dλ.

The two integrands agree by Legendre's duplication formula.

This is the χk2\chi^2_kχk2​ law of ∥g∥2\|g\|^2∥g∥2. It is exactly Edelman's density bound (wishart_lambda_min_cdf_density_bound) in the case r=1r=1r=1, where the bound holds with equality. It serves as a proved sanity check that the constant cr,kc_{r,k}cr,k​ in that statement is the right one; it is not needed by the reduction of wishart_lambda_min_tail.

Formalization Note. gaussianMatrix 1 k is the product law on Fin 1 → Fin k → ℝ. The right-hand side is a lintegral over (0,t](0,t](0,t]. The constant is written exactly as the r=1r=1r=1 instance of the general constant cr,kc_{r,k}cr,k​, after simplifying k−1−1=k−2k-1-1=k-2k−1−1=k−2 and k−1+1=kk-1+1=kk−1+1=k.

Preamble
import Definitions.Def_GaussianMatrix_basic

open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
namespace GaussianMatrix

theorem wishart_lambda_min_cdf_rank_one {k : ℕ} (hk : 1 ≤ k) (t : ℝ) (ht : 0 ≤ t) :
    (gaussianMatrix 1 k) {G | sMin (Matrix.of G)ᵀ ^ 2 ≤ t}
      = ∫⁻ x in Set.Ioc 0 t, ENNReal.ofReal
          (2 ^ (((k : ℝ) - 2) / 2) * Real.Gamma (((k : ℝ) + 1) / 2)
              / (Real.Gamma (1 / 2) * Real.Gamma (k : ℝ))
            * x ^ (((k : ℝ) - 2) / 2) * Real.exp (-x / 2)) := by sorry

end GaussianMatrix
Source
standard fact: if g ~ N(0, I_k) then ‖g‖² ~ χ²_k, with density λ^{k/2−1}e^{−λ/2}/(2^{k/2}Γ(k/2)) on (0, ∞) (e.g. N. L. Johnson, S. Kotz, N. Balakrishnan, Continuous Univariate Distributions, Vol. 1, 2nd ed., Ch. 18). This is the case r = 1 of Edelman 1988, Prop. 5.1 / Tropp–Webber (B.5), where the bound is an equality.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me