Sets, Relations, and Functions - The Building Blocks of Mathematical Reasoning

Mathematics, in its essence, is a discipline of structure, relationships, and transformations. At the very core of this framework lie three interconnected concepts: sets, relations, and functions. These fundamental ideas provide the language and tools to categorize objects, define connections between them, and describe processes of change or mapping. This exploration delves into these foundational elements, examining their definitions, properties, and their pivotal role in constructing more complex mathematical ideas.

---

The Art of Grouping: Sets – Collections and Their Characteristics

A set is one of the most fundamental concepts in mathematics. Intuitively, a set is a well-defined collection of distinct objects, considered as an object in its own right. These objects are called elements or members of the set.

Representation of Sets

There are several ways to represent sets:

1. Roster Form (or Tabular Form): The elements of the set are listed, separated by commas, and enclosed within curly braces {}. For example, the set of the first five natural numbers is $A = \{1, 2, 3, 4, 5\}$. The order of elements does not matter, and repetition of elements is disregarded.
2. Set-Builder Form (or Rule Method): All the elements of a set possess a single common property which is not possessed by any element outside the set. We describe the elements by this property. For example, $A = \{x \mid x \text{ is a natural number and } x < 6\}$. This is read as "the set of all $x$ such that $x$ is a natural number and $x$ is less than 6."
3. Venn Diagrams: Sets can also be represented graphically using Venn diagrams, where sets are typically shown as circles or other closed curves within a universal set (represented by a rectangle).

Basic Set Concepts

• Empty Set (or Null Set, $\emptyset$ or {}): A set containing no elements.
• Universal Set ($U$): A set containing all objects or elements under consideration in a particular context. All other sets in that context are subsets of the universal set.
• Subset ($\subseteq$): Set $A$ is a subset of set $B$ if every element of $A$ is also an element of $B$. We write $A \subseteq B$.
• Proper Subset ($\subset$): Set $A$ is a proper subset of set $B$ if $A \subseteq B$ and $A \neq B$.
• Equality of Sets: Two sets $A$ and $B$ are equal ($A=B$) if they have exactly the same elements.
• Cardinality ($|A|$ or $n(A)$): The number of distinct elements in a finite set $A$.

Set Operations

We can perform various operations on sets:

