Honors Linear Algebra 354
Ahmed Saad Sabit
09 januari 2024 - 9 januari 2024
1 Office Hours
Tuesday, 12:30 - 2:30. Wednesday 9:30 - 12:30 and 2:30 - 3:30.
2 Vector Spaces
3 1.1 Rn and Cn .
We can have a field F which can be either R or C.
Let’s talk a bout a List. A list can be,
(f1 , f2 , . . . fn )
These are ordered elements and the length of the list is n. But, it’s no more a
list if there are infinite elements.
Fn is the set of all lists of length n positive integer with elements of F.
(x1 , x2 , x3 , . . . xn )
R2 can be drawn like in the cartesian plane, but it’s difficult to draw C2 . It is
an ordered pair of complex numbers. These are vector spaces.
(x1 , . . . xn ) + (y1 , . . . yn ) = (x1 + y1 , . . . , xn + yn )
We can multiply scalar times vectors, note that a is any number. It can be real
or complex.
a∈F
For vectors v, u
a (v + u) = av + au
(a + b) v = av + bv
We define origin,
O = (0, 0, 0, 0, . . . , 0)
We have a zero vector such that,
⃗v = ⃗v + ⃗0
1
4 Definition of Vector Space
Definition: There are objects called V vectors. There are scalars F. Then we
have operations which have the properties of either Rn or Cn made with no
notation other than V .
We need addition, ⃗v + w. ⃗ It’s still vector. It’s commutative ⃗v + w ⃗ + ⃗v , its
⃗ =w
associative, ⃗v + (w ⃗ + ⃗z.
⃗ + ⃗z) = (⃗v + w)
for all 0 we have ⃗v + 0 = v. The scalar multiples, a ∈ F and ⃗v ∈ V ,
a⃗v ∈ V
We can have
0v = 0
Proof:
(0 + 0) v = 0v + 0v = 0v
From here, subtracting one of the 0v from one side,
0 = 0v
A vector space with scalars R is called a real vector space. A vector space with
scalars C is a complex vector space.
On P -16, in Sheldon Axler, V denotes (upper case V) always denotes a vector
space over F. And scalars can be complex or real, it’s not always just simple
1, 2, 3, . . . n
5 Subspaces
Can a vector space be consist of just one element? Yes, element zero {0} all by
itself.
But can it be empty? Because it doesn’t have the inverses. It just says it must
have at least the origin. Definition: If V is a vector space. A subset U of V is
said to be a subspace of V if it satisfies all the axioms of a vector space. Using
structure of V itself.
v⃗0 is a vector and the line that connects it can be a subspace. Any single line
that goes through the origin in a R2 space is a subspace. Food for thought, can
we prove or disapprove that for a space Rn , Rn−1 is a subspace.
2
V
v⃗0
Figuur 1: Vector space and subspace diagram, here Red is not a subspace
because it doesn’t have the origin.
6 Chapter 2: Finite Dimensional Vector Spaces
There is a name of this book. It was the textbook of the professor.
Let’s review our standing assumptions,
• F, V, here there is a field and V is a vector space over it.
•
Learning objectives are,
• Span
• Linear Dependence
• Bases
• Dimension
2A span and linear independence.
Definition: A linear combination of a list v⃗1 , . . . , v⃗n of vectors is any vector of
the form,
av⃗1 + . . . + an⃗vn
Here ai is a scalar such that a ∈ F. The set of all linear combination of the list
⃗v1 , . . . , ⃗vn is a subspace of V .
This subset is a subspace of V , and called a span.
If span {v⃗1 , . . . ⃗vn } = V , then we can say that ⃗v1 , . . . ⃗vn span V .
For R3 , span{(1, 0, 0), (0, 1, 0)} is the x − y plane. Until z ̸= 0, we will have
x, y plane to be the span for anything, because no matter how you make the
linear combination, you cannot have any vector that points towards z to make
a z span.
Definion: Linear Independence : Linear independent if a1⃗v1 +a2⃗v2 +. . .+an⃗vn =
0, can only and only be possible if you can use a1 = a2 = a3 = . . . = an = 0.
3
A list of one vector is linearly independent if and only if that vector is not 0.
A list of two vectors is linearly independent if and only if neither are the scalar
multiple of the other.
a1⃗v1 + a2⃗v2 = 0