Question: What are the practical applications of linear algebra?

Linear algebra



Linear algebra is the branch of mathematics concerning linear equations such as 





a

1



x

1


+
⋯
+

a

n



x

n


=
b
,


{\displaystyle a_{1}x_{1}+\cdots +a_{n}x_{n}=b,}


linear functions such as




(

x

1


,
…
,

x

n


)
↦

a

1



x

1


+
…
+

a

n



x

n


,


{\displaystyle (x_{1},\ldots ,x_{n})\mapsto a_{1}x_{1}+\ldots +a_{n}x_{n},}


and their representations through matrices and vector spaces.[1][2][3]
Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis may be basically viewed as the application of linear algebra to spaces of functions. Linear algebra is also used in most sciences and engineering areas, because it allows modeling many natural phenomena, and efficiently computing with such models. For nonlinear systems, which cannot be modeled with linear algebra, linear algebra is often used as a first-order approximation.
History
The procedure for solving simultaneous linear equations now called Gaussian elimination appears in the ancient Chinese mathematical text Chapter Eight: Rectangular Arrays of The Nine Chapters on the Mathematical Art. Its use is illustrated in eighteen problems, with two to five equations. [4]
Systems of linear equations arose in Europe with the introduction in 1637 by René Descartes of coordinates in geometry. In fact, in this new geometry, now called Cartesian geometry, lines and planes are represented by linear equations, and computing their intersections amounts to solving systems of linear equations.
The first systematic methods for solving linear systems used determinants, first considered by Leibniz in 1693. In 1750, Gabriel Cramer used them for giving explicit solutions of linear systems, now called Cramer's Rule. Later, Gauss further described the method of elimination, which was initially listed as an advancement in geodesy.[5]
In 1844 Hermann Grassmann published his "Theory of Extension" which included foundational new topics of what is today called linear algebra. In 1848, James Joseph Sylvester introduced the term matrix, which is Latin for womb. 
Linear algebra grew with ideas noted in the complex plane. For instance, two numbers w and z in ℂ have a difference w – z, and the line segments 






w
z

¯





and






0
(
w
−
z
)

¯




{\displaystyle {\overline {wz}}\ \ {\text{and}}\ \ {\overline {0(w-z)}}}

 are of the same length and direction. The segments are equipollent. The four-dimensional system ℍ of quaternions was started in 1843. The term vector was introduced as v = x i + y j + z k representing a point in space. The quaternion difference p – q also produces a segment equipollent to 






p
q

¯


.


{\displaystyle {\overline {pq}}.}

  
Other hypercomplex number systems also used the idea of a linear space with a basis.
Arthur Cayley introduced matrix multiplication  and the inverse matrix in 1856, making possible the general linear group. The mechanism of group representation became available for describing complex and hypercomplex numbers. Crucially, Cayley used a single letter to denote a matrix, thus treating a matrix as an aggregate object. He also realized the connection between matrices and determinants, and wrote "There would be many things to say about this theory of matrices which should, it seems to me, precede the theory of determinants".[5]
Benjamin Peirce published his Linear Associative Algebra (1872), and his son Charles Sanders Peirce extended the work later.[6]
The telegraph required an explanatory system, and the 1873 publication of A Treatise on Electricity and Magnetism instituted a field theory of forces and required differential geometry for expression. Linear algebra is flat differential geometry and serves in tangent spaces to manifolds. Electromagnetic symmetries of spacetime are expressed by the Lorentz transformations, and much of the history of linear algebra is the history of Lorentz transformations.
The first modern and more precise definition of a vector space was introduced by Peano in 1888;[5] by 1900, a theory of linear transformations of finite-dimensional vector spaces had emerged. Linear algebra took its modern form in the first half of the twentieth century, when many ideas and methods of previous centuries were generalized as abstract algebra. The development of computers led to increased research in efficient algorithms for Gaussian elimination and matrix decompositions, and linear algebra became an essential tool for modelling and simulations.[5]
See also Determinant §History and Gaussian elimination §History.
Vector spaces

