Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lee's Conjecture: Sharp Frobenius Inequality

Updated 6 July 2026
  • Lee’s Conjecture is defined as the optimal Frobenius norm inequality for matrices, demonstrating that the norm of A+B is bounded by sqrt((1+√2)/2) times the norm of |A|+|B|.
  • The proof utilizes polar decompositions, trace identities, and the matrix Cauchy–Schwarz inequality to simplify earlier, more complex angle-based methods.
  • Extensions of the conjecture to many-summand scenarios and Schatten p-norm comparisons underline its significance and broad impact in matrix analysis.

Lee’s conjecture is a sharp matrix inequality in MnM_n, the algebra of all n×nn\times n complex matrices, comparing the Frobenius norm of a sum A+BA+B with the Frobenius norm of the sum of the absolute values A+B|A|+|B|. In the formulation treated by Zhang, it is the p=2p=2 case of Eun-Young Lee’s 2010 problem of determining the smallest constant cpc_p for which A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p holds in Schatten pp-norms. The conjectured Frobenius constant is

c2=1+22,c_2=\sqrt{\frac{1+\sqrt2}{2}},

and the inequality is now known to be correct and optimal. Lin and Zhang proved it in 2022, and Zhang later gave a substantially shorter proof based only on the matrix Cauchy–Schwarz inequality (Zhang, 3 Jul 2025).

1. Mathematical formulation

For AMnA\in M_n, the matrix absolute value is

n×nn\times n0

and similarly n×nn\times n1. The Frobenius norm is

n×nn\times n2

where n×nn\times n3 are the singular values. In this setting, Lee’s conjecture asserts that for all n×nn\times n4,

n×nn\times n5

Equivalently,

n×nn\times n6

These two forms are identical after dividing by n×nn\times n7 and taking square roots (Zhang, 3 Jul 2025).

A persistent point of confusion is the value of the constant. In reproduced versions of the theorem statement, the formula sometimes appears with typographical corruption. The correct norm inequality constant is

n×nn\times n8

whereas

n×nn\times n9

is the coefficient in the squared inequality. This distinction is explicit in the reconstructed theorem and proof (Zhang, 3 Jul 2025).

2. Origin within the Schatten-norm problem

The conjecture originated in Eun-Young Lee’s 2010 paper “Rotfel’d type inequalities for norms,” which asked for the optimal constant A+BA+B0 in

A+BA+B1

The Frobenius case corresponds to A+BA+B2. According to Zhang’s account, Lee observed that even determining A+BA+B3 appeared difficult and conjectured the exact value

A+BA+B4

Thus Lee’s conjecture is not an isolated inequality but the first sharp nontrivial benchmark in a broader program on Schatten-norm comparison between A+BA+B5 and A+BA+B6 (Zhang, 3 Jul 2025).

Historically, the first proof was obtained by Lin and Zhang in 2022. Their argument used inequalities for the angle between two matrices induced by the Frobenius inner product. Zhang’s 2025 paper does not strengthen the bound; its novelty is methodological. It replaces the angle-based approach with a short proof using only polar decomposition, trace identities, positivity, contractions, and matrix Cauchy–Schwarz. This suggests that the conjecture’s sharp constant is encoded in a comparatively elementary trace optimization rather than in a specifically geometric theory of matrix angles (Zhang, 3 Jul 2025).

3. Core mechanism of the short proof

The short proof begins from the polar decompositions

A+BA+B7

with A+BA+B8 and A+BA+B9 partial isometries, and defines

A+B|A|+|B|0

Because A+B|A|+|B|1 arises from polar decomposition, it is a contraction: A+B|A|+|B|2

The Frobenius norm of the sum is expanded as

A+B|A|+|B|3

Using cyclicity of the trace, the mixed term is written in the form

A+B|A|+|B|4

Hence

A+B|A|+|B|5

The argument then depends on two auxiliary inequalities. The first is a weighted trace Cauchy–Schwarz estimate: for any A+B|A|+|B|6 and A+B|A|+|B|7,

A+B|A|+|B|8

The second is the technical heart of the proof: if A+B|A|+|B|9 and p=2p=20 is a contraction, then for any p=2p=21,

p=2p=22

Applying this with

p=2p=23

gives

p=2p=24

At this point the proof becomes a one-parameter optimization. Since

p=2p=25

one chooses p=2p=26 so that the two coefficients coincide. The optimal value is

p=2p=27

for which

p=2p=28

Therefore

p=2p=29

which is exactly the conjecture (Zhang, 3 Jul 2025).

4. Sharpness and equality issues

The inequality is optimal. Zhang’s paper recalls that Lin and Zhang had already shown sharpness using the canonical cpc_p0 example

cpc_p1

This construction shows that the constant

cpc_p2

cannot be improved (Zhang, 3 Jul 2025).

The 2025 short proof does not develop equality cases in detail. Its emphasis is instead on proof compression: the conjecture is reduced to a mixed-term estimate for cpc_p3 and a scalar choice of cpc_p4. A plausible implication is that the sharpness mechanism is already visible at the level of cpc_p5 configurations and does not require high-dimensional structure.

5. Later extensions and the many-summand problem

A later extension generalizes Lee’s two-summand problem to arbitrary finite families. For cpc_p6, the corresponding Frobenius inequality is

cpc_p7

and this constant is sharp. Equality is attained by an equiangular rank-one family (Tang et al., 19 Oct 2025).

In this formulation the original conjecture is precisely the case cpc_p8. The same paper introduces the optimal constant cpc_p9 for Schatten A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p0-norms,

A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p1

and proves the general upper bound

A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p2

It also records the exact endpoint and special values

A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p3

For A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p4, this recovers

A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p5

The same paper proposes a closed-form conjecture for A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p6 for general A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p7, motivated by the same equiangular rank-one extremizers that saturate the Frobenius bound (Tang et al., 19 Oct 2025).

6. Terminological scope and ambiguity

The label “Lee’s conjecture” is not uniform across the literature. In matrix analysis, it refers to the Frobenius-norm conjecture just described. In other areas, however, the phrase may denote unrelated statements or may not denote any named conjecture at all. Zhuang’s paper on knot cobordism develops inequalities for Lee’s perturbation of Khovanov homology, but it does not formulate or resolve a conjecture explicitly called “Lee’s Conjecture” (Zhuang, 2022). Abe and Tagami study a different conjectural question, namely whether a divisibility-based invariant A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p8 coincides with Rasmussen’s A+BpcpA+Bp\|A+B\|_p\le c_p\||A|+|B|\|_p9-invariant (Sano, 2018). A separate note on the Lee–Yang circle theorem is explicitly about a theorem, not a conjecture, and treats “Lee” as part of the Lee–Yang name rather than as the source of a standalone conjecture (Ghosh, 2012).

Within matrix analysis, by contrast, the terminology is stable: Lee’s conjecture means the sharp Frobenius inequality

pp0

Its current significance lies in two facts. First, the exact constant is known and sharp. Second, the 2025 proof shows that the conjecture can be derived from a compact chain of standard tools—polar decomposition, contraction estimates, trace expansions, and matrix Cauchy–Schwarz—while the 2025 many-summand extension indicates that the same phenomenon belongs to a larger family of sharp inequalities for sums of absolute values (Zhang, 3 Jul 2025).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Lee's Conjecture.