Matrix integral inequality for integer Gram matrices with positive integer regularization
ProvedRybinAI2026.P01.matrix_integral_inequality_integer_gramintegral-inequalitymatrix-analysispositive-definite-matrices
Let the dimension be positive, let the common regularizer be a positive integer, and choose any four integer square matrices:
After embedding their entries into the reals, define
Using the spherical integral
with the mission's unnormalized surface measure, the assertion is
Every displayed matrix is symmetric positive definite, even when a Gram factor is singular. This is the integer Gram restriction of the original open problem. It is proposed as the unresolved arithmetic child of a common-denominator reduction of the rational Gram frontier; it is not claimed to be proved.
Preamble
import Definitions.Def_rybin2026_p01_matrix_integral open Matrix RybinAI2026.P01
Formal statement
theorem RybinAI2026.P01.matrix_integral_inequality_integer_gram
{n : ℕ} (hn : 0 < n) (m : ℤ) (hm : 0 < m)
(P Q R S : Matrix (Fin n) (Fin n) ℤ) :
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
sorrySource