Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The cyclic Hlawka bound for real symmetric operators when p ≥ 256

Open
HlawkaSchatten.SchattenSharpness.realSymmetric_cyclic_bound256

by savarin · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

hlawka-schattensharp-constant

Let HHH be a finite-dimensional real inner-product space, of any dimension. A linear map A:H→HA:H\to HA:H→H is symmetric if ⟨Ax,y⟩=⟨x,Ay⟩\langle Ax,y\rangle=\langle x,Ay\rangle⟨Ax,y⟩=⟨x,Ay⟩ for all x,y∈Hx,y\in Hx,y∈H; in an orthonormal basis it is a real symmetric matrix. For real p>1p>1p>1 its Schatten norm is

Np(A)=(∑isi(A)p)1/p,N_p(A)=\Bigl(\sum_i s_i(A)^p\Bigr)^{1/p},Np​(A)=(i∑​si​(A)p)1/p,

where si(A)s_i(A)si​(A) are the singular values of AAA; for symmetric AAA they are the absolute values of its eigenvalues, counted with multiplicity. This is the existing schattenPNorm definition, with no normalization by dimension.

For symmetric A,B,C:H→HA,B,C:H\to HA,B,C:H→H, the triple deficit and the pair-deficit sum are

Δ3=Np(A)+Np(B)+Np(C)−Np(A+B+C),\Delta_3=N_p(A)+N_p(B)+N_p(C)-N_p(A+B+C),Δ3​=Np​(A)+Np​(B)+Np​(C)−Np​(A+B+C), Δ2=2(Np(A)+Np(B)+Np(C))−Np(A+B)−Np(A+C)−Np(B+C),\Delta_2=2\bigl(N_p(A)+N_p(B)+N_p(C)\bigr)-N_p(A+B)-N_p(A+C)-N_p(B+C),Δ2​=2(Np​(A)+Np​(B)+Np​(C))−Np​(A+B)−Np​(A+C)−Np​(B+C),

and the cyclic constant is the existing DiagonalConstruction.cyclicConstant,

Kp=sup⁡1/2≤t≤23(tp+2)1/p−31/p∣2−t∣6(tp+2)1/p−3(2∣1−t∣p+2p)1/p.K_p=\sup_{1/2\le t\le2}\frac{3(t^p+2)^{1/p}-3^{1/p}|2-t|}{6(t^p+2)^{1/p}-3(2|1-t|^p+2^p)^{1/p}}.Kp​=1/2≤t≤2sup​6(tp+2)1/p−3(2∣1−t∣p+2p)1/p3(tp+2)1/p−31/p∣2−t∣​.

Statement. For every real p≥256p\ge256p≥256, every finite-dimensional real inner-product space HHH and all symmetric A,B,C:H→HA,B,C:H\to HA,B,C:H→H,

Δ3≤Kp Δ2.\Delta_3\le K_p\,\Delta_2 .Δ3​≤Kp​Δ2​.

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 Re⟨x,y⟩\mathrm{Re}\langle x,y\rangleRe⟨x,y⟩, is symmetric with every singular value repeated twice, so NpN_pNp​ is multiplied by 21/p2^{1/p}21/p; 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 NpN_pNp​ by 21/p2^{1/p}21/p. A proof of the present statement therefore proves that conjecture.

Formalization Note. Symmetry is Mathlib's LinearMap.IsSymmetric over R\mathbb RR. The space HHH may have any finite dimension, including 000, 111 and 222. No positivity, commutativity, common-eigenbasis or equal-norm hypothesis is imposed.

Preamble
import Definitions.Def_HlawkaSchatten_SchattenNorm
import Definitions.Def_HlawkaSchatten_DiagonalConstruction_Cyclic
import Definitions.Def_HlawkaSchatten_GapComparison

open HlawkaSchatten HlawkaSchatten.DiagonalConstruction
Formal statement
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
Source
Real symmetric case of HlawkaSchatten.SchattenSharpness.selfAdjoint_cyclic_bound256 (https://prove2.me/theorems/ce816d92-eaf6-404f-b7ea-effee7e7aeb5), which is the self-adjoint case of the conjecture HlawkaSchatten.SchattenSharpness.cyclic_bound256 (https://prove2.me/missions/Does_the_sharp_diagonal_Hlawka_constant_work_for_all_complex_matrices_when_p_%E2%89%A5_256%3F), motivated by Audenaert–Kittaneh, Problems and Conjectures in Matrix and Operator Inequalities, §8.2, Problem 7 (inequality (48), p. 12 of arXiv v3), https://arxiv.org/abs/1201.5232; proved diagonal case: https://github.com/savarin/hlawka-schatten/blob/79aa498bfcf7b22bd91d771fb32ec278e2d4704b/HlawkaSchatten/DiagonalConstruction/ComplexTransfer.lean#L83

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me