Scribd
Upload
67 views3 pages

Summary of Lectures 02 Vector Spaces

This document provides a summary of lectures on linear algebra and vector spaces. It defines key concepts such as vector spaces, fields, subspaces, linear dependence and independence, bases, and dimension. Theorems and properties relating to these concepts are also outlined.

Uploaded by

ilyesinfo6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views3 pages

Summary of Lectures 02 Vector Spaces

This document provides a summary of lectures on linear algebra and vector spaces. It defines key concepts such as vector spaces, fields, subspaces, linear dependence and independence, bases, and dimension. Theorems and properties relating to these concepts are also outlined.

Uploaded by

ilyesinfo6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Linear Algebra I

Summary of Lectures: Vector Spaces


Dr Nicholas Sedlmayr

1. Definition 2.1: A vector space. A vector space V over a field F (see


definition 2.3) is a set containing:
• a special zero vector 0;
• an operation of addition of two vectors u + v ∈ V , for u, v ∈ V ; and
• multiplication of a vector V with a number λ ∈ F with λv ∈ V .
The vector space must be closed under both of these operations and must
satisfy the following laws ∀u, v, w ∈ V and λ, µ ∈ F :
(1) associativity (u + v) + w = u + (v + w);
(2) commutativity u + v = v + u;
(3) u + 0 = u;
(4) v + (−1)v = 0;
(5) λ(µu) = (λµ)v;
(6) distributivity λ(u + v) = λu + µv; and
(7) distributivity (λ + µ)u = λu + µu.
2. Proposition 2.2 ∀v ∈ V and ∀λ ∈ F :
(a) v = 1v;
(b) 0v = 0; and
(c) λ0 = 0.
3. Definition 2.3 A field is a set F containing distinct elements 0 and 1 with
two binary operations + and · satisfying the axioms ∀a, b, c ∈ F :
(1) a + b = b + a;
(2) (a + b) + c = a + (b + c);
(3) a + 0 = a;
(4) ∀a ∃ − a such that a + (−a) = 0;
(5) a · b = b · a;
(6) (a · b) · c = a · (b · c);
(7) a · 1 = a;
(8) ∀a 6= 0 ∃a−1 such that a · a−1 = 1; and
(9) a · (b + c) = a · b + a · c;

1
If a field F is finite its order is the number of elements in F .
4. Note that as a field also satisfies all axioms of a vector space a field F is
also itself a vector space V = F over the field F and all properties of a
vector space apply.
5. Theorem 2.4: For each prime p and each positive integer n, there is a
unique field of order pn . Additionally, every finite field is of this form.
6. Definition 2.5 Given a vector space V over F , a subspace of V is a subset
W ⊂ V which contains the zero vector of V and is closed under the
operations of addition and scalar multiplication.
7. Lemma 2.5.1 Let W ⊂ V be nonempty, where V is a vector space over F .
Then W is a subspace of V iff v + λu ∈ W for each v, u ∈ W and each
scalar λ.
8. Definition 2.6 Given a vector space V over F , and given a subset of V
A = {u1 , u2 , u3 , . . . un },

W = {λ1 u1 + λ2 u2 + λ3 u3 + . . . λn un : λ1 , λ2 , . . . λn ∈ F }

is the subspace of V spanned by A. The elements of W are called linear


combinations of vectors from A and the subspace W is denoted as span A.
9. Definition 2.7 If A is an infinite subset of V , where V is a vector space
over F , we define span A to be the set of all linear combinations of finite
subsets of A.
10. Definition 2.8 A set A ⊂ V of vectors in a vector space V over F is linearly
dependent if there are n ∈ N vectors a1 , a2 , . . . an and scalars λ1 , λ2 , . . . λn
not all zero such that

λ1 a1 + λ2 a2 + . . . λn an = 0 .

Otherwise A is linearly independent.


• For a finite set A = {a1 , a2 , . . . an } it is linearly independent iff ∀
scalars λ1 , λ2 , . . . λn ∈ F

λ1 a1 + λ2 a2 + . . . λn an = 0 ⇒ λ1 = λ2 = . . . λn = 0.

• If A is infinite it is linearly independent iff every subset of A is linearly


independent.
• By convention the empty set is linearly independent.
11. Proposition 2.9 Suppose A = {a1 , a2 , . . . an } ⊂ V is linearly independent,
where V is a vector space over F . Suppose also that v ∈ V and there are
scalars λ1 , . . . λn and µ1 , . . . µn such that

v = λ1 a1 + λ2 a2 + . . . λn an

and
v = µ1 a1 + µ2 a2 + . . . µn an
then λ1 = µ1 , λ2 = µ2 ,ldots λn = µn .

2
12. Definition 2.10 A basis of a vector space V is a linearly independent set
B ⊂ V which spans V .

13. Theorem 2.11 Let V be a vector space over F , and let B ⊂ V be linearly
independent. Then there is a basis B 0 of V with B ⊂ B 0 .
14. Theorem 2.12 Suppose span A = V and B ⊂ V is linearly independent.
Then there is a basis B 0 of V with B ⊂ B 0 ⊂ A ∪ B.
15. Lemma 2.13 The “exchange lemma”. Suppose a1 , a2 , . . . an , b are vectors
in a vector space V , and suppose that

b ∈ span(a1 , a2 , . . . an−1 , an )

but
b∈
/ span(a1 , a2 , . . . an−1 ) ,
then
an ∈ span(a1 , . . . , an−1 , b) .
If in addition {a1 , a2 , . . . an } is linearly independent then so is {a1 , a2 , . . . an−1 , b}.
16. Theorem 2.14 Suppose S and B are both bases of a vector space V over
F and. Then A and B have the same number of elements.

17. Definition 2.15 The number of elements of a basis of a vector space V over
F is called the dimension of V and is written as dim V .
18. Corollary 2.16 If V is a vector space over F and U ⊂ V is a subspace of
V then dim U ≤ dim V . If, additionally, dim V is finite and U 6= V then
dim U < dim V .
19. Corollary 2.17 Suppose that V is a vector space over F , dim V is finite,
and U ⊂ V is a subspace of V with dim U = dim V , then U = V .
20. The coordinates of a vector v ∈ V , with V a vector space over F , with
respect to an ordered basis B = {v1 , v2 , . . . vn } are (λ1 , λ2 , . . . , vn )T where

v = λ1 v1 + λ2 v2 + . . . λn vn .

You might also like