Unit 7, lesson 37

Polar Decomposition

The polar decomposition of a real or complex matrix into a partial isometry times its absolute value, when that factor is an isometry or unitary, unitary extensions, and the polar form with the positive factor on the left.

  • Video 37
  • Square Roots and Polar Factors

The matrix AA with rows (0,−1)(0, -1) and (2,0)(2, 0) turns the unit circle into an ellipse. It equals the quarter turn with rows (0,−1)(0, -1) and (1,0)(1, 0) times the stretch diag⁡(2,1)\operatorname{diag}(2, 1), so it doubles horizontal lengths first and then turns the plane rigidly, much as a complex number factors as z=eiθ∣z∣z = e^{i\theta}\lvert z \rvert. This lesson proves that every real or complex matrix, square or rectangular, splits as A=U∣A∣A = U\lvert A \rvert into a positive stretch followed by a map that keeps lengths on the directions that survive. It also settles which factor is unique and what freedom appears in the directions that AA sends to zero. Throughout, F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, the spaces Fn\mathbb{F}^n carry the standard inner product ⟨x,y⟩=x∗y\langle x, y \rangle = x^{*}y, and a tuple such as (1,−1)(1, -1) stands for a column.

Key terms

Absolute value of a matrix

Definition Let A∈Fm×nA \in \mathbb{F}^{m \times n}. The matrix A∗A∈Fn×nA^{*}A \in \mathbb{F}^{n \times n} is Hermitian, since (A∗A)∗=A∗A(A^{*}A)^{*} = A^{*}A, and positive semidefinite, because x∗A∗Ax=∥Ax∥2≥0x^{*}A^{*}Ax = \lVert Ax \rVert^2 \ge 0 for every x∈Fnx \in \mathbb{F}^n. The absolute value of AA is the unique Hermitian positive semidefinite square root of A∗AA^{*}A,

∣A∣=(A∗A)1/2∈Fn×n.\lvert A \rvert = (A^{*}A)^{1/2} \in \mathbb{F}^{n \times n}.

It acts on the input space Fn\mathbb{F}^n, and it is real symmetric when AA is real. For every x∈Fnx \in \mathbb{F}^n

∥∣A∣x∥2=x∗∣A∣2x=x∗A∗Ax=∥Ax∥2,\begin{aligned} \lVert \lvert A \rvert x \rVert^2 &= x^{*}\lvert A \rvert^2 x \\[0.4em] &= x^{*}A^{*}Ax \\[0.4em] &= \lVert Ax \rVert^2, \end{aligned}

so ∣A∣\lvert A \rvert and AA give every input the same length. Hence ker⁡∣A∣=ker⁡A\ker \lvert A \rvert = \ker A, and since ∣A∣\lvert A \rvert is Hermitian, its image is (ker⁡A)⊥(\ker A)^{\perp}. Suppose r=rank⁡A≥1r = \operatorname{rank} A \ge 1 and A=LrΣrVr∗A = L_r\Sigma_r V_r^{*} is a compact SVD, where Lr=[u1 ⋯ ur]L_r = [u_1 \ \cdots \ u_r] and Vr=[v1 ⋯ vr]V_r = [v_1 \ \cdots \ v_r] have orthonormal columns and Σr=diag⁡(σ1,…,σr)\Sigma_r = \operatorname{diag}(\sigma_1, \dots, \sigma_r) holds the positive singular values. Then

∣A∣=VrΣrVr∗,\lvert A \rvert = V_r\Sigma_r V_r^{*},

because this matrix is Hermitian positive semidefinite and its square is VrΣr2Vr∗=A∗AV_r\Sigma_r^2 V_r^{*} = A^{*}A. So the positive eigenvalues of ∣A∣\lvert A \rvert are the positive singular values of AA, with eigenvectors v1,…,vrv_1, \dots, v_r. The left factor of the compact SVD is written LrL_r here rather than UrU_r, so that the letter UU stays free for the polar factor below.

