Maths WorkshopMaths problems with full solutions
Exercise 293Topology › Topology of Mn(ℝ) › Rank, spectrum and normsL2Added 6 Nov 2026

Trace and determinant bounded by the operator norm

#operator norm#singular values#trace#determinant

Statement

On Mn(R)M_n(\mathbb{R}) we use the operator norm ∥A∥=sup⁡∣x∣=1∣Ax∣\|A\|=\sup_{|x|=1}|Ax| (the largest singular value σ1(A)\sigma_1(A)). Show that for every A∈Mn(R)A\in M_n(\mathbb{R})
∣tr⁡A∣≤n∥A∥,∣det⁡A∣≤∥A∥n.|\operatorname{tr}A|\le n\|A\|,\qquad |\det A|\le\|A\|^n.

Hint

For the determinant, write ∣det⁡A∣|\det A| as a product of singular values. For the trace, write tr⁡A=∑ieiTAei\operatorname{tr}A=\sum_i e_i^TAe_i and use Cauchy-Schwarz.

Show solutionHide solution

Solution

Trace. In the standard basis, tr⁡A=∑i=1neiTAei\operatorname{tr}A=\sum_{i=1}^n e_i^TAe_i. For each ii, by Cauchy-Schwarz,
∣eiTAei∣≤∣ei∣ ∣Aei∣≤∥A∥ ∣ei∣2=∥A∥.|e_i^TAe_i|\le|e_i|\,|Ae_i|\le\|A\|\,|e_i|^2=\|A\|.
Summing the nn terms gives ∣tr⁡A∣≤n∥A∥|\operatorname{tr}A|\le n\|A\|.

Determinant. Let A=UΣVTA=U\Sigma V^T be a singular value decomposition, with U,VU,V orthogonal and Σ=diag⁡(σ1≥⋯≥σn≥0)\Sigma=\operatorname{diag}(\sigma_1\ge\dots\ge\sigma_n\ge0). Orthogonal matrices have determinant ±1\pm1, hence
∣det⁡A∣=∣det⁡U∣ det⁡Σ ∣det⁡V∣=σ1σ2⋯σn≤σ1n=∥A∥n.|\det A|=|\det U|\,\det\Sigma\,|\det V|=\sigma_1\sigma_2\cdots\sigma_n\le\sigma_1^n=\|A\|^n.

Check. For A=(2001)A=\begin{pmatrix}2&0\\0&1\end{pmatrix}: ∥A∥=2\|A\|=2, tr⁡A=3≤4\operatorname{tr}A=3\le4 and det⁡A=2≤4\det A=2\le4.

Remark. Both bounds are attained by A=IA=I (trace) and by any orthogonal matrix times a scalar (determinant). The inequality ∣det⁡A∣≤∥A∥n|\det A|\le\|A\|^n says that det⁡\det is a polynomial map of degree nn with a controlled growth, which is useful to prove its continuity and to estimate the distance of a matrix to the singular matrices.