Until the 19th century, linear algebra was introduced through systems of linear equations and matrices. In modern mathematics, the presentation through vector spaces is generally preferred, since it is more synthetic, more general (not limited to the finite-dimensional case), and conceptually simpler, although more abstract.
A vector space over a field F (often the field of the real numbers) is a set V equipped with two binary operations satisfying the following axioms.  
Elements of V are called vectors, and elements of F are called scalars. The first operation, vector addition, takes any two vectors v and w and outputs a third vector v + w. The second operation, scalar multiplication, takes any scalar a and any vector v and outputs a new vector av. The axioms that addition and scalar multiplication must satisfy are the following (in the list below, u, v and w are arbitrary elements of V, and a and b are arbitrary scalars in the field F.[7]



















AxiomSignificationAssociativity of additionu + (v + w) = (u + v) + wCommutativity of additionu + v = v + uIdentity element of additionThere exists an element 0 in V, called the zero vector (or simply zero), such that v + 0 = v for all v in V.Inverse elements of additionFor every v in V, there exists an element −v in V, called the additive inverse of v, such that v + (−v) = 0Distributivity of scalar multiplication with respect to vector addition  a(u + v) = au + avDistributivity of scalar multiplication with respect to field addition(a + b)v = av + bvCompatibility of scalar multiplication with field multiplicationa(bv) = (ab)v [nb 1]Identity element of scalar multiplication1<i>v = v, where 1 denotes the multiplicative identity of F.
The first four axioms mean that V is an abelian group under addition.
Elements of a vector space may have various nature; for example, they can be sequences, functions, polynomials or matrices. Linear algebra is concerned with properties common to all vector spaces.
Linear maps

Linear maps are mappings between vector spaces that preserve the vector-space structure. Given two vector spaces V and W over a field F, a linear map (also called, in some contexts, linear transformation, linear mapping or linear operator) is a map




T
:
V
→
W


{\displaystyle T:V\to W}


that is compatible with addition and scalar multiplication, that is




T
(
u
+
v
)
=
T
(
u
)
+
T
(
v
)
,

T
(
a
v
)
=
a
T
(
v
)


{\displaystyle T(u+v)=T(u)+T(v),\quad T(av)=aT(v)}


for any vectors u,v in V and scalar a in F.
This implies that for any vectors u, v in V and scalars a, b in F, one has




T
(
a
u
+
b
v
)
=
T
(
a
u
)
+
T
(
b
v
)
=
a
T
(
u
)
+
b
T
(
v
)


{\displaystyle T(au+bv)=T(au)+T(bv)=aT(u)+bT(v)}


When a bijective linear map exists between two vector spaces (that is, every vector from the second space is associated with exactly one in the first), the two spaces are isomorphic. Because an isomorphism preserves linear structure, two isomorphic vector spaces are "essentially the same" from the linear algebra point of view, in the sense that they cannot be distinguished by using vector space properties. An essential question in linear algebra is testing whether a linear map is an isomorphism or not, and, if it is not an isomorphism, finding its range (or image) and the set of elements that are mapped to the zero vector, called the kernel of the map. All these questions can be solved by using Gaussian elimination or some variant of this algorithm.
Subspaces, span, and basis

The study of subsets of vector spaces that are themselves vector spaces for the induced operations is fundamental, similarly as for many mathematical structures. These subsets are called linear subspaces. More precisely, a linear subspace of a vector space V over a field F is a subset W of V such that u + v and au are in W, for every u, v in W, and every a in F. (These conditions suffices for implying that W is a vector space.)
For example, the image of a linear map, and the inverse image of 0 by a linear map (called kernel or null space) are linear subspaces.
Another important way of forming a subspace is to consider linear combinations of a set S of vectors: the set of all sums 





a

1



v

1


+

a

2



v

2


+
⋯
+

a

k



v

k


,


{\displaystyle a_{1}v_{1}+a_{2}v_{2}+\cdots +a_{k}v_{k},}


where v1, v2, ..., vk are in V, and a1, a2, ..., ak are in F form a linear subspace called the span of S. The span of S is also the intersection of all linear subspaces containing S. In other words, it is the (smallest for the inclusion relation) linear subspace containing S.
A set of vectors is linearly independent if none is in the span of the others. Equivalently, a set S of vector is linearly independent if the only way to express the zero vector as a linear combination of elements of S is to take zero for every coefficient 




a

i


.


{\displaystyle a_{i}.}


A set of vectors that spans a vector space is called a spanning set or generating set. If a spanning set S is linearly dependent (that is not linearly independent), then some element w of S is in the span of the other elements of S, and the span would remain the same if one remove w from S. One may continue to remove elements of S until getting a linearly independent spanning set. Such a linearly independent set that spans a vector space V is called a basis of V. The importance of bases lies in the fact that there are together minimal generating sets and maximal independent sets. More precisely, if S is a linearly independent set, and T is a spanning set such that 



S
⊆
T
,


{\displaystyle S\subseteq T,}

 then there is a basis B such that 



S
⊆
B
⊆
T
.


{\displaystyle S\subseteq B\subseteq T.}


Any two bases of a vector space V have the same cardinality, which is called the dimension of V; this is the dimension theorem for vector spaces. Moreover, two vector spaces over the same field F are isomorphic if and only if they have the same dimension.[8]
If any basis of V (and therefore every basis) has a finite number of elements, V is a finite-dimensional vector space. If U is a subspace of V, then dim U ≤ dim V. In the case where V is finite-dimensional, the equality of the dimensions implies U = V.
If U1 and U2 are subspaces of V, then




dim
⁡
(

U

1


+

U

2


)
=
dim
⁡

U

1


+
dim
⁡

U

2


−
dim
⁡
(

U

1


∩

U

2


)
,


{\displaystyle \dim(U_{1}+U_{2})=\dim U_{1}+\dim U_{2}-\dim(U_{1}\cap U_{2}),}


where 




U

1


+

U

2




{\displaystyle U_{1}+U_{2}}

denotes the span of 




U

1


∪

U

2


.


{\displaystyle U_{1}\cup U_{2}.}

[9]
Matrices

Matrices allow explicit manipulation of finite-dimensional vector spaces and linear maps. Their theory is thus an essential part of linear algebra.
Let V be a finite-dimensional vector space over a field F, and (v1, v2, ..., vm) be a basis of V (thus m is the dimension of V). By definition of a basis, the map








(

a

1


,
…
,

a

m


)



↦

a

1



v

1


+
⋯

a

m



v

m







F

m





→
V






{\displaystyle {\begin{aligned}(a_{1},\ldots ,a_{m})&\mapsto a_{1}v_{1}+\cdots a_{m}v_{m}\\F^{m}&\to V\end{aligned}}}


is a bijection from 




F

m


,


{\displaystyle F^{m},}

 the set of the sequences of m elements of F, onto V. This is an isomorphism of vector spaces, if 




F

m




{\displaystyle F^{m}}

 is equipped of its standard structure of vector space, where vector addition and scalar multiplication are done component by component.
This isomorphism allows representing a vector by its inverse image under this isomorphism, that is by the coordinates vector 



(

a

1


,
…
,

a

m


)


{\displaystyle (a_{1},\ldots ,a_{m})}

 or by the column matrix






[




a

1






⋮





a

m





]


.


{\displaystyle {\begin{bmatrix}a_{1}\\\vdots \\a_{m}\end{bmatrix}}.}


If W is another finite dimensional vector space (possibly the same), with a basis 



(

w

1


,
…
,

w

n


)
,


{\displaystyle (w_{1},\ldots ,w_{n}),}

 a linear map f from W to V is well defined by its values on the basis elements, that is 



(
f
(

w

1


)
,
…
,
f
(

w

n


)
)
.


{\displaystyle (f(w_{1}),\ldots ,f(w_{n})).}

 Thus, f is well represented by the list of the corresponding column matrices. That is, if 




f
(

w

j


)
=

a

1
,
j



v

1


+
⋯
+

a

m
,
j



v

m


,


{\displaystyle f(w_{j})=a_{1,j}v_{1}+\cdots +a_{m,j}v_{m},}


for j = 1, ..., n, then f is represented by the matrix






[




a

1
,
1




…



a

1
,
n






⋮


…


⋮





a

m
,
1




…



a

m
,
n





]


,


{\displaystyle {\begin{bmatrix}a_{1,1}&\ldots &a_{1,n}\\\vdots &\ldots &\vdots \\a_{m,1}&\ldots &a_{m,n}\end{bmatrix}},}


with m rows and n columns.
Matrix multiplication is defined in such a way that the product of two matrices is the matrix of the composition of the corresponding linear maps, and the product of a matrix and a column matrix is the column matrix representing the result of applying the represented linear map to the represented vector. It follows that the theory of finite-dimensional vector spaces and the theory of matrices are two different languages for expressing exactly the same concepts.
Two matrices that encode the same linear transformation in different bases are called similar. Equivalently, two matrices are similar if one can transform one in the other by elementary row and column operations. For a matrix representing a linear map from W to V, the row operations correspond to change of bases in V and the column operations correspond to change of bases in W. Every matrix is similar to an identity matrix possibly bordered by zero rows and zero columns. In terms of vector space, this means that, for any linear map from W to V, there are bases such that a part of the basis of W is mapped bijectively on a part of the basis of V, and that the remaining basis elements of W, if any, are mapped to zero (this is a way of expressing the fundamental theorem of linear algebra). Gaussian elimination is the basic algorithm for finding these elementary operations, and proving this theorem.
Linear systems

Systems of linear equations form a fundamental part of linear algebra. Historically, linear algebra and matrix theory has been developed for solving such systems. In the modern presentation of linear algebra through vector spaces and matrices, many problems may be interpreted in terms of linear systems.
For example, let








2
x




+




y




−




z




=




8




−
3
x




−




y




+




2
z




=




−
11




−
2
x




+




y




+




2
z




=




−
3






(S)



{\displaystyle {\begin{alignedat}{7}2x&&\;+\;&&y&&\;-\;&&z&&\;=\;&&8\\-3x&&\;-\;&&y&&\;+\;&&2z&&\;=\;&&-11\\-2x&&\;+\;&&y&&\;+\;&&2z&&\;=\;&&-3\end{alignedat}}\qquad {\text{(S)}}}


be a linear system.
To such a system, one may associate its matrix 




M

[




2


1


−
1




−
3


−
1


2




−
2


1


2




]


.



{\displaystyle M\left[{\begin{array}{rrr}2&1&-1\\-3&-1&2\\-2&1&2\end{array}}\right]{\text{.}}}


and its right member vector




v
=


[



8




−
11




−
3



]


.


{\displaystyle v={\begin{bmatrix}8\\-11\\-3\end{bmatrix}}.}


Let T be the linear transformation associated to the matrix M. A solution of the system (S) is a vector 




X
=


[



x




y




z



]




{\displaystyle X={\begin{bmatrix}x\\y\\z\end{bmatrix}}}


such that 




T
(
X
)
=
v
,


{\displaystyle T(X)=v,}


that is an element of the preimage of v by T.
Let (S') be the associated homogeneous system, where the right-hand sides of the equations are put to zero. The solutions of (S') are exactly the elements of the kernel of T or, equivalently, M.
The Gaussian-elimination consists of performing elementary row operations on the augmented matrix




M

[




2


1


−
1


8




−
3


−
1


2


−
11




−
2


1


2


−
3




]



{\displaystyle M\left[{\begin{array}{rrr|r}2&1&-1&8\\-3&-1&2&-11\\-2&1&2&-3\end{array}}\right]}


for putting it in reduced row echelon form. These row operations do not change the set of solutions of the system of equations. In the example, the reduced echelon form is 




M

[




1


0


0


2




0


1


0


3




0


0


1


−
1




]

,


{\displaystyle M\left[{\begin{array}{rrr|r}1&0&0&2\\0&1&0&3\\0&0&1&-1\end{array}}\right],}


showing that the system (S) has the unique solution








x



=
2




y



=
3




z



=
−
1.






{\displaystyle {\begin{aligned}x&=2\\y&=3\\z&=-1.\end{aligned}}}


It follows from this matrix interpretation of linear systems that the same methods can be applied for solving linear systems and for many operations on matrices and linear transformations, which include the computation of the ranks, kernels, matrix inverses.
Endomorphisms and square matrices

A linear endomorphism is a linear map that maps a vector space V to itself. 
If V has a basis of n elements, such an endomorphism is represented by a square matrix of size n.
With respect to general linear maps, linear endomorphisms and square matrices have some specific properties that make their study an important part of linear algebra, which is used in many parts of mathematics, including geometric transformations, coordinate changes, quadratic forms, and many other part of mathematics.
Determinant

The determinant of a square matrix is a polynomial function of the entries of the matrix, such that the matrix is invertible if and only if the determinant is not zero. This results from the fact that the determinant of a product of matrices is the product of the determinants, and thus that a matrix is invertible if and only if its determinant is invertible.
Cramer's rule is a closed-form expression, in terms of determinants, of the solution of a system of n linear equations in n unknowns. Cramer's rule is useful for reasoning about the solution, but, except for n = 2 or 3, it is rarely used for computing a solution, since Gaussian elimination is a faster algorithm.
The determinant of an endomorphism is the determinant of the matrix representing the endomorphism in terms of some ordered basis. This definition makes sense, since this determinant is independent of the choice of the basis.
Eigenvalues and eigenvectors

If f is a linear endomorphism of a vector space V over a field F, an eigenvector of f is a nonzero vector v of V such that f(v) = av for some scalar a in F. This scalar a is an eigenvalue of f.
If the dimension of V is finite, and a basis has been chosen, f and v may be represented, respectively, by a square matrix M and a column matrix and z; the equation defining eigenvectors and eigenvalues becomes




M
z
=
a
z
.


{\displaystyle Mz=az.}


Using the identity matrix I, whose all entries are zero, except those of the main diagonal, which are equal to one, this may be rewritten




(
M
−
a
I
)
z
=
0.


{\displaystyle (M-aI)z=0.}


As z is supposed to be nonzero, this means that M – aI is a singular matrix, and thus that its determinant 



det
(
M
−
a
I
)


{\displaystyle \det(M-aI)}

 equals zero. The eigenvalues are thus the roots of the polynomial




det
(
x
I
−
M
)
.


{\displaystyle \det(xI-M).}


If V is of dimension n, this is a monic polynomial of degree n, called the characteristic polynomial of the matrix (or of the endomorphism), and there are, at most, n eigenvalues.
If a basis exists that consists only of eigenvectors, the matrix of f on this basis has a very simple structure: it is a diagonal matrix such that the entries on the main diagonal are eigenvalues, and the other entries are zero. In this case, the endomorphism and the matrix are said diagonalizable. More generally, an endomorphism and a matrix are also said diagonalizable, if they become diagonalizable after extending the field of scalars. In this extended sense, if the characteristic polynomial is square-free, then the matrix is diagonalizable.
A symmetric matrix is always diagonalizable. There are non-diagonizable matrices, the simplest being






[



0


1




0


0



]




{\displaystyle {\begin{bmatrix}0&1\\0&0\end{bmatrix}}}


(it cannot be diagonalizable since its square is the zero matrix, and the square of a nonzero diagonal matrix is never zero).
When an endomorphism is not diagonalizable, there are bases on which it has a simple form, although not as simple as the diagonal form. The Frobenius normal form does not need of extending the field of scalars and makes the characteristic polynomial immediately readable on the matrix. The Jordan normal form requires to extend the field of scalar for containing all eigenvalues, and differs from the diagonal form only by some entries that are just above the main diagonal and are equal to 1.
Duality

A linear form is a linear map from a vector space V over a field F to the field of scalars F, viewed as a vector space over itself. Equipped by pointwise addition and multiplication by a scalar, the linear forms form a vector space, called the dual space of V, and usually denoted 




V

∗


.


{\displaystyle V^{*}.}


If 




v

1


,
…
,

v

n




{\displaystyle v_{1},\ldots ,v_{n}}

 is a basis of V (this implies that V is finite-dimensional), then one can define, for i = 1, ..., n, a linear map 




v

i


∗




{\displaystyle v_{i}^{*}}

 such that 




v

i


∗


(

e

i


)
=
1


{\displaystyle v_{i}^{*}(e_{i})=1}

 and 




v

i


∗


(

e

j


)
=
0


{\displaystyle v_{i}^{*}(e_{j})=0}

 if j ≠ i. These linear maps form a basis of 




V

∗


,


{\displaystyle V^{*},}

 called the dual basis of 




v

1


,
…
,

v

n


.


{\displaystyle v_{1},\ldots ,v_{n}.}

 (If V is not finite-dimensional, the 




v

i


∗




{\displaystyle v_{i}^{*}}

 may be defined similarly; they are linearly independent, but do not form a basis.)
For v in V, the map




f
→
f
(
v
)


{\displaystyle f\to f(v)}


is a linear form on 




V

∗


.


{\displaystyle V^{*}.}

 This defines the canonical linear map from V into 




V

∗
∗


,


{\displaystyle V^{**},}

, the dual of 




V

∗


,


{\displaystyle V^{*},}

 called the bidual of V. This canonical map is an isomorphism if V is finite-dimensional, and this allows identifying V with its bidual. (In the infinite dimensional case, the canonical map is injective, but not surjective.)
There is thus a complete symmetry between a finite-dimensional vector space and its dual. This motivates the frequent use, in this context, of the bra–ket notation




⟨
f
,
x
⟩


{\displaystyle \langle f,x\rangle }


for denoting f(x).
Dual map

Let 




f
:
V
→
W


{\displaystyle f:V\to W}


be a linear map. For every linear form h on W, the composite function f ∘ h is a linear form on V. This defines a linear map





f

∗


:

W

∗


→

V

∗




{\displaystyle f^{*}:W^{*}\to V^{*}}


between the dual spaces, which is called the dual or the transpose of f.
If V and W are finite dimensional, and M is the matrix of f in terms of some ordered bases, then the matrix of 




f

∗




{\displaystyle f^{*}}

 over the dual bases is the transpose 




M


T





{\displaystyle M^{\mathsf {T}}}

 of M, obtained by exchanging rows and columns.
If elements of vector spaces and their duals are represented by column vectors, this duality may be expressed in bra–ket notation by 




⟨

h


T



,
M
v
⟩
=
⟨

h


T



M
,
v
⟩
.


{\displaystyle \langle h^{\mathsf {T}},Mv\rangle =\langle h^{\mathsf {T}}M,v\rangle .}


For highlighting this symmetry, the two members of this equality are sometimes written 




⟨

h


T



∣
M
∣
v
⟩
.


{\displaystyle \langle h^{\mathsf {T}}\mid M\mid v\rangle .}


Inner-product spaces


Besides these basic concepts, linear algebra also studies vector spaces with additional structure, such as an inner product. The inner product is an example of a bilinear form, and it gives the vector space a geometric structure by allowing for the definition of length and angles. Formally, an inner product is a map




⟨
⋅
,
⋅
⟩
:
V
×
V
→
F


{\displaystyle \langle \cdot ,\cdot \rangle :V\times V\rightarrow F}


that satisfies the following three axioms for all vectors u, v, w in V and all scalars a in F:[10][11]
Conjugate symmetry:




⟨
u
,
v
⟩
=



⟨
v
,
u
⟩

¯


.


{\displaystyle \langle u,v\rangle ={\overline {\langle v,u\rangle }}.}


Note that in R, it is symmetric.
Linearity in the first argument:




⟨
a
u
,
v
⟩
=
a
⟨
u
,
v
⟩
.


{\displaystyle \langle au,v\rangle =a\langle u,v\rangle .}






⟨
u
+
v
,
w
⟩
=
⟨
u
,
w
⟩
+
⟨
v
,
w
⟩
.


{\displaystyle \langle u+v,w\rangle =\langle u,w\rangle +\langle v,w\rangle .}


Positive-definiteness:




⟨
v
,
v
⟩
≥
0


{\displaystyle \langle v,v\rangle \geq 0}

 with equality only for v = 0.
We can define the length of a vector v in V by




‖
v

‖

2


=
⟨
v
,
v
⟩
,


{\displaystyle \|v\|^{2}=\langle v,v\rangle ,}


and we can prove the Cauchy–Schwarz inequality:





|

⟨
u
,
v
⟩

|

≤
‖
u
‖
⋅
‖
v
‖
.


{\displaystyle |\langle u,v\rangle |\leq \|u\|\cdot \|v\|.}


In particular, the quantity








|

⟨
u
,
v
⟩

|



‖
u
‖
⋅
‖
v
‖



≤
1
,


{\displaystyle {\frac {|\langle u,v\rangle |}{\|u\|\cdot \|v\|}}\leq 1,}


and so we can call this quantity the cosine of the angle between the two vectors.
Two vectors are orthogonal if 



⟨
u
,
v
⟩
=
0


{\displaystyle \langle u,v\rangle =0}

. An orthonormal basis is a basis where all basis vectors have length 1 and are orthogonal to each other. Given any finite-dimensional vector space, an orthonormal basis could be found by the Gram–Schmidt procedure. Orthonormal bases are particularly easy to deal with, since if v = a1 v1 + ... + an vn, then 




a

i


=
⟨
v
,

v

i


⟩


{\displaystyle a_{i}=\langle v,v_{i}\rangle }

.
The inner product facilitates the construction of many useful concepts. For instance, given a transform T, we can define its Hermitian conjugate T* as the linear transform satisfying




⟨
T
u
,
v
⟩
=
⟨
u
,

T

∗


v
⟩
.


{\displaystyle \langle Tu,v\rangle =\langle u,T^{*}v\rangle .}


If T satisfies TT* = T*T, we call T normal. It turns out that normal matrices are precisely the matrices that have an orthonormal system of eigenvectors that span V.
Relationship with geometry
There is a strong relationship between linear algebra and geometry, which started with the introduction by René Descartes, in 1637, of Cartesian coordinates. In this new (at that time) geometry, now called Cartesian geometry, points are represented by Cartesian coordinates, which are sequences of three real numbers (in the case of the usual three-dimensional space). The basic objects of geometry, which are lines and planes are represented by linear equations. Thus, computing intersections of lines and planes amounts solving systems of linear equations. This was one of the main motivations for developing linear algebra.
Most geometric transformation, such as translations, rotations, reflections, rigid motions, isometries, and projections transform lines into lines. It follows that they can be defined, specified and studied in terms of linear maps. This is also the case of homographies and Möbius transformations, when considered as transformations of a projective space. 
Until the end of 19th century, geometric spaces were defined by axioms relating points, lines and planes (synthetic geometry). Around this date, it appeared that one may also define geometric spaces by constructions involving vector spaces (see, for example, Projective space and Affine space) It has been shown that the two approaches are essentially equivalent.[12] In classical geometry, the involved vector spaces are vector spaces over the reals, but the constructions may be extended to vector spaces over any field, allowing considering geometry over arbitrary fields, including finite fields. 
Presently, most textbooks, introduce geometric spaces from linear algebra, and geometry is often presented, at elementary level, as a subfield of linear algebra.
Usage and applications
Linear algebra is used in almost all areas of mathematics, and therefore in almost all scientific domains that use mathematics. These applications may be divided into several wide categories.
Geometry of our ambient space
The modeling of our ambient space is based on geometry. Sciences concerned with this space use geometry widely. This is the case with mechanics and robotics, for describing rigid body dynamics; geodesy for describing Earth shape; perspectivity, computer vision, and computer graphics, for describing the relationship between a scene and its plane representation; and many other scientific domains.
In all these applications, synthetic geometry is often used for general descriptions and a qualitative approach, but for the study of explicit situations, one must compute with coordinates. This requires the heavy use of linear algebra.
Functional analysis
Functional analysis studies function spaces. These are vector spaces with additional structure, such as Hilbert spaces. Linear algebra is thus a fundamental part of functional analysis and its applications, which include, in particular, quantum mechanics (wave functions).
Study of complex systems
Most physical phenomena are modeled by partial differential equations. To solve them, one usually decomposes the space in which the solutions are searched into small, mutually interacting cells. For linear systems this interaction involves linear functions. For nonlinear systems, this interaction is often approximated by linear functions.[13] In both cases, very large matrices are generally involved. Weather forecasting is a typical example, where the whole Earth atmosphere is divided in cells of, say, 100 km of width and 100 m of height.
Scientific computation
Nearly all scientific computations involve linear algebra. Consequently, linear algebra algorithms have been highly optimized. BLAS and LAPACK are the best known implementations. For improving efficiency, some of them configure the algorithms automatically, at run time, for adapting them to the specificities of the computer (cache size, number of available cores, ...).
Some processors, typically graphics processing units (GPU), are designed with a matrix structure, for optimizing the operations of linear algebra.
Extensions and generalizations
This section presents several related topics that do not appear generally in elementary textbooks on linear algebra, but are commonly considered, in advanced mathematics, as parts of linear algebra.
Module theory

The existence of multiplicative inverses in fields is not involved in the axioms defining a vector space. One may thus replace the field of scalars by a ring R, and this gives a structure called module over R, or R-module.
The concepts of linear independence, span, basis, and linear maps (also called module homomorphisms) are defined for modules exactly as for vector spaces, with the essential difference that, if R is not a field, there are modules that do not have any basis. The modules that have a basis are the free modules, and those that are spanned by a finite set are the finitely generated modules. Module homomorphisms between finitely generated free modules may be represented by matrices. The theory of matrices over a ring is similar to that of matrices over a field, except that determinants exist only if the ring is commutative, and that a square matrix over a commutative ring is invertible only if its determinant has a multiplicative inverse in the ring.
Vector spaces are completely characterized by their dimension (up to an isomorphism). In general, there is not such a complete classification for modules, even if one restricts oneself to finitely generated modules. However, every module is a cokernel of a homomorphism of free modules.
Modules over the integers can be identified with abelian groups, since the multiplication by an integer may identified to a repeated addition. Most of the theory of abelian groups may be extended to modules over a principal ideal domain. In particular, over a principal ideal domain, every submodule of a free module is free, and the fundamental theorem of finitely generated abelian groups may be extended straightforwardly to finitely generated modules over a principal ring.
There are many rings for which there are algorithms for solving linear equations and systems of linear equations. However, these algorithms have generally a computational complexity that is much higher than the similar algorithms over a field. For more details, see Linear equation over a ring.
Multilinear algebra and tensors

In multilinear algebra, one considers multivariable linear transformations, that is, mappings that are linear in each of a number of different variables. This line of inquiry naturally leads to the idea of the dual space, the vector space V∗ consisting of linear maps f: V → F where F is the field of scalars. Multilinear maps T: Vn → F can be described via tensor products of elements of V∗.
If, in addition to vector addition and scalar multiplication, there is a bilinear vector product V × V → V, the vector space is called an algebra; for instance, associative algebras are algebras with an associate vector product (like the algebra of square matrices, or the algebra of polynomials).
Topological vector spaces


Functional analysis mixes the methods of linear algebra with those of mathematical analysis and studies various function spaces, such as Lp spaces.
Homological algebra


See also

Linear equation over a ring
Fundamental matrix in computer vision
Linear regression, a statistical estimation method
List of linear algebra topics
Numerical linear algebra
Linear programming
Transformation matrix
Notes


Further reading
History
Fearnley-Sander, Desmond, "Hermann Grassmann and the Creation of Linear Algebra", American Mathematical Monthly 86 (1979), pp.809–817.

Introductory textbooks








Murty, Katta G. (2014) , World Scientific Publishing, ISBN978-981-4366-62-5. 




The Manga Guide to Linear Algebra (2012), by Shin Takahashi, Iroha Inoue and Trend-Pro Co., Ltd., ISBN978-1-59327-413-9
Advanced textbooks




















Cite uses deprecated parameter |deadurl= (help)







Study guides and outlines



Online Resources

, a series of 34 recorded lectures by professor Gilbert Strang (Spring 2010)


 on MathWorld.
 on 
 on 
, a video presentation of the basics of linear algebra, with emphasis on the relationship between the geometric, the matrix and the abstract points of view
Online books
Beezer, Rob, 
Connell, Edwin H., 
Hefferon, Jim, 
Matthews, Keith, 
Sharipov, Ruslan, 
Treil, Sergei,