In plain words The absolute value is the pure stretching part of AA. It stretches by σi\sigma_i along each input direction viv_i and flattens the kernel, keeping each of these directions on its own line with no rotation or reflection, yet it changes every length exactly as AA does. For a 1×11 \times 1 matrix [z][z] it is the ordinary absolute value ∣z∣\lvert z \rvert. Watch for this. In general it is not the matrix of absolute values of the entries, although the two agree for a diagonal matrix.

Example Take AA with rows (−1,−2)(-1, -2) and (2,1)(2, 1). Then

ATA=[5445],∣A∣=[2112].A^{\mathsf{T}}A = \begin{bmatrix} 5 & 4 \\ 4 & 5 \end{bmatrix}, \qquad \lvert A \rvert = \begin{bmatrix} 2 & 1 \\ 1 & 2 \end{bmatrix}.

The proposed root is symmetric, its square is ATAA^{\mathsf{T}}A, and its eigenvalues are 33 on (1,1)(1, 1) and 11 on (1,−1)(1, -1), so it is the positive root. Lengths agree, for instance ∣A∣e1=(2,1)\lvert A \rvert e_1 = (2, 1) and Ae1=(−1,2)Ae_1 = (-1, 2) both have length 5\sqrt{5}. Taking absolute values of the entries gives the matrix with rows (1,2)(1, 2) and (2,1)(2, 1). It also squares to ATAA^{\mathsf{T}}A, but its eigenvalue −1-1 on (1,−1)(1, -1) shows that it is not positive semidefinite, so it is not ∣A∣\lvert A \rvert.

Polar decomposition

Definition Let A∈Fm×nA \in \mathbb{F}^{m \times n}. There is exactly one matrix U∈Fm×nU \in \mathbb{F}^{m \times n} such that

A=U∣A∣,Ux=0  for every x∈ker⁡A.\begin{gathered} A = U\lvert A \rvert, \\[0.4em] Ux = 0 \ \text{ for every } x \in \ker A. \end{gathered}

This factorization is the polar decomposition of AA, and UU is its canonical polar factor. For existence, define UU on the image of ∣A∣\lvert A \rvert by U(∣A∣x)=AxU(\lvert A \rvert x) = Ax. This is well defined, since ∣A∣x=∣A∣y\lvert A \rvert x = \lvert A \rvert y gives ∥A(x−y)∥=∥∣A∣(x−y)∥=0\lVert A(x - y) \rVert = \lVert \lvert A \rvert (x - y) \rVert = 0. It is linear and keeps lengths on im⁡∣A∣=(ker⁡A)⊥\operatorname{im}\lvert A \rvert = (\ker A)^{\perp}, and then UU is set to 00 on ker⁡A\ker A. For uniqueness, any WW with A=W∣A∣A = W\lvert A \rvert satisfies W(∣A∣x)=AxW(\lvert A \rvert x) = Ax, so it agrees with UU on (ker⁡A)⊥(\ker A)^{\perp}, and the kernel condition fixes it on ker⁡A\ker A. In a compact SVD as above,

U=LrVr∗,Uvi=ui,U = L_r V_r^{*}, \qquad Uv_i = u_i,

and U∣A∣=LrVr∗VrΣrVr∗=LrΣrVr∗=AU\lvert A \rvert = L_r V_r^{*}V_r\Sigma_r V_r^{*} = L_r\Sigma_r V_r^{*} = A. Since LrΣrL_r\Sigma_r is one to one, ker⁡A=ker⁡Vr∗\ker A = \ker V_r^{*}, so this UU also vanishes on ker⁡A\ker A. If A=0A = 0 both factors are 00. Equivalently U=A∣A∣+U = A\lvert A \rvert^{+}, with the pseudoinverse of ∣A∣\lvert A \rvert. The positive factor is forced as well. If A=WPA = WP with P∈Fn×nP \in \mathbb{F}^{n \times n} Hermitian positive semidefinite and W∗WP=PW^{*}WP = P, for instance with WW an isometry, then A∗A=PW∗WP=P2A^{*}A = PW^{*}WP = P^2, so P=∣A∣P = \lvert A \rvert. When m=nm = n and AA is invertible, ∣A∣\lvert A \rvert is positive definite, the kernel condition holds automatically, and

