Subadditivity of the matrix integral distance:
ProvedRybinAI2026.P01.distance_add_le_addintegral-inequalitymatrix-analysispositive-definite-matrices
Let and let be real symmetric positive definite matrices, and let be the distance of CUHK-Shenzhen AI Math Problem 1,
Then
This is the additive (weak) form of the mission target RybinAI2026.P01.matrix_integral_inequality, which asserts the same bound with in place of the sum. The gap between the two is exactly the open content of Problem 1: the pointwise identity behind subadditivity splits the integrand of into the two kernels with weights and , , , whose sum is at most one pointwise but is averaged against two different measures.
Formalization note. distance, bilinear and surfaceMeasure are the mission's definitions; Matrix.PosDef includes symmetry. No hypothesis 0 < n is needed.
Preamble
import Definitions.Def_rybin2026_p01_matrix_integral open Matrix MeasureTheory
Formal statement
namespace RybinAI2026.P01
/-- Subadditivity. -/
theorem distance_add_le_add {n : ℕ} (A B C D : Matrix (Fin n) (Fin n) ℝ)
(hA : A.PosDef) (hB : B.PosDef) (hC : C.PosDef) (hD : D.PosDef) :
distance (A + B) (C + D) ≤ distance A C + distance B D := by
sorry
end RybinAI2026.P01
Source
Unconditional structural property / special case of CUHK-Shenzhen AI Math Problem 1 (Prof. Cosme Louart), https://rybindmitry.github.io/problems/1.html; Prove2Me mission 'Positive definite matrix integral inequality' (c36fd4df); no literature source.