Applied Mathematics IB Course Notes

PART I: INTRODUCTION TO LINEAR ALGEBRA

Chapter 1: Vectors and Vector Spaces

Introduction

  • Measurement Magnitudes vs. Vectors:
    • Quantities like mass, length, or time are determined solely by their magnitudes and require only a number and a unit of measure.
    • Quantities like force, displacement, or velocity require more information: they need direction in addition to magnitude.
    • Force: Requires magnitude and the direction in which it acts.
    • Displacement: Requires magnitude (how far) and direction (where it moves).
    • Velocity: Requires magnitude (speed) and direction (where the body is headed).
  • Definition of Vectors:
    • Quantities possessing both magnitude and direction are represented by arrows called directed line segments or vectors.
    • The length of the arrow represents the magnitude of the action in terms of a chosen unit.
    • This chapter focuses on nn-vectors or nn-dimensional vectors in Rn\mathbb{R}^n.
  • Scope of Study:
    • Vectors provide geometric motivation for Linear Algebra.
    • Algebraic and geometric properties of points in Rn\mathbb{R}^n are discussed.
    • Scalar products (dot products) and vector products (cross products) are included.
    • Points in R2\mathbb{R}^2 and R3\mathbb{R}^3 are treated as special cases of Rn\mathbb{R}^n.
    • The cross product is unique to 3-dimensional space (invalid in 2D, 4D, or other nn dimensions).

1.1 Definition of Points in n-space

  • Practical Context: Vectors arise in the simultaneous study of multiple characteristics. For example, height (a1a_1), weight (a2a_2), age (a3a_3), and blood pressure (a4a_4) can be represented as an ordered 4-tuple A=(a1,a2,a3,a4)∈R4A = (a_1, a_2, a_3, a_4) \in \mathbb{R}^4.
  • Definition 1.1.1 (Operations): Let A=(a1,a2,…,an)A = (a_1, a_2, \dots, a_n) and B=(b1,b2,…,bn)B = (b_1, b_2, \dots, b_n) be points in nn-space, and c∈Rc \in \mathbb{R}.
    • Addition: A+B=(a1+b1,a2+b2,…,an+bn)A + B = (a_1 + b_1, a_2 + b_2, \dots, a_n + b_n).
    • Scalar Multiplication: cA=(ca1,ca2,…,can)cA = (ca_1, ca_2, \dots, can).
  • Example 1.1.1:
    • Let A=(−1,3,6,2)A = (-1, 3, 6, 2), B=(0,−5,−1,4)B = (0, -5, -1, 4), C=(2,−1,3)C = (2, -1, 3).
    • A+B=(−1+0,3−5,6−1,2+4)=(−1,−2,5,6)A + B = (-1+0, 3-5, 6-1, 2+4) = (-1, -2, 5, 6).
    • A+CA + C is not defined because AA is in 4D space and CC is in 3D space.
    • −2A=(−2(−1),−2(3),−2(6),−2(2))=(2,−6,−12,−4)-2A = (-2(-1), -2(3), -2(6), -2(2)) = (2, -6, -12, -4).
  • Definition 1.1.2 (Subtraction): A−B=A+(−B)A - B = A + (-B).
  • Theorem 1.1.1 (Properties): For points A,B,C∈RnA, B, C \in \mathbb{R}^n and α,β∈R\alpha, \beta \in \mathbb{R}:
    1. A+B=B+AA + B = B + A (Commutativity).
    2. A+(B+C)=(A+B)+CA + (B + C) = (A + B) + C (Associativity).
    3. α(A+B)=αA+αB\alpha(A + B) = \alpha A + \alpha B.
    4. (α+β)A=αA+βA(\alpha + \beta)A = \alpha A + \beta A.
    5. α(βA)=(αβ)A\alpha(\beta A) = (\alpha\beta)A.
    6. A+0=0+A=AA + 0 = 0 + A = A.
    7. 1⋅A=A1 \cdot A = A and −1⋅A=−A-1 \cdot A = -A.
    8. A+(−A)=0A + (-A) = 0.