U=A∣A∣−1U = A\lvert A \rvert^{-1}

is unitary, since U∗U=∣A∣−1A∗A∣A∣−1=IU^{*}U = \lvert A \rvert^{-1}A^{*}A\lvert A \rvert^{-1} = I. Over R\mathbb{R} it is orthogonal. It is then the only matrix of any kind with A=U∣A∣A = U\lvert A \rvert. For real AA all factors are real.

In plain words First ∣A∣\lvert A \rvert stretches along orthogonal input directions, then UU carries the stretched directions rigidly onto the image of AA. The factor UU acts last, and the directions that ∣A∣\lvert A \rvert flattens are sent to zero rather than given an arbitrary image. For a nonzero complex number this is z=(z/∣z∣) ∣z∣z = (z / \lvert z \rvert)\,\lvert z \rvert.

Example For the matrix AA with rows (−1,−2)(-1, -2) and (2,1)(2, 1) from the first card, ∣A∣\lvert A \rvert is invertible, and its inverse is 13\frac{1}{3} times the matrix with rows (2,−1)(2, -1) and (−1,2)(-1, 2). So

U=A∣A∣−1=13[−1−221][2−1−12]=[0−110],\begin{aligned} U &= A\lvert A \rvert^{-1} \\[0.4em] &= \frac{1}{3}\begin{bmatrix} -1 & -2 \\ 2 & 1 \end{bmatrix}\begin{bmatrix} 2 & -1 \\ -1 & 2 \end{bmatrix} \\[0.4em] &= \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}, \end{aligned}

the counterclockwise quarter turn. The SVD route agrees. The unit vectors v1=(1,1)/2v_1 = (1, 1)/\sqrt{2} and v2=(1,−1)/2v_2 = (1, -1)/\sqrt{2} satisfy Av1=3u1Av_1 = 3u_1 and Av2=u2Av_2 = u_2 with u1=(−1,1)/2u_1 = (-1, 1)/\sqrt{2} and u2=(1,1)/2u_2 = (1, 1)/\sqrt{2}, and the quarter turn sends v1v_1 to u1u_1 and v2v_2 to u2u_2. So AA triples lengths along (1,1)(1, 1), keeps them along (1,−1)(1, -1), and then applies the quarter turn. Reversing the factors gives ∣A∣U\lvert A \rvert U with rows (1,−2)(1, -2) and (2,−1)(2, -1), which is not AA.

Partial isometry

Definition A matrix W∈Fm×nW \in \mathbb{F}^{m \times n} is a partial isometry if

∥Wx∥=∥x∥for every x∈(ker⁡W)⊥.\begin{gathered} \lVert Wx \rVert = \lVert x \rVert \\[0.4em] \text{for every } x \in (\ker W)^{\perp}. \end{gathered}

Its initial space is (ker⁡W)⊥(\ker W)^{\perp} and its final space is im⁡W\operatorname{im} W. By the polarization identity WW preserves inner products on the initial space, so it maps that space one to one onto the final space, and the two have the same dimension. Equivalently, W∗WW^{*}W is the orthogonal projector onto the initial space, and then WW∗WW^{*} is the orthogonal projector onto the final space. The canonical polar factor UU of AA is a partial isometry with initial space (ker⁡A)⊥(\ker A)^{\perp} and final space im⁡A\operatorname{im} A. With the pseudoinverse,

U∗U=A+A=VrVr∗,UU∗=AA+=LrLr∗.\begin{aligned} U^{*}U &= A^{+}A = V_r V_r^{*}, \\[0.4em] UU^{*} &= AA^{+} = L_r L_r^{*}. \end{aligned}

