Coordinate vector
Encyclopedia : C : CO : COO : Coordinate vector
In linear algebra, a coordinate vector is an explicit representation of a vector in an abstract vector space as an ordered list of numbers or, equivalently, as an element of the coordinate space Fn. Coordinate vectors allow calculations with abstract objects to be transformed into calculations with blocks of numbers (matrices and column vectors), which we know how to do explicitly.
Contents
Definition
Let V be a vector space of dimension n over a field F and let- [ B = \ ]
- [ v = \alpha _1 b_1 + \alpha _2 b_2 + \cdots + \alpha _n b_n ]
- [ [ v ]_B = \begin \alpha _1 \\ \vdots \\ \alpha _n \end. ]
The standard representation
We can mechanize the above transformation by defining a function [\phi_B], called the standard representation of V with respect to B, that takes every vector to its coordinate representation: [\phi_B(v)=[v]_B]. Then [\phi_B] is a linear transformation from V to Fn. In fact, it is an isomorphism, and its inverse [\phi_B^:\mathbf^n\to V] is simply- [\phi_B^(\alpha_1,\ldots,\alpha_n)=\alpha_1 b_1+\cdots+\alpha_n b_n.]
Examples
Example 1
Let P3 be the space of all the algebraic polynomials in degree less than 4 (i.e. the highest exponent of x can be 3). This space is linear and spanned by the following polynomials:- [ B_P = \ ]
- [ 1 := \begin 1 \\ 0 \\ 0 \\ 0 \end \quad ; \quad x := \begin 0 \\ 1 \\ 0 \\ 0 \end \quad ; \quad x^2 := \begin 0 \\ 0 \\ 1 \\ 0 \end \quad ; \quad x^3 := \begin 0 \\ 0 \\ 0 \\ 1 \end \quad ]
- [ p \left( x \right) = a_0 + a_1 x + a_2 x^2 + a_3 x^3 ] is [ \begin a_0 \\ a_1 \\ a_2 \\ a_3 \end ] .
- [ Dp(x) = P'(x) \quad ; \quad [D] = \begin0 & 1 & 0 & 0 \\0 & 0 & 2 & 0 \\0 & 0 & 0 & 3 \\0 & 0 & 0 & 0 \\\end ]
Example 2
The Pauli matrices which represent the spin operator when transforming the spin eigenstates into vector coordinates.Basis transformation matrix
Let's mark with [M]B the matrix which has columns consisting of b1, b2, ..., bn . Then,- [ v = [M]^ [v]_B ].
- [ [M]_^ = \begin \ [b_1]_C & \cdots & [b_n]_C \ \end ]
- [ [v]_C = [M]_^ [v]_B ]
This matrix is Invertible matrix and M-1 is the basis transformation matrix from C to B. In other words,
- [ [M]_^ [M]_^ = [M]_^ = \mathrm ]
- [ [M]_^ [M]_^ = [M]_^ = \mathrm ]
- The basis transformation matrix can be regarded as an automorphism over V.
- [ [M]_^ = [M]^ ] where E is the standard basis.
- In order to easily remember the theorem
- : [ [v]_C = [M]_^ [v]_B ]
- notice that the M's sup-index and v's sub-index are "canceling" each other and the M's sub-index is what remains and become v's new sub-index. The "canceling" of index is not a real canceling but rather a manipulation of symbols which serves us for purposes of convenience.
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
