We prove the Lu–Wenzel conjecture for real and complex matrices.
Introduction
For a square complex matrix X, write X∗ for its conjugate transpose and ∥X∥F2=Tr(X∗X), where Tr is the sum of the diagonal entries. The commutator of matrices of the same size is [X,Y]=XY−YX. Submultiplicativity and the triangle inequality give
∥[X,Y]∥F≤2∥X∥F∥Y∥F.
In 2005, Böttcher and Wenzel asked for the optimal constant and conjectured the sharper inequality
∥[X,Y]∥F2≤2∥X∥F2∥Y∥F2(1)
for real square matrices [3]. They proved the two-dimensional case. Vong and Jin established the inequality in every real dimension [14], and Lu obtained an independent proof as part of his work on normal scalar curvature [9]. Böttcher and Wenzel subsequently proved the complex inequality and studied related estimates for unitarily invariant norms [2]. Lu’s eigenvalue proof [10] and the account by Lu and Wenzel [12] explain several connections among these approaches.
A second source of commutator inequalities is submanifold geometry. De Smet, Dillen, Verstraelen and Vrancken proved a curvature inequality in codimension two and proposed its extension to arbitrary codimension in 1999 [5]. This became the normal scalar curvature conjecture. Through the Gauss and Ricci equations, it reduces to the matrix inequality
a,b=1∑m∥[Ba,Bb]∥F2≤(a=1∑m∥Ba∥F2)2(2)
for every family of real symmetric matrices B1,…,Bm of the same size, with m≥1. Ge and Tang proved this inequality and classified its equality cases [7]. Lu independently proved the inequality and used it to obtain geometric pinching results [9]. Thus (1) controls one commutator for arbitrary matrices, whereas (2) controls the total commutator energy of a symmetric family.
Lu and Wenzel brought these questions together in their study of the normal Ricci curvature inequality [11]. Their starting point was an estimate arising in a Simons–Bochner formula, in which one symmetric matrix is distinguished from an orthogonal family. For real square matrices X,Y1,…,Ym of the same size, with m≥1, they imposed the bilinear conditions
Tr(Ya[X,Yb])=0(1≤a,b≤m).
Two matrices A,B are Frobenius-orthogonal when Tr(A∗B)=0. For mutually orthogonal X,Y1,…,Ym, their fundamental conjecture predicts
This is Conjecture 8 of [11]. Proposition 10 there shows that the fundamental conjecture implies (2) for arbitrary real matrix families satisfying Tr(Ba[Bb,Bc])=0 for all indices. Symmetric matrices satisfy these constraints because the trace of a product of a symmetric matrix and a skew-symmetric matrix is zero. The constraints therefore preserve the geometric case while allowing nonsymmetric matrices.
Ge, Li, Lu and Zhou [6] reformulated the fundamental conjecture in terms of the spectrum of the commutator operator. For an integer n≥2, equip H=Mn(C) with
⟨A,B⟩=Tr(A∗B),
linear in the second variable. The adjoint of a complex linear operator on H is also denoted by a star. For X∈H, set
DX(Y)=[X,Y],DX∗(Y)=[X∗,Y],TX=DX∗DX.
Cyclicity of trace gives the adjoint formula, so TX is Hermitian and positive semidefinite. Write λ1(TX)≥⋯≥λn2(TX)≥0 for its eigenvalues counted with multiplicity. The largest eigenvalue is the maximum of ∥[X,Y]∥F2 over unit Y, so (1) gives λ1(TX)≤2 for unit X.
Ge, Li, Lu and Zhou proved that every positive eigenvalue occurs with even multiplicity. They showed that the fundamental conjecture is equivalent to bounding the first 2k eigenvalues by 2k+2, and extended these equivalences to complex matrices [6]. They established the spectral inequalities when X is normal, when X has rank one, and when n=2 or 3. In general they obtained
for ∥X∥F=1 and 1≤k≤⌊n2/2⌋. These results and their geometric context are reviewed in [13 Section 4.3]. The spectral conjecture asks for the bound 2k+2 in every dimension. A preprint of Liu computes the spectrum when X2=0 and obtains all the predicted partial sums for this class and its scalar translates [8]. Carptopus proves the inequalities on coordered alignment and isoclinic subfamilies of rank-two matrices, together with stability estimates under a positive lower bound on the smaller singular value [4].
Theorem 1. Let n≥2, let In be the n×n identity matrix, and let X∈Mn(C). For every integer 1≤k≤⌊n2/2⌋,
j=1∑2kλj(TX)≤(2k+2)X−nTrXInF2.
For each 1≤k≤n−1, equality is attained by a nonscalar matrix.
The squared norm on the right is \lVert X\rVert_F^2-\lvert\operatorname{Tr}X\rvert^2/n. Theorem 1 proves the complex version of [6 Conjecture 4], numbered Conjecture 7 in the preprint. For real X$, the complex operator is the complexification of the real one, with the same eigenvalues and multiplicities. When n=1, all commutators vanish.
The proof maximizes the total excess of the eigenvalues above one on the traceless unit sphere. At a maximizer, a strict gap separates the eigenvalues above one from the others. Their sum is smooth in a neighborhood, and its second derivative contains the variation of its spectral projection. Contracting this derivative against commutator directions gives a nonnegative sum of squares. A local maximum principle then permits minimization of the commutator energy within the maximum set. The critical equation, together with membership in the selected spectral subspace, reduces the maximizer to a normal or rank-one matrix.
Normalization and spectral pairs
Subtracting (TrX)In/n does not change DX. If the resulting matrix is nonzero, dividing it by its Frobenius norm divides TX by the square of that norm. For scalar matrices the theorem is immediate. We therefore work on the sphere
S={X∈H:TrX=0,∥X∥F=1},
with the real metric Re⟨⋅,⋅⟩. Use Id for the identity on H and TrH for the trace of a complex linear operator on H. From now on, norms of matrices are Frobenius norms. For a Hermitian operator A, A+ is obtained by replacing each eigenvalue of A by its maximum with zero. Set
G(X)=TrH(TX−Id)+=j=1∑n2max{λj(TX)−1,0}.
We shall prove G(X)≤2 on S. This implies the theorem since each sum of 2k eigenvalues minus 2k is bounded above by G(X).
Unitary conjugation preserves the spectrum, since
TUXU∗(UYU∗)=UTX(Y)U∗
for a unitary n×n matrix U, and Y↦UYU∗ is an isometry. Let Eij, 1≤i,j≤n, denote the matrix unit with a one in position (i,j) and zeros elsewhere. The trace identity
TrHTX=2n∥X∥2−2∣TrX∣2(4)
follows from
i,j∑∥XEij∥2=i,j∑∥EijX∥2=n∥X∥2,
i,j∑⟨XEij,EijX⟩=Tr((i,j∑EjiX∗Eij)X)=∣TrX∣2.
Here ∑i,jEjiX∗Eij=(TrX∗)In.
Let J(Y)=Y∗, an antiunitary involution of H, so it is conjugate linear and ⟨JU,JV⟩=⟨V,U⟩. When the base matrix X is fixed or understood as the variable in a local spectral neighborhood, write D=DX and T=TX. Since ([X,Y∗])∗=−[X∗,Y], one has
JDJ=−D∗,K:=JD,K2=−T.(5)
Consequently K commutes with T. On the eigenspace Eα for a positive eigenvalue α of T, one has ⟨Ku,Kv⟩=α⟨v,u⟩. Thus K/α is antiunitary there and squares to −Id. An orthonormal basis can therefore be chosen in pairs e,f with
Ke=αf,Kf=−αe,De=αf∗,Df=−αe∗.(6)
For an antiunitary map Q with Q2=−Id, antiunitarity gives ⟨Qe,Q2e⟩=⟨Qe,e⟩, and Q2e=−e makes both sides zero. Thus e⊥Qe. The orthogonal complement of their span is invariant under Q, so induction produces the pairs in (6) and proves even multiplicity.
Conversely, the spectral inequalities imply G(X)≤2 on S. Indeed, the number of eigenvalues above one is even; when it is positive, apply the inequality at this cutoff.
Fix an integer 1≤r<n2. Suppose there is a strict gap between the r-th and (r+1)-st eigenvalues of T. Let P be the orthogonal projection onto the eigenspaces for the r largest eigenvalues, which are positive. With an orthonormal eigenbasis write
Tqi=αiqi(i∈I),Tqj=βjqj(j∈O),αi>βj≥0.(7)
The sets I and O partition the n2 basis indices into selected and omitted indices. A sum over all j means j∈I∪O. Entire repeated eigenspaces are selected. For a complex subspace U⊂H, write U∗={u∗:u∈U}. Put W=ranP. Then D(W)=W∗, and (6) proves the following identity in the complex tensor product H⊗CH
i∈I∑Dqi⊗qi∗(8)
is skew under interchange of its factors.
Indeed each pair contributes α(f∗⊗e∗−e∗⊗f∗). The tensor is independent of the orthonormal selected basis, since the second factor transforms with the conjugate change of coordinates.
The Hessian of a separated spectral sum
Work on a neighborhood in S where the strict cut (7) persists. At each point choose a fixed positively oriented contour Γ enclosing the selected eigenvalues and excluding the others, also at nearby points. Diagonalizing TX and integrating the scalar resolvents gives
P(X)=2πi1∫Γ(zId−TX)−1dz.
The formula gives smoothness even at repeated eigenvalues. Define
Fix an orthonormal basis e1,…,en2 of H. Expanding the selected basis vectors in this basis gives
L=a,b=1∑n2⟨eb,Pea⟩Dea∗Deb.
Thus L is independent of the selected frame and smooth as a function of P. For a tangent vector H, differentiating P2=P shows that P′ has zero diagonal blocks in ranP⊕kerP. Since T is block diagonal, TrH(P′T)=0. The term with P fixed is the derivative of ∑i∈I∥[X,qi]∥2, so dF(H)=2Re⟨LX,H⟩. The identity ⟨X,LX⟩=∑i∈I∥[qi,X]∥2=F gives the radial component of the gradient. Each value of Dqi∗ is a commutator and has trace zero, so LX is traceless. Therefore the real sphere gradient is
∇SF=2J,⟨X,J⟩=0.(9)
Define the complex orthogonal projection ΠX, written Π at a fixed base matrix X, by
ΠH=H−nTrHIn−⟨X,H⟩X.
Its image lies in the real tangent space of S and is closed under multiplication by i. For Y∈ranΠ, differentiation gives TY′=D∗DY+DY∗D. For i∈I,j∈O, put
Aji(Y)=⟨[Dqj,qi∗],Y⟩,Cji(Y)=⟨Y,[Dqi,qj∗]⟩.
Then ⟨qj,Tqi′⟩=Aji(Y)+Cji(Y). The adjoint formula and DYq=−DqY give these two expressions. The first term is complex linear in Y, the second conjugate linear. The sphere Hessian HessSF(Y,Y) is the second derivative of F along the sphere geodesic starting with velocity Y. It is
Indeed, differentiating TXP=PTX gives the off-diagonal entry
⟨qj,PY′qi⟩=αi−βj⟨qj,TY′qi⟩.
The two off-diagonal blocks give
TrH(PYTY′)=2i∈I,j∈O∑αi−βj∣⟨qj,TY′qi⟩∣2.
Along the sphere geodesic with initial velocity Y, the acceleration is −∥Y∥2X, and T′′=2DY∗DY−2∥Y∥2T. Thus TrH(PT′′)=2⟨Y,LY⟩−2F∥Y∥2. Differentiating F′=TrH(PT′) proves (10).
The identities Aji(iY)=iAji(Y) and Cji(iY)=−iCji(Y) give
Fix a selected eigenvalue α>0 and an omitted eigenvalue β≥0, and sum over i,j in their respective eigenspaces Eα,Eβ. The vectors Dqi/α form an orthonormal basis of Eα∗ by (6). For β>0, the vectors Dqj/β form one of Eβ∗. Changing orthonormal basis in these two sums gives
For β=0, Dqj=0, so the first identity still holds, and the second follows by changing the selected basis alone. The denominator α−β is constant in each such sum. For U∈H, let ∣U⟩⟨U∣ denote the operator H↦U⟨U,H⟩. Define the Hermitian operator
They therefore cancel. Thus I0=2∥R∥2=21∥∑i[Bi,Ai]∥2.
Apply (13) with Ai=qi∗, Bi=Dqi. Identity (8) supplies skewness, and
i∈I∑[Dqi,qi∗]=LX.(14)
For any three basis indices a,i,j, define
uaij=Tr((Dqa)[qi,qj]).
We restrict a,i to I in the following sums, but the definition also gives ujai when j is omitted. Using uaij=Tr([Dqa,qi]qj), Parseval over the orthonormal basis qj∗ gives
j∑uaijuiaj=Tr([Dqa,qi][qa∗,(Dqi)∗]).
Therefore (13), (14), and (9) imply the exact identity
2Rea,i∈Ijall∑uaijuiaj=∥LX∥2=F2+∥J∥2.(15)
Since D is a derivation and every commutator has trace zero,
Summing over i∈I proves the operator identity ∑i∈I,j∈I∪O∣[qi∗,qj∗]⟩⟨[qi∗,qj∗]∣=L, by equality of Hermitian quadratic forms. Using (αi+βj)/(αi−βj)=1+2βj/(αi−βj), we can rewrite (11) as
L=2L−FId−KII+2RIO.(18)
Use the direct covariance expression B=∑a∈I∣Dqa⟩⟨Dqa∣. Taking its trace against the terms in (18) gives
TrH(BL)=a,i∈Ijall∑∣uaij∣2,
TrH(BKII)=a,i,j∈I∑∣uaij∣2,
TrH(BRIO)=a,i∈I,j∈O∑αi−βjβj∣uaij∣2.(19)
For the first identity, expand ∑a,i∥[qi,Dqa]∥2 in the complete orthonormal starred basis qj∗. For the other two use TrH(∣U⟩⟨U∣∣V⟩⟨V∣)=∣⟨U,V⟩∣2 and ⟨[qi∗,qj∗],Dqa⟩=uaij. Also TrHB=F. Thus
Expanding each factor α/(α−β) as 1+β/(α−β) in the preceding expression gives
TrH(BL)=S+∥J∥2.(22)
The strict cut and βj≥0 suffice for nonnegativity.
For i∈I,j∈O,
⟨[qi∗,qj∗],X⟩=−⟨qj∗,Dqi⟩=0,
since Dqi∈W∗. Consequently RIOX=0, KIIX=LX, and LX=J. The projection onto the scalar matrices makes no contribution because B(In)=0 and L(In)=−FIn.
Using the fixed basis e1,…,en2, define the real tangent fields Za(X)=ΠXDXP(X)ea, 1≤a≤n2. Their covariance satisfies ∑a=1n2∣Za⟩⟨Za∣=ΠBΠ. Therefore
Set C(X)=[X∗,X] on S, writing C at the current base matrix. Suppose that X is a local maximum of F on S, with F>0. Then J=0 and the real Hessian is nonpositive. Equation (24) forces S=0. For every omitted βj>0, (21) gives uaij=uiaj=0, and (16) gives ujai=0. Let O+ be the orthogonal sum of the omitted eigenspaces for positive eigenvalues. For subspaces U,V, write [U,V] for the linear span of the commutators [u,v], u∈U,v∈V. The vectors (Dqj)∗ for omitted βj>0 span O+, by (5)–(6), and ⟨(Dqj)∗,[qa,qi]⟩=ujai=0. Hence
[W,W]⊥O+.(25)
Taking matrix adjoints gives [W∗,W∗]⊥O+∗. By (14) and stationarity, FX=∑i∈I[Dqi,qi∗] belongs to [W∗,W∗], so X⊥O+∗. The output singular-space decomposition is
H=W∗⊕O+∗⊕kerD∗.
The map D∗ takes W∗ into W and kills kerD∗. It follows that the Hermitian matrix satisfies
C=D∗X∈W.(26)
Extremal matrices
Proof of Theorem 1. On a real coordinate neighborhood of S with a strict spectral gap, list the 2n2 fields Za,iZa, 1≤a≤n2, from (24) as Zs, 1≤s≤2n2. For smooth tangent fields U,V, the sphere’s Levi–Civita derivative ∇UV is the real orthogonal projection of the ambient derivative of V in direction U onto the tangent space of S. Define
Y=4ΠBX−s=1∑2n2∇ZsZs.
For a real C2 function h on this neighborhood, set
Ah=s=1∑2n2Zs(Zsh)+Yh.
Vector fields act on functions by directional differentiation. Since HessSh(Zs,Zs)=Zs(Zsh)−(∇ZsZs)h, (24) gives
AF=4(S+∥J∥2)≥0.
Lemma 5 below applies to A in the chosen coordinates.
The function G is continuous, by continuity of the ordered eigenvalues, and attains its maximum M on S. Suppose M>2. Among the matrices at which G=M, choose X0 minimizing E(X)=∥[X∗,X]∥2. This is possible because the maximum set is compact. Let r count the eigenvalues strictly above one at X0. Then 0<r<n2, since G(X0)>0 and DX0(In)=0. Choose a connected real coordinate neighborhood Ω of X0 on which the gap at r remains strict and λr(TX)>1. Take P and F for this cutoff. On Ω,
F−r≤G≤M,
and equality holds throughout this chain at X0. Thus the set where F=M+r in the neighborhood lies in the maximum set of G. At each of its points (26) gives PC=C, with C=[X∗,X].
Define the smooth real tangent field V0=−ΠDPC on the whole neighborhood. It is a smooth real linear combination of the fields Za,iZa. Indeed, if C=∑acaea, its coefficients are −Reca and −Imca, respectively. By Lemma 5, the short integral curve of V0 through X0 stays in the maximum set of F. On that set PC=C and ⟨X,DC⟩=⟨D∗X,C⟩=E, so
V0=−DC+EX.
For a tangent vector H, the derivative of C is [H∗,X]+[X∗,H]. Cyclicity gives
Tr(C[H∗,X])=Tr(H∗[X,C]),Tr(C[X∗,H])=Tr([C,X∗]H).
Since C=C∗, these two scalars are conjugates, and hence
If V0(X0)=0, this derivative is strictly negative at time zero along the propagated curve. For small positive time the curve remains in {G=M} and decreases E, contradicting the choice of X0. Thus V0(X0)=0. In particular, at X0,
DC=EX0,C∈ranP.(27)
All matrix-dependent quantities in the two cases below are evaluated at X0. If C=0, then X0 is normal. In a unitary basis in which it is diagonal, write x1,…,xn for its diagonal entries and x for their column vector. The eigenvalues of TX0 are ∣xi−xj∣2 over ordered pairs (i,j). Form the simple graph with an edge ij when ∣xi−xj∣2>1, and let m be its edge count. For m=0 we have G(X0)=0. For m>0, orient the edges arbitrarily and let A be the vertex-edge incidence matrix, with entries +1, −1 at the endpoints of each column and zero elsewhere. Then
G(X0)/2=∥A∗x∥2−m.
Write degi for the number of edges incident with vertex i. For the row indexed by an edge e=ij, the diagonal entry of A∗A is two. The absolute off-diagonal entry is one exactly for edges sharing an endpoint with e, and, summing over all graph edges f,
f∑∣(A∗A)ef∣=2+(degi−1)+(degj−1)=degi+degj≤m+1.
The last bound follows because the two incident edge sets overlap only in ij. For an eigenvector of A∗A, evaluating its eigenvalue equation at a coordinate of largest absolute value shows that the absolute eigenvalue is at most the largest absolute row sum. Multiplication by A and A∗ transfers the positive eigenspaces of A∗A and AA∗ to each other, so their largest eigenvalues coincide. Hence ∥A∗x∥2=⟨x,AA∗x⟩≤(m+1)∥x∥2=m+1, and G(X0)≤2.
Suppose instead that C=0. By (27), TC=ED∗X0=EC. The eigenvalue E exceeds one because ranP at X0 consists of the eigenspaces above one. Diagonalize C unitarily, with real diagonal entries c1,…,cn. Each nonzero entry (X0)ij satisfies cj−ci=E, by the commutator equation in (27). Write s=rankX0, and choose a nonzero minor of size s with row set R and column set S. A nonzero term of its determinant matches the rows to the columns along nonzero entries. Summing the corresponding relations gives
sE=j∈S∑cj−i∈R∑ci.
The coefficient of each ci in this difference is 0, 1, or −1, and at most 2s coefficients are nonzero. Since ∑ici2=E, Cauchy–Schwarz gives s2E2≤2sE. Thus sE≤2, and E>1 forces s=1.
A traceless rank-one unit matrix is unitarily similar to E12. In fact, writing it as uv∗ with ∥u∥=∥v∥=1, the trace condition gives v∗u=0. Completing u,v to an orthonormal basis gives the stated unitary similarity. In the resulting unitary basis X0=E12, and multiplication gives
The displayed inputs are orthonormal and their outputs are orthogonal. All remaining matrix units except E11,E22 are killed by D, and D(E11+E22)=0. The resulting spectrum, in decreasing order, is
(2,2,1,…,1,0,…,0).(28)
In particular G(X0)=2 in the rank-one case. Both cases contradict M>2. The normalization in § 2 gives the inequality, and (28) gives equality at E12 for the stated cutoffs. □
Inequalities for matrix families
Let X be any unit matrix. The number r of eigenvalues of TX strictly above one is even by (6). If r=0, the positive-part trace is zero. Otherwise Theorem 1, applied with 2k=r, gives
The first eigenvalue is at most two by the pairing and the theorem at k=1. At every cutoff ℓ≥2, the partial sum is at most ℓ+2 by the positive-part bound and at most 2n by (4). The bounds 2 at cutoff one and min{ℓ+2,2n} thereafter are the partial sums of (28). Append zero eigenvalues at indices beyond n2; the same bounds then apply.
Corollary 2. Let X,Y1,…,Ym∈Mn(C), where m≥1 and Y1,…,Ym are mutually Frobenius-orthogonal. Then
Each inequality implies the spectral conjecture when imposed for all X and all families satisfying its hypotheses.
Proof. If X=0 or all Ya=0, the inequalities hold directly. Otherwise take ∥X∥=1 by homogeneity, remove the zero members, and relabel the remaining family as Y1,…,Ym. Set wa=∥Ya∥2 and ea=Ya/wa, with w1≥⋯≥wm>0 after reordering. The operator A=∑awa∣ea⟩⟨ea∣ is positive semidefinite and satisfies A≤w1Id, in the order of Hermitian operators. For positive semidefinite operators R,S, TrH(RS)=TrH(S1/2RS1/2)≥0. Apply this to A, w1Id−A, and the spectral positive part below. Since TX≤Id+(TX−Id)+, we obtain
Under the trace conditions, the span of the Ya is orthogonal to its image under K=JDX, since ⟨Ku,v⟩=−Tr(u[X,v]). Let W be a subspace of this span of dimension d≥1. Write PW for its orthogonal projection. Choose an orthonormal basis u1,…,ud diagonalizing the compression PWTX∣W, the operator that applies TX and projects back to W. Let μi≥0 be the corresponding eigenvalues. For each μi>0, set vi=Kui/μi. The vectors vi are orthonormal because ⟨Kui,Kuj⟩=⟨uj,TXui⟩. They lie in W⊥ and satisfy
⟨vi,TXvi⟩=μi⟨ui,TX2ui⟩≥μi,
using KTX=TXK and Cauchy–Schwarz. For any orthonormal set of size b, the sum of its diagonal entries for a positive semidefinite operator is at most the sum of the first b eigenvalues. Indeed, expanding the set in an eigenbasis gives weights in [0,1] that sum to b, and their weighted eigenvalue sum is maximized by filling the largest entries first. Apply this to the ui and the available vi, at most 2d vectors. The partial sum bound then yields 2∑iμi≤2d+2.
Use this estimate on the spans of e1,…,ej for each 1≤j≤m. Setting wm+1=0, summation by parts gives
For the converse to (29), use 2k orthonormal eigenvectors for the largest eigenvalues. For (30), use one vector from each of the first k positive spectral pairs in (6), or from every positive pair if there are fewer. Their span is orthogonal to its image under K, and the sum of the energies is half of the first 2k eigenvalue sum. With h chosen vectors, the bound is h+1≤k+1, and when h=0 all energies vanish. These chosen vectors belong to positive eigenspaces and are orthogonal to X, since TXX=0. □
Corollary 3. Let m≥1. If B1,…,Bm∈Mn(C) satisfy Tr(Ba[Bb,Bc])=0 for all 1≤a,b,c≤m, then
a,b=1∑m∥[Ba,Bb]∥2≤(a=1∑m∥Ba∥2)2.
Proof. The all-zero family satisfies the inequality. Otherwise normalize ∑a∥Ba∥2=1 and maximize the left side on the compact set of normalized families satisfying the trace conditions. For a unitary m×m matrix U=(Uab), replace the family by Ba′=∑bUabBb. Orthogonality of the columns of U gives ∑a∥Ba′∥2=∑a∥Ba∥2. The commutators transform by
[Ba′,Bb′]=c,d∑UacUbd[Bc,Bd],
so the same orthogonality on both indices preserves the total energy. Every triple trace transforms as a linear combination of the original triple traces, so it remains zero. If Γab=⟨Ba,Bb⟩ is the Gram matrix, then the new one is UΓUT, where T is transpose. The spectral theorem chooses a unitary U making this diagonal. Thus a maximizing family may be chosen orthogonal. Reorder it so that w1≥w2≥⋯, where wa=∥Ba∥2. If only one matrix is nonzero the energy is zero.
Write Q for the maximum and S1=∑b=1∥[B1,Bb]∥2 for the contribution with first index one. For t>0, multiply B1 by t and divide the whole family by 1+(t2−1)w1. The total squared norm becomes
1+(t2−1)w1t2w1+∑a=2mwa=1.
Each triple trace is multiplied by the product of the scalars applied to its three matrices, so the trace constraints are preserved. The energy along this admissible path is
(1+(t2−1)w1)2Q+2(t2−1)S1.
Its derivative at t=1 equals 4S1−4Qw1. Maximality makes it zero, giving S1=Qw1. Applying (30) with X=B1 gives S1≤w1(1−w1+w2)≤w1. As w1>0, this gives Q≤1. □
A rank bound for the bracket on bivectors
Let g=sln(C) be the subspace of traceless matrices with the Frobenius metric. The exterior square Λ2g is spanned by the bilinear alternating products U∧V, with U∧V=−V∧U. Choose a real orthonormal basis F1,…,Fn2−1 of the traceless skew-Hermitian matrices, which satisfy Fi∗=−Fi. It is a complex orthonormal basis of g, since every X∈g has the decomposition
X=2X−X∗+i2iX+X∗.
into complex multiples of traceless skew-Hermitian matrices. The exterior metric is defined, for U1,U2,V1,V2∈g, by
Thus Fi∧Fj, 1≤i<j≤n2−1, form an orthonormal basis, and the metric is preserved by a unitary change of basis. Write b:Λ2g→g for the linear map b(U∧V)=[U,V], and b∗:g→Λ2g for its adjoint with respect to these metrics. For η=∑1≤i<j≤n2−1HijFi∧Fj, extend its coefficients to a skew-symmetric matrix H by Hji=−Hij and Hii=0. The rank of H is independent of the basis, since a change of basis acts by invertible congruence.
These numbers are real because the Frobenius inner product of skew-Hermitian matrices is real. The first bracket makes them antisymmetric in i,j, and the last bracket makes them antisymmetric in j,ℓ; thus they are fully alternating. For X=∑ℓ=1n2−1xℓFℓ, the full skew coefficient matrix C of b∗X, with Cji=−Cij and Cii=0, has entries, for i<j,
The matrix of DX restricted to g has i,j entry ∑ℓ=1n2−1cℓjixℓ=−Cij. Consequently the squared singular values of C, with one extra zero for the scalar direction, give the spectrum of TX.
The exterior metric gives ∥H∥F2=2∥η∥2 and ⟨b∗X,η⟩=Tr(C∗H)/2. If P is the orthogonal projection onto the image of H, then PH=H, so
The last step bounds the trace of CC∗ on a subspace of dimension at most 2k by the corresponding eigenvalue sum, as in the proof of Corollary 2.
For fixed X the estimate is attained on some unit η of rank at most 2k. To see this when C=0, the conjugate-linear map v↦Cv squares to −C∗C since CT=−C, where T is the ordinary transpose. It commutes with C∗C, because its square is −C∗C, and its squared norm at v is ⟨v,C∗Cv⟩. Thus, on an eigenspace of C∗C for a positive eigenvalue α, division by α gives an antiunitary map of square −Id. The construction leading to (6) supplies orthonormal pairs there. If U is the unitary matrix with columns given by these pairs and an orthonormal kernel basis, UTCU consists of two-by-two skew blocks and zeros. This follows because the i,j entry of UTCU is the conjugate of the i-th coordinate of CUj in the columns of U, with Uj the j-th column. Retain the k blocks of largest singular values, or all if fewer, and undo the congruence. The resulting skew matrix has squared Frobenius norm ∑j=12kλj(TX), and its Frobenius inner product with C equals that same sum. Multiplying this matrix by 2/∑j=12kλj(TX) makes it the coefficient matrix of a unit bivector η for which
Taking the supremum over unit X∈g recovers ∥bη∥2 on the left by duality. Conversely the inequality for bη bounds the maximum over rank-constrained unit η by (k+1)∥X∥2. The attainment just proved gives the spectral inequality for traceless X, and subtracting the scalar part gives Theorem 1.
Appendix A. Local maximum propagation
The following local form of maximum propagation is part of the maximum principle of Bony [1].
Lemma 5. Let d, N≥1 be integers, let Ω⊂Rd be open, and let Z1,…,ZN,Y be smooth real vector fields on Ω. Define the differential operator
Ah=s=1∑NZs(Zsh)+Yh
for real h∈C2(Ω). Suppose m∈R, u∈C2(Ω;R), u≤m, and Au≥0 on Ω. If W=∑s=1NfsZs for smooth real functions fs, then every sufficiently short integral curve of W through a point of {u=m} stays in {u=m}.
Proof. Let K={u=m}. Suppose an open ball of center c and radius R in Ω∖K touches K at p∈Ω. Replacing the center and radius by p+t(c−p) and tR with 0<t<1 puts the new closed ball inside the original open ball except at p, by the triangle inequality and its equality case. The normal direction at p is unchanged. Thus we may assume the closed ball lies in Ω and meets K only at p.
In coordinates write Zs=∑i=1dzsi∂i and Y=∑i=1dyi∂i, with ∂i=∂/∂xi. Set
The matrix (aij) is positive semidefinite. We show Zs(p)⋅(p−c)=0 for every s. If their squares sum to a positive number, take v(x)=e−κ∣x−c∣2−e−κR2 for κ>0. Differentiation gives
Choose κ large enough that Av(p)>0, and take a small ball U centered at p with U⊂Ω and Av>0 on U. The compact part of ∂U in the closed exterior ball is disjoint from K. On it u is uniformly below m if this part is nonempty. For sufficiently small ε>0, u+εv<m there. Elsewhere on ∂U we have v<0, giving the same strict inequality. Since u(p)+εv(p)=m, the function u+εv attains an interior maximum in U. At that point A(u+εv)≤0 by the vanishing gradient and the nonpositive Hessian, whereas Au+εAv>0 on U. The contradiction proves the asserted tangency. In particular W(p)⋅(p−c)=0 for every such exterior ball.
Fix x0∈K, choose ρ>0 with B(x0,2ρ)⊂Ω, and set K0=K∩B(x0,2ρ). Let γ be the integral curve of W from x0 on a short interval [0,T] with image in B(x0,ρ/2). For each time choose a nearest point p∈K0 to γ(t), using compactness. Then ∣γ(t)−p∣≤∣γ(t)−x0∣<ρ/2, so
∣p−x0∣≤∣p−γ(t)∣+∣γ(t)−x0∣<ρ.
If γ(t)=p, the ball centered at γ(t) of radius ∣γ(t)−p∣ lies in B(x0,ρ). Every point of K in that ball would belong to K0 and contradict minimality of the distance. Hence the ball avoids all of K. Thus W(p)⋅(γ(t)−p)=0, also valid when γ(t)=p.
The squared distance f(t)=dist(γ(t),K0)2 is Lipschitz on this interval, since distance to a set is 1-Lipschitz. Let L be a Lipschitz constant for W on B(x0,2ρ). At any point of differentiability of f, holding the nearest point p fixed for positive increments gives
[1]J.-M. Bony, Principe du maximum, inégalité de Harnack et unicité du problème de Cauchy pour les opérateurs elliptiques dégénérés, Ann. Inst. Fourier (Grenoble) 19 (1969), no. 1, 277–304.DOI
[2]A. Böttcher and D. Wenzel, The Frobenius norm and the commutator, Linear Algebra Appl. 429 (2008), 1864–1885.DOI
[3]A. Böttcher and D. Wenzel, How big can the commutator of two matrices be and how big is it typically?, Linear Algebra Appl. 403 (2005), 216–228.DOI
[4]Cartpopus, Coordinated alignment and isoclinic stability in the rank-two complex Lu–Wenzel problem, preprint, October 18, 2026, author’s repository.
[5]P. J. De Smet, F. Dillen, L. Verstraelen, and L. Vrancken, A pointwise inequality in submanifold theory, Arch. Math. (Brno) 35 (1999), 115–128.
[6]J. Ge, F. Li, Z. Lu, and Y. Zhou, On some conjectures by Lu and Wenzel, Linear Algebra Appl. 592 (2020), 134–164. Preprint arXiv:1908.06624.DOI
[7]J. Ge and Z. Tang, A proof of the DDV conjecture and its equality case, Pacific J. Math. 237 (2008), no. 1, 87–95.arxiv.org/abs/0801.0650
[8]Z. Liu, The Lu–Wenzel spectral conjecture for square-zero matrices, preprint, version 1, Zenodo record 21693383.
[9]Z. Lu, Normal scalar curvature conjecture and its applications, J. Funct. Anal. 261 (2011), no. 5, 1284–1308.DOI
[10]Z. Lu, Remarks on Böttcher–Wenzel inequality, Linear Algebra Appl. 436 (2012), no. 7, 2531–2535.arxiv.org/abs/1106.1827
[11]Z. Lu and D. Wenzel, The normal Ricci curvature inequality, Contemp. Math. 674, Amer. Math. Soc., Providence, RI, 2016, 99–110.DOI
[12]Z. Lu and D. Wenzel, Commutator estimates comprising the Frobenius norm—looking back and forth, Oper. Theory Adv. Appl. 259, Birkhäuser/Springer, Cham, 2017, 533–559.DOI
[13]J. Ge, F. Li, Z. Tang, and Y. Zhou, A survey on the DDV-type inequalities, Adv. Math. (China) 53 (2024), no. 3, 449–467.
[14]S.-W. Vong and X.-Q. Jin, Proof of Böttcher and Wenzel's conjecture, Oper. Matrices 2 (2008), no. 3, 435–442.DOI