Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integer Gram inequality below the proved regularization threshold

Proved
RybinAI2026.P01.matrix_integral_inequality_integer_gram_small_regularizer

by Wenqian Xing · Sep 6, 2026 · Mathlib c5ea003 (Lean v4.30.0)

integral-inequalitymatrix-analysispositive-definite-matrices

Let the dimension be positive, and let the four Gram factors have integer entries:

n>0,P,Q,R,S∈Zn×n.n>0,\qquad P,Q,R,S\in\mathbb Z^{n\times n}.n>0,P,Q,R,S∈Zn×n.

For a positive integer regularizer, embed the factors into the reals and put

A=PTP+mIn,B=QTQ+mIn,C=RTR+mIn,D=STS+mIn,m∈Z>0.A=P^{\mathsf T}P+mI_n,\quad B=Q^{\mathsf T}Q+mI_n,\quad C=R^{\mathsf T}R+mI_n,\quad D=S^{\mathsf T}S+mI_n,\qquad m\in\mathbb Z_{>0}.A=PTP+mIn​,B=QTQ+mIn​,C=RTR+mIn​,D=STS+mIn​,m∈Z>0​.

Their total squared Frobenius norm is

E=∑i,j(Pij2+Qij2+Rij2+Sij2).E=\sum_{i,j}(P_{ij}^2+Q_{ij}^2+R_{ij}^2+S_{ij}^2).E=i,j∑​(Pij2​+Qij2​+Rij2​+Sij2​).

Here the spherical integral uses the mission's unnormalized surface measure and is defined by

d(X,Y)=∫Sn−1∫Sn−1∣uT(X−Y)v∣(uTXu)(vTYv) dσ(v) dσ(u).d(X,Y)=\int_{S^{n-1}}\int_{S^{n-1}} \frac{|u^{\mathsf T}(X-Y)v|}{(u^{\mathsf T}Xu)(v^{\mathsf T}Yv)} \,d\sigma(v)\,d\sigma(u).d(X,Y)=∫Sn−1​∫Sn−1​(uTXu)(vTYv)∣uT(X−Y)v∣​dσ(v)dσ(u).

Assume the complementary regularization condition

0<m<3E.0<m<3E.0<m<3E.

The assertion is the original maximum inequality:

d(A+B,C+D)≤max⁡{d(A,C),d(B,D)}.d(A+B,C+D)\leq\max\{d(A,C),d(B,D)\}.d(A+B,C+D)≤max{d(A,C),d(B,D)}.

This is the unresolved complementary case after establishing the large-regularizer average bound. For each fixed quadruple of integer Gram factors, this range contains only finitely many positive integer regularizers. The statement is proposed as an open child, not as a proved result.

Preamble
import Definitions.Def_rybin2026_p01_matrix_integral

open Matrix RybinAI2026.P01
open scoped BigOperators
Formal statement
theorem RybinAI2026.P01.matrix_integral_inequality_integer_gram_small_regularizer
    {n : ℕ} (hn : 0 < n) (m : ℤ) (hm : 0 < m)
    (P Q R S : Matrix (Fin n) (Fin n) ℤ)
    (hsmall : (m : ℝ) < 3 * (∑ i : Fin n, ∑ j : Fin n,
      ((P i j : ℝ)^2 + (Q i j : ℝ)^2 + (R i j : ℝ)^2 + (S i j : ℝ)^2))) :
    let p : Matrix (Fin n) (Fin n) ℝ := P.map (fun q : ℤ => (q : ℝ))
    let q : Matrix (Fin n) (Fin n) ℝ := Q.map (fun q : ℤ => (q : ℝ))
    let r : Matrix (Fin n) (Fin n) ℝ := R.map (fun q : ℤ => (q : ℝ))
    let s : Matrix (Fin n) (Fin n) ℝ := S.map (fun q : ℤ => (q : ℝ))
    let A := p.transpose * p + (m : ℝ) • 1
    let B := q.transpose * q + (m : ℝ) • 1
    let C := r.transpose * r + (m : ℝ) • 1
    let D := s.transpose * s + (m : ℝ) • 1
    distance (A + B) (C + D) ≤ max (distance A C) (distance B D) := by
  sorry
Source
https://rybindmitry.github.io/problems/1.html, Problem 1, displayed integral definition and matrix-addition inequality. This is a derived restriction of the original problem to positive integer regularization below three times the total squared Frobenius norm; it is the complementary case in the submitted proof-sketch.

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