📘 Lecture 16 — Types of functions
📖 Overview: This lecture explores different types of functions based on how they map elements between sets. It defines and illustrates injective (one-to-one), surjective (onto), and bijective functions, along with identity and constant functions, providing formal definitions, proofs, examples, and counting techniques essential for understanding function properties in discrete mathematics.
🗂️ Topics Covered
The lecture covers injective (one-to-one) functions with their formal definition, contrapositive form, examples, and counting problems; graphical interpretation via the horizontal line test; surjective (onto) functions with definition, examples, and graphical interpretation; bijective functions as a combination of both properties; and finally identity and constant functions with proofs of their properties.
📝 Lecture Summary
INJECTIVE or ONE-TO-ONE FUNCTION
A function (f: X \to Y) is injective or one-to-one if, and only if, for all (x_1, x_2 \in X), if (x_1 \ne x_2) then (f(x_1) \ne f(x_2)). This means distinct points in the domain map to distinct points in the co-domain. A one-to-one function separates points.
A function (f) is not one-to-one when there exist elements (x_1) and (x_2) with (x_1 \ne x_2) but (f(x_1) = f(x_2)). Such a function collapses points together.
🔑 Definition — Injective Function: A function that maps distinct elements of the domain to distinct elements of the co-domain.
🔑 Alternative Definition: A function (f: X \to Y) is one-to-one iff for all (x_1, x_2 \in X), if (f(x_1) = f(x_2)) then (x_1 = x_2). This is the contrapositive of the original definition.
📌 Example: Determine if (f: \mathbb{R} \to \mathbb{R}) defined by (f(x) = 4x - 1) is one-to-one. Proof: Let (x_1, x_2 \in \mathbb{R}) with (f(x_1) = f(x_2)). Then (4x_1 - 1 = 4x_2 - 1). Adding 1 gives (4x_1 = 4x_2). Dividing by 4 gives (x_1 = x_2). Hence (f) is one-to-one.
📌 Example: Determine if (g: \mathbb{Z} \to \mathbb{Z}) defined by (g(n) = n^2) is one-to-one. Counter example: Let (n_1 = 2) and (n_2 = -2). Then (g(2) = 4) and (g(-2) = 4), so (g(2) = g(-2)) but (2 \ne -2). Hence (g) is not one-to-one.
📌 Example: Find all one-to-one functions from (X = {a, b}) to (Y = {u, v}). Solution: There are exactly 2 one-to-one functions. Function 1: (a \to u, b \to v). Function 2: (a \to v, b \to u).
📐 Formula — Counting One-to-One Functions: Number of one-to-one functions from a set with (m) elements to a set with (n) elements is (n \times (n-1) \times (n-2) \times \cdots \times (n-m+1)), provided (m \le n). If (m > n), there are zero one-to-one functions.
📌 Example: How many one-to-one functions from a set with 3 elements to a set with 4 elements? Solution: (4 \times 3 \times 2 = 24) functions.
📌 Example: How many one-to-one functions from a set with 3 elements to a set with 2 elements? Solution: Zero, because two elements in X map to the two in Y, but the third element of X has no distinct target left.
🔑 Graphical Interpretation — Horizontal Line Test: A graph of a function (f) is one-to-one iff every horizontal line intersects the graph in at most one point.
💡 Why this matters: The horizontal line test provides a quick visual way to check injectivity without algebraic proof.
SURJECTIVE FUNCTION or ONTO FUNCTION
A function (f: X \to Y) is surjective or onto if for every (y \in Y), there exists (x \in X) such that (f(x) = y). This means every element of the co-domain is the image of some element of the domain, i.e., co-domain of (f) = range of (f).
A function (f) is not onto if there exists (y \in Y) such that for all (x \in X), (f(x) \ne y). That is, some element of co-domain is not hit by any domain element.
🔑 Definition — Surjective Function: A function where every element of the co-domain is the image of at least one element of the domain.
📌 Example: Which arrow diagrams define onto functions? Diagram f: Not onto because 3 is not the image of any x in X. Diagram g: Onto because 1 = g(c), 2 = g(d), 3 = g(a) = g(b).
📌 Example: Define (f: \mathbb{R} \to \mathbb{R}) by (f(x) = 4x - 1). Is (f) onto? Proof: Let (y \in \mathbb{R}). Find (x = \frac{y+1}{4} \in \mathbb{R}). Then (f(x) = 4(\frac{y+1}{4}) - 1 = (y+1)-1 = y). Hence every (y) has a preimage, so (f) is onto.
📌 Example: Define (h: \mathbb{Z} \to \mathbb{Z}) by (h(n) = 4n - 1). Is (h) onto? Counter example: Let (m = 0). We need (4n - 1 = 0), so (n = \frac{1}{4} \notin \mathbb{Z}). Hence no integer (n) gives (h(n) = 0), so (h) is not onto.
🔑 Graphical Interpretation: A graph of a function (f) is onto iff every horizontal line intersects the graph in at least one point.
📌 Example: (y = |x|) from (\mathbb{R}) to (\mathbb{R}^+) is onto. (y = e^x) from (\mathbb{R}) to (\mathbb{R}) is not onto (negative values have no preimage).
📌 Example: (X = {1,5,9}), (Y = {3,4,7}), (g(1)=7, g(5)=3, g(9)=4). Is (g) one-to-one? Onto? Solution: (g) is one-to-one because all images are distinct. (g) is onto because every element of Y is an image: (3=g(5), 4=g(9), 7=g(1)).
📌 Example: (f: P({a,b,c}) \to \mathbb{Z}) where (f(A) = |A|). Is (f) one-to-one? Onto? Solution: Not one-to-one because (f({a}) = 1 = f({b})) but ({a} \ne {b}). Not onto because no set maps to (4 \in \mathbb{Z}) (max size is 3).
📌 Example: Determine injectivity/surjectivity: (a) (f: \mathbb{Z} \to \mathbb{Z}^+), (f(x) = |x|): Not injective ((f(1)=f(-1)) but (1 \ne -1)). Onto because every positive integer (a) has both (-a) and (a) as preimages. (b) (g: \mathbb{Z}^+ \to \mathbb{Z}^+ \times \mathbb{Z}^+), (g(x) = (x, x+1)): Injective (if ((x_1, x_1+1) = (x_2, x_2+1)) then (x_1=x_2)). Not onto because ((1,1)) has no preimage.
BIJECTIVE FUNCTION or ONE-TO-ONE CORRESPONDENCE
A function (f: X \to Y) that is both one-to-one (injective) and onto (surjective) is called a bijective function or a one-to-one correspondence.
🔑 Definition — Bijective Function: A function that is both injective and surjective, creating a perfect pairing between elements of the domain and co-domain.
📌 Example: The function (f: X \to Y) with (a \to 1, b \to 2, c \to 3) is bijective.
🔑 Graphical Interpretation: A graph of a function (f) is bijective iff every horizontal line intersects the graph at exactly one point.
📌 Example: Show (f: \mathbb{R} \to \mathbb{R}) defined by (f(x) = x^3) is bijective. Proof:
- One-to-one: Let (f(x_1) = f(x_2)). Then (x_1^3 = x_2^3), so (x_1^3 - x_2^3 = 0). Factor: ((x_1 - x_2)(x_1^2 + x_1x_2 + x_2^2) = 0). The second factor has no real zero (discriminant (x_2^2 - 4x_2^2 = -3x_2^2 \le 0), equality only at (x_1=x_2=0)). Hence (x_1 = x_2). So injective.
- Onto: Let (y \in \mathbb{R}). Choose (x = y^{1/3} \in \mathbb{R}). Then (f(x) = (y^{1/3})^3 = y). So surjective. Thus (f) is bijective.
IDENTITY FUNCTION ON A SET
Given a set (X), define a function (i_X: X \to X) by (i_X(x) = x) for all (x \in X). The function (i_X) is called the identity function on (X) because it sends each element to itself.
🔑 Definition — Identity Function: The function that maps every element to itself.
📌 Example: For (X = {1,2,3,4}), the identity function maps (1 \to 1, 2 \to 2, 3 \to 3, 4 \to 4).
📌 Theorem: The identity function on a non-empty set is bijective. Proof:
- Injective: Let (i_X(x_1) = i_X(x_2)). Then (x_1 = x_2), so injective.
- Surjective: Let (y \in X). Then (i_X(y) = y), so every element has a preimage. Hence (i_X) is bijective.
CONSTANT FUNCTION
A function (f: X \to Y) is a constant function if it maps all elements of (X) to a single element of (Y). That is, for all (x \in X), (f(x) = c) for some fixed (c \in Y).
🔑 Definition — Constant Function: A function that sends every element of the domain to the same value in the co-domain.
📌 Example: (f: {1,2,3,4} \to {7,8,9}) with (f(1)=7, f(2)=7, f(3)=7, f(4)=7) is constant.
🔑 Key Remark 1: A constant function is one-to-one iff its domain is a singleton (has exactly one element).
🔑 Key Remark 2: A constant function is onto iff its co-domain is a singleton (has exactly one element).
⭐ Key Takeaways
A one-to-one (injective) function maps distinct domain elements to distinct co-domain elements — use the contrapositive form (f(x_1)=f(x_2) \Rightarrow x_1=x_2) for proofs and apply the horizontal line test on graphs. An onto (surjective) function covers every co-domain element — for proofs, solve for (x) in terms of (y) and verify the solution lies in the domain. A bijective function is both one-to-one and onto, creating a perfect pairing. The identity function is always bijective, and constant functions are injective or surjective only in trivial singleton cases. Counting one-to-one functions follows a decreasing product formula, and the horizontal line test provides geometric intuition for all three function types.
🧠 Quick Revision Questions
- State the contrapositive definition of a one-to-one function. Why is this form often easier to use in proofs?
- Using the horizontal line test, explain why (f(x) = x^2) from (\mathbb{R}) to (\mathbb{R}) is neither injective nor surjective.
- How many one-to-one functions exist from a 4-element set to a 5-element set? Show your calculation.
- Prove that the function (f: \mathbb{R} \to \mathbb{R}) defined by (f(x) = 2x + 3) is bijective.
- Give an example of a constant function that is both one-to-one and onto. What condition(s) must hold for this to be possible?
📘 Lecture 17 — Inverse Function
📖 Overview: This lecture covers the concept of inverse functions, including the conditions under which a function has an inverse and the properties of inverse functions. It also introduces function composition and explores relationships between functions and their inverses, which are fundamental concepts in discrete mathematics and calculus.
🗂️ Topics Covered
The lecture begins with equality of functions and examples demonstrating when two functions are identical. It then explores inverse functions through arrow diagrams, defining when an inverse exists and noting that only bijective functions have inverses. The lecture provides a working rule for finding inverse functions from formulas, followed by multiple examples. It concludes with composition of functions, including composition with identity functions and composing a function with its inverse.
📝 Lecture Summary
EQUALITY OF FUNCTIONS:
Suppose f and g are functions from X to Y. Then f equals g, written f = g, if, and only if, f(x)=g(x) for all x∈X.
🔑 Definition — Equality of functions: Two functions are equal if they produce identical outputs for every input in their common domain.
📌 Example: Define f: R→R and g: R→R by formulas f(x) = |x| and g(x) = √(x²) for all x∈R. Since |x| = √(x²) for all x∈R, therefore f(x) = g(x) for all x∈R. Hence f = g.
📌 Example: Define functions f and g from R to R by formulas: f(x) = 2x and g(x) = (2x³ + 2x)/(x² + 1) for all x∈R. Solution: g(x) = (2x³ + 2x)/(x² + 1) = 2x(x² + 1)/(x² + 1) = 2x = f(x) [since x² + 1 ≠ 0] for all x∈R. Hence f = g.
INVERSE OF A FUNCTION
The inverse of a function reverses the mapping from output back to input. A function f maps elements from domain X to codomain Y, and the inverse f⁻¹ maps elements from Y back to X.
🔑 Remark: Inverse of a function may not be a function. For an inverse to be a function, each output must map to exactly one input.
INJECTIVE FUNCTION INVERSE
The inverse of an injective function (one-to-one) may not be a function if the function is not also surjective.
SURJECTIVE FUNCTION INVERSE
The inverse of a surjective function (onto) may not be a function if the function is not also injective.
BIJECTIVE FUNCTION INVERSE
The inverse of a bijective function (both one-to-one and onto) is a function. Note: Inverse of a surjective function may not be a function.
INVERSE FUNCTION:
Suppose f: X→Y is a bijective function. Then the inverse function f⁻¹: Y→X is defined as: ∀ y∈Y, f⁻¹(y) = x ⇔ y = f(x) That is, f⁻¹ sends each element of Y back to the element of X that it came from under f.
🔑 Definition — Invertible function: A function whose inverse function exists is called an invertible function.
INVERSE FUNCTION FROM AN ARROW DIAGRAM:
Let the bijection f: X→Y be defined by an arrow diagram mapping elements 1,2,3,4 to elements 6,7,8,9. The inverse function f⁻¹: Y→X reverses the arrows, mapping 6,7,8,9 back to 1,2,3,4 respectively.
INVERSE FUNCTION FROM A FORMULA:
Let f: R→R be defined by the formula f(x) = 4x-1 for all x∈R. Then f is bijective, therefore f⁻¹ exists. By definition of f⁻¹, f⁻¹(y) = x ⇔ f(x)=y Now solving f(x) = y for x: 4x-1 = y → 4x = y+1 → x = (y+1)/4 Hence, f⁻¹(y) = (y+1)/4 is the inverse of f(x)=4x-1 which defines f⁻¹: R→R.
WORKING RULE TO FIND INVERSE FUNCTION:
Let f: X→Y be a one-to-one correspondence defined by the formula f(x)=y.
- Solve the equation f(x) = y for x in terms of y.
- f⁻¹(y) equals the right-hand side of the equation found in step 1.
📌 Example: Let a function f be defined on a set of real numbers as f(x) = (x+1)/(x-1) for all real numbers x≠1.
- Show that f is a bijective function on R-{1}.
- Find the inverse function f⁻¹.
Solution:
- To show f is injective: Let x₁, x₂ ∈ R-{1} and suppose f(x₁)=f(x₂). We must show x₁=x₂. (x₁+1)/(x₁-1) = (x₂+1)/(x₂-1) (x₁+1)(x₂-1) = (x₂+1)(x₁-1) x₁x₂ - x₁ + x₂ - 1 = x₁x₂ - x₂ + x₁ - 1 -x₁ + x₂ = -x₂ + x₁ 2x₂ = 2x₁ x₂ = x₁. Hence f is injective.
b. To show f is surjective: Let y∈R-{1}. We look for x∈R-{1} such that f(x)=y. (x+1)/(x-1) = y x+1 = y(x-1) x+1 = yx-y y+1 = yx-x y+1 = x(y-1) x = (y+1)/(y-1). Thus for each y∈R-{1}, there exists x = (y+1)/(y-1) ∈ R-{1} such that f(x)=y.
- Inverse function of f: From above, x = (y+1)/(y-1). Hence f⁻¹(y) = (y+1)/(y-1), y≠1.
📌 Example: Let f: R→R be defined by f(x) = x³ + 5. Show that f is one-to-one and onto. Find f⁻¹.
Solution:
-
f is one-to-one: Let f(x₁)=f(x₂) for x₁,x₂∈R. x₁³+5 = x₂³+5 → x₁³ = x₂³ → x₁ = x₂.
-
f is onto: Let y∈R. Find x such that f(x)=y. x³+5 = y → x³ = y-5 → x = ³√(y-5). Thus for each y∈R, x = ³√(y-5) ∈ R exists.
-
Formula for f⁻¹: x = ³√(y-5). Hence f⁻¹(y) = ³√(y-5).
COMPOSITION OF FUNCTIONS:
Let f: X→Y' and g: Y→Z be functions with the property that the range of f is a subset of the domain of g, i.e. f(X)⊆Y. Define a new function gof: X→Z as follows: (gof)(x) = g(f(x)) for all x∈X The function gof is called the composition of f and g.
🔑 Definition — Composition of functions: The composition gof first applies f to input x, then applies g to the result f(x).
COMPOSITION OF FUNCTIONS DEFINED BY ARROW DIAGRAMS:
Let X = {1,2,3}, Y'={a,b,c,d}, Y={a,b,c,d,e} and Z={x,y,z}. Define functions f:X→Y' and g:X→Z by arrow diagrams showing how elements map through the composition.
📌 Example: Let A = {1,2,3,4,5} with f,g: A→A defined as: f(1)=3, f(2)=5, f(3)=3, f(4)=1, f(5)=2 g(1)=4, g(2)=1, g(3)=1, g(4)=2, g(5)=3
Solution: (fog)(1)=f(g(1))=f(4)=1 (fog)(2)=f(g(2))=f(1)=3 (fog)(3)=f(g(3))=f(1)=3 (fog)(4)=f(g(4))=f(2)=5 (fog)(5)=f(g(5))=f(3)=3
(gof)(1)=g(f(1))=g(3)=1 (gof)(2)=g(f(2))=g(5)=3 (gof)(3)=g(f(3))=g(3)=1 (gof)(4)=g(f(4))=g(1)=4 (gof)(5)=g(f(5))=g(2)=1
🔑 Remark: The functions fog and gof are not equal.
COMPOSITION OF FUNCTIONS DEFINED BY FORMULAS:
Let f: Z→Z and g: Z→Z be defined by f(n)=n+1 and g(n)=n² for n∈Z. a. Find gof and fog. b. Is gof = fog?
Solution: a. (gof)(n)=g(f(n))=g(n+1)=(n+1)² for all n∈Z (fog)(n)=f(g(n))=f(n²)=n²+1 for all n∈Z
b. (gof)(1)=4 whereas (fog)(1)=2. Thus fog ≠ gof.
🔑 Remark: The composition of functions is not a commutative operation.
COMPOSITION WITH THE IDENTITY FUNCTION:
Let X={a,b,c,d} and Y={u,v,w} with f:X→Y defined by f(a)=u, f(b)=v, f(c)=v, f(d)=u. Find foiₓ and iᵧof, where iₓ and iᵧ are identity functions on X and Y respectively.
Solution: (foiₓ)(a)=f(iₓ(a))=f(a)=u, (foiₓ)(b)=v, (foiₓ)(c)=v, (foiₓ)(d)=u. So foiₓ = f. (iᵧof)(a)=iᵧ(f(a))=iᵧ(u)=u, (iᵧof)(b)=v, (iᵧof)(c)=v, (iᵧof)(d)=u. So iᵧof = f.
COMPOSING A FUNCTION WITH ITS INVERSE:
Let X={a,b,c} and Y={x,y,z}. Define f:X→Y with f(a)=z, f(b)=x, f(c)=y. Then f is bijective. f⁻¹ exists with f⁻¹(x)=b, f⁻¹(y)=c, f⁻¹(z)=a.
(f⁻¹of)(a)=f⁻¹(f(a))=f⁻¹(z)=a, (f⁻¹of)(b)=b, (f⁻¹of)(c)=c. Thus f⁻¹of: X→X sends each element of X to itself, so f⁻¹of = iₓ. Similarly, fof⁻¹ = iᵧ.
🔑 Remark: The function f: X→Y and g: Y→X are inverses of each other iff gof = iₓ and fog = iᵧ.
📌 Example: Let f: R→R and g: R→R be defined by f(x)=3x+2 and g(x)=(x-2)/3 for all x∈R.
Solution: (gof)(x)=g(f(x))=g(3x+2)=((3x+2)-2)/3=3x/3=x (fog)(x)=f(g(x))=f((x-2)/3)=3((x-2)/3)+2=(x-2)+2=x Thus gof and fog are identity functions. Accordingly f and g are inverse of each other.
💡 Why this matters: This example demonstrates how to verify inverse functions by showing that their compositions yield the identity function.
⭐ Key Takeaways
The most critical concepts from this lecture are that a function must be bijective (both one-to-one and onto) to have an inverse function, and the inverse function is found by solving f(x)=y for x in terms of y. Composition of functions is not commutative, meaning fog ≠ gof in general, but composing a function with its inverse always gives the identity function. Two functions are inverses of each other if and only if both gof and fog equal the identity function on their respective domains. The working rule for finding inverse functions involves solving for x and then swapping variables.
🧠 Quick Revision Questions
- What condition must a function satisfy for its inverse to also be a function?
- Find the inverse of f(x) = (2x-3)/5.
- If f(x) = x² and g(x) = x+1, what is (fog)(2)?
- What is the relationship between a function and its inverse when composed?
- Is the composition of functions commutative? Give an example to support your answer.
📘 Lecture 18 — Composition of Functions
📖 Overview: This lecture explores the composition of functions, proving key theorems about how composition preserves one-to-one and onto properties, and establishing the associativity of composition. It also introduces real-valued functions and operations on them (sum, difference, product, quotient, scalar multiplication), and extends the discussion to finite/infinite sets, cardinality, countable sets, and image/inverse image of sets.
🗂️ Topics Covered
Theorems on composition preserving one-to-one and onto properties, associativity of composition, inverse of composition, real-valued functions and operations (sum, difference, product, quotient, scalar multiplication), counterexamples for sums of functions, zero function, characteristic functions, finite and infinite sets, cardinality, countable sets, image and inverse image of sets, and results on images/inverse images.
📝 Lecture Summary
THEOREM: If f and g are two one-to-one functions, then their composition gof is one-to-one
Proof: Let f: X → Y and g: Y → Z both be one-to-one. Suppose x₁, x₂ ∈ X such that (gof)(x₁) = (gof)(x₂). Then g(f(x₁)) = g(f(x₂)). Since g is one-to-one, f(x₁) = f(x₂). Since f is one-to-one, x₁ = x₂. Therefore, gof is one-to-one.
THEOREM: If f: X → Y and g: Y → Z are both onto functions, then gof: X → Z is onto
Proof: Let f: X → Y and g: Y → Z both be onto. Let z ∈ Z. Since g is onto, there exists y ∈ Y such that g(y) = z. Since f is onto, there exists x ∈ X such that f(x) = y. Hence, (gof)(x) = g(f(x)) = g(y) = z. Thus gof is onto.
💡 Why this matters: These theorems show that composition preserves the important properties of being one-to-one and onto, which is crucial for understanding function invertibility.
THEOREM: If f: W → X, g: X → Y, and h: Y → Z are functions, then (hog)of = ho(gof)
Proof: For every x ∈ W: ((hog)of)(x) = (hog)(f(x)) = h(g(f(x))) and (ho(gof))(x) = h((gof)(x)) = h(g(f(x))). Hence (hog)of = ho(gof).
🔑 Definition — Associativity of Composition: The composition of functions is associative.
EXERCISE: Suppose f: X → Y and g: Y → Z are both one-to-one and onto. Prove that (gof)⁻¹ exists and equals f⁻¹ o g⁻¹
Proof: Since f and g are bijective, their composition gof is bijective, so (gof)⁻¹: Z → X exists. To show (gof)⁻¹ = f⁻¹ o g⁻¹, we need (f⁻¹ o g⁻¹) o (gof) = iₓ and (gof) o (f⁻¹ o g⁻¹) = i_z.
First: (f⁻¹ o g⁻¹) o (gof) = f⁻¹ o (g⁻¹ o (gof)) = f⁻¹ o ((g⁻¹ o g) of) = f⁻¹ o (i_y of) = f⁻¹ o f = i_x
Second: (gof) o (f⁻¹ o g⁻¹) = go (f o (f⁻¹ o g⁻¹)) = go ((f o f⁻¹) o g⁻¹) = go (i_y o g⁻¹) = go g⁻¹ = i_z
Therefore, f⁻¹ o g⁻¹ = (gof)⁻¹.
REAL-VALUED FUNCTIONS
🔑 Definition — Real-valued function: Let X be any set and R be the set of real numbers. A function f: X → R that assigns to each x ∈ X a real number f(x) ∈ R is called a real-valued function.
If f: R → R, then f is called a real-valued function of a real variable.
📌 Example: f: R⁺ → R defined by f(x) = log x is a real valued function. 📌 Example: g: R → R defined by g(x) = eˣ is a real valued function of a real variable.
OPERATIONS ON FUNCTIONS
SUM OF FUNCTIONS
🔑 Definition — Sum of functions: Let f: X → R and g: X → R be real valued functions. The sum of f and g, denoted f+g, is a function f+g: X → R defined by (f+g)(x) = f(x) + g(x) for all x ∈ X.
📌 Example: Let f(x) = x² + 1 and g(x) = x + 2 from R to R. Then (f+g)(x) = (x² + 1) + (x + 2) = x² + x + 3 for all x ∈ R.
DIFFERENCE OF FUNCTIONS
🔑 Definition — Difference of functions: Let f: X → R and g: X → R be real valued functions. The difference of f and g, denoted f-g, is a function f-g: X → R defined by (f-g)(x) = f(x) - g(x) for all x ∈ X.
📌 Example: Let f(x) = x² + 1 and g(x) = x + 2. Then (f-g)(x) = (x² + 1) - (x + 2) = x² - x - 1 for all x ∈ R.
PRODUCT OF FUNCTIONS
🔑 Definition — Product of functions: Let f: X → R and g: X → R be real valued functions. The product of f and g, denoted f·g or fg, is a function f·g: X → R defined by (f·g)(x) = f(x)·g(x) for all x ∈ X.
📌 Example: Let f(x) = x² + 1 and g(x) = x + 2. Then (f·g)(x) = (x² + 1)(x + 2) = x³ + 2x² + x + 2 for all x ∈ R.
QUOTIENT OF FUNCTIONS
🔑 Definition — Quotient of functions: Let f: X → R and g: X → R be real valued functions. The quotient of f by g, denoted f/g, is a function from X to R defined by (f/g)(x) = f(x)/g(x), where g(x) ≠ 0.
📌 Example: Let f(x) = x² + 1 and g(x) = x + 2. Then (f/g)(x) = (x² + 1)/(x + 2) for all x ∈ R where x ≠ -2.
SCALAR MULTIPLICATION
🔑 Definition — Scalar multiplication: Let f: X → R be a real valued function and c be a non-zero real number. Then the scalar multiplication of f is a function c·f: R → R defined by (c·f)(x) = c·f(x) for all x ∈ X.
📌 Example: Let f(x) = x² + 1 and g(x) = x + 2. Then (3f - 2g)(x) = 3(x² + 1) - 2(x + 2) = 3x² - 2x - 1 for all x ∈ X.
EXERCISE: If f: R → R and g: R → R are both one-to-one, is f+g also one-to-one?
Counterexample: Define f(x) = x and g(x) = -x for all x ∈ R. Both f and g are one-to-one. However, (f+g)(x) = x + (-x) = 0 for all x ∈ R. Since (f+g)(1) = 0 and (f+g)(2) = 0 but 1 ≠ 2, f+g is not one-to-one.
EXERCISE: If f: R → R and g: R → R are both onto, is f+g also onto?
Counterexample: Define f(x) = x and g(x) = -x for all x ∈ R. Both f and g are onto. However, (f+g)(x) = 0 for all x ∈ R. Only 0 ∈ R has a pre-image; no non-zero element of the co-domain is the image of any element. Thus f+g is not onto.
EXERCISE: Let f: R → R be a function and c (≠ 0) ∈ R. 1. If f is one-to-one, is c·f also one-to-one? 2. If f is onto, is c·f also onto?
Solution for 1: Yes. Suppose f is one-to-one. Let (c·f)(x₁) = (c·f)(x₂). Then c·f(x₁) = c·f(x₂). Since c ≠ 0, f(x₁) = f(x₂). Since f is one-to-one, x₁ = x₂. Hence c·f is one-to-one.
Solution for 2: Yes. Suppose f is onto. Let y ∈ R. We need x ∈ R such that (c·f)(x) = y. Then c·f(x) = y, so f(x) = y/c. Since f is onto, for y/c ∈ R, there exists x ∈ R such that f(x) = y/c. Hence c·f is onto.
EXERCISE: Zero function
🔑 Definition — Zero function: The real-valued function 0ₓ: X → R defined by 0ₓ(x) = 0 for all x ∈ X is called the zero function (on X).
Proof that f + 0ₓ = f: (f + 0ₓ)(x) = f(x) + 0ₓ(x) = f(x) + 0 = f(x) for all x ∈ X.
Proof that f·0ₓ = 0ₓ: (f·0ₓ)(x) = f(x)·0ₓ(x) = f(x)·0 = 0 = 0ₓ(x) for all x ∈ X.
EXERCISE: Characteristic function
🔑 Definition — Characteristic function: Given a set S and a subset A, the characteristic function of A, denoted χₐ, is the function defined from S to the set {0,1} as:
- χₐ(x) = 1 if x ∈ A
- χₐ(x) = 0 if x ∉ A
Theorem: For all subsets A and B of S:
- χₐₙₐ = χₐ · χₐ
- χₐᵤₐ = χₐ + χₐ - χₐ · χₐ
- χₐ'(x) = 1 - χₐ(x)
Proof of (1): If x ∈ A∩B, then χₐₙₐ(x) = 1, χₐ(x) = 1, χₐ(x) = 1, so χₐₙₐ(x) = 1 = (1)(1) = (χₐ·χₐ)(x). If y ∉ A∩B, then χₐₙₐ(y) = 0 and either χₐ(y) = 0 or χₐ(y) = 0, so χₐₙₐ(y) = 0 = (0)(0) = (χₐ·χₐ)(y). Hence χₐₙₐ = χₐ·χₐ.
EXERCISE: Functions from A = {1,2,3} to A
1. F is reflexive: A function F from A to A is reflexive iff every element is related to itself (aFa for all a ∈ A). Since F is a function, each element maps to a unique element. Hence F must map each element to itself, making F the identity function.
2. G is symmetric: G is symmetric iff whenever aGb then bGa. For a function from A to A, this means G must be both one-to-one and onto (bijective).
3. H is transitive onto function: H is transitive iff whenever aHb and bHc then aHc. For H to be both transitive and onto, H must be the identity function.
FINITE AND INFINITE SETS
🔑 Definition — Finite set: A set is called finite if, and only if, it is the empty set or there is a one-to-one correspondence from {1,2,3,...,n} to it, where n is a positive integer.
🔑 Definition — Infinite set: A non-empty set that cannot be put into one-to-one correspondence with {1,2,3,...,n} for any positive integer n is called infinite.
🔑 Definition — Cardinality: Let A and B be any sets. A has the same cardinality as B if, and only if, there is a one-to-one correspondence from A to B. Cardinality means "the total number of elements in a set."
🔑 Definition — Countable set: A set is countably infinite if, and only if, it has the same cardinality as the set of positive integers Z⁺. A set is called countable if, and only if, it is finite or countably infinite. A set that is not countable is called uncountable.
📌 Example: The set Z of all integers is countable.
Proof: Define f: Z⁺ → Z by:
- f(n) = n/2 if n is an even positive integer
- f(n) = -(n-1)/2 if n is an odd positive integer
f is one-to-one and onto, so Z is countably infinite.
📌 Exercise: Show that 2Z (set of all even integers) is countable.
Proof: Define h: Z → 2Z by h(n) = 2n for all n ∈ Z. h is one-to-one (if h(n₁) = h(n₂) then 2n₁ = 2n₂ so n₁ = n₂) and onto (every even integer 2n is the image of n). Since Z is countable, 2Z is countable.
IMAGE OF A SET
🔑 Definition — Image of a set: Let f: X → Y be a function and A ⊆ X. The image of A under f is denoted and defined as: f(A) = {y ∈ Y | y = f(x) for some x in A}.
📌 Example: Let f: X → Y with X = {1,2,3,4}, Y = {a,b,c}, and f(1)=a, f(2)=b, f(3)=b, f(4)=c. For A = {1,2}, f(A) = {b}. For B = {2,3}, f(B) = {b,c}.
INVERSE IMAGE OF A SET
🔑 Definition — Inverse image of a set: Let f: X → Y be a function and C ⊆ Y. The inverse image of C under f is denoted and defined as: f⁻¹(C) = {x ∈ X | f(x) ∈ C}.
📌 Example: Using the same function as above: For C = {a}, f⁻¹(C) = {1,2}. For D = {b,c}, f⁻¹(D) = {3,4}. For E = {d}, f⁻¹(E) = ∅.
SOME RESULTS ON IMAGES AND INVERSE IMAGES
Let f: X → Y be a function. Let A and B be subsets of X, and C and D be subsets of Y.
- If A ⊆ B then f(A) ⊆ f(B)
- f(A ∪ B) = f(A) ∪ f(B)
- f(A ∩ B) ⊆ f(A) ∩ f(B)
- f(A-B) ⊇ f(A) - f(B)
- If C ⊆ D, then f⁻¹(C) ⊆ f⁻¹(D)
- f⁻¹(C ∪ D) = f⁻¹(C) ∪ f⁻¹(D)
- f⁻¹(C ∩ D) = f⁻¹(C) ∩ f⁻¹(D)
- f⁻¹(C - D) = f⁻¹(C) - f⁻¹(D)
⭐ Key Takeaways
The composition of functions preserves one-to-one and onto properties — if both f and g are one-to-one, gof is one-to-one; if both are onto, gof is onto. Composition is associative, and for bijective functions, the inverse of a composition equals the composition of inverses in reverse order: (gof)⁻¹ = f⁻¹ o g⁻¹. Operations on real-valued functions (sum, difference, product, quotient, scalar multiplication) are defined pointwise, but sums of one-to-one or onto functions do not necessarily preserve those properties (counterexamples with f(x)=x and g(x)=-x). A set is countable if it is finite or has the same cardinality as Z⁺, and the image/inverse image of sets under functions obey important subset relations and distributive laws for union, intersection, and difference.
🧠 Quick Revision Questions
-
Prove that if f: X → Y and g: Y → Z are both one-to-one, then their composition gof is one-to-one.
-
Show by counterexample that the sum of two one-to-one functions from R to R is not necessarily one-to-one.
-
State and prove the formula for the inverse of the composition of two bijective functions.
-
Define the characteristic function of a subset A of S, and prove that χₐₙₐ = χₐ · χₐ.
-
Prove that the set of all even integers 2Z is countable by constructing an explicit bijection.
📘 Lecture 19 — Sequence
📖 Overview: This lecture introduces the concept of a sequence as an ordered list of elements, providing formal definitions, notation, and methods for finding terms using explicit formulas. It covers two important types of sequences—arithmetic and geometric—along with their general terms, examples, and applications, including relevance to computer programming.
🗂️ Topics Covered
The lecture begins with the informal and formal definition of a sequence, followed by notation and explicit formulas for finding terms. It includes multiple examples and exercises for computing terms and finding explicit formulas from given sequences. The second half covers arithmetic sequences (definition, common difference, general term) and geometric sequences (definition, common ratio, general term), each with solved examples and exercises. The lecture concludes with a brief discussion of sequences as one-dimensional arrays in computer programming.
📝 Lecture Summary
SEQUENCE:
A sequence is just a list of elements usually written in a row.
EXAMPLES:
- 1, 2, 3, 4, 5, ...
- 4, 8, 12, 16, 20,...
- 2, 4, 8, 16, 32, ...
- 1, 1/2, 1/3, 1/4, 1/5, ...
- 1, 4, 9, 16, 25, ...
- 1, -1, 1, -1, 1, -1, ... NOTE: The symbol “...” is called ellipsis, and reads “and so forth”.
FORMAL DEFINITION: A sequence is a function whose domain is the set of integers greater than or equal to a particular integer n₀. Usually this set is the set of Natural numbers {1, 2, 3, ...} or the set of whole numbers {0, 1, 2, 3, ...}.
NOTATION: We use the notation aₙ to denote the image of the integer n, and call it a term of the sequence. Thus a₁, a₂, a₃, a₄ ..., aₙ, ... represent the terms of a sequence defined on the set of natural numbers N. A sequence is described by listing the terms in order of increasing subscripts.
FINDING TERMS OF A SEQUENCE GIVEN BY AN EXPLICIT FORMULA:
An explicit formula or general formula for a sequence is a rule that shows how the values of aₖ depends on k.
🔑 Definition — Explicit Formula: A rule that shows how the value of a term aₖ depends on k.
EXAMPLE: Define a sequence a₁, a₂, a₃, ... by the explicit formula aₖ = k/(k+1) for all integers k ≥ 1. The first four terms are: a₁ = 1/(1+1) = 1/2 a₂ = 2/(2+1) = 2/3 a₃ = 3/(3+1) = 3/4 a₄ = 4/(4+1) = 4/5
EXAMPLE: Write the first four terms of the sequence defined by the formula bⱼ = 1 + 2ʲ, for all integers j ≥ 0. b₀ = 1 + 2⁰ = 1 + 1 = 2 b₁ = 1 + 2¹ = 1 + 2 = 3 b₂ = 1 + 2² = 1 + 4 = 5 b₃ = 1 + 2³ = 1 + 8 = 9 REMARK: The formula bⱼ = 1 + 2ʲ , for all integers j ≥ 0 defines an infinite sequence having infinite number of values.
EXERCISE: Compute the first six terms of the sequence defined by the formula Cₙ = 1+ (-1)ⁿ for all integers n ≥ 0. C₀ = 1 + (-1)⁰ = 1 + 1 = 2 C₁ = 1 + (-1)¹ = 1 + (-1) = 0 C₂ = 1 + (-1)² = 1 + 1 = 2 C₃ = 1 + (-1)³ = 1 + (-1) = 0 C₄ = 1 + (-1)⁴ = 1 + 1 = 2 C₅ = 1 + (-1)⁵ = 1 + (-1) = 0 REMARK:
- If n is even, then Cₙ = 2 and if n is odd, then Cₙ = 0. Hence, the sequence oscillates endlessly between 2 and 0.
- An infinite sequence may have only a finite number of values.
EXAMPLE: Write the first four terms of the sequence defined by Cₙ = ((-1)ⁿ n)/(n+1) for all integers n ≥ 1. C₁ = ((-1)¹(1))/(1+1) = -1/2 C₂ = ((-1)²(2))/(2+1) = 2/3 C₃ = ((-1)³(3))/(3+1) = -3/4 C₄ = ((-1)⁴(4))/(4+1) = 4/5 🔑 Definition — Alternating sequence: A sequence whose terms alternate in sign.
EXERCISE: Find explicit formulas for sequences with the initial terms given:
-
0, 1, -2, 3, -4, 5, ... SOLUTION: aₙ = (-1)ⁿ⁺¹ n for all integers n ≥ 0
-
1 - 1/2, 1/2 - 1/3, 1/3 - 1/4, 1/4 - 1/5, ... SOLUTION: bₖ = 1/k - 1/(k+1) for all integers k ≥ 1
-
2, 6, 12, 20, 30, 42, 56, ... SOLUTION: Cₙ = n (n + 1) for all integers n ≥ 1
-
1/4, 2/9, 3/16, 4/25, 5/36, 6/49, ... SOLUTION: dᵢ = i/(i+1)² for all integers i ≥ 1 OR dⱼ = (j+1)/(j+2)² for all integers j ≥ 0
ARITHMETIC SEQUENCE:
🔑 Definition — Arithmetic sequence: A sequence in which every term after the first is obtained from the preceding term by adding a constant number. Also called arithmetic progression (A.P.). The constant number is called the common difference, commonly denoted by “d”. 📌 Example: 5, 9, 13, 17, ... (common difference = 4) 📌 Example: 0, -5, -10, -15, ... (common difference = -5) 📌 Example: x + a, x + 3a, x + 5a, ... (common difference = 2a)
GENERAL TERM OF AN ARITHMETIC SEQUENCE: Let a be the first term and d be the common difference of an arithmetic sequence. Then the sequence is a, a+d, a+2d, a+3d, ... 📐 Formula: aₙ = a + (n - 1)d for all integers n ≥ 1
EXAMPLE: Find the 20th term of the arithmetic sequence 3, 9, 15, 21, ... Here a = 3, d = 9 - 3 = 6, n = 20. a₂₀ = 3 + (20 - 1)6 = 3 + 114 = 117
EXAMPLE: Which term of the arithmetic sequence 4, 1, -2, ..., is -77? Here a = 4, d = 1 - 4 = -3, aₙ = -77. -77 = 4 + (n - 1)(-3) -81 = (n - 1)(-3) n - 1 = 27 n = 28 Hence -77 is the 28th term.
EXERCISE: Find the 36th term of the arithmetic sequence whose 3rd term is 7 and 8th term is 17. Let a be the first term and d the common difference. a₃ = a + 2d = 7 ...(1) a₈ = a + 7d = 17 ...(2) Subtracting (1) from (2): 10 = 5d ⇒ d = 2 Substituting in (1): 7 = a + 2(2) ⇒ a = 3 Thus aₙ = 3 + (n - 1)2 a₃₆ = 3 + (36 - 1)2 = 3 + 70 = 73
GEOMETRIC SEQUENCE:
🔑 Definition — Geometric sequence: A sequence in which every term after the first is obtained from the preceding term by multiplying it with a constant number. Also called geometric progression (G.P.). The constant number is called the common ratio, commonly denoted by “r”. 📌 Example: 1, 2, 4, 8, 16, ... (common ratio = 2) 📌 Example: 3, -3/2, 3/4, -3/8, ... (common ratio = -1/2) 📌 Example: 0.1, 0.01, 0.001, 0.0001, ... (common ratio = 0.1)
GENERAL TERM OF A GEOMETRIC SEQUENCE: Let a be the first term and r be the common ratio of a geometric sequence. Then the sequence is a, ar, ar², ar³, ... 📐 Formula: aₙ = arⁿ⁻¹ for all integers n ≥ 1
EXAMPLE: Find the 8th term of the geometric sequence 4, 12, 36, 108, ... Here a = 4, r = 12/4 = 3, n = 8. a₈ = 4(3)⁸⁻¹ = 4(3⁷) = 4(2187) = 8748
EXAMPLE: Which term of the geometric sequence is 1/8 if the first term is 4 and common ratio 1/2? Given a = 4, r = 1/2, aₙ = 1/8. 1/8 = 4(1/2)ⁿ⁻¹ 1/32 = (1/2)ⁿ⁻¹ (1/2)⁵ = (1/2)ⁿ⁻¹ n - 1 = 5 n = 6 Hence 1/8 is the 6th term.
EXERCISE: Write the geometric sequence with positive terms whose second term is 9 and fourth term is 1. Let a be the first term and r the common ratio. a₂ = ar = 9 ...(1) a₄ = ar³ = 1 ...(2) Dividing (2) by (1): 1/9 = r² ⇒ r = 1/3 (rejecting r = -1/3 as terms are positive) Substituting in (1): 9 = a(1/3) ⇒ a = 27 Hence the geometric sequence is 27, 9, 3, 1, 1/3, 1/9, ...
SEQUENCES IN COMPUTER PROGRAMMING:
An important data type in computer programming consists of finite sequences known as one-dimensional arrays; a single variable in which a sequence of variables may be stored. EXAMPLE: The names of k students in a class may be represented by an array of k elements “name” as: name[0], name[1], name[2], ..., name[k-1]
⭐ Key Takeaways
A sequence is a function from integers (usually natural numbers) to real numbers, with each term denoted by aₙ. You must be able to compute terms from an explicit formula and find explicit formulas from given terms, recognizing patterns for alternating, arithmetic, and geometric sequences. For arithmetic sequences, the general term formula aₙ = a + (n-1)d allows finding any term when the first term and common difference are known. For geometric sequences, the formula aₙ = arⁿ⁻¹ enables finding any term using the first term and common ratio. The ability to solve for unknown terms like common difference, common ratio, or term number using these formulas is essential for problem-solving.
🧠 Quick Revision Questions
- What is the formal definition of a sequence?
- Write the first five terms of the sequence defined by aₙ = (-1)ⁿ/(n+1) for n ≥ 0.
- Find the 15th term of the arithmetic sequence: 7, 11, 15, 19, ...
- If the 2nd term of a geometric sequence is 6 and the 5th term is 162, find the first term and common ratio.
- What is the relationship between sequences in mathematics and one-dimensional arrays in programming?
📘 Lecture 20 — Series
📖 Overview: This lecture introduces the concept of a series as the sum of terms of a sequence and covers the summation notation (sigma notation) used to represent series compactly. It explores the properties of summations, and provides detailed formulas and methods for computing the sums of arithmetic series and geometric series, including infinite geometric series, which are fundamental for many applications in mathematics and science.
🗂️ Topics Covered
The lecture begins with the definition of a series and summation notation, illustrating how to compute summations and convert between expanded form and summation notation. It then covers transforming sums by a change of variable and the basic properties of summations. The remainder of the lecture is dedicated to deriving and applying the sum formulas for arithmetic series and geometric series, including the sum of an infinite geometric series, and concludes with important sum formulas for powers of natural numbers and their application in summing more complex series.
📝 Lecture Summary
SERIES
The sum of the terms of a sequence forms a series. If (a_1, a_2, a_3, ...) represent a sequence of numbers, then the corresponding series is (a_1 + a_2 + a_3 + ... ).
SUMMATION NOTATION
The capital Greek letter sigma ((\Sigma)) is used to concisely represent a sum. The expression (\sum_{k=1}^n a_k) is a shorthand notation for the sum (a_1 + a_2 + a_3 + ... + a_n). More generally, for integers (m \le n), the summation from (k=m) to (n) of (a_k) is (\sum_{k=m}^n a_k = a_m + a_{m+1} + a_{m+2} + \cdots + a_n). Here, (k) is called the index of the summation, (m) is the lower limit, and (n) is the upper limit.
🔑 Definition — Index: The variable (k) in a summation notation is called the index of summation; it is a dummy variable that can be replaced by any other symbol (e.g., (i) or (j)) without changing the sum.
📌 Example: Let (a_0 = 2, a_1 = 3, a_2 = -2, a_3 = 1, a_4 = 0). (a) (\sum_{i=0}^4 a_i = a_0 + a_1 + a_2 + a_3 + a_4 = 2 + 3 + (-2) + 1 + 0 = 4) (b) (\sum_{j=0}^2 a_{2j} = a_0 + a_2 + a_4 = 2 + (-2) + 0 = 0) (c) (\sum_{k=1}^1 a_k = a_1 = 3)
EXERCISE (Computing Summations)
Compute the summations.
- (\sum_{i=1}^3 (2i - 1) = [2(1)-1] + [2(2)-1] + [2(3)-1] = 1 + 3 + 5 = 9)
- (\sum_{k=-1}^1 (k^3 + 2) = [(-1)^3 + 2] + [0^3 + 2] + [1^3 + 2] = [1] + [2] + [3] = 6)
SUMMATION NOTATION TO EXPANDED FORM
Write the summation (\sum_{i=0}^n \frac{(-1)^i}{i+1}) in expanded form. 📌 Example: (\sum_{i=0}^n \frac{(-1)^i}{i+1} = \frac{(-1)^0}{0+1} + \frac{(-1)^1}{1+1} + \frac{(-1)^2}{2+1} + \frac{(-1)^3}{3+1} + \cdots + \frac{(-1)^n}{n+1} = 1 - \frac{1}{2} + \frac{1}{3} - \frac{1}{4} + \cdots + \frac{(-1)^n}{n+1})
EXPANDED FORM TO SUMMATION NOTATION
Write ( \frac{1}{n} + \frac{2}{n+1} + \frac{3}{n+2} + \cdots + \frac{n+1}{2n} ) using summation notation. 📌 Example: The numerators form an arithmetic sequence (1, 2, 3, ..., n+1), so the k-th term numerator is (k). The denominators form an arithmetic sequence (n, n+1, n+2, ..., 2n), so the k-th term denominator is (n + (k-1) = k + n - 1). Therefore, the k-th term of the series is (\frac{k}{(n-1) + k}). The series is (\sum_{k=1}^{n+1} \frac{k}{(n-1) + k}). A change of index ((k \rightarrow j+1)) yields (\sum_{j=0}^n \frac{j+1}{n+j}).
TRANSFORMING A SUM BY A CHANGE OF VARIABLE
The index of a summation is a dummy variable. Therefore, (\sum_{k=1}^3 k^2 = \sum_{i=1}^3 i^2). Summations can be transformed by substituting a new variable for the index. 📌 Example: Transform (\sum_{i=1}^{n-1} \frac{i}{(n-i)^2}) by making the change of variable (j = i - 1). When (i=1, j=0); when (i=n-1, j=n-2). Thus, (\sum_{i=1}^{n-1} \frac{i}{(n-i)^2} = \sum_{j=0}^{n-2} \frac{j+1}{[n-(j+1)]^2} = \sum_{j=0}^{n-2} \frac{j+1}{(n-j-1)^2}).
PROPERTIES OF SUMMATIONS
The summation operator is linear and has several important properties.
- Sum of sums: (\sum_{k=m}^n (a_k + b_k) = \sum_{k=m}^n a_k + \sum_{k=m}^n b_k)
- Constant multiple: (\sum_{k=m}^n c a_k = c\sum_{k=m}^n a_k), where (c) is a constant.
- Shifting index (add i): (\sum_{k=a-i}^{b-i} (k + i) = \sum_{k=a}^{b} k)
- Shifting index (subtract i): (\sum_{k=a+i}^{b+i} (k - i) = \sum_{k=a}^{b} k)
- Sum of a constant: (\sum_{k=1}^n c = c + c + \cdots + c = nc)
📌 Example: Simplify (\sum_{k=1}^n 3(2k-3) + \sum_{k=1}^n (4-5k)). Using properties 1 and 2, this can be combined into a single summation: (\sum_{k=1}^n [3(2k-3) + (4-5k)] = \sum_{k=1}^n (k - 5) = \sum_{k=1}^n k - \sum_{k=1}^n 5 = \sum_{k=1}^n k - 5n).
ARITHMETIC SERIES
The sum of the terms of an arithmetic sequence forms an arithmetic series (A.S.). In general, if (a) is the first term and (d) is the common difference, the series is (a + (a+d) + (a+2d) + ... ). The (n)th term is (a_n = a + (n-1)d). The sum of the first (n) terms, (S_n), is given by formulas derived by adding the series to itself in reverse order. [ S_n = \frac{n}{2}(a + a_n) = \frac{n}{2}(a + l) ] where (l = a_n) is the last term. [ S_n = \frac{n}{2}[2a + (n-1)d] ]
📌 Example (Sum of first n natural numbers): Find (1 + 2 + 3 + ... + n). This is an A.S. with (a=1, d=1). (S_n = \frac{n}{2}[2(1) + (n-1)1] = \frac{n}{2}(n+1) = \frac{n(n+1)}{2}).
📌 Example (Sum of two-digit odd integers not divisible by 5): Find the sum of two-digit positive integers which are neither divisible by 5 nor by 2. The integers are 11, 13, 17, 19, ..., 97, 99. Grouping in sets of 4 yields a new A.S.: 60, 100, 140, ... , 380. In this A.S., (a=60, d=40, l=380). Find (n): (380 = 60 + (n-1)40 \Rightarrow n=9). (S_9 = \frac{9}{2}(60 + 380) = 1980).
GEOMETRIC SERIES
The sum of the terms of a geometric sequence forms a geometric series (G.S.). In general, if (a) is the first term and (r) is the common ratio, the series is (a + ar + ar^2 + ar^3 + ... ). The (n)th term is (a_n = ar^{n-1}). The sum of the first (n) terms, (S_n), is found by multiplying by (r) and subtracting. [ S_n = a + ar + ... + ar^{n-1}, \quad rS_n = ar + ar^2 + ... + ar^n ] [ S_n - rS_n = a - ar^n \Rightarrow S_n(1-r) = a(1-r^n) ] [ S_n = \frac{a(1-r^n)}{1-r}, \quad r \neq 1 ]
📎 Formula: (S_n = \frac{a(1-r^n)}{1-r}) for the sum of the first (n) terms of a geometric series, where (r \neq 1).
📌 Example: Find the sum of 10 terms of the G.S. (6 - 2 + \frac{2}{3} - \frac{2}{9} + \cdots). (a=6, r = \frac{-2}{6} = -\frac{1}{3}, n=10). (S_{10} = \frac{6(1-(-1/3)^{10})}{1-(-1/3)} = \frac{6(1-1/3^{10})}{1+1/3} = \frac{6(1+1/3^{10})}{4/3}).
INFINITE GEOMETRIC SERIES
For an infinite geometric series (a + ar + ar^2 + ...), if (|r| < 1), the sum of the first (n) terms approaches a finite limit as (n \to \infty). The series is convergent, and its sum (S) is: [ S = \lim_{n \to \infty} S_n = \lim_{n \to \infty} \frac{a(1-r^n)}{1-r} = \frac{a}{1-r} ] If (|r| \ge 1), the sum increases indefinitely and the series is divergent.
📌 Example: Find the sum of the infinite G.S. (\frac{9}{4} + \frac{3}{2} + 1 + \frac{2}{3} + \cdots). (a = \frac{9}{4}, r = \frac{3/2}{9/4} = \frac{2}{3}). Since (|r| < 1), the sum is (S = \frac{a}{1-r} = \frac{9/4}{1-2/3} = \frac{9/4}{1/3} = \frac{27}{4}).
📌 Example: Find a common fraction for the repeating decimal 0.81818181... = (0.\overline{81}). Write as (0.81 + 0.0081 + 0.000081 + ...), an infinite G.S. with (a=0.81, r=0.01). Sum (= \frac{a}{1-r} = \frac{0.81}{1-0.01} = \frac{0.81}{0.99} = \frac{81}{99} = \frac{9}{11}).
IMPORTANT SUMS
Several formulas for sums of powers of natural numbers are provided.
- (\sum_{k=1}^n k = 1 + 2 + 3 + \cdots + n = \frac{n(n+1)}{2})
- (\sum_{k=1}^n k^2 = 1^2 + 2^2 + 3^2 + \cdots + n^2 = \frac{n(n+1)(2n+1)}{6})
- (\sum_{k=1}^n k^3 = 1^3 + 2^3 + 3^3 + \cdots + n^3 = \left[\frac{n(n+1)}{2}\right]^2)
EXERCISE (Summing a Combined Series)
Sum to (n) terms the series (1 \cdot 5 + 5 \cdot 11 + 9 \cdot 17 + ... ). 📌 Example: Find the (k)th term: (T_k = [1 + (k-1)4] \cdot [5 + (k-1)6] = (4k-3)(6k-1) = 24k^2 - 22k + 3). The total sum is (S_n = \sum_{k=1}^n (24k^2 - 22k + 3)). Using the summation properties and the important sums: (S_n = 24\sum_{k=1}^n k^2 - 22\sum_{k=1}^n k + \sum_{k=1}^n 3) (S_n = 24\left[\frac{n(n+1)(2n+1)}{6}\right] - 22\left[\frac{n(n+1)}{2}\right] + 3n) (S_n = n[4(n+1)(2n+1) - 11(n+1) + 3]) (S_n = n[(8n^2 + 12n + 4) - (11n + 11) + 3]) (S_n = n(8n^2 + n - 4))
⭐ Key Takeaways
For the exam, you must be able to fluently translate between summation notation and expanded form. You must know the formulas for the sum of an arithmetic series, (S_n = n/2 [2a + (n-1)d]), and a geometric series, (S_n = a(1-r^n)/(1-r)), and how to identify the parameters (a, d, r), and (n). The formula (S = a/(1-r)) for the sum of a convergent infinite geometric series (where (|r| < 1)) is essential. Additionally, you should memorize and be able to apply the three important sums for (\sum k), (\sum k^2), and (\sum k^3), and use the linear properties of summation to break down and sum more complex series by finding their (k)th term.
🧠 Quick Revision Questions
- Write the summation (\sum_{k=0}^3 (k^2 - 2)) in expanded form and compute its value.
- Convert the series (1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots) (n terms) into summation notation.
- Find the sum of the first 15 terms of the arithmetic series where the first term is 5 and the common difference is 4.
- Determine if the infinite geometric series (4 + 2 + 1 + 0.5 + \cdots) is convergent or divergent. If convergent, find its sum.
- Sum to n terms the series (1 \cdot 2 + 2 \cdot 3 + 3 \cdot 4 + \cdots + n \cdot (n+1)).