1.2 Vectors in n-space: Geometric Interpretation

  • Vector Determination: A vector AB⃗\vec{AB} is determined by an initial point AA and a terminal point BB.
  • Relation between Points: If A=(a1,a2)A = (a_1, a_2) and B=(b1,b2)B = (b_1, b_2), then B=A+(B−A)B = A + (B - A).
  • Definition 1.2.2 (Equivalence): AB⃗≅CD⃗\vec{AB} \cong \vec{CD} if and only if B−A=D−CB - A = D - C.
    • Origin Property: Every vector is equivalent to a vector whose initial point is the origin (OO). If AB⃗≅OP⃗\vec{AB} \cong \vec{OP}, then P=B−AP = B - A.
  • Definition 1.2.3 (Parallelism): AB⃗∥CD⃗\vec{AB} \parallel \vec{CD} if there exists α∈R\alpha \in \mathbb{R} such that B−A=α(D−C)B - A = \alpha(D - C).
    • Equivalent vectors are parallel where α=1\alpha = 1.
    • If α>0\alpha > 0, vectors have the same direction.
    • If α<0\alpha < 0, vectors have opposite directions.

1.3 The Scalar Product

  • Definition 1.3.1: For A=(a1,…,an)A = (a_1, \dots, a_n) and B=(b1,…,bn)B = (b_1, \dots, b_n), the scalar product (dot product) is:
    • A⋅B=a1b1+a2b2+⋯+anbnA \cdot B = a_1b_1 + a_2b_2 + \dots + a_nb_n.
  • Theorem 1.3.1 (Properties):
    • A⋅B=B⋅AA \cdot B = B \cdot A.
    • A⋅(B+C)=A⋅B+A⋅CA \cdot (B + C) = A \cdot B + A \cdot C.
    • (αA)⋅B=α(A⋅B)=A⋅(αB)(\alpha A) \cdot B = \alpha(A \cdot B) = A \cdot (\alpha B).
    • A⋅A≥0A \cdot A \geq 0; A⋅A=0  ⟺  A=0A \cdot A = 0 \iff A = 0.
  • Definition 1.3.2 (Orthogonality): A⊥B  ⟺  A⋅B=0A \perp B \iff A \cdot B = 0.
  • The Norm of a Vector (Definition 1.3.3):
    • The norm (length) is denoted ∥A∥=A⋅A=a12+a22+⋯+an2\Vert A \| = \sqrt{A \cdot A} = \sqrt{a_1^2 + a_2^2 + \dots + a_n^2}.
    • Property: ∥αA∥=∣α∣∥A∥\Vert \alpha A \| = |\alpha| \Vert A \|.
  • Unit Vectors: A vector AA is a unit vector if ∥A∥=1\Vert A \| = 1.
    • For any A≠0A \neq 0, the vector u=A∥A∥u = \frac{A}{\Vert A \|} is a unit vector in the direction of AA.
  • Distance (Definition 1.3.5): d(A,B)=∥A−B∥=(A−B)⋅(A−B)d(A, B) = \Vert A - B \| = \sqrt{(A-B) \cdot (A-B)}.
  • Angles (Theorem 1.3.5):
    • A⋅B=∥A∥∥B∥cos⁡(θ)A \cdot B = \Vert A \| \Vert B \| \cos(\theta) where 0≤θ≤π0 \leq \theta \leq \pi.
    • cos⁡(θ)=A⋅B∥A∥∥B∥\cos(\theta) = \frac{A \cdot B}{\Vert A \| \Vert B \|}.
  • Directional Cosines: The angles α,β,γ\alpha, \beta, \gamma a vector makes with the positive X,Y,ZX, Y, Z axes are the direction angles.
    • cos⁡(α)=a1∥A∥\cos(\alpha) = \frac{a_1}{\Vert A \|}, cos⁡(β)=a2∥A∥\cos(\beta) = \frac{a_2}{\Vert A \|}, cos⁡(γ)=a3∥A∥\cos(\gamma) = \frac{a_3}{\Vert A \|}.
    • Property: cos⁡2(α)+cos⁡2(β)+cos⁡2(γ)=1\cos^2(\alpha) + \cos^2(\beta) + \cos^2(\gamma) = 1.
  • Projection: The projection of vector AA onto BB is P=ProjBA=A⋅B∥B∥2BP = \text{Proj}_B A = \frac{A \cdot B}{\Vert B \|^2} B.
  • Triangle Inequality (Theorem 1.3.6): ∥A+B∥≤∥A∥+∥B∥\Vert A + B \| \leq \Vert A \| + \Vert B \|.

