Introduction

MATH 211 Linear Algebra

MATH 211 Linear Algebra Introduction 1 / 16

About Me

Name: Diane Christine Pelejo, Ph.D.

Email: dcpelejo@math.upd.edu.ph
Office: MBAn 202
Office Hours this sem:
TTh 9-10am, 1-5pm (or email for appointment),

Credentials:
(Jun 2005-Mar 2009) BS Math, UP Diliman
(Jun 2009-present) Instructor/Asst. Professor, UP Diliman
(Jun 2009- Dec 2011) MS Math, UP Diliman
(Jan 2013- Dec 2016) PhD Applied Science, College of William and Mary
(Aug 2014 - May 2016) Teaching Fellow, College of William and Mary

Research Interests: Matrix Analysis, Linear and Multilinear Algebra, Quantum

Information Theory

MATH 211 Linear Algebra Introduction 2 / 16

About the Class

Class Schedule: WF 10:00-11:30am

Classroom: MB 121

Course Prerequisites: Math 110.2 or Math 114 or COI

Course Requirements: problem sets, 3 long exams, 1 final exam

Course Topics: Vector spaces, Linear Transformations, Cayley-Hamilton theorem,

Jordan Canonical form, Rational Canonical form, Bilinear forms, Inner Products,
Spectral Theorem; (Optional) Modules over principal ideal domains, Law of
Inertia, Multilinear Forms, Tensor Products

References:
Linear Algebra and Matrix Theory by E. Nering;
Matrix Analysis by R. Horn & C. Johnson;
Linear Algebra Done Wrong by S. Treil;
Algebra by T. Hungerford;
The Linear Algebra a Beginning Graduate Student Ought to Know by J. Golan

MATH 211 Linear Algebra Introduction 3 / 16

 REVIEW: Set Notations

S = {a, b, c, d, e} “S is the set containing the distinct elements a, b, c, d, e.”

T = {x : p(x)} “T is the set of distinct objects x for which p(x) is true.”

Indexed/Ordered Sets
S = {a1 , a2 , a3 , a4 , a5 } OR S = {a1 , a2 , a3 , . . .} OR S = {xi : p(xi )}

Common Sets
∅ (empty set) N (natural nos.) Z (integers natural nos.),
Q (rational nos.) R (real nos.) C (complex nos.)

MATH 211 Linear Algebra Introduction 4 / 16

 REVIEW: Set Notations

Other Notations Set Operations

a∈S “a is an element of S” Sc complement of S

