Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Problem 01 Goal — Matrix integral inequality

Open
RybinAI2026.P01.matrix_integral_inequality

by wenxinzhang · Sep 4, 2026 · Mathlib c5ea003 (Lean v4.30.0)

integral-inequalitymatrix-analysispositive-definite-matrices

For every natural number n>0n>0n>0 (including n=1n=1n=1), let En=RnE_n=\mathbb{R}^nEn​=Rn with its Euclidean norm, let Sn={u∈En:∥u∥2=1}S_n=\{u\in E_n:\lVert u\rVert_2=1\}Sn​={u∈En​:∥u∥2​=1}, and let σn\sigma_nσn​ be the measure on SnS_nSn​ obtained by applying the polar-decomposition construction toSphere⁡\operatorname{toSphere}toSphere to Lebesgue volume on EnE_nEn​, without probability normalization. For a real n×nn\times nn×n matrix MMM, define βM(u,v)=uTMv=∑i=0n−1∑j=0n−1uiMijvj\beta_M(u,v)=u^{\mathsf T}Mv=\sum_{i=0}^{n-1}\sum_{j=0}^{n-1}u_iM_{ij}v_jβM​(u,v)=uTMv=∑i=0n−1​∑j=0n−1​ui​Mij​vj​, and, for arbitrary real n×nn\times nn×n matrices X,YX,YX,Y, define the total-valued quantity

Dn(X,Y)=∫Sn ⁣(∫Sn∣βX−Y(u,v)∣βX(u,u) βY(v,v) dσn(v))dσn(u).D_n(X,Y)=\int_{S_n}\!\left(\int_{S_n} \frac{\left|\beta_{X-Y}(u,v)\right|} {\beta_X(u,u)\,\beta_Y(v,v)} \,d\sigma_n(v)\right)d\sigma_n(u).Dn​(X,Y)=∫Sn​​(∫Sn​​βX​(u,u)βY​(v,v)∣βX−Y​(u,v)∣​dσn​(v))dσn​(u).

Then, for every four real n×nn\times nn×n matrices A,B,C,DA,B,C,DA,B,C,D such that, for each M∈{A,B,C,D}M\in\{A,B,C,D\}M∈{A,B,C,D}, every nonzero x∈Enx\in E_nx∈En​ satisfies xTMx>0x^{\mathsf T}Mx>0xTMx>0, one has

Dn(A+B,C+D)≤max⁡ ⁣(Dn(A,C),Dn(B,D)).D_n(A+B,C+D)\le \max\!\bigl(D_n(A,C),D_n(B,D)\bigr).Dn​(A+B,C+D)≤max(Dn​(A,C),Dn​(B,D)).

Matrix addition and subtraction here are entrywise; in particular, the numerator on the left uses (A+B)−(C+D)(A+B)-(C+D)(A+B)−(C+D). No symmetry assumptions are stated separately. Since unit vectors are nonzero, the positivity hypotheses make every denominator occurring in these three quantities strictly positive, including those involving A+BA+BA+B and C+DC+DC+D. The statement nevertheless contains no explicit measurability or integrability assumptions: the integrals are Lean’s totalized Lebesgue integrals, which take the value 000 when the relevant function is not integrable; likewise, the underlying real division is total and assigns a/0=0a/0=0a/0=0, although zero denominators do not occur under the stated hypotheses.

Preamble
import Definitions.Def_rybin2026_p01_matrix_integral

open Matrix
Formal statement
namespace RybinAI2026.P01

/-- The positive-definite matrix integral is nonexpansive under componentwise addition. -/
theorem matrix_integral_inequality
    {n : ℕ} (hn : 0 < n)
    (A B C D : Matrix (Fin n) (Fin n) ℝ)
    (hA : A.PosDef) (hB : B.PosDef) (hC : C.PosDef) (hD : D.PosDef) :
    distance (A + B) (C + D) ≤ max (distance A C) (distance B D) := by
  sorry

end RybinAI2026.P01
Source
https://rybindmitry.github.io/problems/1.html
Read-back

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

For every natural number n>0n>0n>0 (including n=1n=1n=1), let En=RnE_n=\mathbb{R}^nEn​=Rn with its Euclidean norm, let Sn={u∈En:∥u∥2=1}S_n=\{u\in E_n:\lVert u\rVert_2=1\}Sn​={u∈En​:∥u∥2​=1}, and let σn\sigma_nσn​ be the measure on SnS_nSn​ obtained by applying the polar-decomposition construction toSphere⁡\operatorname{toSphere}toSphere to Lebesgue volume on EnE_nEn​, without probability normalization. For a real n×nn\times nn×n matrix MMM, define βM(u,v)=uTMv=∑i=0n−1∑j=0n−1uiMijvj\beta_M(u,v)=u^{\mathsf T}Mv=\sum_{i=0}^{n-1}\sum_{j=0}^{n-1}u_iM_{ij}v_jβM​(u,v)=uTMv=∑i=0n−1​∑j=0n−1​ui​Mij​vj​, and, for arbitrary real n×nn\times nn×n matrices X,YX,YX,Y, define the total-valued quantity

Dn(X,Y)=∫Sn ⁣(∫Sn∣βX−Y(u,v)∣βX(u,u) βY(v,v) dσn(v))dσn(u).D_n(X,Y)=\int_{S_n}\!\left(\int_{S_n} \frac{\left|\beta_{X-Y}(u,v)\right|} {\beta_X(u,u)\,\beta_Y(v,v)} \,d\sigma_n(v)\right)d\sigma_n(u).Dn​(X,Y)=∫Sn​​(∫Sn​​βX​(u,u)βY​(v,v)∣βX−Y​(u,v)∣​dσn​(v))dσn​(u).

Then, for every four real n×nn\times nn×n matrices A,B,C,DA,B,C,DA,B,C,D such that, for each M∈{A,B,C,D}M\in\{A,B,C,D\}M∈{A,B,C,D}, every nonzero x∈Enx\in E_nx∈En​ satisfies xTMx>0x^{\mathsf T}Mx>0xTMx>0, one has

Dn(A+B,C+D)≤max⁡ ⁣(Dn(A,C),Dn(B,D)).D_n(A+B,C+D)\le \max\!\bigl(D_n(A,C),D_n(B,D)\bigr).Dn​(A+B,C+D)≤max(Dn​(A,C),Dn​(B,D)).

Matrix addition and subtraction here are entrywise; in particular, the numerator on the left uses (A+B)−(C+D)(A+B)-(C+D)(A+B)−(C+D). No symmetry assumptions are stated separately. Since unit vectors are nonzero, the positivity hypotheses make every denominator occurring in these three quantities strictly positive, including those involving A+BA+BA+B and C+DC+DC+D. The statement nevertheless contains no explicit measurability or integrability assumptions: the integrals are Lean’s totalized Lebesgue integrals, which take the value 000 when the relevant function is not integrable; likewise, the underlying real division is total and assigns a/0=0a/0=0a/0=0, although zero denominators do not occur under the stated hypotheses.

Human review
  • Endorsed by Shuze Chen · Sep 4, 2026

  • Endorsed by wenxinzhang · Sep 4, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me