1.4 The Cross Product

  • Definition 1.4.1 (3D space only): A⃗×B⃗=(a2b3−a3b2)i−(a1b3−a3b1)j+(a1b2−a2b1)k\vec{A} \times \vec{B} = (a_2b_3 - a_3b_2)\mathbf{i} - (a_1b_3 - a_3b_1)\mathbf{j} + (a_1b_2 - a_2b_1)\mathbf{k}.
  • Properties (Theorem 1.4.1):
    • A×B=−(B×A)A \times B = -(B \times A).
    • If A∥BA \parallel B, then A×B=0A \times B = 0.
    • A×BA \times B is perpendicular to both AA and BB.
    • ∥A×B∥=∥A∥∥B∥sin⁡(θ)\Vert A \times B \| = \Vert A \| \Vert B \| \sin(\theta). This equals the area of the parallelogram formed by AA and BB.
    • Lagranges's Identity: ∥A×B∥2=(A⋅A)(B⋅B)−(A⋅B)2\Vert A \times B \|^2 = (A \cdot A)(B \cdot B) - (A \cdot B)^2.
    • Unit Vector relations: i×j=k\mathbf{i} \times \mathbf{j} = \mathbf{k}, j×k=i\mathbf{j} \times \mathbf{k} = \mathbf{i}, k×i=j\mathbf{k} \times \mathbf{i} = \mathbf{j}. Reversed products yield negative results (e.g., j×i=−k\mathbf{j} \times \mathbf{i} = -\mathbf{k}).

1.5 Lines and Planes

  • Lines in Space:
    • A line ll is determined by a point Q(x0,y0,z0)Q(x_0, y_0, z_0) and a vector L=ai+bj+ckL = a\mathbf{i} + b\mathbf{j} + c\mathbf{k} parallel to it.
    • Vector Equation: r=r0+tLr = r_0 + tL.
    • Parametric Equations: x=x0+atx = x_0 + at, y=y0+bty = y_0 + bt, z=z0+ctz = z_0 + ct.
    • Symmetric Equations: x−x0a=y−y0b=z−z0c\frac{x - x_0}{a} = \frac{y - y_0}{b} = \frac{z - z_0}{c}.
  • Distance from point QQ to line ll: D=∥L×PQ⃗∥∥L∥D = \frac{\Vert L \times \vec{PQ} \|}{\Vert L \|} where PP is any point on ll.
  • Planes in Space:
    • A plane is determined by a point Q(x0,y0,z0)Q(x_0, y_0, z_0) and a normal vector N=ai+bj+ckN = a\mathbf{i} + b\mathbf{j} + c\mathbf{k}.
    • Equation of Planet: a(x−x0)+b(y−y0)+c(z−z0)=0a(x - x_0) + b(y - y_0) + c(z - z_0) = 0.
  • Distance from point QQ to plane π\pi: D=∣N⋅QP⃗∣∥N∥D = \frac{|N \cdot \vec{QP}|}{\Vert N \|} where PP is any point on π\pi.

1.6 Applications

  • Area of a Triangle: Area=12∥A×B∥Area = \frac{1}{2} \Vert A \times B \| where AA and BB are adjacent side vectors.
  • Volume of a Parallelepiped: Volume=∣A⋅(B×C)∣Volume = |A \cdot (B \times C)|. This is the absolute value of the scalar triple product.

Vector Spaces (Chapter 4)

