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.
Definition (vector space)
Let V be a set and K be a field. Then, V is a vector space if there exists two
operations, called + and such that
(i) for all v1, v2 V, v1 + v2 V, and
(ii) for all k K and v V, k v V.
Questions
(i)
Can we define the length of a vector on all infinite dimensional vector
spaces?
(ii)
What does it mean to be an open or a closed set in R n and in infinite
dimensional vector spaces?
(iii)
Which results from Real Analysis can be extended to higher-dimensional
vector spaces and infinite dimensional vector spaces?
(iv)
Which results from Linear Algebra extend automatically to infinite
dimensional vector spaces?
(v)
What are the main applications of infinite dimensional vector spaces in
mathematics and in science?
Definition: Open set
A set E R n is open if for each x E, there exists an open ball Br(x) entirely
contained in E.
Theorem Proposition (Properties)
1 Countable unions of open sets are open.
2 Finite intersections of open sets are open
PROOF
Let E1, E2, E3, , En be a countable family of open sets
Let E:= j=1 Ej . For each Ej, for any x Ej there exists Br(x) Ej.
Choose x E, then x R for some k N, so there exists a ball Brk(x) Ek E.
Therefore, E is open

Counterexample for 2
Consider En =(-1/n, 1/n) n N
n=1 En={0 } Not an open set. You cant find a ball Br(0) {0}
2 Finite number of open sets: E1, E2, ., En not mutually disjoint
E:= j=1 n Ej
Choose x E, so x E1, x E2, , x En
For each j=1, ,n rj>0 such that Brj (x) Ej
Choose r = min from 1<= j <=n rj>0, then x Br(x) Ej for all j=1, ,n
Therefore Br(x) n=1 En=
Definition (Componentwise convergence) A sequence Xn = (xn,1, xn,2, xn,3, . . . ,
xn,k ) R k converges to X = (x1, x2, x3, . . . , xk ) if it converges componentwise.
That is, xn,j xj as n for all j = 1, . . . , k.
Definition (Limit point) Let E R n . A point x is a limit point of E if there exists a
sequence {yn} in E such that yn x as n .
Definition (Closed set) A set E R n is closed if it contains all its limit points.
Proposition (Properties) A set E R n is an open set if and only if E c is a closed set.
Proof
Show that if E is open, then Ec is close.
Let x E, since E is open , r >0 such that Br(x) . Fr any y Br(x), y

Ec therfore there can' t be a sequence of points{zn} from Ec such that Zn -> x.

So x is not a limit point of Ec. No point of E is a limit point of Ec. So Ec contains all of
its limit points therefore Ec is closed
Definition (Compact sets in R n )
A set E Rn is said to be compact if it is closed and bounded
Remark
Note that this definition of compactness is only temporary and will be superseded
by a better definition when we consider infinite dimensional spaces. Its simplicity
makes it convenient when thinking about R n .
Definition
(Pointwise Convergence: Defn 7.1 (Wade)) Let E be a nonempty subset of R. A
sequence of functions fn : E R is said to converge pointwise on E if f(x) = limn
fn(x) for each x E.
Definition
(Uniform Convergence; Defn 7.7 (Wade)) Let E be a nonempty subset of R. A
sequence of functions fn : E R is said to converge uniformly on E to a function f if
for every > 0 there is an N N such that n N implies |fn(x) f(x)| < for all x
E.

Theorem (Thms 7.9 and 7.10 (Wade))

Let E be a nonempty subset of R and suppose that fn f uniformly on E. (i) If each
fn is continuous at some x0 E, then f is continuous at x0 E. (ii) If E = [a, b] and
each fn is integrable on E, then f is integrable on E and limn Z b a fn(x) dx = Z b
a limn fn(x) dx. In fact, limn R x a fn(t) dt = R x a f(t) dt uniformly for x E.
Theorem (Thm 7.12 (Wade)) Let (a, b) be a bounded interval and suppose that fn is
a sequence of functions that converges at some x0 (a, b). If each fn is
differentiable on (a, b) and f n converges uniformly on (a, b) as n , then fn
converges uniformly on (a, b) and limn f n (x) = limn fn(x) for each x (a,
b).