The cyclic Hlawka bound for self-adjoint operators when p ≥ 256
OpenHlawkaSchatten.SchattenSharpness.selfAdjoint_cyclic_bound256Let be a finite-dimensional complex inner-product space, of any dimension. A complex-linear map is self-adjoint if for all ; in an orthonormal basis it is a Hermitian matrix. For real its Schatten norm is
where are the singular values of ; for self-adjoint they are the absolute values of its eigenvalues. This is the existing schattenPNorm definition, with no normalization by dimension.
For self-adjoint , 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 complex inner-product space and all self-adjoint ,
This is the self-adjoint case of the general-matrix conjecture HlawkaSchatten.SchattenSharpness.cyclic_bound256, and it is equivalent to it. In one direction it is the special case restricted to self-adjoint triples. In the other, the Hermitian dilation carries every rectangular operator to a self-adjoint one and multiplies every Schatten norm by the same factor , so a proof of this statement settles the general conjecture.
Formalization Note. Self-adjointness is Mathlib's LinearMap.IsSymmetric. 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.selfAdjoint_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