4.1 Definition and Axioms

  • Definition: A vector space VV over a field FF is a set of objects (vectors) satisfying:
    1. Closure under addition: u+v∈Vu + v \in V.
    2. Closure under scalar multiplication: αv∈V\alpha v \in V.
    3. Commutativity: u+v=v+uu + v = v + u.
    4. Associativity of addition: (u+v)+w=u+(v+w)(u + v) + w = u + (v + w).
    5. Additive identity: There exists 0∈V0 \in V such that 0+u=u0 + u = u.
    6. Additive inverse: There exists −u∈V-u \in V such that u+(−u)=0u + (-u) = 0.
    7. Distributivity (scalar): α(u+v)=αu+αv\alpha(u + v) = \alpha u + \alpha v.
    8. Distributivity (field): (α+β)u=αu+βu(\alpha + \beta)u = \alpha u + \beta u.
    9. Associativity of scalar multiplication: (αβ)u=α(βu)(\alpha\beta)u = \alpha(\beta u).
    10. Unitary Law: 1⋅u=u1 \cdot u = u.
  • Theorem 4.1.2:
    • 0v=00v = 0 and α0=0\alpha 0 = 0.
    • αv=0  ⟺  α=0\alpha v = 0 \iff \alpha = 0 or v=0v = 0.
    • (−1)v=−v(-1)v = -v.

4.2 Subspaces

  • Definition: A subset W⊆VW \subseteq V is a subspace if it satisfies closure under addition, closure under scalar multiplication, and contains the zero vector.
  • Intersection Rule: The intersection of two subspaces W1∩W2W_1 \cap W_2 is always a subspace.
  • Union Rule: The union W1∪W2W_1 \cup W_2 is generally not a subspace unless one is contained in the other.
  • Sum of Subspaces: W1+W2={u1+u2:u1∈W1,u2∈W2}W_1 + W_2 = \{u_1 + u_2 : u_1 \in W_1, u_2 \in W_2\} is a subspace.
  • Linear Combination: A vector v=∑αiviv = \sum \alpha_i v_i is a linear combination.
  • Generating Set: A set SS spans VV if every vector in VV can be written as a linear combination of elements in SS.

4.3 Linear Independence

  • Linear Dependence: Vectors v1⃗,…,vn⃗\vec{v_1}, \dots, \vec{v_n} are LD if ∑αivi⃗=0\sum \alpha_i \vec{v_i} = 0 for some αi≠0\alpha_i \neq 0.
  • Linear Independence: Vectors are LI if ∑αivi⃗=0  ⟹  \sum \alpha_i \vec{v_i} = 0 \implies all αi=0\alpha_i = 0.
  • Singleton Rule: {x}\left\{x\right\} is LI iff x≠0x \neq 0.

4.4 Basis and Dimension

  • Basis: A set BB is a basis for VV if it spans VV and is linearly independent.
  • Dimension (dimVdim V): The number of vectors in any basis of VV.
  • Extension Theorem: Any linearly independent set can be extended to form a basis.
  • Coordinate Vector: If u=∑aiviu = \sum a_i v_i relative to basis {vk}\left\{v_k\right\}, then (a1,…,an)(a_1, \dots, a_n) is the coordinate vector.

Chapter 2: Matrices, Determinants, and Systems

2.1 Matrix Definitions

  • Definition: An m×nm \times n matrix AA is a rectangular array of numbers with mm rows and nn columns.
  • Equality: Matrices A=BA=B if they have the same size and all corresponding entries aij=bija_{ij} = b_{ij} are equal.

2.2 Operations

  • Addition: (A+B)ij=aij+bij(A+B)_{ij} = a_{ij} + b_{ij}. Both must be same size.
  • Scalar Multiplication: (αA)ij=αaij(\alpha A)_{ij} = \alpha a_{ij}.
  • Multiplication: For Am×nA_{m \times n} and Bn×pB_{n \times p}, the product Cm×pC_{m \times p} is cik=∑j=1naijbjkc_{ik} = \sum_{j=1}^n a_{ij} b_{jk}.
    • Note: Matrix multiplication is not commutative (AB≠BAAB \neq BA).
  • Properties:
    • A(BC)=(AB)CA(BC) = (AB)C (Associative).
    • A(B+C)=AB+ACA(B+C) = AB + AC (Distributive).