So U∗U=InU^{*}U = I_n exactly when ker⁡A={0}\ker A = \{0\}, and UU∗=ImUU^{*} = I_m exactly when im⁡A=Fm\operatorname{im} A = \mathbb{F}^m.

In plain words A partial isometry is rigid on one subspace and zero on its orthogonal complement. It moves the initial space onto the final space without changing any length or angle, and it discards everything perpendicular to the initial space.

Example Take AA with rows (0,0)(0, 0) and (3,0)(3, 0). Then ATA=diag⁡(9,0)A^{\mathsf{T}}A = \operatorname{diag}(9, 0), so ∣A∣=diag⁡(3,0)\lvert A \rvert = \operatorname{diag}(3, 0), and the canonical factor sends e1e_1 to Ae1/3=e2Ae_1/3 = e_2 and sends e2∈ker⁡Ae_2 \in \ker A to 00,

U=[0010],U∣A∣=[0030]=A.\begin{gathered} U = \begin{bmatrix} 0 & 0 \\ 1 & 0 \end{bmatrix}, \\[0.4em] U\lvert A \rvert = \begin{bmatrix} 0 & 0 \\ 3 & 0 \end{bmatrix} = A. \end{gathered}

Its initial space is the line through e1e_1 and its final space is the line through e2e_2, and indeed UTU=diag⁡(1,0)U^{\mathsf{T}}U = \operatorname{diag}(1, 0) and UUT=diag⁡(0,1)UU^{\mathsf{T}} = \operatorname{diag}(0, 1). This partial isometry even satisfies U2=0U^2 = 0, so all of its eigenvalues are 00, although it keeps every length on its initial space.

Isometry

Definition A matrix W∈Fm×nW \in \mathbb{F}^{m \times n} is an isometry if ∥Wx∥=∥x∥\lVert Wx \rVert = \lVert x \rVert for every x∈Fnx \in \mathbb{F}^n. Equivalently W∗W=InW^{*}W = I_n, which says that the columns of WW are orthonormal. An isometry is one to one, so it needs n≤mn \le m, and WW∗WW^{*} is the orthogonal projector onto im⁡W\operatorname{im} W, equal to ImI_m only when m=nm = n. A square isometry is unitary, with W∗W=WW∗=IW^{*}W = WW^{*} = I, and a real one is orthogonal. A matrix with WW∗=ImWW^{*} = I_m, that is with orthonormal rows, is a coisometry. It needs m≤nm \le n, and its adjoint W∗W^{*} is an isometry. Isometries and coisometries are partial isometries, with initial space Fn\mathbb{F}^n for an isometry and final space Fm\mathbb{F}^m for a coisometry. For A∈Fm×nA \in \mathbb{F}^{m \times n} of rank rr, the canonical polar factor UU is

  • an isometry exactly when r=nr = n, that is when AA has full column rank,
  • a coisometry exactly when r=mr = m, that is when AA has full row rank,
  • unitary exactly when m=nm = n and AA is invertible.

When r<min⁡(m,n)r < \min(m, n), neither U∗UU^{*}U nor UU∗UU^{*} is an identity.

In plain words An isometry keeps every length and angle of its input space, so it places an exact copy of that space inside a possibly larger output space. When AA loses no input direction, its polar factor is such an embedding, and when AA reaches every output direction, its polar factor is a coisometry.

Example The matrix

A=[221001]A = \begin{bmatrix} 2 & 2 \\ 1 & 0 \\ 0 & 1 \end{bmatrix}

has full column rank, and ATAA^{\mathsf{T}}A has rows (5,4)(5, 4) and (4,5)(4, 5) as in the first card, so ∣A∣\lvert A \rvert has rows (2,1)(2, 1) and (1,2)(1, 2). Since ∣A∣\lvert A \rvert is invertible,

