Maths WorkshopMaths problems with full solutions
Exercise 1399Topology › Topology of Mn(ℝ) › Norms and metric structureL3Added 7 Nov 2026

The operator norm is invariant under transposition

#transpose#operator norm#duality

Statement

Show that ∥AT∥=∥A∥\|A^T\|=\|A\| for every A∈Mn(R)A\in M_n(\mathbb{R}).

Hint

Show that ∥A∥=sup⁡∣x∣=∣y∣=1yTAx\|A\|=\sup_{|x|=|y|=1}y^TAx.

Then transpose the scalar yTAxy^TAx.

Show solutionHide solution

Solution

Idea. Express the norm as a supremum of a *bilinear* expression in which xx and yy play symmetric roles, then notice that transposing AA simply exchanges them.

Step 1: the bilinear formula. For a vector v∈Rnv\in\mathbb{R}^n, ∣v∣=sup⁡∣y∣=1yTv|v|=\sup_{|y|=1}y^Tv: indeed yTv≤∣y∣∣v∣=∣v∣y^Tv\le|y||v|=|v| by Cauchy-Schwarz, and equality holds for y=v/∣v∣y=v/|v| (any yy if v=0v=0). Applying this to v=Axv=Ax,
∥A∥=sup⁡∣x∣=1∣Ax∣=sup⁡∣x∣=1sup⁡∣y∣=1yTAx=sup⁡∣x∣=∣y∣=1yTAx.\|A\|=\sup_{|x|=1}|Ax|=\sup_{|x|=1}\sup_{|y|=1}y^TAx=\sup_{|x|=|y|=1}y^TAx.

Step 2: transposing. The number yTAxy^TAx is a scalar, so it equals its own transpose: yTAx=(yTAx)T=xTATyy^TAx=(y^TAx)^T=x^TA^Ty. Hence
∥A∥=sup⁡∣x∣=∣y∣=1xTATy=sup⁡∣y∣=∣x∣=1xTATy=∥AT∥,\|A\|=\sup_{|x|=|y|=1}x^TA^Ty=\sup_{|y|=|x|=1}x^T A^Ty=\|A^T\|,
where in the last step we applied the formula of Step 1 to ATA^T (with the roles of xx and yy exchanged).

Remark. An alternative proof: ∥AT∥2=λmax⁡(AAT)\|A^T\|^2=\lambda_{\max}(AA^T) and AATAA^T, ATAA^TA have the same non-zero eigenvalues (equal to σi2\sigma_i^2), so ∥AT∥=σ1=∥A∥\|A^T\|=\sigma_1=\|A\|. The same equality *fails* for the induced norms ∥⋅∥1,∥⋅∥∞\|\cdot\|_1,\|\cdot\|_\infty: there ∥AT∥1=∥A∥∞\|A^T\|_1=\|A\|_\infty, which differs in general from ∥A∥1\|A\|_1.