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.
The matrix A with rows (0,−1) and (2,0) turns the unit circle into an ellipse. It equals the quarter turn with rows (0,−1) and (1,0) times the stretch 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∣. This lesson proves that every real or complex matrix, square or rectangular, splits as A=U∣A∣ 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 A sends to zero. Throughout, F is R or C, the spaces Fn carry the standard inner product ⟨x,y⟩=x∗y, and a tuple such as (1,−1) stands for a column.
Key terms
Absolute value of a matrix
Definition Let A∈Fm×n. The matrix A∗A∈Fn×n is Hermitian, since (A∗A)∗=A∗A, and positive semidefinite, because x∗A∗Ax=∥Ax∥2≥0 for every x∈Fn. The absolute value of A is the unique Hermitian positive semidefinite square root of A∗A,
∣A∣=(A∗A)1/2∈Fn×n.
It acts on the input space Fn, and it is real symmetric when A is real. For every x∈Fn
∥∣A∣x∥2=x∗∣A∣2x=x∗A∗Ax=∥Ax∥2,
so ∣A∣ and A give every input the same length. Hence ker∣A∣=kerA, and since ∣A∣ is Hermitian, its image is (kerA)⊥. Suppose r=rankA≥1 and A=LrΣrVr∗ is a compact SVD, where Lr=[u1⋯ur] and Vr=[v1⋯vr] have orthonormal columns and Σr=diag(σ1,…,σr) holds the positive singular values. Then
∣A∣=VrΣrVr∗,
because this matrix is Hermitian positive semidefinite and its square is VrΣr2Vr∗=A∗A. So the positive eigenvalues of ∣A∣ are the positive singular values of A, with eigenvectors v1,…,vr. The left factor of the compact SVD is written Lr here rather than Ur, so that the letter U stays free for the polar factor below.
In plain words The absolute value is the pure stretching part of A. It stretches by σi along each input direction vi 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 A does. For a 1×1 matrix [z] it is the ordinary absolute value ∣z∣. 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 A with rows (−1,−2) and (2,1). Then
ATA=[5445],∣A∣=[2112].
The proposed root is symmetric, its square is ATA, and its eigenvalues are 3 on (1,1) and 1 on (1,−1), so it is the positive root. Lengths agree, for instance ∣A∣e1=(2,1) and Ae1=(−1,2) both have length 5. Taking absolute values of the entries gives the matrix with rows (1,2) and (2,1). It also squares to ATA, but its eigenvalue −1 on (1,−1) shows that it is not positive semidefinite, so it is not ∣A∣.
Polar decomposition
Definition Let A∈Fm×n. There is exactly one matrix U∈Fm×n such that
A=U∣A∣,Ux=0 for every x∈kerA.
This factorization is the polar decomposition of A, and U is its canonical polar factor. For existence, define U on the image of ∣A∣ by U(∣A∣x)=Ax. This is well defined, since ∣A∣x=∣A∣y gives ∥A(x−y)∥=∥∣A∣(x−y)∥=0. It is linear and keeps lengths on im∣A∣=(kerA)⊥, and then U is set to 0 on kerA. For uniqueness, any W with A=W∣A∣ satisfies W(∣A∣x)=Ax, so it agrees with U on (kerA)⊥, and the kernel condition fixes it on kerA. In a compact SVD as above,
U=LrVr∗,Uvi=ui,
and U∣A∣=LrVr∗VrΣrVr∗=LrΣrVr∗=A. Since LrΣr is one to one, kerA=kerVr∗, so this U also vanishes on kerA. If A=0 both factors are 0. Equivalently U=A∣A∣+, with the pseudoinverse of ∣A∣. The positive factor is forced as well. If A=WP with P∈Fn×n Hermitian positive semidefinite and W∗WP=P, for instance with W an isometry, then A∗A=PW∗WP=P2, so P=∣A∣. When m=n and A is invertible, ∣A∣ is positive definite, the kernel condition holds automatically, and
U=A∣A∣−1
is unitary, since U∗U=∣A∣−1A∗A∣A∣−1=I. Over R it is orthogonal. It is then the only matrix of any kind with A=U∣A∣. For real A all factors are real.
In plain words First ∣A∣ stretches along orthogonal input directions, then U carries the stretched directions rigidly onto the image of A. The factor U acts last, and the directions that ∣A∣ flattens are sent to zero rather than given an arbitrary image. For a nonzero complex number this is z=(z/∣z∣)∣z∣.
Example For the matrix A with rows (−1,−2) and (2,1) from the first card, ∣A∣ is invertible, and its inverse is 31 times the matrix with rows (2,−1) and (−1,2). So
U=A∣A∣−1=31[−12−21][2−1−12]=[01−10],
the counterclockwise quarter turn. The SVD route agrees. The unit vectors v1=(1,1)/2 and v2=(1,−1)/2 satisfy Av1=3u1 and Av2=u2 with u1=(−1,1)/2 and u2=(1,1)/2, and the quarter turn sends v1 to u1 and v2 to u2. So A triples lengths along (1,1), keeps them along (1,−1), and then applies the quarter turn. Reversing the factors gives ∣A∣U with rows (1,−2) and (2,−1), which is not A.
Partial isometry
Definition A matrix W∈Fm×n is a partial isometry if
∥Wx∥=∥x∥for every x∈(kerW)⊥.
Its initial space is (kerW)⊥ and its final space is imW. By the polarization identity W 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∗W is the orthogonal projector onto the initial space, and then WW∗ is the orthogonal projector onto the final space. The canonical polar factor U of A is a partial isometry with initial space (kerA)⊥ and final space imA. With the pseudoinverse,
U∗UUU∗=A+A=VrVr∗,=AA+=LrLr∗.
So U∗U=In exactly when kerA={0}, and UU∗=Im exactly when imA=Fm.
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 A with rows (0,0) and (3,0). Then ATA=diag(9,0), so ∣A∣=diag(3,0), and the canonical factor sends e1 to Ae1/3=e2 and sends e2∈kerA to 0,
U=[0100],U∣A∣=[0300]=A.
Its initial space is the line through e1 and its final space is the line through e2, and indeed UTU=diag(1,0) and UUT=diag(0,1). This partial isometry even satisfies U2=0, so all of its eigenvalues are 0, although it keeps every length on its initial space.
Isometry
Definition A matrix W∈Fm×n is an isometry if ∥Wx∥=∥x∥ for every x∈Fn. Equivalently W∗W=In, which says that the columns of W are orthonormal. An isometry is one to one, so it needs n≤m, and WW∗ is the orthogonal projector onto imW, equal to Im only when m=n. A square isometry is unitary, with W∗W=WW∗=I, and a real one is orthogonal. A matrix with WW∗=Im, that is with orthonormal rows, is a coisometry. It needs m≤n, and its adjoint W∗ is an isometry. Isometries and coisometries are partial isometries, with initial space Fn for an isometry and final space Fm for a coisometry. For A∈Fm×n of rank r, the canonical polar factor U is
an isometry exactly when r=n, that is when A has full column rank,
a coisometry exactly when r=m, that is when A has full row rank,
unitary exactly when m=n and A is invertible.
When r<min(m,n), neither U∗U nor 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 A loses no input direction, its polar factor is such an embedding, and when A reaches every output direction, its polar factor is a coisometry.
Example The matrix
A=210201
has full column rank, and ATA has rows (5,4) and (4,5) as in the first card, so ∣A∣ has rows (2,1) and (1,2). Since ∣A∣ is invertible,
U=A∣A∣−1=3122−12−12.
The columns are orthonormal, so UTU=I2 and U is an isometry. It is not a coisometry, since
UUT=9182225−42−45=I3−91ccT
with c=(1,−2,−2), a normal vector of the plane imA. This is the orthogonal projector onto that plane, not I3. Transposing the compact SVD shows that the canonical polar factor of the 2×3 matrix AT is UT, which has orthonormal rows. That factor is a coisometry and not an isometry.
Unitary extension
Definition Let A∈Fn×n have rank r and canonical polar factor U. A unitary extension of U is a unitary matrix W∈Fn×n, orthogonal when F=R, that agrees with U on (kerA)⊥. Because A=U∣A∣ and im∣A∣=(kerA)⊥, a unitary W satisfies A=W∣A∣ exactly when it agrees with U there, so the unitary extensions are exactly the unitary matrices with A=W∣A∣. Such a W maps (kerA)⊥ onto imA, so it maps kerA onto (imA)⊥. Conversely, every isometry Φ from kerA onto (imA)⊥, both of dimension n−r, combined with U on (kerA)⊥, gives a unitary extension. So unitary extensions always exist, and
if r=n, the only one is U itself,
if r<n and F=C, there are infinitely many, since Φ can be multiplied by any eiθ,
if r<n and F=R, there are at least two, from Φ and −Φ, exactly two when n−r=1, and infinitely many when n−r≥2, since Φ can be composed with any rotation of kerA.
A unitary matrix has zero kernel, so when r<n no unitary extension vanishes on kerA, and the uniqueness of U is not contradicted. For a rectangular A∈Fm×n with m≥n the same recipe, with an isometry from kerA into (imA)⊥, whose dimensions are n−r≤m−r, gives an isometric extension W with W∗W=In and A=W∣A∣. When m<n no isometry on all of Fn exists. A coisometric extension with WW∗=Im and A=W∣A∣ can be built instead, by mapping an (m−r)-dimensional subspace of kerA isometrically onto (imA)⊥ and sending the orthogonal complement of that subspace inside kerA to 0.
In plain words Once ∣A∣ has flattened some directions, the product W∣A∣ cannot see what W does to them. A unitary extension fills in that missing action by sending those directions rigidly onto the orthogonal complement of the image of A, 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 A with rows (0,0) and (3,0), where ∣A∣=diag(3,0) and U sends e1 to e2 and e2 to 0. Here kerA is the line through e2 and (imA)⊥ is the line through e1. Sending e2 to ce1 with ∣c∣=1 gives
Wc=[01c0],Wc∣A∣=[0300]=A.
Over R the two choices are c=1, the reflection across the line y=x with determinant −1, and c=−1, the counterclockwise quarter turn with determinant 1. So for a singular A not even the determinant of a unitary factor is determined. Over C every c=eiθ works.
Polar form with the positive factor on the left
Definition Let A∈Fm×n and let
K=(AA∗)1/2∈Fm×m
be the Hermitian positive semidefinite square root of AA∗, which is ∣A∗∣. With the same canonical polar factor U,
A=KU,K=U∣A∣U∗.
This is the polar form with the positive factor on the left. In a compact SVD K=LrΣrLr∗, and since Lr∗Lr=Vr∗Vr=Ir,
KU=LrΣrLr∗LrVr∗=LrΣrVr∗=A,
and multiplying out U∣A∣U∗ the same way gives K. The uniqueness condition now sits on the output side. Among all W with A=KW, the canonical U is the only one with imW⊆imA, because K is one to one on imK=imA. For a nonzero A whose image is not all of Fm, vanishing on kerA does not pin W down in this form. Adding to U a nonzero map that is zero on kerA and takes values in kerK=(imA)⊥ gives another such W. When A is square and invertible, U=K−1A is the same unitary as in A=U∣A∣. The two positive factors act on different sides, ∣A∣ on the input space Fn and K on the output space Fm, and for square A they are equal exactly when A∗A=AA∗, that is when A 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 A with rows (−1,−2) and (2,1),
AAT=[5−4−45],K=[2−1−12],
since this K is symmetric with eigenvalues 1 on (1,1) and 3 on (1,−1) and squares to AAT. With the quarter turn U found earlier,
KU=[2−1−12][01−10]=[−12−21]=A.
Here K differs from ∣A∣, which has rows (2,1) and (1,2), because ATA=AAT. The quarter turn carries (1,1), the direction that ∣A∣ triples, to (−1,1), and that is the direction that K triples.
Check yourself
Find ∣A∣, the canonical polar factor U and the left positive factor K=(AAT)1/2 for the real matrix A with rows (0,3) and (−4,0). Then compute ∣A∣U.
Show the answer
Here ATA=diag(16,9), so ∣A∣=diag(4,3). It is invertible, so
U=A∣A∣−1=[0−430][1/4001/3]=[0−110],
the clockwise quarter turn, an orthogonal matrix with determinant 1. On the other side AAT=diag(9,16), so K=diag(3,4), and KU has rows (0,3) and (−4,0), which is A. The reversed product ∣A∣U has rows (0,4) and (−3,0). That is not A, so the order of the factors matters.
The real matrix A with rows (1,1) and (1,1) is symmetric positive semidefinite, and A=IA. Is the identity I its canonical polar factor? If not, find the canonical factor and every orthogonal W with A=W∣A∣.
Show the answer
Since A is symmetric positive semidefinite and A2=ATA, uniqueness of the positive root gives ∣A∣=A. So A=I∣A∣ holds, but I is not the canonical factor, because it does not vanish on kerA, the line through (1,−1). The canonical factor satisfies U(∣A∣x)=Ax, so it fixes every vector of imA, the line through (1,1), and sends kerA to 0. That makes it the orthogonal projector
U=21[1111].
Here (imA)⊥ is again the line through (1,−1), so an orthogonal extension sends the unit vector (1,−1)/2 to itself or to its negative. That gives exactly two, W=I and W=2U−I, which swaps the two coordinates. Both satisfy W∣A∣=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 I only when the matrix is invertible.
Let A∈R3×2 have rows (1,1), (0,0) and (1,1). Find ∣A∣, the canonical factor U and the projectors UTU and UUT. Then find an isometry W∈R3×2 with A=W∣A∣ and explain why it is not the canonical polar factor.
Show the answer
Every entry of ATA is 2. The 2×2 matrix with every entry 1 is symmetric, has eigenvalues 2 and 0, and squares to ATA, so it is ∣A∣. The rank is 1, with v1=(1,1)/2, σ1=2 and u1=Av1/2=(1,0,1)/2, so
U=u1v1T=21101101.
The two products are
UTU=21[1111],UUT=21101000101,
the orthogonal projectors onto (kerA)⊥, the line through (1,1), and onto imA, the line through (1,0,1). Neither is an identity, so the rank one factor U is neither an isometry nor a coisometry.
For an isometric extension, send the unit kernel vector (1,−1)/2 to a unit vector of (imA)⊥, for instance (1,0,−1)/2. That adds 21 times the matrix with rows (1,−1), (0,0) and (−1,1) to U and gives
W=100001.
Its columns are orthonormal, so WTW=I2, and W∣A∣ has rows (1,1), (0,0) and (1,1), which is A. It is not the canonical factor, because W(1,−1)=(1,0,−1)=0, so it does not vanish on kerA. Choosing e2 in place of (1,0,−1)/2 gives another isometric extension, while the canonical U is unique.
May we count page visits to understand which courses and learning features are useful? Cloudflare collects visit and performance statistics, without your account details or answers. Your choice does not affect access. Details