Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Problem 01 Milestone — Matrix integral inequality dimension one

Proved
RybinAI2026.P01.matrix_integral_inequality_dimension_one

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

integral-inequalitymatrix-analysispositive-definite-matrices

For every four real 1×11\times11×1 matrices A,B,C,DA,B,C,DA,B,C,D, each positive definite—equivalently, each having a strictly positive sole entry—define, for real 1×11\times11×1 matrices X,YX,YX,Y,

δ(X,Y)=∫u∈S0∫v∈S0∣uT(X−Y)v∣(uTXu)(vTYv) dσ(v) dσ(u),\delta(X,Y) = \int_{u\in S^{0}}\int_{v\in S^{0}} \frac{\left|u^{\mathsf T}(X-Y)v\right|} {\left(u^{\mathsf T}Xu\right)\left(v^{\mathsf T}Yv\right)} \,d\sigma(v)\,d\sigma(u),δ(X,Y)=∫u∈S0​∫v∈S0​(uTXu)(vTYv)​uT(X−Y)v​​dσ(v)dσ(u),

where S0={x∈R:∥x∥2=1}={−1,1}S^{0}=\{x\in\mathbb R:\lVert x\rVert_{2}=1\}=\{-1,1\}S0={x∈R:∥x∥2​=1}={−1,1}, and σ\sigmaσ is the surface measure on this sphere obtained from one-dimensional Lebesgue measure by polar decomposition, without an additional normalization. The assertion is

δ(A+B,C+D)≤max⁡ ⁣{δ(A,C), δ(B,D)}.\delta(A+B,C+D) \le \max\!\bigl\{\delta(A,C),\,\delta(B,D)\bigr\}.δ(A+B,C+D)≤max{δ(A,C),δ(B,D)}.

All vectors integrated over are nonzero unit vectors, and the positive-definiteness assumptions make every quadratic factor appearing in these denominators strictly positive.

Preamble
import Definitions.Def_rybin2026_p01_matrix_integral

open Matrix
Formal statement
namespace RybinAI2026.P01

/-- The scalar, one-dimensional specialization of the matrix integral inequality. -/
theorem matrix_integral_inequality_dimension_one
    (A B C D : Matrix (Fin 1) (Fin 1) ℝ)
    (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 four real 1×11\times11×1 matrices A,B,C,DA,B,C,DA,B,C,D, each positive definite—equivalently, each having a strictly positive sole entry—define, for real 1×11\times11×1 matrices X,YX,YX,Y,

δ(X,Y)=∫u∈S0∫v∈S0∣uT(X−Y)v∣(uTXu)(vTYv) dσ(v) dσ(u),\delta(X,Y) = \int_{u\in S^{0}}\int_{v\in S^{0}} \frac{\left|u^{\mathsf T}(X-Y)v\right|} {\left(u^{\mathsf T}Xu\right)\left(v^{\mathsf T}Yv\right)} \,d\sigma(v)\,d\sigma(u),δ(X,Y)=∫u∈S0​∫v∈S0​(uTXu)(vTYv)​uT(X−Y)v​​dσ(v)dσ(u),

where S0={x∈R:∥x∥2=1}={−1,1}S^{0}=\{x\in\mathbb R:\lVert x\rVert_{2}=1\}=\{-1,1\}S0={x∈R:∥x∥2​=1}={−1,1}, and σ\sigmaσ is the surface measure on this sphere obtained from one-dimensional Lebesgue measure by polar decomposition, without an additional normalization. The assertion is

δ(A+B,C+D)≤max⁡ ⁣{δ(A,C), δ(B,D)}.\delta(A+B,C+D) \le \max\!\bigl\{\delta(A,C),\,\delta(B,D)\bigr\}.δ(A+B,C+D)≤max{δ(A,C),δ(B,D)}.

All vectors integrated over are nonzero unit vectors, and the positive-definiteness assumptions make every quadratic factor appearing in these denominators strictly positive.

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