Scribd
Upload
20 views21 pages

Lec16 ES205 Sp25 Upload

The lecture covers advanced topics in linear algebra, focusing on vector spaces, linearly independent sets, and bases, as outlined in Chapter 4 of the textbook by David C. Lay. Key concepts include the definition of bases, the spanning set theorem, and the dimension of a vector space, emphasizing the importance of coordinate systems and their relation to vector spaces. The session also includes preparations for upcoming assignments and quizzes.

Uploaded by

ammarsiddiqui911
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views21 pages

Lec16 ES205 Sp25 Upload

The lecture covers advanced topics in linear algebra, focusing on vector spaces, linearly independent sets, and bases, as outlined in Chapter 4 of the textbook by David C. Lay. Key concepts include the definition of bases, the spanning set theorem, and the dimension of a vector space, emphasizing the importance of coordinate systems and their relation to vector spaces. The session also includes preparations for upcoming assignments and quizzes.

Uploaded by

ammarsiddiqui911
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

ES 205 – Advanced Linear Algebra

Lecture 16

Dr. Asad Mahmood


March 12th, 2025
Lecture Outline
• Announcements: (Assignment and Quiz # 3, Mid Exam Preparations)
• Review of Last Lecture
• Quiz Solution
• Chapter 4 – Vector Spaces
• 4.3 Linearly Independent Sets; Bases
• Outline for Today’s Lecture
• Chapter 4 – Vector Spaces
• 4.4 Coordinate Systems
• 4.5 The Dimension of a Vector Space
Chapter 4 – Vector Spaces
Linear Algebra and its Applications, David C. Lay, 6th Edition – Global
Edition
Prepared by:
Dr. Asad Mahmood, FES, GIK Institute
Chapter Contents
• Chapter 4 – Vector Spaces
• INTRODUCTORY EXAMPLE: DISCRETE-TIME SIGNALS AND DIGITAL SIGNAL
PROCESSING
• 4.1 Vector Spaces and Subspaces
• 4.2 Null Spaces, Column Spaces, Row Spaces, and Linear Transformations
• 4.3 Linearly Independent Sets; Bases
• 4.4 Coordinate Systems
• 4.5 The Dimension of a Vector Space
• 4.6 Change of Basis
• 4.7 Digital Signal Processing
• 4.8 Applications to Difference Equations
Chapter Contents
• Chapter 4 – Vector Spaces
• INTRODUCTORY EXAMPLE: DISCRETE-TIME SIGNALS AND DIGITAL SIGNAL
PROCESSING
• 4.1 Vector Spaces and Subspaces
• 4.2 Null Spaces, Column Spaces, Row Spaces, and Linear Transformations
• 4.3 Linearly Independent Sets; Bases
• 4.4 Coordinate Systems
• 4.5 The Dimension of a Vector Space
• 4.6 Change of Basis
• 4.7 Digital Signal Processing
• 4.8 Applications to Difference Equations
4.3 - Linearly Independent Sets; Bases

• A) Introduction
• B) The Spanning Set Theorem
• C) Bases for Nul A, Col A, and Row A
• D) Two Views of a Basis
4.3 - Linearly Independent Sets; Bases
A) Introduction
• Goal  Find the subsets that span a vector space 𝑉 or a subspace 𝐻 as “efficiently” as
possible  The key idea is that of Linear independence
Theorem 4:
• An indexed set {𝒗1 , … , 𝒗𝑝 } of two or more vectors, with 𝒗1 ≠ 0, is linearly dependent if
and only if some 𝒗𝑗 (with 𝑗 > 1) is a linear combination of the preceding vectors,
{𝒗1 , … , 𝒗𝑗−1 } .

Definition:
• Let 𝐻 be a subspace of a vector space 𝑉 . A set of vectors 𝐵 in 𝑉 is a
basis for 𝐻 if
1. 𝐵 is a linearly independent set, and
2. the subspace spanned by 𝐵 coincides with 𝐻; that is, 𝐻 = Span 𝐵

• Examples
4.3 - Linearly Independent Sets; Bases
B) The Spanning Set Theorem
• A basis is an efficient spanning set that contains no unnecessary vectors
 can be created from the spanning set by discarding unneeded vectors
Theorem 5: The Spanning Set Theorem
• Let 𝑆 = {𝒗1 , … , 𝒗𝑝 } be a set in a vector space 𝑉, and let 𝐻 = Span{𝒗1 , … , 𝒗𝑝 }.
1. If one of the vectors in 𝑆—say, 𝒗𝑘 —is a linear combination of the remaining
vectors in 𝑆, then the set formed from 𝑆 by removing 𝑣𝑘 still spans 𝐻.
2. If 𝐻 ≠ {0}, some subset of 𝑆 is a basis for 𝐻.

• Examples
4.3 - Linearly Independent Sets; Bases
C) Bases for Nul 𝐴, Col 𝐴, and Row 𝐴

1. Basis for Nul 𝐴


The spanning set of the parametric solution for Nul 𝐴 is a basis for Nul 𝐴

2. Basis for Col 𝐴


• Example
• If the matrix is in reduced echelon form
• If the matrix not in reduced echelon form

Theorem 6:
• The pivot columns of a matrix 𝐴 form a basis for Col 𝐴

Note, however, that the row operations can change the column space!!!
4.3 - Linearly Independent Sets; Bases
C) Bases for Nul 𝐴, Col 𝐴, and Row 𝐴
3. Basis for Row 𝐴
• Unlike Col A, the row operations do not alter the row space of a matrix

