Sign-free kernel bound for the matrix integral inequality
OpenRybinAI2026.P01.matrix_integral_kernel_sum_le_maxLet and let be real symmetric positive definite matrices. Let be the unit sphere carrying the surface measure of the mission (the polar-decomposition measure toSphere of Lebesgue measure, without normalisation), and for a symmetric matrix write . Define the two kernel integrals
The statement asserts
where is the distance of CUHK-Shenzhen AI Math Problem 1.
Relation to the mission target. Since and both kernels share the denominator , the triangle inequality gives under the integral sign. Hence this statement implies the mission target RybinAI2026.P01.matrix_integral_inequality. It is a strengthening: it discards the possible cancellation between the two signed kernels and keeps only the two nonnegative ones.
Structure of the difficulty. Put , , , . Then and , where has total mass and is the analogous measure for . The pointwise bound settles the one-dimensional case and the case of proportional pairs, but and differ in general; the claim is that nevertheless.
Evidence. Numerical quadrature in dimension (about random quadruples plus adversarial hill-climbing) and dimension ( quadruples) found no violation; the ratio approaches only in the degenerate regime where one pair dominates the other. Two natural sufficient conditions are false and should not be attempted: the arithmetic-mean variant with (violations up to ), and stochastic dominance of the ratio pair under versus .
Formalization note. The integrals are iterated Bochner integrals against surfaceMeasure n, exactly as in the mission's definition distance; bilinear M u v is , and Matrix.PosDef includes symmetry. The hypothesis 0 < n mirrors the mission target.
import Definitions.Def_rybin2026_p01_matrix_integral open Matrix MeasureTheory
namespace RybinAI2026.P01
/-- Sign-free kernel form of the matrix integral inequality (conjectural strengthening). -/
theorem matrix_integral_kernel_sum_le_max
{n : ℕ} (hn : 0 < n)
(A B C D : Matrix (Fin n) (Fin n) ℝ)
(hA : A.PosDef) (hB : B.PosDef) (hC : C.PosDef) (hD : D.PosDef) :
(∫ u, ∫ v, |bilinear (A - C) u.1 v.1| /
(bilinear (A + B) u.1 u.1 * bilinear (C + D) v.1 v.1)
∂surfaceMeasure n ∂surfaceMeasure n) +
(∫ u, ∫ v, |bilinear (B - D) u.1 v.1| /
(bilinear (A + B) u.1 u.1 * bilinear (C + D) v.1 v.1)
∂surfaceMeasure n ∂surfaceMeasure n)
≤ max (distance A C) (distance B D) := by
sorry
end RybinAI2026.P01