U=A∣A∣−1=13[222−1−12].U = A\lvert A \rvert^{-1} = \frac{1}{3}\begin{bmatrix} 2 & 2 \\ 2 & -1 \\ -1 & 2 \end{bmatrix}.

The columns are orthonormal, so UTU=I2U^{\mathsf{T}}U = I_2 and UU is an isometry. It is not a coisometry, since

UUT=19[82225−42−45]=I3−19 ccT\begin{aligned} UU^{\mathsf{T}} &= \frac{1}{9}\begin{bmatrix} 8 & 2 & 2 \\ 2 & 5 & -4 \\ 2 & -4 & 5 \end{bmatrix} \\[0.4em] &= I_3 - \tfrac{1}{9}\,cc^{\mathsf{T}} \end{aligned}

with c=(1,−2,−2)c = (1, -2, -2), a normal vector of the plane im⁡A\operatorname{im} A. This is the orthogonal projector onto that plane, not I3I_3. Transposing the compact SVD shows that the canonical polar factor of the 2×32 \times 3 matrix ATA^{\mathsf{T}} is UTU^{\mathsf{T}}, which has orthonormal rows. That factor is a coisometry and not an isometry.

Unitary extension

Definition Let A∈Fn×nA \in \mathbb{F}^{n \times n} have rank rr and canonical polar factor UU. A unitary extension of UU is a unitary matrix W∈Fn×nW \in \mathbb{F}^{n \times n}, orthogonal when F=R\mathbb{F} = \mathbb{R}, that agrees with UU on (ker⁡A)⊥(\ker A)^{\perp}. Because A=U∣A∣A = U\lvert A \rvert and im⁡∣A∣=(ker⁡A)⊥\operatorname{im}\lvert A \rvert = (\ker A)^{\perp}, a unitary WW satisfies A=W∣A∣A = W\lvert A \rvert exactly when it agrees with UU there, so the unitary extensions are exactly the unitary matrices with A=W∣A∣A = W\lvert A \rvert. Such a WW maps (ker⁡A)⊥(\ker A)^{\perp} onto im⁡A\operatorname{im} A, so it maps ker⁡A\ker A onto (im⁡A)⊥(\operatorname{im} A)^{\perp}. Conversely, every isometry Φ\Phi from ker⁡A\ker A onto (im⁡A)⊥(\operatorname{im} A)^{\perp}, both of dimension n−rn - r, combined with UU on (ker⁡A)⊥(\ker A)^{\perp}, gives a unitary extension. So unitary extensions always exist, and

  • if r=nr = n, the only one is UU itself,
  • if r<nr < n and F=C\mathbb{F} = \mathbb{C}, there are infinitely many, since Φ\Phi can be multiplied by any eiθe^{i\theta},
  • if r<nr < n and F=R\mathbb{F} = \mathbb{R}, there are at least two, from Φ\Phi and −Φ-\Phi, exactly two when n−r=1n - r = 1, and infinitely many when n−r≥2n - r \ge 2, since Φ\Phi can be composed with any rotation of ker⁡A\ker A.

A unitary matrix has zero kernel, so when r<nr < n no unitary extension vanishes on ker⁡A\ker A, and the uniqueness of UU is not contradicted. For a rectangular A∈Fm×nA \in \mathbb{F}^{m \times n} with m≥nm \ge n the same recipe, with an isometry from ker⁡A\ker A into (im⁡A)⊥(\operatorname{im} A)^{\perp}, whose dimensions are n−r≤m−rn - r \le m - r, gives an isometric extension WW with W∗W=InW^{*}W = I_n and A=W∣A∣A = W\lvert A \rvert. When m<nm < n no isometry on all of Fn\mathbb{F}^n exists. A coisometric extension with WW∗=ImWW^{*} = I_m and A=W∣A∣A = W\lvert A \rvert can be built instead, by mapping an (m−r)(m - r)-dimensional subspace of ker⁡A\ker A isometrically onto (im⁡A)⊥(\operatorname{im} A)^{\perp} and sending the orthogonal complement of that subspace inside ker⁡A\ker A to 00.

