Define $A$ as a linear transformation $A : Y \to Y$ on finite-dimensional inner product space $Y$ that preserves
- $\vert Ay\vert=\vert y \vert, \forall y\in Y$
- $\langle Ay,Az \rangle= \langle y,z \rangle, \forall y,z \in Y$
We know $A$ must be a unitary matrix, $A^*A=I,AA^*=I$
Define $X\subset Y$ as points on the $n-1$ sphere with a radius $r$. $X\triangleq\{x\in{Y}:\vert x \vert = r\}$
Then can we say $\forall x,\tilde{x} \in X$ $\exists A,Ax=\tilde{x}$?
Based on this question (n Dimensional Rotation Matrix) I believe this can be computed algorithmically via successive applications of Gram-Schmidt orthonormalization.
- Set $A=I$ the $n\times n$ identity matrix
- Starting with i=1,compute the desired ith column of $A$, $A_i$ such that $A_i x=\tilde{x}_i$ and $\vert A_i \vert=1$
- Perform Gram-Schmidt orthonormalization on columns $i$ through $n$
- Advance i and repeat steps 2 and 3.
Testing a few small samples this seems to work fine, but what I am interested is if I am able to say that it will always work for any $x,\tilde{x}\in X$.