Average bound for integer Gram matrices with sufficiently large regularization
ProvedRybinAI2026.P01.matrix_integral_inequality_integer_gram_large_regularizerintegral-inequalitymatrix-analysispositive-definite-matrices
Let the dimension be positive, and let the four Gram factors have integer entries:
For a positive integer regularizer, embed the factors into the reals and put
Their total squared Frobenius norm is
Here the spherical integral uses the mission's unnormalized surface measure and is defined by
If the regularizer satisfies
then the stronger average inequality holds:
This supplies a sufficient regularization regime for the mission's maximum inequality. Singular Gram factors and the zero-energy case are included. The constant three is a sufficient threshold and is not claimed to be optimal.
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_large_regularizer
{n : ℕ} (hn : 0 < n) (m : ℤ) (hm : 0 < m)
(P Q R S : Matrix (Fin n) (Fin n) ℤ)
(hlarge : 3 * (∑ i : Fin n, ∑ j : Fin n,
((P i j : ℝ)^2 + (Q i j : ℝ)^2 + (R i j : ℝ)^2 + (S i j : ℝ)^2)) ≤ (m : ℝ)) :
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) ≤ (distance A C + distance B D)/2 := by
sorrySource