In plain words Once ∣A∣\lvert A \rvert has flattened some directions, the product W∣A∣W\lvert A \rvert cannot see what WW does to them. A unitary extension fills in that missing action by sending those directions rigidly onto the orthogonal complement of the image of AA, which can be done in more than one way. The canonical factor makes the one choice that sends them to zero instead.

Example Continue with AA with rows (0,0)(0, 0) and (3,0)(3, 0), where ∣A∣=diag⁡(3,0)\lvert A \rvert = \operatorname{diag}(3, 0) and UU sends e1e_1 to e2e_2 and e2e_2 to 00. Here ker⁡A\ker A is the line through e2e_2 and (im⁡A)⊥(\operatorname{im} A)^{\perp} is the line through e1e_1. Sending e2e_2 to ce1ce_1 with ∣c∣=1\lvert c \rvert = 1 gives

Wc=[0c10],Wc∣A∣=[0030]=A.\begin{gathered} W_c = \begin{bmatrix} 0 & c \\ 1 & 0 \end{bmatrix}, \\[0.4em] W_c\lvert A \rvert = \begin{bmatrix} 0 & 0 \\ 3 & 0 \end{bmatrix} = A. \end{gathered}

Over R\mathbb{R} the two choices are c=1c = 1, the reflection across the line y=xy = x with determinant −1-1, and c=−1c = -1, the counterclockwise quarter turn with determinant 11. So for a singular AA not even the determinant of a unitary factor is determined. Over C\mathbb{C} every c=eiθc = e^{i\theta} works.

Polar form with the positive factor on the left

Definition Let A∈Fm×nA \in \mathbb{F}^{m \times n} and let

K=(AA∗)1/2∈Fm×mK = (AA^{*})^{1/2} \in \mathbb{F}^{m \times m}

be the Hermitian positive semidefinite square root of AA∗AA^{*}, which is ∣A∗∣\lvert A^{*} \rvert. With the same canonical polar factor UU,

A=KU,K=U∣A∣U∗.A = KU, \qquad K = U\lvert A \rvert U^{*}.

This is the polar form with the positive factor on the left. In a compact SVD K=LrΣrLr∗K = L_r\Sigma_r L_r^{*}, and since Lr∗Lr=Vr∗Vr=IrL_r^{*}L_r = V_r^{*}V_r = I_r,

KU=LrΣrLr∗LrVr∗=LrΣrVr∗=A,KU = L_r\Sigma_r L_r^{*}L_r V_r^{*} = L_r\Sigma_r V_r^{*} = A,

and multiplying out U∣A∣U∗U\lvert A \rvert U^{*} the same way gives KK. The uniqueness condition now sits on the output side. Among all WW with A=KWA = KW, the canonical UU is the only one with im⁡W⊆im⁡A\operatorname{im} W \subseteq \operatorname{im} A, because KK is one to one on im⁡K=im⁡A\operatorname{im} K = \operatorname{im} A. For a nonzero AA whose image is not all of Fm\mathbb{F}^m, vanishing on ker⁡A\ker A does not pin WW down in this form. Adding to UU a nonzero map that is zero on ker⁡A\ker A and takes values in ker⁡K=(im⁡A)⊥\ker K = (\operatorname{im} A)^{\perp} gives another such WW. When AA is square and invertible, U=K−1AU = K^{-1}A is the same unitary as in A=U∣A∣A = U\lvert A \rvert. The two positive factors act on different sides, ∣A∣\lvert A \rvert on the input space Fn\mathbb{F}^n and KK on the output space Fm\mathbb{F}^m, and for square AA they are equal exactly when A∗A=AA∗A^{*}A = AA^{*}, that is when AA is normal.

In plain words In this form the rigid part acts first and the stretch comes afterward, along orthogonal directions of the output space. The stretch factors are the same singular values, but the axes have moved, so the positive matrix is usually a different one.