2.3 Types of Matrices

  • Transpose (AtA^t): Interchanging rows and columns. (At)ij=aji(A^t)_{ij} = a_{ji}.
    • (AB)t=BtAt(AB)^t = B^tA^t.
  • Identity (II): Square matrix with 1s on diagonal, 0s elsewhere.
  • Diagonal: aij=0a_{ij} = 0 for i≠ji \neq j.
  • Symmetric: At=A  ⟹  aij=ajiA^t = A \implies a_{ij} = a_{ji}.
  • Skew-Symmetric: At=−A  ⟹  aij=−ajiA^t = -A \implies a_{ij} = -a_{ji} (diagonal entries must be 0).
  • Triangular: Upper triangular (aij=0a_{ij} = 0 for i>ji > j) or Lower triangular (aij=0a_{ij} = 0 for i<ji < j).

2.4 Inverses and Rank

  • Elementary Row Operations:
    • Interchange two rows (Ri↔RjR_i \leftrightarrow R_j).
    • Multiply a row by a non-zero constant (Ri→αRiR_i \to \alpha R_i).
    • Add a multiple of one row to another (Ri→Ri+αRjR_i \to R_i + \alpha R_j).
  • Row Echelon Form (REF):
    • Zeros at bottom.
    • Leading non-zero entry is 1.
    • Leading 1 of a lower row is to the right of the leading 1 above it.
  • Reduced Row Echelon Form (RREF): REF plus zeros above every leading 1.
  • Inverse (A−1A^{-1}): AA−1=A−1A=IAA^{-1} = A^{-1}A = I. Only for non-singular matrices.
  • Computation: Augment AA with II ([A∣I][A | I]) and use row operations to reach [I∣A−1][I | A^{-1}].
  • Rank: Number of non-zero rows in REF.

2.6 Systems of Linear Equations

  • Matrix Form: Ax=bAx = b.
  • Gaussian Elimination: Reducing the augmented matrix to REF.
  • Gauss-Jordan Elimination: Reducing the augmented matrix to RREF.
  • Consistency:
    • If rank(A)<rank(A∣b)rank(A) < rank(A|b), no solution (inconsistent).
    • If rank(A)=rank(A∣b)=nrank(A) = rank(A|b) = n, unique solution.
    • If rank(A)=rank(A∣b)<nrank(A) = rank(A|b) < n, infinitely many solutions (dependent on n−rn-r parameters).

Chapter 3: Determinants

  • Definition 3.1.1:
    • 1×11 \times 1: ∣a11∣=a11|a_{11}| = a_{11}.
    • 2×22 \times 2: ∣abcd∣=ad−bc\begin{vmatrix} a & b \\ c & d \end{vmatrix} = ad - bc.
    • Expansion by Cofactors: detA=∑j=1n(−1)i+jaij∣Aij∣det A = \sum_{j=1}^n (-1)^{i+j} a_{ij} |A_{ij}| for any row ii. Here ∣Aij∣|A_{ij}| is the minor (determinant of submatrix after deleting row ii and col jj).
  • Properties:
    • det(I)=1det(I) = 1.
    • det(AB)=det(A)det(B)det(AB) = det(A)det(B).
    • det(At)=det(A)det(A^t) = det(A).
    • If any row or col is all 0, det(A)=0det(A) = 0.
    • Swapping two rows changes the sign of the determinant.
    • Multiplying a row by kk results in k⋅det(A)k \cdot det(A).
    • For triangular matrices, det(A)=∏i=1naiidet(A) = \prod_{i=1}^n a_{ii}.
  • Adjoint Inverse: A−1=1detAadjAA^{-1} = \frac{1}{det A} adj A, where adjAadj A is the transpose of the matrix of cofactors.
  • Cramer’s Rule: For Ax=bAx=b, xi=det(Bi)det(A)x_i = \frac{det(B_i)}{det(A)}, where BiB_i replaces col ii of AA with bb.

