Real Vector

Spaces and
Subspaces
Definition of Vector Spaces
A vector spaces is a collection of objects, called
vectors, on which we have two operations:
vector addition and scalar multiplication.
Further the operations must satisfy the following
properties.
Elements abide by the
properties of vectors V
Addition
1. is in V Closure under addition
2. Commutative Property
3. Associative Property
4. V has zero vector 0 such
that for every u in
5. For every u in V, there is avector in V denoted by –u
such that
Scalar

1. is in V Closure under scalar multiplication

2. c( Distributive Property
3. (c+d)u = cu+du Distributive Property
4. c(du)= (cd)u
5. l(u)=u
 𝑛
𝑅 is an example of a vetor space .
Definition of Real Vector Spaces
A real vector space is a vector
space whose field of scalars is the field of
reals. A linear transformation between real
vector spaces is given by a matrix with real
entries (i.e., a real matrix).
SUBSPACES

A subspace of a vector space V is a subset H

and V which has three properties
• The zero vector is in H
• H is closed under vector addition
• H is closed under scalar multiplication
Observation

Every subspace satisfies all the rules of a

vector space.

So every subspace is a vector space.

Observation

Every subspace satisfies all the rules of a

vector space.

So every subspace is a vector space.

Zero Subspace

The set H = {0} is a subspace of any vector

space.

This is the “trivial” subspace.

Determine Subspace

Is the following set a subspace of

1. Yes, H contains the zero vector. Let =
2. This is in H
So H is closed under addition.
3. This is in H. So H is closed under scalar multiplication.
H is a subspace.
Determine Subspace

Is the following set a subspace of

1. Yes, H contains the zero vector. Let =
2. This is in H
So H is closed under addition.
3. This is in H. So H is closed under scalar multiplication.
H is a subspace.
 Linear Combination
A vector v in a vector space V is called a linear combination
of the vectors in V when v can be written in the form

Where are scalars.

 Example of Linear Combination
a. For the set of vectors in

is a linear combination of and because

b. For the set of vectors in

is a linear combination of because

 Linear Independence
A set of vectors in a vector space V is called linearly
independent when the vector equation

Has only trivial solution

It there are also non trivial solutions, then S is linearly

dependent
 Linear Independence
, in a vector space V for linear independence this equation
will require that all scalars equal zero.

To check for linear independence we look for a valid set of

nonzero scalars.
If those nonzero scalars do not exist they are linearly
independent.
 Determining Linear Independence

, in a vector space V we treat the scalars as

unknown variable

All zero Linearly independent

Some nonzero Linearly dependent
Determining Linear Independence
Determining Linear Independence
 Determining Linear Independence

to get a new .
 Determining Linear Independence

to get a new .
 Determining Linear Independence

to get a new .
 Determining Linear Independence

to get a new .
 Determining Linear Independence

to get a new .
 Determining Linear Independence

We have only two rows with nonzero entries.

 Determining Linear Independence

The set of vectors is linearly dependent.

 Determining Linear Independence

We would have had three equations.

 Determining Linear Independence

We would have had three equations.

 Determining Linear Independence

Then these would be linearly independent.

 Determining Linear Independence

[ 𝑎
𝑐
𝑏
𝑑 ]
We can determine linear independence for a
set of vectors that make a square matrix by
finding its determinant.
 Determining Linear Independence

[ 𝑎
𝑐
𝑏
𝑑 ]
If the determinant is zero then the vectors are
linearly dependent.

If the determinant is nonzero then the vectors are

linearly independent.
Determining Linear Independence
Determining Linear Independence
Determining Linear Independence
Determining Linear Independence
Determining Linear Independence
 Determining Linear Independence

𝑐 1=0
𝑐 2= 0

These vectors are linearly independent

 Checking Comprehension
1. Use the determinant method to check if the following
vectors are linearly independent:
<1,2,1> <-1, -1, 2> <-1,0,5>

2. Use elementary row operation to check if the following

are linearly independent:
<1, -3, 2, 1> <-1, 2, 2, 5> <2, -2, -3, 3>
 Span

Set of all possible linear combinations of

this elements is the span
Span
Span
Span
 Checking Comprehension
1. If and find their span.
Span
Basis
Finding a Basis
Finding a Basis
Finding a Basis
Finding a Basis
Finding a Basis
Finding a Basis
Finding a Basis
Finding a Basis
Understanding Dimension
Understanding Dimension
Understanding Dimension
 Checking Comprehension
1.Are the following vectors a basis of
<1, 0> <1,1> <3,2>
2. Are the following vectors a basis of
 Rank of Matrix
The rank of a matrix is the number of linearly independent rows. Or
equivalent, the number of linearly independent columns. Only a zero
matrix has rank zero.

Rank (A)=3

Rank (B)=2
 Rank of Matrix
The rank of a matrix is the number of linearly independent rows. Or
equivalent, the number of linearly independent columns. Only a zero
matrix has rank zero.

Rank (A)=3

Rank (B)=3
 Rank of Matrix
The rank of a matrix is the number of linearly independent rows. Or
equivalent, the number of linearly independent columns. Only a zero
matrix has rank zero.

𝑅 2=−2 𝑅 1𝑟𝑘 (𝐶)=1

𝐶 3 =− 𝑅 1 𝑟𝑘 ( 𝐷 )=2
 Linear Transformation
Definition: Linear Transformation
Sort of like functions on vector spaces in which
it takes a vector on a vector space and
transform this into another vector.
The transformed vector maybe a totally
different type of vector.
Linear Transformation
Linear Transformation
Linear Transformation
Linear Transformation
Properties of Linear Transformation
Example of Linear Transformation
Example of Linear Transformation
Example of Linear Transformation
Example of Linear Transformation
Example of Linear Transformation
 KERNEL
Definition: Kernel
A vector v is in the kernel of a matrix A if
and only if Av=0. Thus, the kernel is
the span of all these vectors.
Similarly, a vector v is in the kernel of
a linear transformation T if and only if
T(v)=0.
 EXAMPLE
For example the kernel of this matrix (call it A)

Is the following matrix, where s can be any number :

Verification using matrix multiplaction: the first entry is and the second
entry is
 EXAMPLE
For example the kernel of this matrix (call it A)

Is the following matrix, where s can be any number :

Verification using matrix multiplaction: the first entry is and the second
entry is
 Rank and Nullity
The nullity of a matrix is determined by the difference between the
order and rank of the matrix. The rank of a matrix is the number of
linearly independent row or column vectors of a matrix. If n is the order
of the square matrix A, then the nullity of A is given by n – r. Thus, the
rank of a matrix is the number of linearly independent or non-zero
vectors of a matrix, whereas nullity is the number of zero vectors of a
matrix.
The rank of matrix A is denoted as ρ(A), and the nullity is denoted as
N(A). Evidently, if the rank of the matrix is equal to the order of the
matrix, then the nullity of the matrix is zero.
 Nullspace
Let A be a real matrix of order m × n, the set of the solutions
associated with the system of homogeneous equation AX = 0 is
said to be the null space of A.
Nullspace of A = { x ∈ R | Ax = 0}. Then the nullity of A will be the
n

dimension of the Nullspace of A.

If the rank of A is r, there are r leading variables in row-reduced
echelon form of A and n – r free variables, which are solutions of
the homogeneous system of equation AX = 0. Thus, n – r is the
dimension of the null space of A. This fact motivates the rank and
nullity theorem for matrices.
Nullspace
 Range
The range (also called the column space or
image) of a m × n matrix A is the span (set of
all possible linear combinations) of its column
vectors. The column space of a matrix is the
image or range of the corresponding matrix
transformation. We will denote it as Range(A).
So it is a subspace of ℝ in case of real entries
m

or ℂ when matrix A has complex entries.

m
 Use short powerful Switch to long statements
sentences with a punch to convey emotions
Presentations are communication Presentations are communication
tools that can be used as tools that can be used as
demonstrations, lectures, demonstrations, lectures,
speeches, reports, and more. speeches, reports, and more.
 Time
yourself
To ensure you're within
the time allotted for you
Presentations are communication tools that can
be used as lectures, speeches, reports, and
more. Most of the time, they’re presented
before an audience.
 Reflects your confidence and
allows your important points to sink Modulate
your voice
in
Presentations are communication tools that
can be used as lectures, speeches, reports,
and more. Most of the time, they’re
presented before an audience.
 Isomorphism
Definition: Isomorphism
Let and be two vector spaces between f.
and are called isomorphic if there exist
a linear map T: which is one to one and
onto. T is called isomorphism.
Notation:
 EXAMPLE
Let, ,

a) Is T one-to-one? Yes
T is one to one nullspace
𝑥 1=0
b) Is T onto? 𝑥 2=0
𝑥 3=0
 Isomorphism
