How many solutions? Hung-yi Lee New Question:

Slides:



Advertisements
Similar presentations
5.2 Rank of a Matrix. Set-up Recall block multiplication:
Advertisements

Chapter 3: Linear transformations
Linear Equations in Linear Algebra
Section 4.6 (Rank).
Lecture 10 Dimensions, Independence, Basis and Complete Solution of Linear Systems Shang-Hua Teng.
 A equals B  A + B (Addition)  c A scalar times a matrix  A – B (subtraction) Sec 3.4 Matrix Operations.
Chapter 2 Simultaneous Linear Equations (cont.)
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
Vectors in R n a sequence of n real number An ordered n-tuple: the set of all ordered n-tuple  n-space: R n Notes: (1) An n-tuple can be viewed.
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
A vector space containing infinitely many vectors can be efficiently described by listing a set of vectors that SPAN the space. eg: describe the solutions.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Chapter Content Real Vector Spaces Subspaces Linear Independence
5.5 Row Space, Column Space, and Nullspace
4.6: Rank. Definition: Let A be an mxn matrix. Then each row of A has n entries and can therefore be associated with a vector in The set of all linear.
Vector Spaces RANK © 2016 Pearson Education, Inc..
Solve a system of linear equations By reducing a matrix Pamela Leutwyler.
Class 24: Question 1 Which of the following set of vectors is not an orthogonal set?
1.3 Solutions of Linear Systems
Arab Open University Faculty of Computer Studies M132: Linear Algebra
1.7 Linear Independence. in R n is said to be linearly independent if has only the trivial solution. in R n is said to be linearly dependent if there.
Ch 6 Vector Spaces. Vector Space Axioms X,Y,Z elements of  and α, β elements of  Def of vector addition Def of multiplication of scalar and vector These.
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Chapter 5 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Row Space, Column Space, and Nullspace 6.
1 1.4 Linear Equations in Linear Algebra THE MATRIX EQUATION © 2016 Pearson Education, Ltd.
Sec Sec Sec 4.4 CHAPTER 4 Vector Spaces Let V be a set of elements with vector addition and multiplication by scalar is a vector space if these.
1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.
How many solutions? Hung-yi Lee. Review No solution YES NO Given a system of linear equations with m equations and n variables Have solution We don’t.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
EE611 Deterministic Systems Vector Spaces and Basis Changes Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
REVIEW Linear Combinations Given vectors and given scalars
1.4 The Matrix Equation Ax = b
7.3 Linear Systems of Equations. Gauss Elimination
Inverse of a Matrix Hung-yi Lee Textbook: Chapter 2.3, 2.4 Outline:
Matrices and Vector Concepts
Linear Equations in Linear Algebra
Linear independence and matrix rank
Chapter 2 Simultaneous Linear Equations (cont.)
Lecture 7 Vector Space Last Time - Properties of Determinants
Row Space, Column Space, and Nullspace
Euclidean Inner Product on Rn
Basis Hung-yi Lee.
Coordinate System Hung-yi Lee.
Linear Equations in Linear Algebra
Elementary Linear Algebra
4.6: Rank.
Orthogonal Projection
§2-3 Observability of Linear Dynamical Equations
Linear Algebra Lecture 37.
What can we know from RREF?
Elementary Linear Algebra
7.5 Solutions of Linear Systems:
Row-equivalences again
Elementary Linear Algebra
Linear Algebra Lecture 24.
Maths for Signals and Systems Linear Algebra in Engineering Lectures 4-5, Tuesday 18th October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN.
Linear Algebra Lecture 6.
Linear Algebra Lecture 7.
Vectors Any quantity having a n components is called a vector of order n. thus, the coefficients in a linear equation or the elements of a row or column.
Row-equivalences again
LINEAR INDEPENDENCE Definition: An indexed set of vectors {v1, …, vp} in is said to be linearly independent if the vector equation has only the trivial.
Eigenvalues and Eigenvectors
Vector Spaces RANK © 2012 Pearson Education, Inc..
Null Spaces, Column Spaces, and Linear Transformations
NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS
Linear Equations in Linear Algebra
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
Subspace Hung-yi Lee Think: beginning subspace.
CHAPTER 4 Vector Spaces Linear combination Sec 4.3 IF
Presentation transcript:

How many solutions? Hung-yi Lee New Question: Why Homogeneous name homogeneous? Does it have applications? Extension: intuitive definition to another definition => should I proof it? Why only one or inifintie soluiton? Intuitive link of infiitnie solution and independent Question: Example for 冗員 the correct definition of rank dependent is defined on a set or a vector? On set

