basis (linear algebra)

aesthetics  →
being  →
complexity  →
database  →
enterprise  →
ethics  →
fiction  →
history  →
internet  →
knowledge  →
language  →
licensing  →
linux  →
logic  →
method  →
news  →
perception  →
philosophy  →
policy  →
purpose  →
religion  →
science  →
sociology  →
software  →
truth  →
unix  →
wiki  →
essay  →
feed  →
help  →
system  →
wiki  →
critical  →
discussion  →
forked  →
imported  →
original  →
basis (linear algebra)
[ temporary import ]
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{redirect|Basis vector|basis vector in the context of crystals|Crystal structure|a more general concept in physics|Frame of reference}}{{redirects here|Basis (mathematics)||Basis (disambiguation)#Mathematics{{!}}Basis}}(File:3d two bases same vector.svg|130px|thumb|The same vector can be represented in two different bases (purple and red arrows).)In mathematics, a set of elements (vectors) in a vector space V is called a basis, or a set of {{visible anchor|basis vectors}}, if the vectors are linearly independent and every vector in the vector space is a linear combination of this set.BOOK, Halmos, Paul Richard, Paul Halmos, 1987, Finite-Dimensional Vector Spaces, 4th, Springer, New York,weblink 10, 0-387-90093-4, In more general terms, a basis is a linearly independent spanning set.Given a basis of a vector space V, every element of V can be expressed uniquely as a linear combination of basis vectors, whose coefficients are referred to as vector coordinates or components. The computation of these components is sometimes called decomposition of a vector on a basis. A vector space can have several distinct sets of basis vectors; however each such set has the same number of elements, with this number being the dimension of the vector space.


File:Basis graph (no label).svg|thumb|400px|This picture illustrates the standard basis in R2. The blue and orange vectors are the elements of the basis; the green vector can be given in terms of the basis vectors, and so is linearly dependentlinearly dependentA basis B of a vector space V over a field F is a linearly independent subset of V that spans V.In more detail, suppose that B = { v1, …, v'n } is a finite subset of a vector space V over a field F (such as the real or complex numbers R or C'). Then B'' is a basis if it satisfies the following conditions:
  • the linear independence property,

for all a1, …, a'n ∈ F, if a1v1 + … + a'n'v'n = 0, then necessarily a1 = … = an = 0; and
  • the spanning property,

for every (vector) x in V it is possible to choose a1, …, a'n ∈ F such that x = a1v1 + … + a'n'v'n.
The numbers ai are called the coordinates of the vector x with respect to the basis B, and by the first property they are uniquely determined.A vector space that has a finite basis is called finite-dimensional. To deal with infinite-dimensional spaces, we must generalize the above definition to include infinite basis sets. We therefore say that a set (finite or infinite) B ⊂ V is a basis, if
  • every finite subset B0 ⊆ B obeys the independence property shown above; and
  • for every x in V it is possible to choose a1, …, a'n ∈ F and v1, …, v'n ∈ B such that x = a1v1 + … + a'n'vn.
The sums in the above definition are all finite because without additional structure the axioms of a vector space do not permit us to meaningfully speak about an infinite sum of vectors. Settings that permit infinite linear combinations allow alternative definitions of the basis concept: see Related notions below.It is often convenient to list the basis vectors in a specific order, for example, when considering the transformation matrix of a linear map with respect to a basis. We then speak of an ordered basis, which we define to be a sequence (rather than a set) of linearly independent vectors that span V: see Ordered bases and coordinates below.


Again, B denotes a subset of a vector space V. Then, B is a basis if and only if any of the following equivalent conditions are met:
  • B is a minimal generating set of V, i.e., it is a generating set and no proper subset of B is also a generating set.
  • B is a maximal set of linearly independent vectors, i.e., it is a linearly independent set but no other linearly independent set contains it as a proper subset.
  • Every vector in V can be expressed as a linear combination of vectors in B in a unique way. If the basis is ordered (see Ordered bases and coordinates below) then the coefficients in this linear combination provide coordinates of the vector relative to the basis.
Every vector space has a basis. The proof of this requires the axiom of choice. All bases of a vector space have the same cardinality (number of elements), called the dimension of the vector space. This result is known as the dimension theorem, and requires the ultrafilter lemma, a strictly weaker form of the axiom of choice.Also many vector sets can be attributed a standard basis which comprises both spanning and linearly independent vectors.Standard bases for example:In Rn, {{nowrap|{e1, ..., e'n},}} where e'i is the ith column of the identity matrix.In P2, where P2 is the set of all polynomials of degree at most 2, {{nowrap|1={1, x, x2} }} is the standard basis.In M22, {{nowrap|{M1,1, M1,2, M2,1, M2,2},}} where M22 is the set of all 2×2 matrices and Mm,n is the 2×2 matrix with a 1 in the m,n position and zeros everywhere else.

Change of basis

Given a vector space V over a field F and suppose that {{nowrap|{v1, ..., v'n}}} and {{nowrap|{α1, ..., α'n}}} are two bases for V. By definition, if ξ is a vector in V then {{nowrap|1=ξ = x1α1 + ... + x'n'α'n}} for a unique choice of scalars {{nowrap|x1, ..., x'n}} in F called the coordinates of ξ relative to the ordered basis {{nowrap|{α1, ..., α'n}.}} The vector {{nowrap|1=x = (x1, ..., x'n)}} in F'n is called the coordinate tuple of ξ (relative to this basis). The unique linear map {{nowrap|φ : F'n → V}} with {{nowrap|1=φ(v'j) = α'j}} for {{nowrap|1=j = 1, ..., n}} is called the coordinate isomorphism for V and the basis {{nowrap|{α1, ..., α'n}.}} Thus {{nowrap|1=φ(x) = ξ}} if and only if {{nowrap|1=ξ = x1α1 + ... + x'n'α'n}}.A set of vectors can be represented by a matrix of which each column consists of the components of the corresponding vector of the set. As a basis is a set of vectors, a basis can be given by a matrix of this kind. The change of basis of any object of the space is related to this matrix. For example, coordinate tuples change with its inverse.


  • Consider R2, the vector space of all coordinates {{nowrap|(a, b)}} where both a and b are real numbers. Then a very natural and simple basis is simply the vectors {{nowrap|1=e1 = (1,0)}} and {{nowrap|1=e2 = (0,1)}}: suppose that {{nowrap|1=v = (a, b)}} is a vector in R2, then {{nowrap|1=v = a(1,0) + b(0,1)}}. But any two linearly independent vectors, like (1,1) and (−1,2), will also form a basis of R2.
  • More generally, the vectors e1, e2, ..., en are linearly independent and generate Rn. Therefore, they form a basis for Rn and the dimension of Rn is n. This basis is called the standard basis.
  • Let V be the real vector space generated by the functions et and e2t. These two functions are linearly independent, so they form a basis for V.
  • Let R[x] denote the vector space of real polynomials; then {{nowrap|(1, x, x2, ...)}} is a basis of R[x]. The dimension of R[x] is therefore equal to aleph-0.

Extending to a basis

Let S be a subset of a vector space V. To extend S to a basis of V means to find a basis B of V that contains S as a subset. This can be done if and only if S is linearly independent. Almost always, there is more than one such B, except in rather special circumstances (i.e. that S is already a basis, or S is empty and V has two elements).A similar question is when does a subset S contain a basis. This occurs if and only if S spans V. In this case, S will usually contain several different bases.

Example of alternative proofs

Often, a mathematical result can be proven in more than one way.Here, using three different proofs, we show that the vectors (1,1) and (−1,2) form a basis for R2.

From the definition of basis

We have to prove that these two vectors are linearly independent and that they generate R2.Part I: If two vectors v and w are linearly independent, then av + bw = 0 (a and b scalars) implies a = 0, b = 0.To prove that they are linearly independent, suppose that there are numbers a, b such that:
(i.e., they are linearly dependent). Then:
(a-b,a+2b)=(0,0)   and  
a-b=0   and  
a+2b=0 .
Subtracting the first equation from the second, we obtain:
3b=0   so  
b=0 .
Adding this equation to the first equation then:
a=0 .
Hence we have linear independence.Part II: To prove that these two vectors generate R2, we have to let {{nowrap|(a, b)}} be an arbitrary element of R2, and show that there exist numbers {{nowrap|r, s ∈ R}} such that:
r(1,1)+s(-1,2)=(a,b) .
Then we have to solve the equations:
r-s=a r+2s=b .
Subtracting the first equation from the second, we get:
3s=b-a ,           and then

s=(b-a)/3 ,         and finally

r=s+a=((b-a)/3)+a=(b+2a)/3 .

By the dimension theorem

Since (−1,2) is clearly not a multiple of (1,1) and since (1,1) is not the zero vector, these two vectors are linearly independent. Since the dimension of R2 is 2, the two vectors already form a basis of R2 without needing any extension.

By the invertible matrix theorem

Simply compute the determinant
Since the above matrix has a nonzero determinant, its columns form a basis of R2. See: invertible matrix.

Ordered bases and coordinates

A basis is a linearly independent set of vectors with or without a given ordering. For many purposes it is convenient to work with an ordered basis. For example, when working with a coordinate representation of a vector it is customary to speak of the "first" or "second" coordinate, which makes sense only if an ordering is specified for the basis. For finite-dimensional vector spaces one typically indexes a basis {v'i} by the first n integers. An ordered basis is also called a frame'''.Suppose V is an n-dimensional vector space over a field F. A choice of an ordered basis for V is equivalent to a choice of a linear isomorphism φ from the coordinate space Fn to V.Proof. The proof makes use of the fact that the standard basis of Fn is an ordered basis.Suppose first that
φ : Fn → V
is a linear isomorphism. Define an ordered basis {vi} for V by
v'i = φ(e'i) for 1 ≤ i ≤ n''
where {ei} is the standard basis for Fn.Conversely, given an ordered basis, consider the map defined by
φ(x) = x1v1 + x2v2 + ... + x'n'vn,
where x = x1e1 + x2e2 + ... + x'nen is an element of F'n. It is not hard to check that φ'' is a linear isomorphism.These two constructions are clearly inverse to each other. Thus ordered bases for V are in 1-1 correspondence with linear isomorphisms Fn → V.The inverse of the linear isomorphism φ determined by an ordered basis {v'i} equips V with coordinates: if, for a vector v ∈ V, φ−1(v) = (a1, a2,...,a'n) ∈ Fn, then the components a'j = a'j(v) are the coordinates of v in the sense that v = a1(v) v1 + a2(v) v2 + ... + a'n(v) v'n.The maps sending a vector v to the components a'j(v) are linear maps from V to F, because of φ−1 is linear. Hence they are linear functionals. They form a basis for the dual space of V, called the dual basis'''.

Related notions


In the context of infinite-dimensional vector spaces over the real or complex numbers, the term {{visible anchor|Hamel basis}} (named after Georg Hamel) or algebraic basis can be used to refer to a basis as defined in this article. This is to make a distinction with other notions of "basis" that exist when infinite-dimensional vector spaces are endowed with extra structure. The most important alternatives are orthogonal bases on Hilbert spaces, Schauder bases, and Markushevich bases on normed linear spaces. In the case of the real numbers R viewed as a vector space over the field Q of rational numbers, Hamel bases are uncountable, and have specifically the cardinality of the continuum, which is the cardinal number 2^{aleph_0}, where aleph_0 is the smallest infinite cardinal, the cardinal of the integers.The common feature of the other notions is that they permit the taking of infinite linear combinations of the basis vectors in order to generate the space. This, of course, requires that infinite sums are meaningfully defined on these spaces, as is the case for topological vector spaces – a large class of vector spaces including e.g. Hilbert spaces, Banach spaces, or Fréchet spaces.The preference of other types of bases for infinite-dimensional spaces is justified by the fact that the Hamel basis becomes "too big" in Banach spaces: If X is an infinite-dimensional normed vector space which is complete (i.e. X is a Banach space), then any Hamel basis of X is necessarily uncountable. This is a consequence of the Baire category theorem. The completeness as well as infinite dimension are crucial assumptions in the previous claim. Indeed, finite-dimensional spaces have by definition finite bases and there are infinite-dimensional (non-complete) normed spaces which have countable Hamel bases. Consider c_{00}, the space of the sequences x=(x_n) of real numbers which have only finitely many non-zero elements, with the norm |x|=sup_n |x_n|. Its standard basis, consisting of the sequences having only one non-zero element, which is equal to 1, is a countable Hamel basis.


In the study of Fourier series, one learns that the functions {1} ∪ { sin(nx), cos(nx) : n = 1, 2, 3, ... } are an "orthogonal basis" of the (real or complex) vector space of all (real or complex valued) functions on the interval [0, 2π] that are square-integrable on this interval, i.e., functions f satisfying
int_0^{2pi} left|f(x)right|^2,dx

- content above as imported from Wikipedia
- "basis (linear algebra)" does not exist on GetWiki (yet)
- time: 3:29pm EDT - Mon, Sep 24 2018
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
M.R.M. Parrott