Definition: Isomorphism

Let T: VW be a linear transformation. Then T

is an isomorphism if T is one to one and
onto.
 R EC OR D YOUR S ELF AS YOU P RAC TI C E
Presentations are tools that can be used as
lectures, speeches, reports, and more.

Watch TALK I N F R ONT OF A M I R R OR

Presentations are tools that can be used as

yourself lectures, speeches, reports, and more.

G ATHER S OM E F R I END S
T O F OR M AN AUD I ENC E
Presentations are tools that can be used as
lectures, speeches, reports, and more.
Tips on the day of your
actual presentation
HELPS C ALM T HE NERVES
Presentations are tools that can be used as
lectures, speeches, reports, and more.
Take deep
breaths if
R EG UL ATES T HE HEART RATE
Presentations are tools that can be used as
lectures, speeches, reports, and more.
you feel
R EL AXES THE M US CLES nervous
Presentations are tools that can be used as
lectures, speeches, reports, and more.
Delivery is essential to the
whole package of your
presentation.
PR ES EN T L IKE A PR O W ITH THES E S UGGES TI ON S .
 The more adjusted you are,
Adjust to the more comfortable you'll feel
Presentations are communication tools that can
your be used as lectures, speeches, reports, and
more. Most of the time, they’re presented
surrounding before an audience.

s
 Imagine a positive outcome
and it's likely to go that way
Presentations are tools that can be
Use
used as lectures, reports, and more.
Most of the time, they’re presented
positive
before an audience.
visualizatio
n
Good luck!