In this journal, you will be asked to enter summaries of the material for this semester.

The summary should include at least the following

(i) A list of all the definitions in the text, whether they are explicit (Definition X.Y) or as
part of the text.
(ii) A list of all the results (lemma, propositions, theorems, etc)
For better understanding, link the definitions and results.
Lecture 3
Definition (Vector space)
A set V is said to be a vector space over a field K if V is an Abelian group under
addition + and there is an operation such that the following conditions hold for
all a, b K and all u, v V.
1 av := a v V
2 a(v + u) = av + au
3 (a + b)v = av + bv
4 a(bv) = (ab)v
5 1v = v.
Definition (Vector subspace)
A subspace of a vector space V is a subset of V which is itself a vector space with
the operations of addition and scalar multiplication defined as in V.
Lemma (Lemma 4.8)
A subset W of a vector space V is a subspace if ax + by W for all x,y W and all
scalars a,b.
Definition (Proper subspace)
A proper subspace of a space V is a subspace other than V. A nontrivial subspace is
a subspace containing non-zero elements. The trivial subspace is the subspace {0}.
Proposition (Prop. 4.11)
The intersection of any two subspaces of a vector space is a subspace.
Definition (Linearly dependent set)
A set of vectors {x1, . . . , xn} is called linearly dependent if there is a set of scalars
c1, . . . , cn, not all zero, such that c1x1 + c2x2 + + cnxn = 0. A linearly
independent set is one that is not linearly dependent.
Definition (Linear combination)
A linear combination of a finite set of vectors x1, . . . , xn is a vector of the form
a1x1 + + anxn where the ai are scalars.

Definition (Subspace spanned by X)

Let X be any set of vectors in a vector space V. The set of all linear combinations of
elements of X is called a subspace spanned by X or generated by X.
Definition (Finite basis)
A set {x1, . . . , xn} is called a finite basis for a vector space V if it is linearly
independent and it spans V. We then say that V is an n-dimensional vector space.
Otherwise, V is infinite-dimensional.
Definition (Norm)
A norm on a vector space V is a rule which, given any x V, specifies a real
number kxk, called the norm of x, such that
1 ||x|| > 0 if x 6= 0 and ||0| = 0
2 ||ax|| = |a| ||x|| for any x V and any scalar a
3 Triangle Inequality: ||x + y|| ||x||+ ||y|| for any x, y V
Lecture 4
Definition (Convergence wrt || ||)
Let x and x1, x2, . . . , xn, . . . be elements of a normed vector space X with norm ||
||. We say xn converges to x (xn x as n ) if for every > 0, there exists N
N such that if n N then ||xn x|| < .
Theorem
Let xn = (x1,n, x2,n, . . . , xk,n) be a sequence in R k and x = (x1, x2, . . . , xk ) R
k . Then xn x as n with respect to k k2 iff xj,n xj as n in (R, | |) for j =
1, 2, . . . , k
Proposition
Let xn and yn be two sequences in the normed space X such that xn x X and yn
y X as n . Then
1 xn + yn x + y as n .
2 If xnk is a subsequence of xn, then xnk x.
3 If a R, then axn ax as n .
Theorem
Let fn be a sequence in C[a, b] and f C[a, b]. Then fn f as n in the k k
norm iff fn f uniformly.
Definition (Convergence of series)
Let x and x1, x2, . . . be elements of the normed vector space X. We say the series

xi

xi = x1 + x2 + x3 + converges to x if the sequence sn of partial sums,

i=1

sn =

xi

xi , converges to x.

i=1

Definition (Convergence in the mean - 4.37)

If F, f1, f2, . . . are functions from R R, we say fn F in the mean on [a, b] as n
if

fn ( x)F( x ) dx
b

0 as n .

Theorem
Consider a sequence fn C[a, b] such that fn f as n with the sup-norm (i.e. f
C[a, b]). Then, fn f as n with the || ||2 norm