10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

5.7. EMBEDDING IN AFFINE HULL 395<br />

For any matrix whose range is R(V )= N(1 T ) we get the same result; e.g.,<br />

because<br />

r = dim R(XV †T<br />

N ) (938)<br />

R(XV ) = {Xz | z ∈ N(1 T )} (939)<br />

and R(V ) = R(V N ) = R(V †T<br />

N<br />

) (E). These auxiliary matrices (B.4.2) are<br />

more closely related;<br />

V = V N V † N<br />

(1541)<br />

5.7.1.1 Affine dimension r versus rank<br />

Now, suppose D is an EDM as defined by<br />

D(X) ∆ = δ(X T X)1 T + 1δ(X T X) T − 2X T X ∈ EDM N (798)<br />

and we premultiply by −V T N and postmultiply by V N . Then because V T N 1=0<br />

(805), it is always true that<br />

−V T NDV N = 2V T NX T XV N = 2V T N GV N ∈ S N−1 (940)<br />

where G is a Gram matrix.<br />

(confer (820))<br />

Similarly pre- and postmultiplying by V<br />

−V DV = 2V X T XV = 2V GV ∈ S N (941)<br />

always holds because V 1=0 (1531). Likewise, multiplying inner-product<br />

form EDM definition (863), it always holds:<br />

−V T NDV N = Θ T Θ ∈ S N−1 (867)<br />

For any matrix A , rankA T A = rankA = rankA T . [176,0.4] 5.31 So, by<br />

(939), affine dimension<br />

r = rankXV = rankXV N = rankXV †T<br />

N<br />

= rank Θ<br />

= rankV DV = rankV GV = rankVN TDV N = rankVN TGV N<br />

(942)<br />

5.31 For A∈R m×n , N(A T A) = N(A). [287,3.3]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!