PART II: CALCULUS

Chapter 1: Limits, Continuity, and Differentiation

1.1 Limits

  • Definition: lim⁡x→af(x)=L\lim_{x \to a} f(x) = L if f(x)f(x) approach LL as xx approaches aa.
  • One-Sided Limits: lim⁡x→a−f(x)\lim_{x \to a^-} f(x) (left-hand) and lim⁡x→a+f(x)\lim_{x \to a^+} f(x) (right-hand).
  • Theorems: Limits of sums, differences, products, and quotients are the operations of the individual limits (assuming denominators are non-zero).
  • Squeeze Theorem: If h(x)≤f(x)≤g(x)h(x) \leq f(x) \leq g(x) and lim⁡h(x)=lim⁡g(x)=L\lim h(x) = \lim g(x) = L, then lim⁡f(x)=L\lim f(x) = L.
  • Trigonometric Limits: lim⁡x→0sin⁡(x)x=1\lim_{x \to 0} \frac{\sin(x)}{x} = 1 and lim⁡x→01−cos⁡(x)x=0\lim_{x \to 0} \frac{1 - \cos(x)}{x} = 0.

Continuity

  • At a point: continuous at aa if f(a)f(a) is defined, the limit exists, and lim⁡x→af(x)=f(a)\lim_{x \to a} f(x) = f(a).
  • Discontinuities: Removable (limit exists but ≠f(a)\neq f(a)) or Essential (limit does not exist, e.g., jump or infinite).
  • Intermediate Value Theorem (IVT): If ff is continuous on [a,b][a, b] and kk is between f(a)f(a) and f(b)f(b), there exists c∈(a,b)c \in (a, b) such that f(c)=kf(c) = k.

1.3 Differentiation

  • Definition: f′(a)=lim⁡h→0f(a+h)−f(a)hf'(a) = \lim_{h \to 0} \frac{f(a+h) - f(a)}{h}.
  • Geometric Meaning: The slope of the tangent line to the curve at x=ax=a.
  • Rules:
    • ddx[c]=0\frac{d}{dx}[c] = 0.
    • ddx[xn]=nxn−1\frac{d}{dx}[x^n] = nx^{n-1}.
    • ddx[f⋅g]=f′g+fg′\frac{d}{dx}[f \cdot g] = f'g + fg' (Product Rule).
    • ddx[f/g]=f′g−fg′g2\frac{d}{dx}[f/g] = \frac{f'g - fg'}{g^2} (Quotient Rule).
    • ddx[f(g(x))]=f′(g(x))⋅g′(x)\frac{d}{dx}[f(g(x))] = f'(g(x)) \cdot g'(x) (Chain Rule).
  • Implicit Differentiation: Differentiating both sides of an equation with respect to xx, treating yy as a function of xx, and solving for dydx\frac{dy}{dx}.
  • Transcendental Functions:
    • ddx[sin⁡x]=cos⁡x\frac{d}{dx}[\sin x] = \cos x, ddx[cos⁡x]=−sin⁡x\frac{d}{dx}[\cos x] = -\sin x, ddx[tan⁡x]=sec⁡2x\frac{d}{dx}[\tan x] = \sec^2 x.
    • ddx[ex]=ex\frac{d}{dx}[e^x] = e^x.
    • ddx[ln⁡x]=1x\frac{d}{dx}[\ln x] = \frac{1}{x}.

1.4 L’Hôpital’s Rule

  • If lim⁡x→af(x)g(x)\lim_{x \to a} \frac{f(x)}{g(x)} yields 00\frac{0}{0} or ∞∞\frac{\infty}{\infty}, then lim⁡x→af(x)g(x)=lim⁡x→af′(x)g′(x)\lim_{x \to a} \frac{f(x)}{g(x)} = \lim_{x \to a} \frac{f'(x)}{g'(x)} (provided the latter exists).
  • Other Indeterminate Forms: 0⋅∞0 \cdot \infty, ∞−∞\infty - \infty, 000^0, 1∞1^\infty, ∞0\infty^0. These must be algebraically converted to 00\frac{0}{0} or ∞∞\frac{\infty}{\infty}.

