Scribd
Upload
37 views

Lecture 2

This document defines and discusses key concepts in linear algebra including linear combinations, spanning sets, and linear independence. It defines a linear combination as a sum of scalar multiples of vectors and a spanning set as the set of all possible linear combinations of a given set of vectors. A set of vectors is linearly independent if the only way to get the zero vector as a linear combination is with all scalars equal to zero, and linearly dependent otherwise. Theorems are stated but proofs are omitted regarding spanning sets forming subspaces and linear dependence occurring when a vector can be written as a linear combination of others. Examples demonstrate these concepts for sets of vectors in R3.

Uploaded by

Kaveesha Jayasuriya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

Lecture 2

This document defines and discusses key concepts in linear algebra including linear combinations, spanning sets, and linear independence. It defines a linear combination as a sum of scalar multiples of vectors and a spanning set as the set of all possible linear combinations of a given set of vectors. A set of vectors is linearly independent if the only way to get the zero vector as a linear combination is with all scalars equal to zero, and linearly dependent otherwise. Theorems are stated but proofs are omitted regarding spanning sets forming subspaces and linear dependence occurring when a vector can be written as a linear combination of others. Examples demonstrate these concepts for sets of vectors in R3.

Uploaded by

Kaveesha Jayasuriya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Linear Algebra - MA2034

2 Linear Combinations, Spanning Sets


and Linear Independence

2.1 Linear Combinations and Spanning Sets

Definition 2.1.1: Let 𝑉 be a vector space over a field 𝐹 and let 𝐵 = {𝒗𝟏 , 𝒗𝟐 , … , 𝒗𝒏 } be a finite
subset of 𝑉. Then any vector of the form ∑𝑛𝑟=1 𝑎𝑟 𝒗𝒓 is called a linear combination of the vectors
in the set 𝐵; where {𝑎1 , 𝑎2 , … , 𝑎𝑛 } ⊂ 𝐹.

Definition 2.1.2: Let 𝑉 be a vector space over a field 𝐹 and let 𝐵 = {𝒗𝟏 , 𝒗𝟐 , … , 𝒗𝒏 } be a finite
subset of 𝑉. Then we denote the set of all linear combinations of the vectors in 𝐵 as span(𝐵).
In other words, span(𝐵) ∶= { ∑𝑛𝑟=1 𝑎𝑟 𝒗𝒓 | 𝑎1 , 𝑎2 , … , 𝑎𝑛 ∈ 𝐹 }.

Theorem 2.1.1: Let 𝑉 be a vector space over a field 𝐹 and let 𝐵 = {𝒗𝟏 , 𝒗𝟐 , … , 𝒗𝒏 } be a finite
subset of 𝑉, then
a) span(𝐵) is a subspace of 𝑉 and
b) span(𝐵) is the smallest subspace of 𝑉 that contains B.
Proof: Will be explained in the lecture.

2.2 Linear Independence

Definition 2.2.1: Let 𝑉 be a vector space over a field 𝐹 and let 𝐵 = {𝒗𝟏 , 𝒗𝟐 , … , 𝒗𝒏 } be a finite
subset of 𝑉. Then we say that 𝐵 is linearly independent ⟺
∀ 𝑎 = (𝑎1 , 𝑎2 , … , 𝑎𝑛 ) ∈ 𝐹 𝑛 ,
𝑛

∑ 𝑎𝑟 𝒗𝒓 = 𝟎 ⟹ 𝑎 = 0.
𝑟=1

Definition 2.2.2: Let 𝑉 be a vector space over a field 𝐹 and let 𝐵 = {𝒗𝟏 , 𝒗𝟐 , … , 𝒗𝒏 } be a finite
subset of 𝑉. Then we say 𝐵 is linearly dependent iff 𝐵 is not linearly independent.

1
Dr. Supem Samarasiri, Department of Mathematics, University of Moratuwa
Linear Algebra - MA2034

Theorem 2.2.1: Let 𝑉 be a vector space over a field 𝐹 and let 𝐵 = {𝒗𝟏 , 𝒗𝟐 , … , 𝒗𝒏 } be a finite
subset of 𝑉; with 𝑛 ≥ 2. Then 𝐵 is linearly dependent if and only if at least one element of 𝐵
can be written as a linear combination of the other elements of 𝐵.
Proof: Will be explained in the lecture.

Examples
span{(1,0,0), (0,1,0), (0,0,1)} = span{(2,0,0), (0,2,0), (0,0,2)} = span{(1,0,0), (0,1,0), (0,0,1), (1,1,0)} = ℝ3 .

{(1,0,0), (0,1,0), (0,0,1)} is linearly independent.

{(2,0,0), (0,2,0), (0,0,2)} is linearly independent.

{(1,0,0), (0,1,0), (0,0,1), (1,1,0)} is linearly dependent.

{(1,0,0) , (0,1,0)} is linearly independent but does not span ℝ3 .

{(1,0,0), (0,1,0), (1,2,0), (−1,1,0)} is linearly dependent and does not span ℝ3 .

2
Dr. Supem Samarasiri, Department of Mathematics, University of Moratuwa

You might also like