Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(65), p. 1656 — Andréief's identity ∫det(f_j(x_k))det(g_j(x_k))Πdµ(x_k) = N!·det(∫f_jg_k dµ)

Proved
SpikedWishart.SoftEdge.eq_65

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

andreief-identitycauchy-binetdeterminantp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let μ\muμ be a σ\sigmaσ-finite measure on a measurable space XXX, N≥0N\ge0N≥0, and f1,…,fN,g1,…,gNf_1,\dots,f_N,g_1,\dots,g_Nf1​,…,fN​,g1​,…,gN​ real functions on XXX such that every product fjgkf_jg_kfj​gk​ is μ\muμ-integrable. Then

∫XNdet⁡(fj(xk))j,k=1N det⁡(gj(xk))j,k=1N∏k=1Ndμ(xk)=N! det⁡(∫Xfj(x)gk(x) dμ(x))j,k=1N.\int_{X^N}\det\big(f_j(x_k)\big)_{j,k=1}^N\,\det\big(g_j(x_k)\big)_{j,k=1}^N\prod_{k=1}^N d\mu(x_k)=N!\,\det\Big(\int_X f_j(x)g_k(x)\,d\mu(x)\Big)_{j,k=1}^N .∫XN​det(fj​(xk​))j,k=1N​det(gj​(xk​))j,k=1N​k=1∏N​dμ(xk​)=N!det(∫X​fj​(x)gk​(x)dμ(x))j,k=1N​.

This identity (Andréief, 1883) turns the NNN-fold integral of the eigenvalue density into a single N×NN\times NN×N determinant, the step from (64) to (66) in the proof of Proposition 2.1.

Formalization Note The printed (65) omits the factor N!N!N! on the left-hand side (it is absorbed into the constant C′C'C′ of (66)); the true identity is stated here.

Preamble
import Mathlib
open MeasureTheory
Formal statement
namespace SpikedWishart.SoftEdge

theorem eq_65 {α : Type*} [MeasurableSpace α] (μ : Measure α) [SigmaFinite μ] (N : ℕ)
    (f g : Fin N → α → ℝ) (hfg : ∀ j k, Integrable (fun x => f j x * g k x) μ) :
    ∫ x : Fin N → α, (Matrix.of fun j k => f j (x k)).det * (Matrix.of fun j k => g j (x k)).det
        ∂(Measure.pi fun _ => μ) =
      (N.factorial : ℝ) * (Matrix.of fun j k => ∫ y, f j y * g k y ∂μ).det := by sorry

end SpikedWishart.SoftEdge
Source
Baik, Ben Arous and Péché, Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices, Ann. Probab. 33 (2005), p. 1656, §2.1, (65)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · 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