Grothendieck's inequality for matrices #
Let a be a finite scalar matrix with |∑ i, ∑ j, a i j * s i * t j| ≤ C whenever all scalars
s i, t j have absolute value at most one. Grothendieck's inequality bounds
|∑ i, ∑ j, a i j * ⟪u i, v j⟫| by a universal constant times C, for all families of vectors of
norm at most one in any inner product space. We prove it with the constants κ_ℝ = 8 over the
reals and κ_𝕜 = 16 over any RCLike field; these constants are not optimal.
The real case #
The proof is the Gaussian truncation argument. By Matrix.innerProductSup_le_iff it suffices to
treat a finite-dimensional real inner product space E. Its vectors embed isometrically into
L² of the standard Gaussian measure on E by TauCeti.Probability.gaussianL2; write uᴹ for
the observable of u clipped at height M > 0. Splitting
⟪u, v⟫ = ⟪uᴹ, vᴹ⟫ + ⟪uᴹ, v - vᴹ⟫ + ⟪u - uᴹ, v⟫ in L²:
- the first part is the integral of
∑ i, ∑ j, a i j * uᵢᴹ(y) * vⱼᴹ(y), which is at mostC * M ^ 2pointwise because the clipped observables are bounded byM; - the clipping errors have
L²norm at most√3 / (4 * M), so the other two parts are bounded throughΓ(a) = Matrix.innerProductSup a, which applies in every real inner product space.
This gives the absorption inequality Γ(a) ≤ C * M ^ 2 + Γ(a) * √3 / (2 * M)
(Matrix.innerProductSup_le_mul_sq_add); at M = 2 it yields Γ(a) ≤ 8 * C.
The RCLike case #
Over an RCLike field, rotate the sum by a scalar ω of norm at most one to make it real and
nonnegative, and regard the space as a real inner product space via
InnerProductSpace.rclikeToReal. The real part of the rotated sum is the sum of two real
bilinear expressions, with coefficient matrices re (ω * a i j) and im (ω * a i j), both of
which inherit the scalar bound C. Applying the real inequality twice gives 16 * C.
Main declarations #
Matrix.abs_sum_sum_mul_mul_le_mul_sq: the scalar bound rescaled to scalars bounded byM.Matrix.innerProductSup_le_mul_sq_add: the absorption inequality.Matrix.innerProductSup_le_eight_mul:Γ(a) ≤ 8 * C.Matrix.abs_sum_sum_mul_inner_le_eight_mul: the real Grothendieck inequality in any real inner product space.Matrix.abs_sum_sum_map_mul_mul_mul_le: real-linear images of a rotatedRCLikematrix inherit its scalar bound.Matrix.norm_sum_sum_mul_inner_le_sixteen_mul: the Grothendieck inequality overRCLikescalars, in any inner product space.
References #
- F. Albiac and N. J. Kalton, Topics in Banach Space Theory, §8.1.
A bound C on |∑ i, ∑ j, a i j * s i * t j| for scalars of absolute value at most one
rescales to the bound C * M ^ 2 for scalars of absolute value at most M > 0.
The absorption inequality of the Gaussian truncation proof of Grothendieck's inequality: if
|∑ i, ∑ j, a i j * s i * t j| ≤ C for all scalars of absolute value at most one, then
Γ(a) ≤ C * M ^ 2 + Γ(a) * √3 / (2 * M) for every clipping height M > 0.
Grothendieck's inequality in terms of Γ(a) = Matrix.innerProductSup a: if
|∑ i, ∑ j, a i j * s i * t j| ≤ C for all real scalars of absolute value at most one, then
Γ(a) ≤ 8 * C.
Grothendieck's inequality over the reals, with constant κ_ℝ = 8: if
|∑ i, ∑ j, a i j * s i * t j| ≤ C for all real scalars of absolute value at most one, then
|∑ i, ∑ j, a i j * ⟪u i, v j⟫| ≤ 8 * C for all families of vectors of norm at most one in any
real inner product space.
If ‖∑ i, ∑ j, a i j * s i * t j‖ ≤ C for all scalars of norm at most one, then for every
ω of norm at most one and every real-linear functional φ with |φ z| ≤ ‖z‖ (such as re or
im), the real matrix φ (ω * a i j) satisfies the same bound C on real scalars of absolute
value at most one.
Grothendieck's inequality over an RCLike field, with constant κ_𝕜 = 16: if
‖∑ i, ∑ j, a i j * s i * t j‖ ≤ C for all scalars of norm at most one, then
‖∑ i, ∑ j, a i j * ⟪u i, v j⟫‖ ≤ 16 * C for all families of vectors of norm at most one in any
inner product space over 𝕜. Over ℝ, Matrix.abs_sum_sum_mul_inner_le_eight_mul gives the
constant 8.