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.

48 CHAPTER 2. CONVEX GEOMETRY<br />

T<br />

R 2 R 3<br />

dim domT = dim R(T)<br />

Figure 14: Linear injective mapping Tx=Ax : R 2 →R 3 of Euclidean<br />

body remains two-dimensional under mapping representing skinny full-rank<br />

matrix A∈ R 3×2 ; two bodies are isomorphic by Definition 2.2.1.0.1.<br />

2.2.1.1 Injective linear operators<br />

Injective mapping (transformation) means one-to-one mapping; synonymous<br />

with uniquely invertible linear mapping on Euclidean space. Linear injective<br />

mappings are fully characterized by lack of a nontrivial nullspace.<br />

2.2.1.1.1 Definition. Isometric isomorphism.<br />

An isometric isomorphism of a vector space having a metric defined on it is a<br />

linear bijective mapping T that preserves distance; id est, for all x,y ∈dom T<br />

‖Tx − Ty‖ = ‖x − y‖ (40)<br />

Then the isometric isomorphism T is a bijective isometry.<br />

Unitary linear operator Q : R k → R k representing orthogonal matrix<br />

Q∈ R k×k (B.5) is an isometric isomorphism; e.g., discrete Fourier transform<br />

via (747). Suppose T(X)= UXQ , for example. Then we say the Frobenius<br />

norm is orthogonally invariant; meaning, for X,Y ∈ R p×k and dimensionally<br />

compatible orthonormal matrix 2.13 U and orthogonal matrix Q<br />

‖U(X −Y )Q‖ F = ‖X −Y ‖ F (41)<br />

2.13 Any matrix U whose columns are orthonormal with respect to each other (U T U = I);<br />

these include the orthogonal matrices.<br />

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

Saved successfully!

Ooh no, something went wrong!