Example For AA with rows (−1,−2)(-1, -2) and (2,1)(2, 1),

AAT=[5−4−45],K=[2−1−12],\begin{gathered} AA^{\mathsf{T}} = \begin{bmatrix} 5 & -4 \\ -4 & 5 \end{bmatrix}, \\[0.4em] K = \begin{bmatrix} 2 & -1 \\ -1 & 2 \end{bmatrix}, \end{gathered}

since this KK is symmetric with eigenvalues 11 on (1,1)(1, 1) and 33 on (1,−1)(1, -1) and squares to AATAA^{\mathsf{T}}. With the quarter turn UU found earlier,

KU=[2−1−12][0−110]=[−1−221]=A.\begin{aligned} KU &= \begin{bmatrix} 2 & -1 \\ -1 & 2 \end{bmatrix}\begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix} \\[0.4em] &= \begin{bmatrix} -1 & -2 \\ 2 & 1 \end{bmatrix} = A. \end{aligned}

Here KK differs from ∣A∣\lvert A \rvert, which has rows (2,1)(2, 1) and (1,2)(1, 2), because ATA≠AATA^{\mathsf{T}}A \ne AA^{\mathsf{T}}. The quarter turn carries (1,1)(1, 1), the direction that ∣A∣\lvert A \rvert triples, to (−1,1)(-1, 1), and that is the direction that KK triples.

Check yourself

  1. Find ∣A∣\lvert A \rvert, the canonical polar factor UU and the left positive factor K=(AAT)1/2K = (AA^{\mathsf{T}})^{1/2} for the real matrix AA with rows (0,3)(0, 3) and (−4,0)(-4, 0). Then compute ∣A∣U\lvert A \rvert U.
Show the answer

Here ATA=diag⁡(16,9)A^{\mathsf{T}}A = \operatorname{diag}(16, 9), so ∣A∣=diag⁡(4,3)\lvert A \rvert = \operatorname{diag}(4, 3). It is invertible, so

U=A∣A∣−1=[03−40][1/4001/3]=[01−10],\begin{aligned} U = A\lvert A \rvert^{-1} &= \begin{bmatrix} 0 & 3 \\ -4 & 0 \end{bmatrix}\begin{bmatrix} 1/4 & 0 \\ 0 & 1/3 \end{bmatrix} \\[0.4em] &= \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, \end{aligned}

the clockwise quarter turn, an orthogonal matrix with determinant 11. On the other side AAT=diag⁡(9,16)AA^{\mathsf{T}} = \operatorname{diag}(9, 16), so K=diag⁡(3,4)K = \operatorname{diag}(3, 4), and KUKU has rows (0,3)(0, 3) and (−4,0)(-4, 0), which is AA. The reversed product ∣A∣U\lvert A \rvert U has rows (0,4)(0, 4) and (−3,0)(-3, 0). That is not AA, so the order of the factors matters.

  1. The real matrix AA with rows (1,1)(1, 1) and (1,1)(1, 1) is symmetric positive semidefinite, and A=I AA = I\,A. Is the identity II its canonical polar factor? If not, find the canonical factor and every orthogonal WW with A=W∣A∣A = W\lvert A \rvert.
Show the answer

Since AA is symmetric positive semidefinite and A2=ATAA^2 = A^{\mathsf{T}}A, uniqueness of the positive root gives ∣A∣=A\lvert A \rvert = A. So A=I∣A∣A = I\lvert A \rvert holds, but II is not the canonical factor, because it does not vanish on ker⁡A\ker A, the line through (1,−1)(1, -1). The canonical factor satisfies U(∣A∣x)=AxU(\lvert A \rvert x) = Ax, so it fixes every vector of im⁡A\operatorname{im} A, the line through (1,1)(1, 1), and sends ker⁡A\ker A to 00. That makes it the orthogonal projector

