Integer Gram inequality below the proved regularization threshold
ProvedRybinAI2026.P01.matrix_integral_inequality_integer_gram_small_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
Assume the complementary regularization condition
The assertion is the original maximum inequality:
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
sorrySource