A **sum **is the result of an addition. The notion of series is related to the sum of numbers.

For example, adding 1, 2, 3, and 4 gives the sum 10: 1+2+3+4=10. The decad represents the number ten.

*“Ten is the very nature of number. All Greeks and all barbarians alike count up to ten, and having reached ten revert again to the unity. And again, Pythagoras maintains, the power of the number 10 lies in the number 4, the tetrad. This is the reason: If one starts at the unit (1) and adds the successive number up to 4, one will make up the number 10 (1 + 2 + 3 + 4 = 10). And if one exceeds the tetrad, one will exceed 10 too…. So that the number by the unit resides in the number 10, but potentially in the number 4.*” (Aetius 1.3.8)

The **Tetractys** (greek Τετρακτύς) is a symbol composed of ten dots in an upward-pointing triangular formation.

The numbers being summed are called *addends*.

Given a set A, a sequence of elements of A is a function F: N -> A; rather than using notation F(n) for the elements that have been selected from A, since the domain is always the natural numbers (N), we use the notation and denote the sequence:

or

Given any sequence of elements of a set A, we have an associated sequence of nth partial sums:

where with k=1…n

the symbol is called **series **(or infinite series).

We take A to be the set of real functions on R.

**Pointwise convergence of sequence of functions.**

Definition: let be a sequence of functions defined on a set of real numbers A. We say that converges pointwise to a function f on A for each , the sequence of real numbers converges to the number f(x). In other words, for each , we have:

**Example:** let and let f(x)= 0 if , f(x)=1 if x=1.

Then converges to f pointwise on [0,1]

Suppose converges to f pointwise on A. Then given , and given , there exists such that:

for all n>=N

In general N depends on a.w.a x.

**Example: **.

We have for all and hence for a given , any N with will imply that for all n>N and for

**Uniform convergence of sequence of functions**

Let be a sequence of function on A. We say that converges uniformly to f on A if for given , there exists , depending on , such that:

for all n>=N and for all

If converges uniformly to f on A, we write: uniformly on A.

Remark: N depends only on and not on x.

**Example**: converges uniformly to 0 on

If uniformly on A and , then there exists N>0 and all x , . This implies that for all n>N:

and hence .

Since is an arbitrary positive number, we conclude that:

if uniformly on A, then .

*The converse is also true.*

**Theorem: **

if uniformly on A, if and only if .

**Cauchy Criterion for Uniform Convergence. **A sequence converges uniformly on A if and only if for a given , there exists N>0 such that for all and for all ,

$latex| f_n(x)-f_m(x)|< \epsilon $

**Theorem: **If is a sequence of continuos functions on a bounded and closed interval $ latex [a,b] and converges pointwise to a continuous function f on [a,b], then uniformly on [a,b]

**Consequences of uniform convergence**

**Theorem:** if uniformly on [a,b], if are continuous at c [a,b] , then f is continuous at c.

**Corollary: **if uniformly on [a,b],if are continuous on [a,b], then f is continuous on [a,b].