basis
let
be a vector subspace. an ordered set of vectors
is called a basis of
if it satisfies any of the three equivalent conditions.
- the set is a maximal linearly independent set: it is linearly independent, and if you add one more vector, the set will no longer be linearly independent.
- the set is a minimal spanning set: it spans
, and if you drop one vector, it will no longer span
.
- the set is a linearly independent set spanning
.
let
be a finite-dimensional vector space. an ordered basis for
is a basis for
endowed with a specific corder; that is, an ordered basis for
is a finite sequence of linearly independent vectors in
that generates
.
[cite:;taken from @algebra_insel_2019 chapter 2.2 the matrix representation of a linear transformation]
[cite:;taken from @algebra_insel_2019 chapter 2.2 the matrix representation of a linear transformation]
let
be a basis of
:
since
is linearly independant then:
this is necessarily true because
has to be 0 for
to zero out and if it wasnt zero then the output vector would have a non-zero in it and it wouldnt be
anymore
a basis doesnt have to be of this simplified form, we can take the basis
, apply elementary row operations to its vectors and we would get another basis for the given vector space
every finitely generated vector space
has atleast one basis
since
is finitely generated there exists a finite set
such that 
according to [[can_drop_vector_keep_span][this lemma]], there exists
where
is linearly independant and
, therefore
is a basis
according to [[can_drop_vector_keep_span][this lemma]], there exists
consider the vector space
which represents all the matrices with dimensions
over the field 
what we are basically looking for is a set of matrices that is linearly independant so that no matrix is a linear combination of the others, which is accomplished with:
and:
we prove that
is linearly independant:
it must be that
and so
is linearly independant because the only linear combination that gives us
is where the coefficients all are 0
what we are basically looking for is a set of matrices that is linearly independant so that no matrix is a linear combination of the others, which is accomplished with:
given
is a finite set and
and
, then
is linearly dependant
in other words, if we have a finitely generated vector space, if
is a subset of that space such that the number of elements in
is bigger than the number of elements in
, then
is linearly dependant
in other words, if we have a finitely generated vector space, if
let
and
such that 
let
denote the coefficients, for every
where
there exist the coefficients:

let
let
be a finite set, if
and
is linearly independant then 
let
be bases of
then 
is a spanning set and
and
is linearly independant then 
is a spanning set and
and
is linearly independant then 
therefore
therefore
basis of the cartesian coordinate system
the of the cartesian coordinate system consists of the unit vectors that lie along the x, y, and z axes
the x unit vector is denoted by , the y unit vector by
, and the z unit vector by