Reference Textbook: Chapter 1.7

Given a system of linear equations with m equations and n variables Review 𝐴:𝑚×𝑛 𝑥∈ 𝑅 𝑛 𝑏∈ 𝑅 𝑚 Is 𝑏 a linear combination of columns of 𝐴? Is 𝑏 in the span of the columns of 𝐴? NO YES No solution Have solution Check existence first One or infinite soluiton How many solutions?

Today 𝐴:𝑚×𝑛 𝑥∈ 𝑅 𝑛 𝑏∈ 𝑅 𝑚 Other cases? Unique solution Given a system of linear equations with m equations and n variables Today 𝐴:𝑚×𝑛 𝑥∈ 𝑅 𝑛 𝑏∈ 𝑅 𝑚 Is 𝑏 a linear combination of columns of 𝐴? Is 𝑏 in the span of the columns of 𝐴? NO YES The columns of 𝐴 are independent. The columns of 𝐴 are dependent. No solution Check existence first One or infinite soluiton Rank A = n Rank A < n Other cases? Nullity A = 0 Nullity A > 0 Unique solution Infinite solution

Dependent and Independent (依賴的、不獨立的) (獨立的、自主的)

Definition A set of n vectors 𝒂 1 , 𝒂 2 ,⋯, 𝒂 𝑛 is linear dependent If there exist scalars 𝑥 1 , 𝑥 2 ,⋯, 𝑥 𝑛 , not all zero, such that A set of n vectors 𝒂 1 , 𝒂 2 ,⋯, 𝒂 𝑛 is linear independent Find one Obtain many 𝑥 1 𝒂 1 + 𝑥 2 𝒂 2 +⋯+ 𝑥 𝑛 𝒂 𝑛 =𝟎 How about the vector with only one element? 𝑥 1 𝒂 1 + 𝑥 2 𝒂 2 +⋯+ 𝑥 𝑛 𝒂 𝑛 =𝟎 Only if 𝑥 1 = 𝑥 2 =⋯= 𝑥 𝑛 =0 unique

Dependent and Independent Given a vector set, {a1, a2, , an}, if there exists any ai that is a linear combination of other vectors Linear Dependent −4 12 6 , −10 30 15 Dependent or Independent? How about only one vector 2.5u1 = u2 6 3 3 , 1 8 3 , 7 11 6 Dependent or Independent?

Dependent and Independent Given a vector set, {a1, a2, , an}, if there exists any ai that is a linear combination of other vectors Linear Dependent Dependent or Independent? 0 ⋮ 0 is linear dependent or independent? Zero vector is the linear combination of any other vectors Any set contains zero vector would be linear dependent How about a set with only one vector?

Dependent and Independent Given a vector set, {a1, a2, , an}, if there exists any ai that is a linear combination of other vectors Linear Dependent 2 𝒂 𝒊 + 𝒂 𝒋 +3 𝒂 𝒌 =𝟎 𝒂 𝒊 ′ =3 𝒂 𝒋 ′ +4 𝒂 𝒌 ′ 2 𝒂 𝒊 + 𝒂 𝒋 =−3 𝒂 𝒌 − 2 3 𝒂 𝒊 + − 1 3 𝒂 𝒋 = 𝒂 𝒌 𝒂 𝒊 ′ −3 𝒂 𝒋 ′ −4 𝒂 𝒌 ′ =𝟎 How to check? Simple, check whether a vector is the linear combination of the other. Are there better approach. Draw on the black board…… Given a vector set, {a1, a2, , an}, there exists scalars x1, x2, , xn, that are not all zero, such that x1a1 + x2a2 +  + xnan = 0.

Intuition Dependent: Once we have solution, we have infinite. Intuitive link between dependence and the number of solutions 6 1 7 3 8 11 3 3 6 𝑥 1 𝑥 2 𝑥 3 = 14 22 12 1∙ 6 3 3 +1∙ 1 8 3 = 7 11 6 1∙ 6 3 3 +1∙ 1 8 3 +1∙ 7 11 6 = 14 22 12 𝑥 1 𝑥 2 𝑥 3 = 1 1 1 2∙ 6 3 3 +2∙ 1 8 3 = 14 22 12 𝑥 1 𝑥 2 𝑥 3 = 2 2 0 Infinite Solution

