LA Unit 2.8, 2.9, 4.9 Notes- These notes are a condensation of Unit 4 notes.

Use the Unit 4 videos and skip

over the crossed off examples in the videos. 2.8 is 4.1, 4.2 and 4.3. 2.9 is 4.4-4.5 4.9 is still 4.9.

LA Section 4.1 Notes

Vector spaces- definition

The main areas we will concentrate on to give you an understanding in abstract world will be 1 and 6. We also
need to make sure that the "⃗
0 is included in V. Some courses will make you show all 10! Yikes, but yes. We
will do this for subspaces.

Example 1:
Let V be in the third quadrant in the xy plane. In other words:
𝑥
𝑉 = &'𝑦* : 𝑥 ≤ 0, 𝑦 ≤ 0.
a) If u and v are in V, is u + v in V? Why?

b) Find a specific u in V and specific scalar c such that cu is not in V. What does this show?
Example 2: Determine if the given set is a subspace of Ρ! for an appropriate value of n. Justify your answers.
a) All polynomials of the form of 𝐩(𝑡) = 𝑎𝑡 " , where a is in R.
b) All polynomials of the form of 𝐩(𝑡) = 𝑎𝑡 " + 𝑐𝑡 # + 2, where a and c are in R.

Theorem 1- If 𝐯$ , 𝐯# , … 𝐯% are in the vector space V, then Span:𝐯$ , 𝐯# , … 𝐯% ; is a subspace of V.

𝑎+𝑏
Example 3: Let H be the set of all vectors of the form < 𝑏 ?. Show that H is a subspace of ℝ" .
𝑎−𝑏

1 −2 4 3
Example 4: Let 𝐯$ = <2? , 𝐯# = < 1 ? , and 𝐯" = <2? and 𝐰 = <1?.
3 0 1 1

a) Is w in {𝐯$ , 𝐯# , 𝐯" }?

b) Is w in the subspace spanned by {𝐯$ , 𝐯# , 𝐯" }? Why?

4.1 Gift (practice problems) #1-23 odd, 35,37,38

LA 4.2 Notes
Nul(A), Col(A), Kernal, Range

In this section, we will do many of the same operations as before, but build your vocabulary, using subspaces.

Proof:
 1) Row reduce to find free variables.
2) Decompose into linear combinations where
the weights are the free variables.
3) Every linear combination of the vectors
found in 2) is the spanning set for Nul(A).

Column Space

a. Show A(u)=0, then u is in Nul(A).

b. Show the augmented matrix is consistent for A(x)=v, then v is in Col A.

Kernel and Range of a Linear Transformation
Contrast between Nul(A) and Col(A) for an mxn matrix

LA Gift 4.2 Practice #1-3, #1-25 odd, 31, 37.

LA Notes 4.3

We want to form a basis for a subspace. You will use techniques that we have done already, but it is the
definition and concepts that we have to pay attention to.

Basis: Any invertible nxn matrix, the columns will form a

basis for ℝ! because the columns are linearly
independent and the span ℝ! , by the invertible Matrix
Theorem.

The STANDARD BASIS for ℝ! are the elementary column vectors, {𝐞𝟏 , 𝐞𝟐 , … , 𝐞𝐧 }.

1 −2 4
Example 1: Let 𝐯$ = <2? , 𝐯# = < 1 ? , and 𝐯" = <2?. Determine if {𝐯𝟏 , 𝐯𝟐 , 𝐯𝟑 } is a basis for ℝ" .
3 0 1

1 −2 −1
Example 2: Let 𝐯$ = <2? , 𝐯# = < 1 ? , and 𝐯" = < 3 ?. Determine if {𝐯𝟏 , 𝐯𝟐 , 𝐯𝟑 } is a basis for ℝ" .
3 0 3
Example 3: Find the basis for the Nul(A) and the Col(A) for matrix B.

Example 4: Which of the following sets form a basis for ℝ" ?

1 2 1 1 2 1 2 1 4
N<2? , <3? , <−1?O N<2? , <3?O N<2? , <3? , <−1? , <5?O
3 0 2 3 0 3 0 2 6

4.3 Practice #1-3 Gift #1-9 odd, 13,14,15,17,19,21,23,24,29,30.

2.8 Gift 2.8 Practice problems 1-3, #1-7 odd, 11,13, 15-21 all,23-29 odd, 36,37.
LA 4.4 Coordinate Systems Video for 2.9

Say that we have a basis for ℝ# , namely {𝐞𝟏 , 𝐞𝟐 }. We can then

generate any vector in ℝ# .

−1
*So, here we have ' *. This is the same as −1𝐞𝟏 + 𝟒𝐞𝟐 . We can
4
generate any vector in ℝ# , using this basis.

Question
𝟏 𝟏
What if we have a new basis to vector space V, which is ℬ = {𝐛𝟏 , 𝐛𝟐 } = ' *.
𝟎 𝟐

We still have the coordinates at (-1,4) in the x-y plane. However, it is now
−3
the vector ' * in V. We are going to build this backwards, then undo
2
what we did to get a method to move from a standard graph to a ℬ graph
paper.

𝐱 is the vector in regular graph land. [𝐱]ℬ is the vector in vector space V.

We can then build 𝐱 from the basis in ℬ.

1 1 −1 𝟏 𝟏 −3 −1
𝐱 = −3 ' * + 2 ' * = ' * Or 𝐱=' *' * = ' *
0 2 4 𝟎 𝟐 2 4
This is a mapping [𝐱]ℬ → 𝐱 .

What if we wanted to reverse our direction?

