Coordinate vector

From Wikipedia, the free encyclopedia

(Redirected from Basis transformation matrix)
Jump to: navigation, search

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

Let V be a vector space of dimension n over a field F and let

 B = \{ b_1, b_2, \ldots, b_n \}

be an ordered basis for V. Then for every  v \in V there is a unique linear combination of the basis vectors that equals v:

 v = \alpha _1 b_1 + \alpha _2 b_2 + \cdots + \alpha _n b_n

By one of the defining properties of bases, the α-s are determined uniquely by v and B. Now, we define the coordinate vector of v relative to B (also called the B representation of v) to be the following column vector:

 [ v ]_B = \begin{bmatrix} \alpha _1 \\ \vdots \\ \alpha _n \end{bmatrix}.

The α-s are called the coordinates of v.

We can mechanize the above transformation by defining a function φB, called the standard representation of V with respect to B, that takes every vector to its coordinate representation: φB(v) = [v]B. Then φB is a linear transformation from V to Fn. In fact, it is an isomorphism, and its inverse \phi_B^{-1}:\mathbf{F}^n\to V is simply

\phi_B^{-1}(\alpha_1,\ldots,\alpha_n)=\alpha_1 b_1+\cdots+\alpha_n b_n.

Alternatively, we could have defined \phi_B^{-1} to be the above function from the beginning, realized that \phi_B^{-1} is an isomorphism, and defined φB to be its inverse.

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:

BP = {1,x,x2,x3}

matching

 1 := \begin{bmatrix} 1 \\ 0 \\ 0 \\ 0 \end{bmatrix} \quad ; \quad x := \begin{bmatrix} 0 \\ 1 \\ 0 \\ 0 \end{bmatrix} \quad ; \quad x^2 := \begin{bmatrix} 0 \\ 0 \\ 1 \\ 0 \end{bmatrix} \quad ; \quad x^3 := \begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \end{bmatrix} \quad

then the corresponding coordinate vector to the polynomial

 p \left( x \right) = a_0 + a_1 x + a_2 x^2 + a_3 x^3 is  \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) \quad ; \quad [D] = 
\begin{bmatrix}
0 & 1 & 0 & 0 \\
0 & 0 & 2 & 0 \\
0 & 0 & 0 & 3 \\
0 & 0 & 0 & 0 \\
\end{bmatrix}

Using that method it is easy to explore the properties of the operator: such as invertibility, hermitian or anti-hermitian or none, spectrum and eigenvalues and more.

The Pauli matrices which represent the spin operator when transforming the spin eigenstates into vector coordinates.

Let's mark with [M]B the matrix which has columns consisting of b1, b2, ..., bn . Then,

v = [M]B[v]B.

This formalism can be generalized for transforming v from B representation to a C representation (where C is another basis). Defining basis transformation matrix from B to C as the following matrix:

 [M]_{C}^{B} = \begin{bmatrix} \ [b_1]_C & \cdots & [b_n]_C \ \end{bmatrix}

we receive the following theorem:

 [v]_C = [M]_{C}^{B} [v]_B.

Corollary:
This matrix is Invertible matrix and M-1 is the basis transformation matrix from C to B. In other words,

 [M]_{C}^{B} [M]_{B}^{C} = [M]_{C}^{C} = \mathrm{Id}
 [M]_{B}^{C} [M]_{C}^{B} = [M]_{B}^{B} = \mathrm{Id}

Remarks:

  1. The basis transformation matrix can be regarded as an automorphism over V.
  2.  [M]_{E}^{B} = [M]^{B} where E is the standard basis.
  3. In order to easily remember the theorem
 [v]_C = [M]_{C}^{B} [v]_B
notice that the M's sub-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.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.