Thank you for your reply!
You are right, E and D are matrices. Let me state my question more clearly.
I want to find a projection that maximally preserves the Euclidean distance between two points (vectors in general). Consider a 2-D example as show in the figure. The direction that maximally preserves the distance between c1 and c2 will be (c2-c1), or I can say it's the row space for matrix E = [(c2-c1)].
http://www.personal.psu.edu/sxy162/temp/1.jpg
If c2 and c1 have the same norm, then (c2+ c1) is perpendicular to (c2 - c1), or (c2-c1)*(c2+c1)' = 0. Therefore, instead of projecting to row of matrix E = [(c2-c1)], I can project to the null space of matrix D = [(c2 + c1)], right? It only works if all the vectors are normalized.
Now my question is about more general problem. Say
E = [
(c1,1 - c1,2)
(c2,1 - c2, 2)
...
(cn,1 - cn, 2)
]
and
D =
[
(c1,1 + c1,2)
(c2,1 + c2, 2)
...
(cn,1 + cn, 2)
]
Now, matrices E and D each has n rows, instead of 1 row in the first example.
The question is, can I still say that, projecting to null(D) is equivalent to projecting to row(E)?