Maths WorkshopMaths problems with full solutions
Exercise 681Topology › Topology of Mn(ℝ) › Continuity of matrix mapsL2Added 7 Nov 2026

The nearest symmetric matrix is the symmetric part

#symmetric matrices#skew-symmetric#orthogonal projection#Frobenius norm

Statement

Show that A↦A+AT2A\mapsto\frac{A+A^T}2 is a continuous linear projection of Mn(R)M_n(\mathbb{R}) onto Symn\mathrm{Sym}_n with kernel the skew-symmetric matrices, and that A+AT2\frac{A+A^T}2 is the symmetric matrix nearest to AA in the Frobenius norm. Compute the distance.

Hint

Show that symmetric and skew-symmetric matrices are orthogonal for the Frobenius inner product.

Then use Pythagoras.

Show solutionHide solution

Solution

Idea. The decomposition A=A+AT2+A−AT2A=\frac{A+A^T}2+\frac{A-A^T}2 is an orthogonal decomposition of MnM_n for ⟨X,Y⟩=tr⁡(XTY)\langle X,Y\rangle=\operatorname{tr}(X^TY), so the symmetric part is an orthogonal projection, and orthogonal projections give the best approximation.

Step 1: the projection. Let π(A)=A+AT2\pi(A)=\frac{A+A^T}2. It is linear, and π(A)T=π(A)\pi(A)^T=\pi(A) so it takes values in Symn\mathrm{Sym}_n. If AA is symmetric then π(A)=A\pi(A)=A. Hence π∘π=π\pi\circ\pi=\pi, and π\pi is onto Symn\mathrm{Sym}_n. π(A)=0\pi(A)=0 iff AT=−AA^T=-A: the kernel is the space Skewn\mathrm{Skew}_n of skew matrices. It is continuous as a linear map between finite-dimensional spaces (explicitly ∥π(A)∥F≤∥A∥F\|\pi(A)\|_F\le\|A\|_F).

Step 2: orthogonality. For SS symmetric and KK skew,
⟨S,K⟩=tr⁡(STK)=tr⁡(SK)=tr⁡((SK)T)=tr⁡(KTST)=−tr⁡(KS)=−tr⁡(SK),\langle S,K\rangle=\operatorname{tr}(S^TK)=\operatorname{tr}(SK)=\operatorname{tr}\big((SK)^T\big)=\operatorname{tr}(K^TS^T)=-\operatorname{tr}(KS)=-\operatorname{tr}(SK),
(using tr⁡(X)=tr⁡(XT)\operatorname{tr}(X)=\operatorname{tr}(X^T) and tr⁡(KS)=tr⁡(SK)\operatorname{tr}(KS)=\operatorname{tr}(SK)), so tr⁡(SK)=0\operatorname{tr}(SK)=0. Thus Symn⊥Skewn\mathrm{Sym}_n\perp\mathrm{Skew}_n and Mn=Symn⊕SkewnM_n=\mathrm{Sym}_n\oplus\mathrm{Skew}_n, an orthogonal direct sum.

Step 3: best approximation. Write A=S0+K0A=S_0+K_0 with S0=A+AT2S_0=\frac{A+A^T}2, K0=A−AT2K_0=\frac{A-A^T}2. For any S∈SymnS\in\mathrm{Sym}_n, the vector S0−SS_0-S is symmetric, so is orthogonal to K0K_0 and
∥A−S∥F2=∥K0∥F2+∥S0−S∥F2≥∥K0∥F2,\|A-S\|_F^2=\|K_0\|_F^2+\|S_0-S\|_F^2\ge\|K_0\|_F^2,
with equality iff S=S0S=S_0. So S0S_0 is the unique nearest symmetric matrix and
dist⁡F(A,Symn)=∥A−AT2∥F.\operatorname{dist}_F(A,\mathrm{Sym}_n)=\left\|\frac{A-A^T}2\right\|_F.

Example. A=(1203)A=\begin{pmatrix}1&2\\0&3\end{pmatrix}: S0=(1113)S_0=\begin{pmatrix}1&1\\1&3\end{pmatrix}, K0=(01−10)K_0=\begin{pmatrix}0&1\\-1&0\end{pmatrix}, distance 2\sqrt2.

Remark. The Frobenius norm is essential: for the operator norm the nearest symmetric matrix is in general *not* unique and not equal to S0S_0 (the operator-norm unit ball is not strictly convex).