A logarithmic minimization property of the unitary polar factor in the spectral norm and the Frobenius matrix norm
Patrizio Neff, Yuji Nakatsukasa, Andreas Fischle

TL;DR
This paper proves that the unitary polar factor minimizes certain matrix logarithm norms, establishing its optimality in spectral and Frobenius norms and connecting it to geodesic distance in matrix space.
Contribution
It demonstrates the minimization property of the unitary polar factor for matrix logarithm norms in spectral and Frobenius norms, extending previous results.
Findings
The unitary polar factor minimizes the Log-based norms in spectral and Frobenius cases.
The minimization holds in any dimension for spectral norm and in 2-3 dimensions for Frobenius norm.
The result links the polar factor to geodesic distance in matrix space.
Abstract
The unitary polar factor in the polar decomposition of the matrix is the minimizer for both and its Hermitian part over both and , for any given invertible matrix in and any matrix logarithm , not necessarily the principal logarithm . We prove this for the spectral matrix norm in any dimension and for the Frobenius matrix norm in two and three dimensions. The result shows that the unitary polar factor is the nearest orthogonal matrix to not only in the normwise sense, but also in a geodesic distance. The derivation is based on Bhatia's generalization of Bernstein's trace inequality for the matrix exponential and a new sum of squared logarithms inequality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Mathematical Inequalities and Applications · Analytic and geometric function theory