U=12[1111].U = \frac{1}{2}\begin{bmatrix} 1 & 1 \\ 1 & 1 \end{bmatrix}.

Here (im⁡A)⊥(\operatorname{im} A)^{\perp} is again the line through (1,−1)(1, -1), so an orthogonal extension sends the unit vector (1,−1)/2(1, -1)/\sqrt{2} to itself or to its negative. That gives exactly two, W=IW = I and W=2U−IW = 2U - I, which swaps the two coordinates. Both satisfy W∣A∣=AW\lvert A \rvert = A. In general a positive semidefinite matrix is its own absolute value, and its canonical polar factor is the orthogonal projector onto its image, which is II only when the matrix is invertible.

  1. Let A∈R3×2A \in \mathbb{R}^{3 \times 2} have rows (1,1)(1, 1), (0,0)(0, 0) and (1,1)(1, 1). Find ∣A∣\lvert A \rvert, the canonical factor UU and the projectors UTUU^{\mathsf{T}}U and UUTUU^{\mathsf{T}}. Then find an isometry W∈R3×2W \in \mathbb{R}^{3 \times 2} with A=W∣A∣A = W\lvert A \rvert and explain why it is not the canonical polar factor.
Show the answer

Every entry of ATAA^{\mathsf{T}}A is 22. The 2×22 \times 2 matrix with every entry 11 is symmetric, has eigenvalues 22 and 00, and squares to ATAA^{\mathsf{T}}A, so it is ∣A∣\lvert A \rvert. The rank is 11, with v1=(1,1)/2v_1 = (1, 1)/\sqrt{2}, σ1=2\sigma_1 = 2 and u1=Av1/2=(1,0,1)/2u_1 = Av_1/2 = (1, 0, 1)/\sqrt{2}, so

U=u1v1T=12[110011].U = u_1 v_1^{\mathsf{T}} = \frac{1}{2}\begin{bmatrix} 1 & 1 \\ 0 & 0 \\ 1 & 1 \end{bmatrix}.

The two products are

UTU=12[1111],UUT=12[101000101],\begin{gathered} U^{\mathsf{T}}U = \frac{1}{2}\begin{bmatrix} 1 & 1 \\ 1 & 1 \end{bmatrix}, \\[0.4em] UU^{\mathsf{T}} = \frac{1}{2}\begin{bmatrix} 1 & 0 & 1 \\ 0 & 0 & 0 \\ 1 & 0 & 1 \end{bmatrix}, \end{gathered}

the orthogonal projectors onto (ker⁡A)⊥(\ker A)^{\perp}, the line through (1,1)(1, 1), and onto im⁡A\operatorname{im} A, the line through (1,0,1)(1, 0, 1). Neither is an identity, so the rank one factor UU is neither an isometry nor a coisometry.

For an isometric extension, send the unit kernel vector (1,−1)/2(1, -1)/\sqrt{2} to a unit vector of (im⁡A)⊥(\operatorname{im} A)^{\perp}, for instance (1,0,−1)/2(1, 0, -1)/\sqrt{2}. That adds 12\frac{1}{2} times the matrix with rows (1,−1)(1, -1), (0,0)(0, 0) and (−1,1)(-1, 1) to UU and gives

W=[100001].W = \begin{bmatrix} 1 & 0 \\ 0 & 0 \\ 0 & 1 \end{bmatrix}.

Its columns are orthonormal, so WTW=I2W^{\mathsf{T}}W = I_2, and W∣A∣W\lvert A \rvert has rows (1,1)(1, 1), (0,0)(0, 0) and (1,1)(1, 1), which is AA. It is not the canonical factor, because W(1,−1)=(1,0,−1)≠0W(1, -1) = (1, 0, -1) \ne 0, so it does not vanish on ker⁡A\ker A. Choosing e2e_2 in place of (1,0,−1)/2(1, 0, -1)/\sqrt{2} gives another isometric extension, while the canonical UU is unique.

How this lesson connects