• Union ($A \cup B$): The set of all elements that are in set $A$, or in set $B$, or in both. $A \cup B = \{x \mid x \in A \text{ or } x \in B\}$.
• Intersection ($A \cap B$): The set of all elements that are in both set $A$ and set $B$. $A \cap B = \{x \mid x \in A \text{ and } x \in B\}$.
• Complement ($A'$ or $A^c$): The set of all elements in the universal set $U$ that are not in set $A$. $A' = \{x \in U \mid x \notin A\}$.
• Difference ($A - B$ or $A \setminus B$): The set of all elements that are in set $A$ but not in set $B$. $A - B = \{x \mid x \in A \text{ and } x \notin B\} = A \cap B'$.
• Symmetric Difference ($A \Delta B$): The set of elements which are in either of the sets, but not in their intersection. $A \Delta B = (A-B) \cup (B-A) = (A \cup B) - (A \cap B)$.
• Cartesian Product ($A \times B$): The set of all possible ordered pairs $(a, b)$ where $a \in A$ and $b \in B$.

Algebraic Properties of Set Operations

Set operations obey several algebraic laws, similar to arithmetic operations:

• Commutative Laws: $A \cup B = B \cup A$; $A \cap B = B \cap A$.
• Associative Laws: $(A \cup B) \cup C = A \cup (B \cup C)$; $(A \cap B) \cap C = A \cap (B \cap C)$.
• Distributive Laws: $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$; $A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$.
• De Morgan's Laws: $(A \cup B)' = A' \cap B'$; $(A \cap B)' = A' \cup B'$.
• Idempotent Laws: $A \cup A = A$; $A \cap A = A$.
• Identity Laws: $A \cup \emptyset = A$; $A \cap U = A$.
• Complement Laws: $A \cup A' = U$; $A \cap A' = \emptyset$; $(A')' = A$.
• Domination Laws: $A \cup U = U$; $A \cap \emptyset = \emptyset$.

Power Set and Principle of Inclusion-Exclusion

• Power Set ($P(A)$): The set of all possible subsets of a set $A$. If $|A|=n$, then $|P(A)| = 2^n$.
• Principle of Inclusion-Exclusion (PIE): A counting technique for finding the number of elements in the union of multiple sets by systematically adding and subtracting the sizes of their intersections to avoid overcounting.
  • For two sets: $|A \cup B| = |A| + |B| - |A \cap B|$.
  • For three sets: $|A \cup B \cup C| = |A| + |B| + |C| - (|A \cap B| + |A \cap C| + |B \cap C|) + |A \cap B \cap C|$.

---

Connecting the Dots: Relations – Defining Relationships

Once we have sets, we often want to describe relationships between their elements, or between elements of different sets. This is where relations come in.

• A binary relation $R$ from a set $A$ to a set $B$ is a subset of the Cartesian product $A \times B$. If $(a,b) \in R$, we say that "$a$ is related to $b$" and write $aRb$. If $A=B$, the relation is on the set $A$.

• An n-ary relation is a generalization, defined as a subset of the Cartesian product of $n$ sets, $A_1 \times A_2 \times \dots \times A_n$.

• Domain of a Relation: The set of all first elements of the ordered pairs in $R$. Domain$(R) = \{a \mid (a,b) \in R \text{ for some } b \in B\}$.

• Range of a Relation: The set of all second elements of the ordered pairs in $R$. Range$(R) = \{b \mid (a,b) \in R \text{ for some } a \in A\}$.

Representations of Relations

Binary relations can be represented in several ways:

• As a set of ordered pairs: e.g., $R = \{(1,a), (1,b), (2,c)\}$.
• By a Matrix (0-1 Matrix): For a relation $R$ from finite set $A$ to finite set $B$, a matrix $M$ can be defined where $M_{ij} = 1$ if $(a_i, b_j) \in R$, and $M_{ij} = 0$ otherwise.
• By a Graph (Directed Graph): For a relation on a set $A$, we can draw a directed graph where the vertices represent the elements of $A$, and a directed edge from vertex $a$ to vertex $b$ exists if and only if $(a,b) \in R$.

Types of Relations (on a set $A$)

Certain types of relations defined on a single set $A$ (i.e., $R \subseteq A \times A$) are particularly important:

• Reflexive: A relation $R$ on $A$ is reflexive if every element in $A$ is related to itself. That is, for all $a \in A$, $(a,a) \in R$.
• Symmetric: A relation $R$ on $A$ is symmetric if whenever $a$ is related to $b$, then $b$ is also related to $a$. That is, if $(a,b) \in R$, then $(b,a) \in R$.
• Transitive: A relation $R$ on $A$ is transitive if whenever $a$ is related to $b$ and $b$ is related to $c$, then $a$ is also related to $c$. That is, if $(a,b) \in R$ and $(b,c) \in R$, then $(a,c) \in R$.
• Antisymmetric: A relation $R$ on $A$ is antisymmetric if whenever $a$ is related to $b$ and $b$ is related to $a$, then $a$ must be equal to $b$. That is, if $(a,b) \in R$ and $(b,a) \in R$, then $a=b$. (Note: this is different from not symmetric).

Closures of Relations

The closure of a relation $R$ with respect to a property (e.g., reflexivity) is the smallest relation $R'$ that contains $R$ and has that property.

• Reflexive Closure: $R \cup \{(a,a) \mid a \in A\}$.
• Symmetric Closure: $R \cup R^{-1}$, where $R^{-1} = \{(b,a) \mid (a,b) \in R\}$.
• Transitive Closure: The smallest transitive relation containing $R$. It can be found by repeatedly adding pairs required for transitivity.

Equivalence Relations

An equivalence relation is a binary relation on a set that satisfies all three of the following properties:

1. Reflexive
2. Symmetric
3. Transitive

Equivalence relations are fundamental because they partition a set into disjoint subsets called equivalence classes. Each equivalence class consists of all elements that are related to each other. For example, the relation "has the same birthday month as" on a set of people is an equivalence relation, partitioning people into 12 equivalence classes.

---

The Mathematical Machines: Functions – Rules of Correspondence

A function is a special type of relation that maps elements from one set (the domain) to elements of another set (the codomain) in a specific way: each input from the domain is associated with exactly one output in the codomain.

• Definition: A function $f$ from a set $A$ to a set $B$, denoted $f: A \to B$, is a relation such that for every $a \in A$, there is exactly one $b \in B$ for which $(a,b) \in f$. We write $f(a)=b$, where $b$ is the image of $a$ under $f$.
• Representation as a Set of Ordered Pairs: Since a function is a relation, it can be represented as a set of ordered pairs $(a,b)$ where $a \in A$, $b \in B$, and each $a$ appears as the first element in exactly one pair.
• Domain, Codomain, and Range:
  • Domain ($A$): The set of all possible input values.
  • Codomain ($B$): The set of all possible output values specified in the function's definition.
  • Range (or Image): The set of all actual output values that $f$ produces. The range is a subset of the codomain. Range$(f) = \{f(a) \mid a \in A\}$.
• Vertical Line Test: For a graph in the Cartesian plane to represent a function $y=f(x)$, any vertical line must intersect the graph at most once. This ensures that each $x$-value (input) has only one $y$-value (output).

---

A Parade of Personalities: Types of Functions – A Diverse Cast

Functions come in many varieties, each with its unique characteristics and applications.

Algebraic Functions

These are functions that can be defined using algebraic operations (addition, subtraction, multiplication, division, raising to a power, and taking roots).

• Polynomial Functions: $f(x) = a_n x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0$. Examples: linear functions ($f(x)=mx+c$), quadratic functions ($f(x)=ax^2+bx+c$), cubic functions.
• Rational Functions: Ratios of two polynomial functions, $f(x) = P(x)/Q(x)$, where $Q(x) \neq 0$.
• Root Functions (or Radical Functions): Functions involving roots, e.g., $f(x) = \sqrt{x}$, $f(x) = \sqrt[3]{x}$.

Transcendental Functions

These are non-algebraic functions.

• Exponential Functions: $f(x) = b^x$, where the base $b$ is a positive constant ($b \neq 1$). The most common base is Euler's number, $e \approx 2.71828$, giving $f(x)=e^x$. Properties: Domain $\mathbb{R}$, Range $(0, \infty)$. $b^x b^y = b^{x+y}$, $(b^x)^y = b^{xy}$.
• Logarithmic Functions: The inverse of exponential functions. $f(x) = \log_b x$ (read "log base $b$ of $x$") is equivalent to $b^y = x$. The common logarithm uses base 10 ($\log x$), and the natural logarithm uses base $e$ ($\ln x$). Properties: Domain $(0, \infty)$, Range $\mathbb{R}$. $\log_b(xy) = \log_b x + \log_b y$, $\log_b(x/y) = \log_b x - \log_b y$, $\log_b(x^p) = p \log_b x$.
• Trigonometric Functions (or Circular Functions): Relate angles of a right triangle to ratios of its sides, or defined using the unit circle.
  • Sine ($\sin x$), Cosine ($\cos x$), Tangent ($\tan x = \sin x / \cos x$).
  • Cosecant ($\csc x = 1/\sin x$), Secant ($\sec x = 1/\cos x$), Cotangent ($\cot x = 1/\cos x$).
  Properties: Periodic, specific domains and ranges, many identities (e.g., $\sin^2 x + \cos^2 x = 1$).
• Inverse Trigonometric Functions: These "undo" the trigonometric functions, giving an angle for a given ratio.
  • $\arcsin x$ (or $\sin^{-1} x$), $\arccos x$ (or $\cos^{-1} x$), $\arctan x$ (or $\tan^{-1} x$), etc.
  Properties: Their ranges are restricted to principal value ranges to make them functions (e.g., $\arcsin x$ has range $[-\pi/2, \pi/2]$).
• Permutation Functions: A permutation of a finite set $A$ is a bijective function from $A$ to itself. It represents a rearrangement of the elements of the set.
• Piecewise Functions: Functions defined by different expressions over different intervals. For example:
  $$f(x) = \begin{cases} x^2 & \text{if } x < 0 \\ x + 1 & \text{if } x \geq 0 \end{cases}$$
• Step Functions: A type of piecewise function that is constant over intervals. The most common example is the floor function ($\lfloor x \rfloor$), which rounds down to the nearest integer, and the ceiling function ($\lceil x \rceil$), which rounds up to the nearest integer.
• Sign Function: The sign function, denoted $\text{sgn}(x)$, is defined as:
  $$\text{sgn}(x) = \begin{cases} -1 & \text{if } x < 0 \\ 0 & \text{if } x = 0 \\ 1 & \text{if } x > 0 \end{cases}$$
  It indicates the sign of a real number.
• Absolute Value Function: The absolute value function, denoted $|x|$, is defined as:
  $$|x| = \begin{cases} x & \text{if } x \geq 0 \\ -x & \text{if } x < 0 \end{cases}$$
  It gives the non-negative value of $x$ regardless of its sign.
• Greatest Integer Function: The greatest integer function, denoted $\lfloor x \rfloor$, returns the largest integer less than or equal to $x$. For example, $\lfloor 3.7 \rfloor = 3$ and $\lfloor -2.3 \rfloor = -3$.
• Least Integer Function: The least integer function, denoted $\lceil x \rceil$, returns the smallest integer greater than or equal to $x$. For example, $\lceil 3.7 \rceil = 4$ and $\lceil -2.3 \rceil = -2$.
• Hyperbolic Functions: Analogous to trigonometric functions but based on hyperbolas rather than circles.
  • Hyperbolic sine ($\sinh x = \frac{e^x - e^{-x}}{2}$), Hyperbolic cosine ($\cosh x = \frac{e^x + e^{-x}}{2}$), Hyperbolic tangent ($\tanh x = \frac{\sinh x}{\cosh x}$).
  • Inverse hyperbolic functions: $\text{arsinh} x$, $\text{arcosh} x$, $\text{artanh} x$, etc.
• Logistic Function: A specific type of sigmoid function, often used in statistics and machine learning, defined as: $f(x) = \frac{1}{1 + e^{-x}}$ It has a characteristic S-shaped curve and is bounded between 0 and 1.
• Sigmoid Function: A general class of functions that have an S-shaped curve, often used in neural networks and statistics. The logistic function is a specific example of a sigmoid function.
• Gamma Function: An extension of the factorial function to complex numbers, defined as: $\Gamma(n) = \int_0^\infty t^{n-1} e^{-t} dt$ For positive integers, $\Gamma(n) = (n-1)!$.
• Beta Function: A special function defined as: $B(x, y) = \int_0^1 t^{x-1} (1-t)^{y-1} dt$ It is related to the gamma function and has applications in probability and statistics.

---

Function ID Check: Properties of Functions – How They Behave

Functions can be classified based on how their elements map from the domain to the codomain, and based on their symmetry.

Mappings: Injective, Surjective, Bijective

• Injective (One-to-One) Function: A function $f: A \to B$ is injective if every distinct element in the domain $A$ maps to a distinct element in the codomain $B$. That is, if $f(a_1) = f(a_2)$, then $a_1=a_2$. No two inputs share the same output.
  • Horizontal Line Test: A function is one-to-one if and only if no horizontal line intersects its graph more than once.
• Surjective (Onto) Function: A function $f: A \to B$ is surjective if every element in the codomain $B$ is the image of at least one element in the domain $A$. That is, the range of $f$ is equal to its codomain. Every possible output is actually produced.
• Bijective Function (One-to-One Correspondence): A function $f: A \to B$ is bijective if it is both injective (one-to-one) and surjective (onto). This means every element in $A$ maps to a unique element in $B$, and every element in $B$ is mapped to by exactly one element in $A$.

Symmetry: Even and Odd Functions

• Even Function: A function $f(x)$ is even if $f(-x) = f(x)$ for all $x$ in its domain. The graph of an even function is symmetric with respect to the y-axis. Example: $f(x) = x^2$, $f(x) = \cos x$.
• Odd Function: A function $f(x)$ is odd if $f(-x) = -f(x)$ for all $x$ in its domain. The graph of an odd function is symmetric with respect to the origin (rotation by $180^\circ$). Example: $f(x) = x^3$, $f(x) = \sin x$. (Note: Most functions are neither even nor odd).

Extension of Functions and their Properties

A function $f$ defined on a domain $D$ can sometimes be "extended" to a larger domain $D' \supset D$. A common use of this concept is creating an even extension or an odd extension of a function initially defined only for $x \ge 0$ (or on an interval like $[0, L]$).

• Even Extension: If $f(x)$ is defined for $x \ge 0$, its even extension $f_e(x)$ to all $\mathbb{R}$ (or a symmetric interval) is defined as: $f_e(x) = f(x)$ for $x \ge 0$ $f_e(x) = f(-x)$ for $x < 0$. The resulting function $f_e(x)$ is an even function.
• Odd Extension: If $f(x)$ is defined for $x \ge 0$ (and typically $f(0)=0$ for a well-behaved odd extension), its odd extension $f_o(x)$ is: $f_o(x) = f(x)$ for $x > 0$ $f_o(x) = 0$ for $x = 0$ $f_o(x) = -f(-x)$ for $x < 0$. The resulting function $f_o(x)$ is an odd function.

These extensions are particularly useful in Fourier series analysis.

Order and Structure: Posets and Lattices

• Partial Ordering Relation (Poset): A binary relation on a set that is reflexive, antisymmetric, and transitive is called a partial order. A set equipped with a partial order is called a partially ordered set (poset). Unlike a total order, not every pair of elements in a poset needs to be comparable.
  • Example: The "divisibility" relation on the set of positive integers. $3|6$ and $3|9$, but 6 and 9 are not comparable.
• Hasse Diagram: A graphical representation of a finite poset. It is a directed graph where:
  • Vertices are elements of the set.
  • An edge goes upward from $x$ to $y$ if $y$ covers $x$ (i.e., $x \le y$ and there is no $z$ such that $x < z < y$).
  • Loops for reflexivity and edges implied by transitivity are omitted for simplicity.
• Lattice: A lattice is a poset in which every pair of elements has a unique supremum (least upper bound, or join) and a unique infimum (greatest lower bound, or meet). Lattices represent structures where elements have well-defined "common superiors" and "common subordinates."

---

The Rhythm of Patterns: Recurrence Relations

A recurrence relation is an equation that defines a sequence recursively; each term of the sequence is defined as a function of the preceding terms.

Discrete Numeric Functions and Generating Functions

• Discrete Numeric Function: Another term for a sequence $\{a_n\}$.
• Generating Function: A powerful tool for analyzing sequences. The generating function for a sequence $\{a_n\}_{n=0}^\infty$ is the formal power series: $G(x) = \sum_{n=0}^{\infty} a_n x^n$ This function "encodes" the entire sequence into a single algebraic object, which can then be manipulated.

Linear Recurrence Relations with Constant Coefficients

This is an important class of recurrence relations of the form: $a_n = c_1 a_{n-1} + c_2 a_{n-2} + \dots + c_k a_{n-k} + F(n)$ where $c_i$ are constants.

• If $F(n)=0$, the relation is homogeneous.
• If $F(n) \neq 0$, it is non-homogeneous.

Solution of Homogeneous Linear Recurrence Relations: The general solution is found by solving the characteristic equation.

1. Form the Characteristic Equation: For a recurrence relation $a_n - c_1 a_{n-1} - \dots - c_k a_{n-k} = 0$, assume a solution of the form $a_n = r^n$. Substituting this leads to the characteristic polynomial: $r^k - c_1 r^{k-1} - c_2 r^{k-2} - \dots - c_k = 0$
2. Find the Roots: Find the roots ($r_1, r_2, \ldots, r_k$) of this polynomial.
3. Construct the General Solution:
   • Case 1 (Distinct Roots): If all roots $r_1, \ldots, r_k$ are distinct, the general solution is: $a_n = \alpha_1 r_1^n + \alpha_2 r_2^n + \dots + \alpha_k r_k^n$
   • Case 2 (Repeated Roots): If a root $r_1$ has multiplicity $m$, its contribution to the solution is a polynomial in $n$ of degree $m-1$, multiplied by $r_1^n$: $(\alpha_1 + \alpha_2 n + \alpha_3 n^2 + \dots + \alpha_m n^{m-1}) r_1^n$
   The constants $\alpha_i$ are determined by the initial conditions of the sequence.

Solution by using Generating Functions:

1. Define $G(x) = \sum a_n x^n$.
2. Multiply the recurrence relation by $x^n$ and sum over all valid $n$.
3. Manipulate the resulting sums to express them in terms of $G(x)$ and known initial values. This yields an algebraic equation for $G(x)$.
4. Solve for $G(x)$.
5. Expand $G(x)$ (often using partial fractions) back into a power series to find an explicit formula for the coefficient $a_n$.

Periodic Functions – The Never-Ending Cycle

A function $f(x)$ is periodic if there exists a positive constant $T$ such that $f(x+T) = f(x)$ for all $x$ in the domain of $f$. The smallest such positive value $T$ is called the fundamental period of the function.

• Characteristics: Periodic functions repeat their values in regular intervals (periods).
• Examples: Trigonometric functions are classic examples. $\sin x$ and $\cos x$ have a fundamental period of $2\pi$. $\tan x$ has a fundamental period of $\pi$.
• If a function has period $T$, then $nT$ for any integer $n$ is also a period, but the fundamental period is the smallest positive one.

Composite Functions – Functions Within Functions

A composite function is created when one function is applied to the result of another function. If $f: B \to C$ and $g: A \to B$ are two functions, then the composite function $f \circ g$ (read "f composed with g") is defined as: $(f \circ g)(x) = f(g(x))$ The domain of $f \circ g$ consists of those $x$ in the domain of $g$ for which $g(x)$ is in the domain of $f$.

• Properties:
  • Function composition is associative: $(f \circ g) \circ h = f \circ (g \circ h)$.
  • Function composition is not generally commutative: $f \circ g \neq g \circ f$.

---

Undoing the Doing: Inverse Functions – Reversing the Process

An inverse function, denoted $f^{-1}$, "reverses" the effect of a function $f$. If $f$ maps $a$ to $b$ (i.e., $f(a)=b$), then $f^{-1}$ maps $b$ back to $a$ (i.e., $f^{-1}(b)=a$).

• Conditions for Existence: For a function $f: A \to B$ to have an inverse function $f^{-1}: B \to A$, the function $f$ must be bijective (both one-to-one and onto).
  • If $f$ is not one-to-one, then two different inputs map to the same output, so the inverse wouldn't know where to map that output back to uniquely.
  • If $f$ is not onto, then there are elements in the codomain $B$ that are not outputs of $f$, so $f^{-1}$ would not be defined for those elements if its domain is $B$. (Typically, we consider the inverse $f^{-1}$ mapping from Range($f$) back to $A$ if $f$ is only injective).
• Computation/Finding the Inverse:
  1. Write $y = f(x)$.
  2. Swap $x$ and $y$ to get $x = f(y)$.
  3. Solve for $y$. The resulting expression for $y$ is $f^{-1}(x)$.
• Properties:
  • $(f^{-1} \circ f)(x) = x$ for all $x$ in Domain($f$).
  • $(f \circ f^{-1})(y) = y$ for all $y$ in Range($f$) (which is Domain($f^{-1}$)).
• Graph of an Inverse Function: The graph of $y=f^{-1}(x)$ is the reflection of the graph of $y=f(x)$ across the line $y=x$.

---

The "Do Nothing" Special: Identity Function – Keeping It Real (or the Same)

The identity function on a set $A$, denoted $I_A: A \to A$ (or just $I$), is the function that maps every element to itself: $I(x) = x$

• Significance:
  • It's a simple but fundamental function.
  • It acts as an identity element for function composition: For any function $f: A \to B$, we have $f \circ I_A = f$ and $I_B \circ f = f$.
  • The composition of a function and its inverse yields an identity function (on the appropriate domain/range): $f^{-1} \circ f = I_A$ and $f \circ f^{-1} = I_{\text{Range}(f)}$.

---

Shape Shifters: Transformation of Functions – Moving and Stretching Graphs

We can create new functions from existing ones by applying various transformations, which correspond to geometric transformations of their graphs: Let $y=f(x)$ be the original function and $c > 0$.

• Vertical Shifts:
  • $g(x) = f(x) + c$: Shifts the graph of $f$ upwards by $c$ units.
  • $g(x) = f(x) - c$: Shifts the graph of $f$ downwards by $c$ units.
• Horizontal Shifts:
  • $g(x) = f(x - c)$: Shifts the graph of $f$ to the right by $c$ units.
  • $g(x) = f(x + c)$: Shifts the graph of $f$ to the left by $c$ units.
• Vertical Stretches/Compressions: (Assume $c > 0$)
  • $g(x) = c f(x)$: If $c > 1$, stretches the graph of $f$ vertically by a factor of $c$. If $0 < c < 1$, compresses it vertically.
• Horizontal Stretches/Compressions: (Assume $c > 0$)
  • $g(x) = f(cx)$: If $c > 1$, compresses the graph of $f$ horizontally by a factor of $1/c$. If $0 < c < 1$, stretches it horizontally by $1/c$.
• Reflections:
  • $g(x) = -f(x)$: Reflects the graph of $f$ across the x-axis.
  • $g(x) = f(-x)$: Reflects the graph of $f$ across the y-axis.

These transformations can be combined to produce more complex graph manipulations.

---

Key Takeaways: The Cornerstones of Mathematical Structure

Our journey through sets, relations, and functions has illuminated the fundamental ways mathematicians organize, connect, and transform concepts.

• Sets as Foundations: Sets are the basic collections of objects, described and manipulated using operations like union, intersection, and complement, all governed by consistent algebraic properties. The power set reveals the totality of an object's sub-collections.
• Relations Define Connections: Relations, as subsets of Cartesian products, formally define how elements within or between sets are associated. Equivalence relations are particularly powerful for partitioning sets into meaningful classes.
• Functions as Mappings: Functions are specialized relations that uniquely map each element of a domain to an element in a codomain, forming the basis for describing processes, transformations, and dependencies.
• Diversity of Functions: From algebraic (polynomials, rationals) to transcendental (exponential, logarithmic, trigonometric), each type of function has unique characteristics and models different real-world phenomena.
• Functional Properties: Understanding whether a function is injective (one-to-one), surjective (onto), or bijective (a perfect pairing) is crucial for analyzing its behavior, particularly for the existence of inverse functions. Symmetry properties like even and odd functions simplify analysis.
• Dynamics of Functions: Periodic functions repeat in cycles. Composite functions allow for building complex operations from simpler ones. Inverse functions reverse a function's mapping. The identity function acts as a neutral mapping. Transformations allow us to manipulate and understand families of functions based on a parent function.

These concepts – sets, relations, and functions – are not just abstract definitions; they are the essential toolkit used across all branches of mathematics and its applications, providing precision, structure, and a powerful language for describing the world.