Chapter 2: Applications of Derivative

  • Extrema:
    • Absolute Extrema: The highest/lowest values on an interval. On a closed interval, checking critical numbers and endpoints.
    • Critical Number: cc where f′(c)=0f'(c) = 0 or f′(c)f'(c) is undefined.
  • Rolle’s Theorem: If ff is continuous on [a,b][a, b], differentiable on (a,b)(a, b), and f(a)=f(b)f(a) = f(b), there is a c∈(a,b)c \in (a, b) such that f′(c)=0f'(c) = 0.
  • Mean Value Theorem (MVT): There exists c∈(a,b)c \in (a, b) such that f′(c)=f(b)−f(a)b−af'(c) = \frac{f(b) - f(a)}{b - a}.
  • Monotonicity: f′>0  ⟹  f' > 0 \implies increasing; f′<0  ⟹  f' < 0 \implies decreasing.
  • Concavity: f′′>0  ⟹  f'' > 0 \implies concave up; f′′<0  ⟹  f'' < 0 \implies concave down.
  • Inflection Point: Point where concavity changes sign.
  • Optimization: Converting word problems to functions, finding critical points to maximize/minimize quantities (e.g., volume, area, time).
  • Related Rates: Finding the rate of change of one quantity based on the rate of change of others using the Chain Rule (e.g., area of a growing disc, ladder sliding down a wall).

Chapter 3: Integration

Antiderivatives and Indefinite Integrals

  • Definition: FF is an antiderivative of ff if F′(x)=f(x)F'(x) = f(x).
  • Notation: ∫f(x)dx=F(x)+C\int f(x) dx = F(x) + C.
  • General Formulas:
    • ∫xndx=xn+1n+1+C\int x^n dx = \frac{x^{n+1}}{n+1} + C (n≠−1n \neq -1).
    • ∫1xdx=ln⁡∣x∣+C\int \frac{1}{x} dx = \ln|x| + C.
    • ∫exdx=ex+C\int e^x dx = e^x + C.
    • ∫sin⁡xdx=−cos⁡x+C\int \sin x dx = -\cos x + C.

Techniques of Integration

  • Substitution (u-substitution): ∫f(g(x))g′(x)dx=∫f(u)du\int f(g(x))g'(x)dx = \int f(u)du.
  • Integration by Parts: ∫udv=uv−∫vdu\int u dv = uv - \int v du.
  • Partial Fractions: Decomposing rational functions P(x)Q(x)\frac{P(x)}{Q(x)} into sums of simpler fractions based on the factors of Q(x)Q(x).

Definite Integrals

  • Riemann Sum: The limit of sums of rectangular areas under a curve.
  • Fundamental Theorem of Calculus (FTC):
    • Part I: ddx∫axf(t)dt=f(x)\frac{d}{dx} \int_a^x f(t) dt = f(x).
    • Part II: ∫abf(x)dx=F(b)−F(a)\int_a^b f(x) dx = F(b) - F(a).

Chapter 4: Applications of Integration

  • Area Between Curves: A=∫ab[f(x)−g(x)]dxA = \int_a^b [f(x) - g(x)] dx.
  • Work Done by Force: W=∫abF(x)dxW = \int_a^b F(x) dx. Use Hooke's Law for springs: F(x)=kxF(x) = kx.
  • Volume of Solids of Revolution:
    • Disk Method: V=∫abπ[f(x)]2dxV = \int_a^b \pi [f(x)]^2 dx.
    • Washer Method: V=∫abπ([f(x)]2−[g(x)]2)dxV = \int_a^b \pi ([f(x)]^2 - [g(x)]^2) dx.
  • Arc Length of Plane Curves: ℓ(C)=∫ab1+[f′(x)]2dx\ell(C) = \int_a^b \sqrt{1 + [f'(x)]^2} dx.