Affiliation: Lecturers of Mathematics at Addis Ababa University, Ethiopia.
Previous Work: University Mathematics I.
Publication Date: January, 2017.
Content Summary: The material contains two main parts: * Part I: Infinite Series: Chapters 1–3 covering Sequences and Series, Power Series, and Fourier Series. * Part II: Calculus of Functions of Several Variables: Chapters 4–7 covering Preliminaries, Limits and Continuity, Partial Derivatives and Applications, and Multiple Integrals.
Chapter 1: Sequences and Series
1.1 Definition of a Sequence
General Definition: A sequence is an ordered collection of objects or events with an identified first, second, and third member.
Mathematical Definition (1.1.1): A sequence is a function from the set of integers greater than or equal to some integer m0 (usually 0 or 1) into a nonempty set X.
Real Sequence: If the range is a subset of real numbers (R), it is a sequence of real numbers. This chapter focuses exclusively on real sequences.
Notation: * General term: an in place of a(n). * Terms: a1,a2,a3,…,an,… * Ordered pairs representation: (1,a1),(2,a2),…,(n,an),…. * Shorthand: an or ann=1∞.
Description Methods: 1. Listing: Writing the first few terms (e.g., 2,4,6,8,… where an=2n). 2. Defining Formula: Giving a specific rule for an. For an=n−12n, the smallest value is n=2. 3. Recursive Definition: Defining a term using preceding terms (recurrence). * Positive odd numbers: a1=1 and an+1=an+2,∀n≥1. * Fibonacci Sequence: 1,1,2,3,5,8,13,21,34,… s.t. a1=a2=1 and an+2=an+1+an,∀n≥2. 4. Verbally: For cases with no obvious pattern, like the sequence of prime numbers.
Special Types: * Stationary Sequence: an=an+1 for all natural numbers n. * Equality: an=bn if an=bn,∀n.
Graph of a Sequence: Consists of isolated points on a coordinate plane with coordinates (n0,an0),(n1,an1),….
1.2 Convergence and Divergence of Sequences
Formal Definition (1.2.1): A sequence an has the limit L if for every ε>0, there exists a positive integer N (dependent on ε) such that for every n>N, ∣an−L∣<ε. * Notation: limn→∞an=L or an→L as n→∞. * A sequence is convergent if the limit exists; otherwise, it is divergent.
Geometric Representation: The points (n,an) must lie between the horizontal lines y=L+ε and y=L−ε for all n>N.
Theorem 1.2.1: If f(n)=an for a real-valued function f, then limx→∞f(x)=L⟹limn→∞an=L. * Caution: The converse is not always true. Example: cos(2πn)→1, but limx→∞cos(2πx) does not exist.
Types of Divergent Sequences: * Diverge to ∞: ∀M>0,∃N s.t. n>N⟹an>M. * Diverge to −∞: ∀m>0,∃N s.t. n>N⟹an<m. * Oscillating: Sequences that diverge but not to ±∞.
Null Sequence: A sequence that converges to zero.
Geometric Sequences: The sequence crn converges if −1<r≤1. * Limit is 0 if −1<r<1. * Limit is c if r=1.
Chapter 2: Power Series
Definition (2.0.1): A power series in (x−a) is a series of the form: ∑n=0∞cn(x−a)n=c0+c1(x−a)+c2(x−a)2+c3(x−a)3+… where x is a variable, cn are constants (coefficients), and a is the center.
Radius and Interval of Convergence: * Theorem 2.1.1: Exactly one of the following is true: 1. Converges only at x=a (R=0). 2. Absolutely convergent for all x (R=∞). 3. ∃R>0 such that series converges if ∣x−a∣<R and diverges if ∣x−a∣>R. * Abel’s Theorem (2.2.3): Relates the function limit to the series sum at endpoints of the interval of convergence.
Differentiation and Integration (2.1.4): A power series P(x) with R>0 is differentiable and integrable on (a−R,a+R) term by term. The radius R remains unchanged.
Uniqueness Theorem (2.2.1): If f(x) is represented by a power series, the coefficients are cn=n!f(n)(a).
Taylor Series: The power series representation f(x)=∑n=0∞n!f(n)(a)(x−a)n. * Maclaurin Series: A Taylor series centered at a=0.
Common Series Representations: * ex=∑n=0∞n!xn for all x. * sin(x)=∑n=0∞(−1)n(2n+1)!x2n+1. * cos(x)=∑n=0∞(−1)n(2n)!x2n. * 1−x1=∑n=0∞xn for ∣x∣<1. * ln(1+x)=∑n=1∞(−1)n−1nxn for −1<x≤1.
Binomial Series (2.4.1): For any real m, (1+x)m=∑n=0∞(nm)xn where (nm)=n!m(m−1)…(m−n+1). Converges for ∣x∣<1.
Chapter 3: Fourier Series
Periodic Functions: f(x+P)=f(x). The smallest P is the fundamental period.
Inner Product (3.1.4): (f,g)=∫abf(x)g(x)dx. Two functions are orthogonal if their inner product is zero.
Fourier Series (3.2.1): For a 2π-periodic function f, the series is: f(x)∼2a0+∑n=1∞(ancos(nx)+bnsin(nx)) * Euler Formulas: * a0=π1∫aa+2πf(x)dx * an=π1∫aa+2πf(x)cos(nx)dx * bn=π1∫aa+2πf(x)sin(nx)dx
Arbitrary Period 2l: f(x)∼2a0+∑n=1∞(ancoslnπx+bnsinlnπx)
Special Cases: * Even Functions: Only cosine terms exist (bn=0). an=l2∫0lf(x)coslnπxdx. * Odd Functions: Only sine terms exist (an=0). bn=l2∫0lf(x)sinlnπxdx.
Dirichlet Convergence Theorem (3.3.1): If f and f′ are piecewise continuous and f is periodic, the series converges to f(x) at continuity points and to the average of limits 2f(c+)+f(c−) at discontinuities.
Chapter 5: Limits and Continuity in Multiple Variables
Definition 5.1.1: A function of two variables assigns a unique number f(x,y) to each pair (x,y) in domain D.
Limit Definition (5.3.2): lim(x,y)→(a,b)f(x,y)=L if ∀ε>0,∃δ>0 s.t. 0<(x−a)2+(y−b)2<δ⟹∣f(x,y)−L∣<ε.
Path Dependency: If f(x,y) approaches different values along different paths to (a,b), the limit does not exist.
Continuity (5.4.2): f is continuous at (a,b) if lim(x,y)→(a,b)f(x,y)=f(a,b).
Squeeze Theorem (5.3.1): If f≤g≤h and limf=limh=L, then limg=L.
Chapter 6: Partial Derivatives and Applications
Definition 6.1.1: * With respect to x: fx(x,y)=limh→0hf(x+h,y)−f(x,y). * With respect to y: fy(x,y)=limh→0hf(x,y+h)−f(x,y).
Clairaut's Theorem (6.2.1): If fxy and fyx are continuous, then fxy=fyx.
Chain Rule: * One independent variable: dtdz=∂x∂zdtdx+∂y∂zdtdy.
Implicit Differentiation (6.5.1): If f(x,y,z)=0, then ∂x∂z=−fzfx and ∂y∂z=−fzfy.
Directional Derivative (6.6.1): In direction of unit vector u=(a,b), Duf=fxa+fyb=∇f⋅u.
Gradient Vector: ∇f=(fx,fy). * f increases most rapidly in the direction of ∇f. * Maximum rate of change is ∣∣∇f∣∣.
Tangent Plane (6.7.1): For z=f(x,y), the equation is z−z0=fx(x0,y0)(x−x0)+fy(x0,y0)(y−y0).
Optimization: * Second Partials Test: D=fxxfyy−(fxy)2. * D>0 and fxx>0: Relative minimum. * D>0 and fxx<0: Relative maximum. * D<0: Saddle point. * D=0: Inconclusive. * Lagrange Multipliers: To maximize/minimize f subject to g=k, solve ∇f=λ∇g.
Chapter 7: Multiple Integrals
Fubini’s Theorem (7.1.1): Allows evaluation of double integrals as iterated integrals over rectangles: ∬Rf(x,y)dA=∫ab∫cdf(x,y)dydx=∫cd∫abf(x,y)dxdy.