The cyclic Hlawka bound for real symmetric operators when p ≥ 256
OpenHlawkaSchatten.SchattenSharpness.realSymmetric_cyclic_bound256Let be a finite-dimensional real inner-product space, of any dimension. A linear map is symmetric if for all ; in an orthonormal basis it is a real symmetric matrix. For real its Schatten norm is
where are the singular values of ; for symmetric they are the absolute values of its eigenvalues, counted with multiplicity. This is the existing schattenPNorm definition, with no normalization by dimension.
For symmetric , the triple deficit and the pair-deficit sum are
and the cyclic constant is the existing DiagonalConstruction.cyclicConstant,
Statement. For every real , every finite-dimensional real inner-product space and all symmetric ,
This is the real symmetric case of HlawkaSchatten.SchattenSharpness.selfAdjoint_cyclic_bound256, and it is equivalent to it: a complex self-adjoint operator, viewed as a real-linear map with inner product , is symmetric with every singular value repeated twice, so is multiplied by ; conversely, complexifying a real symmetric operator keeps every singular value with its multiplicity. The self-adjoint statement is itself equivalent to the general-matrix conjecture HlawkaSchatten.SchattenSharpness.cyclic_bound256 through the Hermitian dilation, which carries every rectangular operator to a self-adjoint one and multiplies by . A proof of the present statement therefore proves that conjecture.
Formalization Note. Symmetry is Mathlib's LinearMap.IsSymmetric over . The space may have any finite dimension, including , and . No positivity, commutativity, common-eigenbasis or equal-norm hypothesis is imposed.
import Definitions.Def_HlawkaSchatten_SchattenNorm import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic import Definitions.Def_HlawkaSchatten_GapComparison open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
theorem HlawkaSchatten.SchattenSharpness.realSymmetric_cyclic_bound256
(p : ℝ) (hp : 256 ≤ p)
(H : Type*)
[NormedAddCommGroup H] [InnerProductSpace ℝ H] [FiniteDimensional ℝ H]
(A B C : H →ₗ[ℝ] H)
(hA : A.IsSymmetric) (hB : B.IsSymmetric) (hC : C.IsSymmetric) :
tripleGap (schattenPNorm p : (H →ₗ[ℝ] H) → ℝ) A B C ≤
cyclicConstant p * pairGapSum (schattenPNorm p : (H →ₗ[ℝ] H) → ℝ) A B C := by sorry