Proof Columns of A are dependent → If Ax=b have solution, it will have Infinite Solutions If Ax=b have Infinite solutions → Columns of A are dependent

Proof 𝐴𝑥=𝟎 Homogeneous linear equations 𝑥= 𝑥 1 𝑥 2 ⋮ 𝑥 𝑛 𝑥= 𝑥 1 𝑥 2 ⋮ 𝑥 𝑛 𝐴𝑥=𝟎 𝐴= 𝑎 1 𝑎 2 ⋯ 𝑎 𝑛 (always having 𝟎 as solution) Based on the definition A set of n vectors 𝒂 𝟏 , 𝒂 𝟐 ,⋯, 𝒂 𝒏 is linear dependent 𝐴𝑥=𝟎 have non-zero solution 同種的;同質的 Homogeneous Homogeneous have more solutions 1. Does Ax = 0 always have a solution? Linear independent => Only has one solution Linear dependent => Exists non-zero solution infinite A set of n vectors 𝒂 𝟏 , 𝒂 𝟐 ,⋯, 𝒂 𝒏 is linear independent 𝐴𝑥=𝟎 only have zero solution

Proof Columns of A are dependent → If Ax=b have solution, it will have Infinite solutions If Ax=b have Infinite solutions → Columns of A are dependent We can find non-zero solution u such that 𝐴𝑢=𝟎 𝐴 𝑢+𝑣 =b 𝑢+𝑣 is another solution different to v There exists v such that 𝐴𝑣=b 𝐴𝑢=b 𝐴 𝑢−𝑣 =𝟎 𝑢≠𝑣 𝐴𝑣=b Non-zero

Rank and Nullity

Rank and Nullity The rank of a matrix is defined as the maximum number of linearly independent columns in the matrix. Nullity = Number of columns - rank −3 2 −1 7 9 0 0 0 2 1 3 10 2 6 20 3 9 30 0 0 0 0 0 0 0 0 0 (b) the maximum number of linearly independent row vectors in the matrix. Both definitions are equivalent. The rank of a matrix would be zero only if the matrix had no non-zero elements. If a matrix had even one non-zero element, its minimum rank would be one.

Rank and Nullity The rank of a matrix is defined as the maximum number of linearly independent columns in the matrix. Nullity = Number of columns - rank 1 3 4 2 6 8 0 3 0 5 5 2 6 (b) the maximum number of linearly independent row vectors in the matrix. Both definitions are equivalent. The rank of a matrix would be zero only if the matrix had no non-zero elements. If a matrix had even one non-zero element, its minimum rank would be one.

Columns of A are independent Rank and Nullity The rank of a matrix is defined as the maximum number of linearly independent columns in the matrix. Nullity = Number of columns - rank If A is a mxn matrix: (b) the maximum number of linearly independent row vectors in the matrix. Both definitions are equivalent. The rank of a matrix would be zero only if the matrix had no non-zero elements. If a matrix had even one non-zero element, its minimum rank would be one. Rank A = n Columns of A are independent Nullity A = 0

Conclusion 𝐴:𝑚×𝑛 𝑥∈ 𝑅 𝑛 𝑏∈ 𝑅 𝑚 Unique solution Infinite solution Is 𝑏 a linear combination of columns of 𝐴? Is 𝑏 in the span of the columns of 𝐴? NO YES The columns of 𝐴 are independent. The columns of 𝐴 are dependent. No solution Check existence first One or infinite soluiton Rank A = n Rank A < n Nullity A = 0 Nullity A > 0 Unique solution Infinite solution

Conclusion 𝐴:𝑚×𝑛 𝑥∈ 𝑅 𝑛 𝑏∈ 𝑅 𝑚 The columns of 𝐴 are independent. Rank A = n Nullity A = 0 NO YES Is 𝑏 a linear combination of columns of 𝐴? Is 𝑏 a linear combination of columns of 𝐴? Is 𝑏 in the span of the columns of 𝐴? Is 𝑏 in the span of the columns of 𝐴? NO YES NO YES No solution Infinite solution No solution Unique solution

Question True or False If the columns of A are linear independent, then Ax=b has unique solution. If the columns of A are linear independent, then Ax=b has at most one solution. If the columns of A are linear dependent, then Ax=b has infinite solution. If the columns of A are linear independent, then Ax=0 (homogeneous equation) has unique solution. If the columns of A are linear dependent, then Ax=0 (homogeneous equation) has infinite solution.