Lec18 ES205 Sp25 Upload
Lec18 ES205 Sp25 Upload
Lecture 18
• 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.
4.5 – The Dimension of a Vector Space
A) Introduction
Definition:
If a vector space 𝑉 is spanned by a finite set, then 𝑉 is said to be finite-dimensional,
and the dimension of 𝑉 , written as dim 𝑉 , is the number of vectors in a basis for 𝑉 .
The dimension of the zero-vector space 𝟎 is defined to be zero. If 𝑉 is not spanned
by a finite set, then 𝑉 is said to be infinite-dimensional.
Examples
4.5 – The Dimension of a Vector Space
B) Subspaces of a Finite-Dimensional Space
Theorem 12:
Let 𝑯 be a subspace of a finite-dimensional vector space 𝑽 . Any linearly independent set
in 𝑯 can be expanded, if necessary, to a basis for 𝑯. Also, H is finite-dimensional and
𝑑𝑖𝑚 𝐻 ≤ 𝑑𝑖𝑚 𝑉
Examples
4.5 – The Dimension of a Vector Space
• The Rank Theorem is a powerful tool for processing information about systems of linear
equations
• Example:
• A scientist has found two solutions to a homogeneous system of 40 equations in 42
variables. The two solutions are not multiples, and all other solutions can be
constructed by adding together appropriate multiples of these two solutions. Can the
scientist be certain that an associated nonhomogeneous system (with the same
coefficients) has a solution?
4.5 – The Dimension of a Vector Space
• The various vector space concepts associated with a matrix provide several more
statements for the Invertible Matrix Theorem, IN ADDITION to the previous statements,
as given below
Theorem: The Invertible Matrix Theorem (Contd.)
Let 𝐴 be an 𝑛 × 𝑛 matrix. Then the following statements are each equivalent to the
statement that 𝐴 is an invertible matrix.
m. The columns of 𝐴 form a basis of ℝ𝑛 .
n. Col 𝐴 =
o. rank 𝐴 =
p. nullity 𝐴 =
q. Nul 𝐴 =
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.6 – Change of Basis
• A) Introduction
• B) Change of Basis in ℝ𝑛
4.6 – Change of Basis
A) Introduction
• When a basis B is chosen for an n-dimensional vector space V , the associated
coordinate mapping (given by the coordinate vector [𝑥]𝐵 ) onto ℝ𝑛 provides a
coordinate system for V.
• In this section, we study how [𝒙]𝐵 and [𝒙]𝐶 are related for each 𝒙 in 𝑉.
4.6 – Change of Basis
A) Introduction
Find [𝒙]𝐵 and [𝒙]𝐶 for 𝒙 in figure 1
4.6 – Change of Basis
A) Introduction
Theorem 15:
Let 𝐵 = {𝒃1 , 𝒃2 , … , 𝒃𝑛 } and C = {𝒄1 , 𝒄2 , … , 𝒄𝑛 } be bases of a vector space 𝑉 . Then
there is a unique 𝑛 × 𝑛 matrix 𝑃𝐶←𝐵 such that
𝒙 𝐶 = 𝑃𝐶←𝐵 𝒙 𝐵
The columns of𝑃𝐶←𝐵 are the 𝐶-coordinate vectors of the vectors in the basis 𝐵. That is,
𝑃𝐶←𝐵 = 𝒃1 𝐶 𝒃2 𝐶 … … . 𝒃𝑛 𝐶