f ∈
/S “f is not in S” S ∪T union of S and T
T ⊆S “T is a subset of S” ˙
S ∪T disjoint union of S and T
T 6⊆ S “T is not a subset of S” S ∩T intersection of S and T
T (S “T is a proper subset of S” S ×T Cartesian product of S and T
|S| “cardinality of S” S \T set difference
k
S S × S × ··· × S
| {z }
k times

Suppose a + b is defined for all a ∈ S and b ∈ T :

Minkowski Sum: S + T = {a + b | a ∈ S, b ∈ T }
Translation of T by a: a + T = {a + b | b ∈ T }

MATH 211 Linear Algebra Introduction 5 / 16

 REVIEW: Functions
f : A −→ B f is a function from the set A to the set B
x 7→ f (x) f maps the element x ∈ A to f (x) ∈ B
domain of f A
codomain of f B

f (x) the image of x under f

f (C) = {f (x) : x ∈ C} image of C ⊆ A under f
f (A) = {f (x) : x ∈ A} range of f
−1
f (D) = {x ∈ A : f (x) ∈ D} inverse image of a set of D ⊆ B

f is onto f (A) = B
f is one-to-one f (u) = f (v ) iff u = v

MATH 211 Linear Algebra Introduction 6 / 16

 REVIEW: Group (G , ∗)

(nonempty set) G
(binary operation) ∗ : G × G −→ G (G is closed under ∗)

1. (∗ is associative on G ) ∀a, b, c ∈ G , (a ∗ b) ∗ c = a ∗ (b ∗ c)
2. (G has an identity elt. under ∗) ∃e ∈ G , ∀a ∈ G , a∗e =e ∗a=a
3. (Each element has an inverse) ∀a ∈ G , ∃b ∈ G a∗b =b∗a=e
4. (∗ is commutative) ∀a, b ∈ G , a∗b =b∗a
Note:
with 1, G is a semigroup
with 1,2, G is a monoid
with 1,2,3 G is a group
with 1,2,3,4 G is an abelian group
identity element, if it exists, is unique
inverse of an element is unique, if it exists, and is denoted a−1 and −a

MATH 211 Linear Algebra Introduction 7 / 16

 REVIEW: Group (G , ∗)

Examples:
1 (C, +)
2 (R, +)
3 (Z, +)
4 (Zn , +n )
1 R[t] set of all polynomials in t with real coefficients,
+ - usual polynomial addition
2 set of functions on f : R −→ R under composition ◦ is a monoid
3 Sn = set of all permutations (bijections) of n letters, under composition is a
non-abelian group

MATH 211 Linear Algebra Introduction 8 / 16

 REVIEW: Rings and Fields (R, +, ·)

(nonempty set) R
(binary operations) + : R × R −→ R and · : R × R −→ R

R is said to be a ring under + and · if the following hold:

1. R is an abelian group under +

2. R is a semigroup under ·

3. (left/right) · is distributive over +

a · (b + c) = (a · b) + (a · c) and (b + c) · a = (b · a) + (c · a) ∀ a, b, c ∈ R

If identity element for · exists (1R ), R is a ring with unity.

If 1R exists and R has no zero divisors, then R is an integral domain.
If R \ {0R } is a group under ·, then R is a division ring.
If R \ {0R } is an abelian group under ·, then R is a field.
MATH 211 Linear Algebra Introduction 9 / 16
 REVIEW: Rings and Fields

Examples:
1 Z is an integral domain.
2 hQ, +, ·i, hR, +, ·i, hC, +, ·iare fields.
3 hZp , +p , ·p i, where p is prime, is a field.
4 hZ4 , +4 , ·4 i, is a ring with unity
5 R[t] is an integral domain.

MATH 211 Linear Algebra Introduction 10 / 16

 REVIEW: morphisms

Groups: (G , ∗), (H, ◦)

Group Homomorphism:
φ : G −→ H such that φ(a ∗ b) = φ(a) ◦ φ(b) for all a, b ∈ G

Rings/Fields: (E , +, ·), (F ,
, )
Ring/Field Homomorphism:
φ : E −→ F such that φ(a + b) = φ(a)
φ(b) for all a, b ∈ G
and φ(a · b) = φ(a) φ(b) for all a, b ∈ G

MATH 211 Linear Algebra Introduction 11 / 16

 REVIEW: R2 vectors

Representation
  
2 2 a
R = {(a, b) : a, b ∈ R} OR R = : a, b ∈ R (will be our default)
b
Equality
   
a c
Let u = ,v= . We say u = v exactly when a = c and b = d.
b d

Addition: Visualization
     
a c a+c
+ =
b d b+d v
b

Scaling:
   
a ka a
k =
b kb

MATH 211 Linear Algebra Introduction 12 / 16

 REVIEW: R2 vectors

Representation
  
a
R2 = {(a, b) : a, b ∈ R} OR R2 = : a, b ∈ R (will be our default)
b
Equality
   
a c
Let u = ,v= . We say u = v exactly when a = c and b = d.
b d

Addition: Visualization
     
a c a+c v
+ =
b d b+d u+v

Scaling:
   
a ka
k = u
b kb

MATH 211 Linear Algebra Introduction 13 / 16

 REVIEW: R2 vectors

Representation
  
a
R2 = {(a, b) : a, b ∈ R} OR R2 = : a, b ∈ R (will be our default)
b
Equality
   
a c
Let u = ,v= . We say u = v exactly when a = c and b = d.
b d

Addition: Visualization
     
a c a+c
+ =
b d b+d
2v
Scaling:
v
   
a ka
k =
b kb
−v

MATH 211 Linear Algebra Introduction 14 / 16

 REVIEW: Solving Systems of Linear Equations Ax = b

Examples:

 x1 − 5x2 + 4x3 = −3 3

1 2x1 − 7x2 + 3x3 = −2 
 2x1 − 4x4 = −10
−2x1 + x2 + 7x3 = −1 3x2 + 3x3 = 0
 

x − 2y = 4 + z 
 x3 + 4x4 = −1
2
−3x1 + x2 + 3x3 + x4 = 5

−2x + 4y = 5z + 6

Write the augmented matrix of the system, that is [A|b]

Apply elementary row operations to [A|b] to get row reduced form [C |d]
If the last column of [C |d] has a pivot, then the system is inconsistent.
Otherwise, it is consistent.
If the system is consistent, then the solution set of the system can be
expressed parametrically.
1 If all columns of the C has a pivot, then solution is unique.
2 The number of free parameters in the solution set is equal to the number of
columns of C that has no pivot.

MATH 211 Linear Algebra Introduction 15 / 16

 REVIEW: Basic Proof Structures

How do you prove or disprove statements of the following type:

If p, then q.
p if and only if q.
p(x) is true for any x ∈ A.
p(x) is true for some x ∈ A.
For any x ∈ A, there exists y ∈ B such that p(x, y ) is true.
There exists x ∈ A, such that for any y ∈ B the statement p(x, y ) holds.
A ⊆ B.
A = B.

MATH 211 Linear Algebra Introduction 16 / 16