![Coordinate vector](https://www.english.nina.az/image-resize/1600/900/web/wikipedia.jpg)
This article needs additional citations for verification.(February 2009) |
In linear algebra, a coordinate vector is a representation of a vector as an ordered list of numbers (a tuple) that describes the vector in terms of a particular ordered basis. An easy example may be a position such as (5, 2, 1) in a 3-dimensional Cartesian coordinate system with the basis as the axes of this system. Coordinates are always specified relative to an ordered basis. Bases and their associated coordinate representations let one realize vector spaces and linear transformations concretely as column vectors, row vectors, and matrices; hence, they are useful in calculations.
The idea of a coordinate vector can also be used for infinite-dimensional vector spaces, as addressed below.
Definition
Let V be a vector space of dimension n over a field F and let
be an ordered basis for V. Then for every there is a unique linear combination of the basis vectors that equals
:
The coordinate vector of relative to B is the sequence of coordinates
This is also called the representation of with respect to B, or the B representation of
. The
are called the coordinates of
. The order of the basis becomes important here, since it determines the order in which the coefficients are listed in the coordinate vector.
Coordinate vectors of finite-dimensional vector spaces can be represented by matrices as column or row vectors. In the above notation, one can write
and
where is the transpose of the matrix
.
The standard representation
We can mechanize the above transformation by defining a function , called the standard representation of V with respect to B, that takes every vector to its coordinate representation:
. Then
is a linear transformation from V to Fn. In fact, it is an isomorphism, and its inverse
is simply
Alternatively, we could have defined to be the above function from the beginning, realized that
is an isomorphism, and defined
to be its inverse.
Examples
Example 1
Let be the space of all the algebraic polynomials of degree at most 3 (i.e. the highest exponent of x can be 3). This space is linear and spanned by the following polynomials:
matching
then the coordinate vector corresponding to the polynomial
is
According to that representation, the differentiation operator d/dx which we shall mark D will be represented by the following matrix:
Using that method it is easy to explore the properties of the operator, such as: invertibility, Hermitian or anti-Hermitian or neither, spectrum and eigenvalues, and more.
Example 2
The Pauli matrices, which represent the spin operator when transforming the spin eigenstates into vector coordinates.
Basis transformation matrix
Let B and C be two different bases of a vector space V, and let us mark with the matrix which has columns consisting of the C representation of basis vectors b1, b2, …, bn:
This matrix is referred to as the basis transformation matrix from B to C. It can be regarded as an automorphism over . Any vector v represented in B can be transformed to a representation in C as follows:
Under the transformation of basis, notice that the superscript on the transformation matrix, M, and the subscript on the coordinate vector, v, are the same, and seemingly cancel, leaving the remaining subscript. While this may serve as a memory aid, it is important to note that no such cancellation, or similar mathematical operation, is taking place.
Corollary
The matrix M is an invertible matrix and M−1 is the basis transformation matrix from C to B. In other words,
Infinite-dimensional vector spaces
Suppose V is an infinite-dimensional vector space over a field F. If the dimension is κ, then there is some basis of κ elements for V. After an order is chosen, the basis can be considered an ordered basis. The elements of V are finite linear combinations of elements in the basis, which give rise to unique coordinate representations exactly as described before. The only change is that the indexing set for the coordinates is not finite. Since a given vector v is a finite linear combination of basis elements, the only nonzero entries of the coordinate vector for v will be the nonzero coefficients of the linear combination representing v. Thus the coordinate vector for v is zero except in finitely many entries.
The linear transformations between (possibly) infinite-dimensional vector spaces can be modeled, analogously to the finite-dimensional case, with infinite matrices. The special case of the transformations from V into V is described in the full linear ring article.
See also
- Change of basis
- Coordinate space
References
- Howard Anton; Chris Rorres (12 April 2010). Elementary Linear Algebra: Applications Version. John Wiley & Sons. ISBN 978-0-470-43205-1.
This article needs additional citations for verification Please help improve this article by adding citations to reliable sources Unsourced material may be challenged and removed Find sources Coordinate vector news newspapers books scholar JSTOR February 2009 Learn how and when to remove this message In linear algebra a coordinate vector is a representation of a vector as an ordered list of numbers a tuple that describes the vector in terms of a particular ordered basis An easy example may be a position such as 5 2 1 in a 3 dimensional Cartesian coordinate system with the basis as the axes of this system Coordinates are always specified relative to an ordered basis Bases and their associated coordinate representations let one realize vector spaces and linear transformations concretely as column vectors row vectors and matrices hence they are useful in calculations The idea of a coordinate vector can also be used for infinite dimensional vector spaces as addressed below DefinitionLet V be a vector space of dimension n over a field F and let B b1 b2 bn displaystyle B b 1 b 2 ldots b n be an ordered basis for V Then for every v V displaystyle v in V there is a unique linear combination of the basis vectors that equals v displaystyle v v a1b1 a2b2 anbn displaystyle v alpha 1 b 1 alpha 2 b 2 cdots alpha n b n The coordinate vector of v displaystyle v relative to B is the sequence of coordinates v B a1 a2 an displaystyle v B alpha 1 alpha 2 ldots alpha n This is also called the representation of v displaystyle v with respect to B or the B representation of v displaystyle v The a1 a2 an displaystyle alpha 1 alpha 2 ldots alpha n are called the coordinates of v displaystyle v The order of the basis becomes important here since it determines the order in which the coefficients are listed in the coordinate vector Coordinate vectors of finite dimensional vector spaces can be represented by matrices as column or row vectors In the above notation one can write v B a1 an displaystyle v B begin bmatrix alpha 1 vdots alpha n end bmatrix and v BT a1a2 an displaystyle v B T begin bmatrix alpha 1 amp alpha 2 amp cdots amp alpha n end bmatrix where v BT displaystyle v B T is the transpose of the matrix v B displaystyle v B The standard representationWe can mechanize the above transformation by defining a function ϕB displaystyle phi B called the standard representation of V with respect to B that takes every vector to its coordinate representation ϕB v v B displaystyle phi B v v B Then ϕB displaystyle phi B is a linear transformation from V to Fn In fact it is an isomorphism and its inverse ϕB 1 Fn V displaystyle phi B 1 F n to V is simply ϕB 1 a1 an a1b1 anbn displaystyle phi B 1 alpha 1 ldots alpha n alpha 1 b 1 cdots alpha n b n Alternatively we could have defined ϕB 1 displaystyle phi B 1 to be the above function from the beginning realized that ϕB 1 displaystyle phi B 1 is an isomorphism and defined ϕB displaystyle phi B to be its inverse ExamplesExample 1 Let P3 displaystyle P 3 be the space of all the algebraic polynomials of degree at most 3 i e the highest exponent of x can be 3 This space is linear and spanned by the following polynomials BP 1 x x2 x3 displaystyle B P left 1 x x 2 x 3 right matching 1 1000 x 0100 x2 0010 x3 0001 displaystyle 1 begin bmatrix 1 0 0 0 end bmatrix quad x begin bmatrix 0 1 0 0 end bmatrix quad x 2 begin bmatrix 0 0 1 0 end bmatrix quad x 3 begin bmatrix 0 0 0 1 end bmatrix then the coordinate vector corresponding to the polynomial p x a0 a1x a2x2 a3x3 displaystyle p left x right a 0 a 1 x a 2 x 2 a 3 x 3 is a0a1a2a3 displaystyle begin bmatrix a 0 a 1 a 2 a 3 end bmatrix According to that representation the differentiation operator d dx which we shall mark D will be represented by the following matrix Dp x P x D 0100002000030000 displaystyle Dp x P x quad D begin bmatrix 0 amp 1 amp 0 amp 0 0 amp 0 amp 2 amp 0 0 amp 0 amp 0 amp 3 0 amp 0 amp 0 amp 0 end bmatrix Using that method it is easy to explore the properties of the operator such as invertibility Hermitian or anti Hermitian or neither spectrum and eigenvalues and more Example 2 The Pauli matrices which represent the spin operator when transforming the spin eigenstates into vector coordinates Basis transformation matrixLet B and C be two different bases of a vector space V and let us mark with M CB displaystyle lbrack M rbrack C B the matrix which has columns consisting of the C representation of basis vectors b1 b2 bn M CB b1 C bn C displaystyle lbrack M rbrack C B begin bmatrix lbrack b 1 rbrack C amp cdots amp lbrack b n rbrack C end bmatrix This matrix is referred to as the basis transformation matrix from B to C It can be regarded as an automorphism over Fn displaystyle F n Any vector v represented in B can be transformed to a representation in C as follows v C M CB v B displaystyle lbrack v rbrack C lbrack M rbrack C B lbrack v rbrack B Under the transformation of basis notice that the superscript on the transformation matrix M and the subscript on the coordinate vector v are the same and seemingly cancel leaving the remaining subscript While this may serve as a memory aid it is important to note that no such cancellation or similar mathematical operation is taking place Corollary The matrix M is an invertible matrix and M 1 is the basis transformation matrix from C to B In other words Id M CB M BC M CC M BC M CB M BB displaystyle begin aligned operatorname Id amp lbrack M rbrack C B lbrack M rbrack B C lbrack M rbrack C C 3pt amp lbrack M rbrack B C lbrack M rbrack C B lbrack M rbrack B B end aligned Infinite dimensional vector spacesSuppose V is an infinite dimensional vector space over a field F If the dimension is k then there is some basis of k elements for V After an order is chosen the basis can be considered an ordered basis The elements of V are finite linear combinations of elements in the basis which give rise to unique coordinate representations exactly as described before The only change is that the indexing set for the coordinates is not finite Since a given vector v is a finite linear combination of basis elements the only nonzero entries of the coordinate vector for v will be the nonzero coefficients of the linear combination representing v Thus the coordinate vector for v is zero except in finitely many entries The linear transformations between possibly infinite dimensional vector spaces can be modeled analogously to the finite dimensional case with infinite matrices The special case of the transformations from V into V is described in the full linear ring article See alsoChange of basis Coordinate spaceReferencesHoward Anton Chris Rorres 12 April 2010 Elementary Linear Algebra Applications Version John Wiley amp Sons ISBN 978 0 470 43205 1