Theorem 7:
• If two matrices 𝐴 and 𝐵 are row equivalent, then their row spaces are the same. If 𝐵 is
in echelon form, the nonzero rows of 𝐵 form a basis for the row space of 𝐴 as well as
for that of 𝐵.

• Example
4.3 - Linearly Independent Sets; Bases

D) Two views of a Basis


• A basis can be viewed as a spanning set for a space/subspace 𝑉 which is as small as
possible  further deletion of any vector would not span 𝑉
• A basis can also be viewed as a set of linearly independent set which is as large as
possible  any further addition of a vector would lose the linear independence
• Examples 
• Decide if the following sets of vectors is a basis for ℝ𝟑 or not?
Chapter Contents
• Chapter 4 – Vector Spaces
• INTRODUCTORY EXAMPLE: DISCRETE-TIME SIGNALS AND DIGITAL SIGNAL
PROCESSING
• 4.1 Vector Spaces and Subspaces
• 4.2 Null Spaces, Column Spaces, Row Spaces, and Linear Transformations
• 4.3 Linearly Independent Sets; Bases
• 4.4 Coordinate Systems
• 4.5 The Dimension of a Vector Space
• 4.6 Change of Basis
• 4.7 Digital Signal Processing
• 4.8 Applications to Difference Equations
4.4 – Coordinate Systems

• A) Introduction
• B) A Graphical Interpretation of Coordinates
• C) Coordinates in ℝ𝑛
• D) The Coordinate Mapping
4.4 – Coordinate Systems
A) Introduction
• An important reason for specifying a basis 𝐵 for a vector space 𝑉 is to impose a
“coordinate system” on 𝑉 .
• This section will show that if 𝐵 contains 𝑛 vectors, then the coordinate system will
make 𝑉 act like ℝ𝑛 .

Theorem 8: The Unique Representation Theorem


• Let 𝐵 = {𝒃1 , … , 𝒃𝑛 } be a basis for a vector space 𝑉 . Then for each 𝒙 in 𝑉 , there exists
a unique set of scalars 𝑐1 , … , 𝑐𝑛 such that
𝒙 = 𝑐1 𝒃1 + ⋯ + 𝑐𝑛 𝒃𝑛
4.4 – Coordinate Systems
A) Introduction
Definition
• Suppose 𝐵 = {𝒃1 , … , 𝒃𝑛 } is a basis for a vector space 𝑉 and 𝒙 is in 𝑉. The coordinates
of 𝒙 relative to the basis 𝐵 (or the 𝐵-coordinates of 𝑥) are the weights 𝑐1 , … , 𝑐𝑛 such
that 𝒙 = 𝑐1 𝒃1 + ⋯ + 𝑐𝑛 𝒃𝑛

• Coordinate vector / B-coordinate vector


• Coordinate mapping
• Examples
4.4 – Coordinate Systems
B) A Graphical Interpretation of Coordinates

Coordinates of x in the new basis B


4.4 – Coordinate Systems
C) Coordinates in ℝ𝑛
• When a basis 𝐵 for ℝ𝑛 is fixed, the 𝐵-coordinate vector of a specified 𝒙 can be easily
found.
• Example

• The change-of coordinates equation is important and will be needed at several points in
Chapters 5 and 7
4.4 – Coordinate Systems
D) The Coordinate Mapping
• Choosing a basis 𝐵 = {𝒃1 , … , 𝒃𝑛 } for a vector space 𝑽 introduces a coordinate system in
𝑽.
• The coordinate mapping 𝒙 ↦ 𝒙 𝐵 connects the possibly unfamiliar space 𝑽 to the
familiar space ℝ𝑛  Points in 𝑽 can now be identified by their new “names.”

Theorem 9:
Let 𝐵 = {𝒃1 , … , 𝒃𝑛 } be a basis for a vector space
𝑉 . Then the coordinate mapping 𝒙 ↦ 𝒙 𝐵 is a
one-to-one linear transformation from V onto
ℝ𝑛

• One-to-one linear transformation from the space 𝑽 into the space 𝑾 is also called
isomorphism from 𝑽 into the new space, e.g. isomorphism between ℙ3 and ℝ4
• Example
Chapter Contents
• Chapter 4 – Vector Spaces
• INTRODUCTORY EXAMPLE: DISCRETE-TIME SIGNALS AND DIGITAL SIGNAL
PROCESSING
• 4.1 Vector Spaces and Subspaces
• 4.2 Null Spaces, Column Spaces, Row Spaces, and Linear Transformations
• 4.3 Linearly Independent Sets; Bases
• 4.4 Coordinate Systems
• 4.5 The Dimension of a Vector Space
• 4.6 Change of Basis
• 4.7 Digital Signal Processing
• 4.8 Applications to Difference Equations
4.5 – The Dimension of a Vector Space

• A) Introduction
• B) Subspaces of a Finite-dimensional space
• C) The Dimensions of Nul A, Col A, and Row A
• D) Applications to Systems of Equations
• E) Rank and the Invertible Matrix Theorem
4.5 – The Dimension of a Vector Space

A) Introduction
• It was seen in the previous section that a vector space 𝑉 with a basis 𝐵 containing
𝑛 vectors is isomorphic to ℝ𝑛 .
• This section shows that this number n is an intrinsic property (called the
dimension) of the space 𝑉 that does not depend on the particular choice of basis.

Theorem 10:
If a vector space has a basis 𝐵 = 𝒃1 , … , 𝒃𝑛 , then any set in 𝑉 containing more than
𝑛 vectors must be linearly dependent.

Theorem 11:
If a vector space 𝑉 has a basis of 𝑛 vectors, then every basis of 𝑉 must consist of
exactly 𝑛 vectors.

You might also like