𝐱 → [𝐱]ℬ is done by the inverse or reduced row echelon form.
+𝟏
[𝐱]ℬ = '𝟏 𝟏* '−1* = '−3* or rref '𝟏 𝟏 −𝟏* ~ '𝟏 𝟎 −𝟑*
𝟎 𝟐 4 2 𝟎 𝟐 𝟒 𝟎 𝟏 𝟐
Example 1: Find the vector 𝐱 determined by the given coordinate vector [𝐱]ℬ and the given basis for ℬ.

−1 3 4 −4
ℬ = N< 2 ? , <−5? , <−7?O , [𝐱]ℬ = < 8 ?
0 2 3 −7

Example 2: Find the coordinate vector [𝐱]ℬ of 𝐱 relative to the given basis ℬ = {𝐛𝟏 , 𝐛𝟐 , 𝐛𝟑 }.

1 2 1 3
𝐛$ = <0? , 𝐛# = <1? , and 𝐛" = <−1?, and 𝐱 = <−5?.
3 8 2 4

Define 𝑃ℬ and 𝑃ℬ+$ .

4.4 Practice Problem #1, Gift 1-11 odd, 12, 15, 17, 21, 35
4.5 Dimension of a Vector Space for 2.9

2 4
1) Do the vectors <1? and <−1? form a basis for ℝ" ? If not, what do they form a basis for?
3 0

Dimension- The number of basis vectors for a subspace.

2) What is the dimension formed by the vectors in #1?

3) What is the dimension of ℝ" ? ℝ$, ?
4) What is the dimension of the Nul(A) and Col(A) below?

−3 6 −1 1 −7
𝐴 = < 1 −2 2 3 −1 ?
2 −4 5 8 −4

The dim(Nul(A))=the number of free variables and dim(Col(A)) is the number of pivot columns.
In an mxn matrix, n = dim(Nul(A)) + dim(col(A)). The dim(col(A)) is also called the rank (A).

What if we have an invertible nxn matrix?

m. The columns of A form a basis of ℝ!
n. Col(A)= ℝ!
o. dim(Col(A))=n
p. rank(A)=n
q. Nul(A)={𝟎}
r. dim(Nul(A))=0

Example: Find the dimension of the subspace

Example: Find the bases for the column space, row space and the null space, the dim of each and the rank of
the matrix.

−2 −5 8 0 −17
b1 3 −5 1 5 d
3 11 −19 7 1
1 7 −13 5 −3

4.5 Practice #1 Gift 1,3,5,11,13,15,17,19a-d

4.6 Gift 1,3,5,7,9,13
2.9 Gift 1,2,3-23 odd, 29.
LA Section 4.9
Markov Chains

Warm up- What are the fixed point(s) of the recurrence relations?

fixed point(s) = _____ fixed point(s) = _____ fixed point(s) = _____

. -" .##
𝑎!-$ = 4𝑎! − 3 𝑎!-$ = #.! +/ 𝑎!-$ = n1 + $# o 𝑎! − 50
!

Markov Chains are used to find the probabilities of experiments that are repeated. It is like a recursive
formula for matrices, where you apply a transition, get a result, apply the transition to that result and get
another result. Repeat until you have a stable probability model.

Andrei Markov developed a system with matrices in order to replicate a chain of events. Hence, the name
Markov Chains represent using these matrices in a repetitive order.

Example: Let’s go down to the Mr. Hoe’s cafeteria. (Mr. Hoe used to run the HS café for 50 years.)
1) Let’s say that if a student eats Mr. Hoe food on one day, there is a 70% chance that they will eat Mr. Hoe
food next following day.
2) If a student doesn’t eat Mr. Hoe food one day, the probability that they will eat Mr. Hoe the next day is
40%.
3) Data shows that 75% of the students ate in the café on day 1, Monday.

Let’s create a model for this to show repetitive day. Ultimately, we want to know who is eating Mr. Hoe food
in the long term.

Let’s set up a transitional situation with matrices.

Initial Distribution (𝑥1 ):

Transitional Matrix (P):

Question 1 and 2. How do we find out the predicted number of students on Tuesday? How about Friday?
Remember that we have the following number of transitions.

Tuesday_____________ Friday _____________

Question 3: What can Mr. Hoe expect long term so Question 5: Draw a digraph for the transition
he can predict orders for the number of students in matrix.
the café? (Steady State)

Question 4: Does the initial state matter for the Question 6: What is the “Fixed Point” for Mr. Hoe?
steady state in this example? Try some different
initial states.

Definitions
1) Probability vector

2) Stochastic Matrix

3) Markov Chain

4) Steady State Vector

Extend to a 3x3.

For the gift, keep the matrices saved in the Nspire docs, as some of the problems are revisited.
Gift- Section 4.9 1,3,4,5,7,11,13,14,15,16,21.
Markov Chains
Intro to Google search- Do in class together. Please wait.

In 4.9, we learned how to make a Markov Chain, which included an initial state vector and a transition matrix.
We set this up as 𝑥$ = 𝑃𝑥1 for one transition and as a general transition 𝑥2-$ = 𝑃𝑥2 𝑜𝑟 𝑥2-$ = 𝑃2 𝑥1 .
Most of our examples settled to a steady state, regardless of its initial state. In fact, a stochastic matrix, a
square matrix with probability column vectors (this course uses columns), will always have a steady state
vector. The question is, will you always end in a steady state, depending on which initial state vector you
begin with? Let’s investigate.

On the left, you will have a picture or diagram. I want you to work with others to figure out the transition
matrix for each situation. Movement comes with equal chance of probability of from one destination to
another, if not listed. Good luck!
Setup Transition matrix P.
1) Rooms in a house.

2)

3)

4)

5)

6) For number 5, play around with different initial states. What happens? What happens in the long term
depending on different initial states?