Chapter 1 — Sets and Functions

What is a set? A set is a collection of well-defined, distinct objects called elements. The idea is simple: we group together items that satisfy a property or belong to a chosen collection. Sets are denoted by capital letters and listed using braces { }. For instance, A = {2, 4, 6} is the set of even numbers less than 7. The objects inside may be numbers, letters, people, shapes or any clearly defined items.

Ways to describe a set include listing its elements (roster form) or giving a rule that characterises its members (set‑builder form). Roster form: B = {a, e, i, o, u}. Set‑builder form: C = {x ∈ N : x is prime and x < 20}. When using set‑builder notation, it is important to state the universe or the type of objects considered (N, Z, R, etc.) otherwise the description is ambiguous.

Empty set and singleton The empty set, denoted ∅, contains no elements. A singleton is a set with exactly one element, e.g., {0}. Always remember that order does not matter in a set: {1,2} = {2,1}, and repeated entries are ignored: {1,1,2} = {1,2}.

Membership and notation We use the symbol ∈ to denote membership: if 3 ∈ A then 3 is an element of A; 5 ∉ A means 5 is not in A. Standard named sets often used are N (natural numbers), Z (integers), Q (rationals), R (reals). Awareness of these sets helps in defining domain and codomain when later we work with functions.

Equality of sets Two sets are equal when they have precisely the same elements. This can be checked element-wise: A = B if for every x, x ∈ A implies x ∈ B and x ∈ B implies x ∈ A. This logical notion is the foundation for many proofs you will meet: to show two set expressions are equal, show mutual inclusion.

Subsets A is a subset of B, written A ⊆ B, if every element of A is also an element of B. If A ⊆ B but A ≠ B, then A is a proper subset (A ⊂ B). Note that ∅ ⊆ A for any A. Recognising subsets is useful in counting problems and for constructing power sets.

Why learn sets? Sets provide the language for mathematics: functions, relations, sequences and probability are all stated using sets. Clear notation and careful thinking about membership, equality and subsets will make algebraic proofs and reasoning precise. Early practice in writing and manipulating sets builds habits that are used in advanced topics such as functions, relations, and calculus.

Two common descriptions are roster form and set‑builder form. Roster form lists every element: A = {2, 4, 6}. Set‑builder form describes a property: B = {x ∈ Z : −2 ≤ x ≤ 2} = {−2, −1, 0, 1, 2}. In set‑builder notation we normally include the universe (Z, N, R) to avoid ambiguity. A constructive description gives a rule to generate elements, for example C = {2k : k ∈ N} specifies the even natural numbers. When using constructive rules, check that the rule does not produce duplicates or elements outside the intended universe.

Equality by mutual inclusion To prove two sets A and B are equal, show A ⊆ B and B ⊆ A. This is done by element‑wise arguments. Start by letting x be an arbitrary element of A and prove x ∈ B using the defining properties. Then repeat with x ∈ B to show x ∈ A. This method is rigorous and widely used for identities with unions, intersections and complements.

Common pitfalls include failing to specify the universe or giving informal descriptions like ‘large numbers’ which are not well‑defined. Also remember that order and repetition do not matter in sets: {1,2,2,3} is the same as {3,2,1}. When sets are infinite, listing elements is impossible; set‑builder or rule form must be used carefully.

Working with symbolic descriptions When a set is described by a condition such as {x : P(x)}, translate P(x) into logical form and work element‑wise. For example, to show {x ∈ R : x^2 < 1} ⊆ {x ∈ R : |x| < 1}, pick x with x^2 < 1 and deduce |x| < 1 by taking square roots and using nonnegativity of |x|. Conversely show the reverse inclusion if needed.

Examples of proofs are straightforward once you adopt the mutual inclusion approach. For instance, to show {x ∈ Z : x^2 = 4} = {−2, 2}, start by letting x be in the left set: x is integer with x^2 = 4, so x = ±2, hence x ∈ {−2,2}. Next, show both −2 and 2 satisfy x^2 = 4 so they belong to the left set. Both inclusions give equality.

Practical tips: always state the universe, pick arbitrary elements for proofs, and clearly indicate which direction of inclusion you are proving. This structure keeps proofs organized and acceptable at board standard examinations.

Fundamental operations allow us to form new sets from existing ones. The union A ∪ B is the set of elements that belong to A or B or both. The intersection A ∩ B is the set of elements common to both. The set difference A \ B (read A minus B) is the set of elements that are in A but not in B. Each operation has a clear element‑wise definition: x ∈ A ∪ B ⇔ x ∈ A ∨ x ∈ B, x ∈ A ∩ B ⇔ x ∈ A ∧ x ∈ B, x ∈ A \ B ⇔ x ∈ A ∧ x ∉ B.

Properties mimic arithmetic laws: union and intersection are commutative and associative: A ∪ B = B ∪ A, A ∩ B = B ∩ A, and parentheses can be rearranged for multiple unions or intersections. Distributive laws connect union and intersection: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) and A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C). These identities are proved by mutual inclusion and are central when simplifying set expressions.

Complements and De Morgan's laws When working inside a universal set U, the complement A' = U \ A contains all elements of U not in A. De Morgan's laws state (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'. These follow directly from logical equivalences: not (P or Q) ⇔ (not P) and (not Q), etc. De Morgan's laws are frequently used to transform unions into intersections and vice versa, simplifying set expressions or proving identities.

Using difference is different from intersection with complement: A \ B = A ∩ B'. Note that set difference is not commutative: generally A \ B ≠ B \ A. Also A \ (B ∪ C) = (A \ B) ∩ (A \ C) and A \ (B ∩ C) = (A \ B) ∪ (A \ C). These identities are proven by element-wise arguments and are useful in problem solving.

Techniques for proofs For any identity, pick an arbitrary element x and show it belongs to the left side if and only if it belongs to the right side. Alternatively, use Venn diagrams to visualise regions and then convert that intuition into an element-wise argument for a formal proof. Clear reasoning about logical connectives (and, or, not) maps directly to set operations and helps avoid mistakes.

Examples and practice with finite sets help build confidence: compute unions, intersections and differences of small sets; apply De Morgan to complements; and check non‑commutativity of difference by simple counterexamples. Regular practice will make manipulation of set expressions second nature, an essential skill for proofs and exams.

What are Venn diagrams? Venn diagrams are pictorial representations that use overlapping circles within a rectangle to show relationships among sets. The rectangle represents the universal set U. Each circle stands for a set. For two sets, the diagram has three regions: elements only in A, only in B, and in both (A ∩ B). For three sets, there are seven distinct regions: elements exclusive to each set, elements in each pairwise overlap but not the third, and elements common to all three.

Why use Venn diagrams? They help visualise how elements are shared among sets and provide a clear way to convert word problems into algebraic equations. Many survey or counting problems describe how many people like different subjects or items; Venn diagrams allow you to place known counts into regions and solve for unknowns by using totals and inclusion‑exclusion principles.

Stepwise method to solve problems (two or three sets): (1) Read the problem carefully and identify the sets and the universal set size (if given). (2) Draw the Venn diagram with the correct number of circles. (3) Fill the innermost region first: for three sets fill the triple intersection value if given. (4) Next fill pairwise intersection‑only regions: subtract the triple intersection from each pairwise intersection count to get the pair-only numbers. (5) Fill the single-only regions by subtracting pairwise and triple counts from the total for each set. (6) Finally, compute the outside region (elements in U but in none of the sets) by subtracting the sum of all regions inside circles from the total universal set.

Inclusion‑exclusion formulas give algebraic shortcuts: for two sets, |A ∪ B| = |A| + |B| − |A ∩ B| because elements in A ∩ B were counted twice when summing |A| and |B|. For three sets, |A ∪ B ∪ C| = |A| + |B| + |C| − |A ∩ B| − |B ∩ C| − |C ∩ A| + |A ∩ B ∩ C|. The last term corrects for subtracting the triple intersection three times.

Reading phrases carefully is crucial: 'at least one' refers to union; 'exactly one' means count only the single-only regions; 'exactly two' equals sum of pair-only regions (pairwise intersections minus triple). Misreading phrases is a common source of error. Also, watch for phrases like 'like at least two' which mean sum of pair-only and triple intersection regions as appropriate.

Practice examples often involve surveys where students select subjects or preferences. For instance, if 100 students were asked about three hobbies and counts of single and pairwise likes are given, you can find the number who like none by filling the Venn diagram and using the inclusion‑exclusion formula. The diagram makes the arithmetic transparent and helps avoid double counting mistakes.

Limitations and extension Venn diagrams are most effective for up to three sets in classroom problems; for more sets, diagrams become hard to draw and algebraic inclusion‑exclusion or complementary counting is preferred. Still, the conceptual idea of counting regions and correcting for overcounts remains the same and is widely used in examinations.

Power set defined The power set P(A) of a set A is the set of all subsets of A. It includes the empty set and A itself. If A = {a, b}, then P(A) = {∅, {a}, {b}, {a, b}}. Power sets appear naturally when you consider all choices of including or excluding each element; they are central in combinatorics, probability and in defining functions on subsets.

Counting subsets If A is finite with |A| = n, each element may be either present or absent in a subset, giving 2 choices per element. By the multiplication principle, total number of subsets is 2^n. This reasoning is the simplest counting argument and explains why P(A) has 2^n elements. For example, a 3-element set has 8 subsets, a 4-element set has 16 subsets and so on.

Types of subsets include proper subsets (all subsets except A itself) and non‑empty proper subsets (exclude both ∅ and A). The number of proper subsets is 2^n − 1, the number of non‑empty proper subsets is 2^n − 2 for n ≥ 1. These counts are useful in combinatorial problems and counting proofs.

Power set as a set of sets emphasises that elements of P(A) are themselves sets. This nested structure sometimes causes confusion; for example if A = {1}, then P(A) = {∅, {1}} contains two elements: the empty set and the singleton {1}. Understand the difference between element and subset carefully: 1 ∈ A but 1 ∉ P(A) unless one of the subsets equals 1 (which would only happen if elements themselves are sets).

Relations with functions There is a natural correspondence between subsets of A and functions from A to {0,1}: each subset S ⊆ A corresponds to its indicator function χ_S where χ_S(x) = 1 if x ∈ S and 0 otherwise. Since there are 2 choices per element, this gives 2^n such indicator functions, matching the power set size. This viewpoint is useful in probability and combinatorial constructions.

Infinite sets While the 2^n rule applies to finite sets, infinite sets have larger subtleties: the power set of a countably infinite set is uncountable. That is a more advanced idea you will encounter later; for now focus on finite sets where the 2^n rule is applied widely in problems.

Practice list all subsets for small sets to gain fluency, and use counting formulas to answer questions about numbers of ways to choose committees, form subgroups, or count possible binary strings. Understanding power sets strengthens combinatorial thinking for exams and later topics.

Cartesian product basics The Cartesian product of sets A and B is the set A × B = {(a, b) : a ∈ A, b ∈ B}. Each element is an ordered pair where the order matters: (a, b) is not the same as (b, a) unless a = b. This construction formalises the idea of pairing elements from two sets and is fundamental in coordinate geometry and in defining relations and functions.

Counting pairs If A has m elements and B has n elements (finite), then A × B has m·n elements because each element of A can be paired with each element of B independently. A simple way to visualise this is a grid: rows labelled by A and columns by B; each cell corresponds to an ordered pair. For example, if A = {1,2} and B = {x,y,z}, then A × B has 2×3 = 6 ordered pairs.

Higher Cartesian products extend to triples and n‑tuples: A × B × C is the set of ordered triples (a, b, c) and A^n is the set of n‑tuples from A. These constructions are the basis of coordinate spaces such as R^2 and R^3 used in geometry and physics. Each point in the plane is an ordered pair (x, y) ∈ R × R; the order indicates which number is the horizontal coordinate and which is the vertical coordinate.

Functions and relations via Cartesian product A relation from A to B is any subset of A × B. A function is a special relation with the uniqueness property for each first coordinate. Viewing functions as subsets of A × B emphasises that specifying a function means selecting exactly one pair (a, b) for each a ∈ A. This viewpoint also helps in understanding graphs of functions and composition where pairs chain through intermediate sets.

Special cases and properties The Cartesian product with an empty set is empty: A × ∅ = ∅ and ∅ × A = ∅ because no ordered pairs can be formed if one side has no elements. Cartesian product is not commutative in general: A × B ≠ B × A, though there is a natural bijection that swaps coordinates. Parentheses matter when considering products like (A × B) × C versus A × (B × C): while conceptually equivalent as sets of triples, formally they contain ordered pairs whose second component is itself an ordered pair; however there are standard identifications that simplify practical use.

Visual tools Use grids for small finite products and coordinate axes for R × R. Practice writing ordered pairs correctly and converting between tabular or rule definitions of sets and their Cartesian products. Understanding ordered pairs and Cartesian products prepares you for functions, relations, and analytic geometry.

Definition and viewpoint A relation from A to B is any subset R ⊆ A × B. Thus relations generalise the idea of pairing that we saw in Cartesian products: instead of taking all possible pairs, we choose some pairs that satisfy a condition. For instance, if A is a set of students and B is a set of courses, a relation 'takes' consists of pairs (student, course) where the student takes that course.

Relations on a set When A = B we say R is a relation on A. Important properties of relations on a set include reflexivity (for all a, (a,a) ∈ R), symmetry ((a,b) ∈ R ⇒ (b,a) ∈ R), antisymmetry ((a,b) ∈ R and (b,a) ∈ R ⇒ a = b), and transitivity ((a,b) ∈ R and (b,c) ∈ R ⇒ (a,c) ∈ R). These properties characterise useful structures: an equivalence relation is reflexive, symmetric and transitive; a partial order is reflexive, antisymmetric and transitive.

Representations Relations can be represented in three common ways: as a set of ordered pairs, as a 0–1 matrix when the underlying set is finite, or as a directed graph where nodes represent elements and arrows represent related pairs. The matrix method is convenient for checking properties: symmetry corresponds to a symmetric matrix, reflexivity to ones on the diagonal, transitivity can be investigated using matrix multiplication (Boolean product) or by checking closure under paths in the directed graph.

Composition of relations If R ⊆ A × B and S ⊆ B × C, the composite S∘R ⊆ A × C consists of pairs (a, c) for which there exists b ∈ B with (a, b) ∈ R and (b, c) ∈ S. This chaining idea is analogous to function composition and is useful in reasoning about sequences of relationships, for example 'is an ancestor of' is the composition of 'is a parent of' with itself many times.

Examples and checks To test reflexivity, check whether all diagonal pairs (a,a) are present. To test symmetry, pick an ordered pair and see whether its reverse is present. To test transitivity, verify that whenever two pairs line up (a,b) and (b,c) exist, the pair (a,c) is also in R. Using small concrete sets and listing pairs or drawing arrows makes these checks straightforward and provides good practice for exam questions.

Applications Relations model many practical situations: preference relations in economics, connectivity in graphs, divisibility on integers, and congruence relations in number theory. Understanding relations prepares you for equivalence classes, partitions and the foundational language of modern mathematics.

Function as a special relation A function f from a set A (domain) to a set B (codomain) is a relation with the property that every a ∈ A is paired with exactly one b ∈ B. We write f : A → B and denote the image of a by f(a). The requirement ‘exactly one’ has two parts: existence (each input has at least one output) and uniqueness (each input has at most one output). If either fails, the relation is not a function.

Different descriptions of a function Functions are given by formulas (f(x) = 2x + 1), by mapping diagrams (arrows from elements of A to elements of B), by tables, or by graphs in the coordinate plane when A and B are subsets of R. Every function must have its domain and codomain specified. If a formula has limited domain (like 1/x), state it explicitly: f : R\{0} → R.

Range vs codomain The range (or image) of f is the set {f(a) : a ∈ A} of actual outputs; it is always a subset of the codomain. For instance, f : R → R, f(x) = x^2 has codomain R but range [0,∞). This difference is important when discussing surjectivity: a function is onto if its range equals the codomain.

Graphical test For real functions f : R → R, the vertical line test determines whether a curve is the graph of a function: a curve is the graph of a function if and only if every vertical line x = constant meets it at most once, ensuring uniqueness for each input. This simple visual check is very useful when dealing with graphs of algebraic or piecewise functions.

Special simple functions include identity id_A(x) = x, constant functions f(x) = c for all x, and projection functions π1, π2 on products returning first or second coordinate. These examples show different behaviours: constant functions are not injective (unless domain is singleton), identity is bijective, etc. Many complicated functions are built by combining these simple ones through arithmetic operations, composition or piecewise definitions.

Notation and practice When working with functions, get used to precise notation: f : A → B, f(a) = b, domain(f) = A, codomain(f) = B, range(f) = f(A). Practice determining whether a given rule defines a function (check existence and uniqueness), and always explicitly state domain and codomain in exam answers to avoid ambiguity.

Definitions Domain of a function is the set of all permissible inputs; codomain is the set into which outputs are declared to lie; range (image) is the actual set of outputs produced by applying the function to the domain. For f : A → B, domain(f) = A, codomain(f) = B, and range(f) ⊆ B. These three sets are central to classifying functions as injective, surjective or bijective.

Determining domain from formulas For functions presented by algebraic expressions, determine the domain by finding all input values for which the expression is defined in the chosen number system (usually reals). Exclude values that make denominators zero, negative arguments of even roots, or non-positive arguments of logarithms (for real logs). For example, f(x) = √(x−1) has domain [1,∞), while g(x) = ln(x) has domain (0,∞). If the problem does not explicitly state a domain, use the natural domain: the largest set of real numbers where the formula makes sense.

Finding range Finding the range often needs algebraic inversion: set y = f(x) and solve for x in terms of y, then deduce permitted y values that give real solutions. For example, with y = x^2, solving gives x = ±√y, so y ≥ 0; range is [0,∞). For rational functions, rearrange to see if any y value leads to contradiction; some y may be forbidden because solving for x would require dividing by zero.

Codomain choice and surjectivity The codomain is part of the function’s definition. Two functions with the same rule and domain but different codomains are different as set-theoretic objects. For surjectivity, range must equal codomain. Always check what codomain the question specifies before deciding onto-ness.

Graphical methods Graphs help find range visually: look at the y-values attained by the curve. For continuous functions on intervals, consider limits and extreme values; calculus methods later give precise range. For piecewise functions, find range over each piece and combine. Use horizontal asymptotes and behaviour at infinity for rational and exponential functions to check if some y-values are never achieved.

Practical advice Always state domain and codomain explicitly in answers. For range, show reasoning: either solve for x in terms of y, analyse behaviour and limits, or use monotonicity. This clear approach is expected in examinations and avoids ambiguous claims that could lose marks.

Injective (one-one) A function f : A → B is injective if different inputs give different outputs: for any a1, a2 ∈ A, f(a1) = f(a2) implies a1 = a2. Another equivalent test is that every element of the range has exactly one preimage. To prove injectivity, assume f(a1) = f(a2) and show a1 = a2 by algebraic manipulation or logical reasoning. Graphically for real functions, injectivity is checked by the horizontal line test: a horizontal line meets the graph at most once.

Surjective (onto) A function f : A → B is surjective if every element of the codomain B is an image of some element of A: for every b ∈ B, there exists a ∈ A such that f(a) = b. To prove surjectivity, start with an arbitrary b ∈ B and construct or solve for an a ∈ A with f(a) = b. If such an a does not exist for some b, the function is not surjective.

Bijection and inverse A bijection is both injective and surjective. Bijections are important because they establish a one‑to‑one correspondence between sets; when a bijection exists, the two sets have the same cardinality. Every bijection f : A → B has an inverse function f^{-1} : B → A satisfying f^{-1}(f(a)) = a for all a ∈ A and f(f^{-1}(b)) = b for all b ∈ B.

Algebraic tests For common algebraic functions: linear functions f(x) = ax + b with a ≠ 0 are bijective from R to R. Quadratic functions f(x) = x^2 are not injective on R (f(1)=f(−1)) and not surjective onto R because negative y values are not attained. However by restricting the domain to [0,∞) you can make x^2 injective and surjective onto [0,∞), hence bijective on that restricted domain.

Implications in composition If f and g are injective, their composition g∘f is injective. If g∘f is injective, then f must be injective (but g need not be). Similarly for surjectivity, if f and g are surjective then g∘f is surjective, and if g∘f is surjective then g must be surjective. These facts are useful when deducing properties of composed mappings.

Exam strategy To answer questions, clearly state definitions, show algebraic steps for injectivity or construct preimages for surjectivity, and give counterexamples where properties fail. Precise domain and codomain statements are necessary to avoid losing marks on board exams.

Definition and requirement The composition of two functions f : A → B and g : B → C is the function g∘f : A → C defined by (g∘f)(x) = g(f(x)). For composition to be defined, the codomain of f must match the domain of g or at least the range of f must lie in the domain of g. Composition models the idea of performing one operation after another: apply f first, then apply g to the result.

Computing composition For algebraic functions, compute g∘f by substituting the expression for f(x) into g. Example: f(x)=x+1 and g(x)=x^2 give (g∘f)(x) = (x+1)^2 while (f∘g)(x)=x^2+1; these are usually different, showing composition is not commutative. Practice substitution carefully and simplify; mistakes often come from incorrect replacement or forgetting parentheses.

Properties of composition Composition is associative: h∘(g∘f) = (h∘g)∘f when all compositions make sense. Identity functions act as neutral elements: id_B∘f = f and f∘id_A = f. Composition preserves injectivity and surjectivity under certain conditions: if f and g are injective, g∘f is injective; if g∘f is injective, f must be injective. If f and g are surjective, g∘f is surjective; if g∘f is surjective, g must be surjective. Use these facts to deduce properties of complicated functions from their components.

Inverse and composition If f and g are bijections then their composition is a bijection and (g∘f)^{-1} = f^{-1}∘g^{-1}. This reversal of order when taking inverses is important: to undo g∘f you must first undo g, then undo f. This is often used in algebraic manipulations and solving functional equations.

Applications and examples Composition is used to build complex transformations in geometry (translation, rotation, scaling), to chain coordinate changes and to simplify calculations by splitting tasks into manageable steps. In function equation problems, compositions help create new equalities to solve for unknown functions. For exam practice, compute both compositions f∘g and g∘f to check non‑commutativity and to practise substitution and simplification skills.

Problem solving approach When asked to show properties of compositions, start with arbitrary x in domain and apply definitions: for injectivity arguments assume (g∘f)(x1)=(g∘f)(x2) and deduce x1=x2 step by step. For surjectivity, start with arbitrary element in codomain C and show existence of preimage in A. Clear sequential reasoning following the application order of functions prevents mistakes.

What is an inverse? For a bijection f : A → B, the inverse f^{-1} : B → A reverses the mapping: for each b ∈ B there is a unique a ∈ A with f(a) = b, and f^{-1}(b) = a. Existence of a two‑sided inverse requires both injectivity (to ensure uniqueness) and surjectivity (to ensure existence). If a function lacks either property it does not have a full inverse function, though it may have one sided inverses.

Finding inverse algebraically To find f^{-1}, write y = f(x), solve the equation for x in terms of y, and then swap x and y to obtain the inverse function formula. For example, y = 3x + 2 gives x = (y − 2)/3, so f^{-1}(x) = (x − 2)/3. Always check that the solved expression indeed maps the codomain to the domain and respects any restrictions on variables.

Domain and range swap The domain of f^{-1} is the range of f, and the range of f^{-1} is the domain of f. When sketching graphs, the graph of f^{-1} is the reflection of the graph of f about the line y = x. This symmetry helps in verifying inverse relationships and provides a useful visual tool for understanding inverses of common functions such as exponentials and logarithms.

Monotonicity and invertibility For real functions, strict monotonicity (always increasing or always decreasing) on an interval guarantees injectivity, and if the function maps onto the target interval it will have an inverse on that interval. For instance, f(x) = e^x is strictly increasing and maps R onto (0,∞), so it has inverse ln x defined on (0,∞).

Domain restriction for inverses Some functions like f(x) = x^2 are not invertible on their whole domain R because they fail injectivity. Restricting the domain to [0,∞) makes f bijective onto [0,∞) and hence invertible with f^{-1}(x) = √x. Always state such restrictions clearly when required; ignoring them leads to incorrect inverse claims.

Verifying inverses To prove two functions are inverses, show f^{-1}(f(x)) = x for all x in domain of f and f(f^{-1}(y)) = y for all y in domain of f^{-1}. Providing both compositions equal the identity function completes the proof. This direct verification is often the simplest rigorous test in exam answers.

Proving injectivity The direct method is standard: assume f(x1) = f(x2) for arbitrary x1, x2 in domain and show x1 = x2 by algebraic manipulation. This method demonstrates uniqueness of preimages. Sometimes it is easier to use monotonicity: a strictly increasing (or decreasing) real function on an interval is injective. For polynomials and rational functions, algebraic rearrangement often yields the result. In proofs, begin by clearly stating 'Let x1, x2 be arbitrary elements of domain' and then proceed; this structure is expected in board answers.

Proving surjectivity To prove that f : A → B is onto, take an arbitrary b ∈ B and explicitly construct or solve for x ∈ A with f(x) = b. This approach shows existence of preimages for every target element. If solving for x yields expressions that always lie in domain, surjectivity is established. For many elementary functions, a direct inverse formula demonstrates surjectivity by writing x = f^{-1}(b).

Using counterexamples To show a function is not injective, find distinct x1, x2 with f(x1) = f(x2). To show not surjective, produce a b ∈ B such that the equation f(x) = b has no solution in the domain. Simple numerical examples are often sufficient and accepted in exams as proofs of failure of a property.

Composition arguments Use composition to deduce properties: if g∘f is injective then f must be injective (because otherwise g∘f would identify distinct inputs), and if g∘f is surjective then g must be surjective. These implications are proved by applying definitions to arbitrary elements and constructing required elements step by step.

Well-definedness When defining a function on equivalence classes or on quotient sets, one must check the function is well-defined: the value assigned does not depend on the representative chosen. This check is commonly required in exam questions and consists of showing that if two representatives are equivalent then their images are equal.

Exam tips Always clearly state which method you use, give explicit arbitrary choices where necessary (let b ∈ B be arbitrary...), and when providing counterexamples ensure they satisfy all domain and codomain restrictions. Clear structure and correct logic earn full credit.

Overview of common functions There are several classes of elementary functions you will use repeatedly: linear functions f(x)=ax+b, polynomials of various degrees, rational functions p(x)/q(x), power functions x^n, exponential functions a^x (a>0, a≠1), logarithmic functions log_a(x), and trigonometric functions sin x, cos x, tan x. Each has characteristic domain, range and special properties such as monotonicity, periodicity, asymptotic behaviour and invertibility on restricted domains.

Linear functions are simplest: f(x)=ax+b with a≠0 is a bijection from R to R, invertible with f^{-1}(x)=(x−b)/a. Graphs are straight lines with slope a and y-intercept b. These functions are used to model proportional relationships and translations.

Polynomials and powers behave differently by degree: odd-degree polynomials usually have range R and are often surjective; even-degree polynomials like x^2 are not injective on R but are onto nonnegative reals when restricted appropriately. For quadratic functions, completing the square helps find vertex, range and domain. Higher-degree polynomials may have multiple turning points and need calculus to analyse extrema, but basic injectivity or surjectivity questions are often answered by inspection or counterexample.

Rational functions are quotients of polynomials and may have vertical asymptotes where denominator is zero and horizontal or oblique asymptotes describing end behaviour. For example, f(x)=(x+1)/(x−1) has domain R\{1} and range R\{1} because y=1 cannot be attained. Analyse rational functions by algebraic manipulation and by considering limits at infinity.

Exponential and logarithmic functions are inverses: a^x (a>1) is increasing with domain R and range (0,∞). Its inverse log_a(x) maps (0,∞) to R. These functions model growth and decay and are strictly monotone so invertible on full domain. Use logs when solving equations where variable is in exponent.

Trigonometric functions are periodic and not injective on R. Restricting domains to principal intervals makes them invertible: sin x on [−π/2, π/2] has inverse arcsin mapping [−1,1] back to [−π/2, π/2]. Understanding periods and principal values is necessary for equation solving and inverse trig functions.

Piecewise and absolute value functions Piecewise definitions like f(x)=|x| (x if x≥0, −x otherwise) are common. Check continuity at boundary points and determine injectivity or invertibility by looking at restricted domains. Many real-life models use piecewise functions.

Practice Explore domain, range, monotonicity and invertibility of each example. Sketch graphs to visualise behaviour and use algebra to verify properties. These elementary functions are building blocks for more advanced constructions in calculus and coordinate geometry.

Binary operation formal definition A binary operation on a set S is a function ⋆ : S × S → S that assigns to every ordered pair (a,b) in S × S a unique element a ⋆ b in S. The key requirement is closure: the result must lie in S for all inputs. Common examples include addition and multiplication on numbers, where S might be Z, Q, R, or C.

Properties of operations Major properties studied are associativity ((a⋆b)⋆c = a⋆(b⋆c)), commutativity (a⋆b = b⋆a), existence of identity element e (e⋆a = a⋆e = a), and existence of inverses (for a given a there exists b such that a⋆b = e). These properties form the basis of algebraic structures like groups, rings and fields, although full study of those is beyond Class 11. Recognising which properties an operation satisfies is important when solving related problems.

Counting binary operations On a finite set S with n elements, the number of possible binary operations (without imposing any property) is n^{n^2}. This formula comes from: there are n^2 ordered pairs and for each pair the operation can assign any of the n elements, hence n choices for each of the n^2 positions, giving n^{n^2} possible operation tables. This large number shows how many possible algebraic structures exist even on small finite sets.

Functions using operations Many functions on sets are defined using binary operations. For instance, f(a) = a⋆a squares an element in the operation sense. When a function is defined in terms of an operation that is not universally defined for all elements (like division), ensure the domain excludes problematic inputs (e.g., division by zero). Check closure and domain explicitly when defining such functions.

Operation tables For small finite sets it is useful to present a binary operation as a table (like a Cayley table), with rows and columns labelled by elements and table entries giving the product. Tables make checking properties like identity and commutativity straightforward: identity appears as a row and column matching headers, and commutativity is seen as table symmetry across diagonal.

Applications Binary operations model composition of symmetries, addition of residues in modular arithmetic, and logical connectives in boolean algebra. In computer science, binary operations on bits form building blocks of algorithms. Familiarity with operations, their properties and tables prepares students for algebraic reasoning and proofs in later classes.

Equivalence relations An equivalence relation ∼ on a set A satisfies three properties: reflexivity (for every a ∈ A, a ∼ a), symmetry (a ∼ b implies b ∼ a) and transitivity (a ∼ b and b ∼ c imply a ∼ c). Such relations capture the idea of elements being 'equivalent' in some sense, for instance congruence modulo n on the integers.

Equivalence classes For a ∈ A, the equivalence class [a] is defined as {x ∈ A : x ∼ a}. Equivalence classes partition the set A: they are non‑empty, pairwise disjoint, and their union equals A. If two equivalence classes intersect, they are identical. This property follows from transitivity and symmetry and provides a convenient way to group elements that share a relation.

Partitions A partition of A is a collection of non‑empty disjoint subsets whose union is A. Every equivalence relation on A induces a partition given by its equivalence classes. Conversely, given any partition of A into blocks, we can define an equivalence relation by declaring elements equivalent when they lie in the same block. This one‑to‑one correspondence between partitions and equivalence relations is a fundamental structural result.

Quotient sets The set of equivalence classes is called the quotient set A/∼. Members of A/∼ are the blocks of the partition. When defining functions on A/∼, you must ensure the function is well-defined: that is, its value must not depend on the representative chosen from an equivalence class. To check well‑definedness, show that if a ∼ b then the proposed function gives the same value for a and b. This check is commonly required in exam problems.

Examples Congruence modulo n partitions integers into n residue classes: for n = 4, classes are [0], [1], [2], [3] containing integers congruent to 0,1,2,3 mod 4. Another example partitions students by birth month; each class contains students born in the same month. These everyday examples illustrate the abstract notion concretely and are useful for problems and illustrations in examinations.

Applications and significance Equivalence relations and partitions appear in many areas: identifying points under a symmetry, classifying solutions by a property, and forming quotient structures in algebra and topology. Understanding how to move between relations and partitions and how to verify properties like reflexivity, symmetry and transitivity is essential for higher mathematics and examination success.

Functions model mappings between sets and are fundamental for describing relationships in mathematics and real life. A function f : A → B assigns to each element of A a single element of B. This viewpoint emphasises that functions are not only formulas but also mappings that can be counted, composed, inverted and analysed. For finite sets, counting functions helps in combinatorial problems and understanding possible mappings between structures.

Counting functions If |A| = m and |B| = n (finite), the total number of functions from A to B is n^m because each of the m domain elements may map independently to any of the n codomain elements. The number of injective functions when m ≤ n is n(n−1)...(n−m+1) (permutations), and the number of bijections when m = n is n! (factorial). These counting principles are widely used in combinatorics and exam problems asking for arrangements or mappings.

Applications in modelling Functions represent many real-world processes: position as a function of time in physics, cost as a function of quantity in economics, and encryption as a function from messages to codewords in computer science. Understanding domain, codomain and behaviour helps build accurate models and solve applied problems.

Functions and invertibility Some real-world applications require invertibility: for example, decoding a message requires an inverse mapping; in physics, reversible processes correspond to bijective mappings between states. Recognising when a function is invertible and constructing its inverse is therefore practical, not merely theoretical.

Mappings diagrams and graphs Use mapping diagrams (two columns of dots with arrows) to visualise functions between finite sets; draw graphs for real functions to see continuity, asymptotes and extrema. Mapping diagrams are particularly useful when counting injective or surjective functions because they make preimage structure visible. They also help in constructing explicit bijections to demonstrate equal cardinalities of finite sets.

Problem solving strategy For counting functions or testing properties, list possibilities for small sets, use formulae n^m, permutations P(n,m), and n! for bijections. For mapping problems in applications, clearly state domain and codomain, and if needed provide constructions or proofs of existence. These habits lead to clear, exam‑ready solutions.

Major identities Beyond basic algebra, sets satisfy many identities that you should be able to prove and use. Important ones include distributive laws A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C), De Morgan's laws (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B', and identities involving differences like A \ (B ∪ C) = (A \ B) ∩ (A \ C) and A \ (B ∩ C) = (A \ B) ∪ (A \ C). Symmetric difference A Δ B = (A \ B) ∪ (B \ A) has algebraic properties similar to addition mod 2: A Δ A = ∅ and (A Δ B) Δ C = A Δ (B Δ C).

Proof techniques The standard approach is element‑wise (also called 'element chasing'): pick an arbitrary element x and show it belongs to the left side if and only if it belongs to the right side. This usually reduces to logical equivalences among statements using and/or/not. For equality of sets prove mutual inclusion: LHS ⊆ RHS and RHS ⊆ LHS. Venn diagrams can provide intuition but are not substitutes for formal proofs in examinations; diagrams help to identify regions to include in each side and guide the element‑wise proof.

Using logical equivalences Translate set membership statements into logic: x ∈ A ∩ (B ∪ C) ⇔ x ∈ A ∧ (x ∈ B ∨ x ∈ C), which by distributive property of 'and' over 'or' is equivalent to (x ∈ A ∧ x ∈ B) ∨ (x ∈ A ∧ x ∈ C), i.e., x ∈ (A ∩ B) ∪ (A ∩ C). This direct mapping to propositional logic often simplifies proofs and makes them systematic.

Proving subset relations Sometimes only one-way inclusion is required (A ⊆ B). For this, take arbitrary x ∈ A and demonstrate x ∈ B using definitions and known properties. Subset proofs are common in exercises and are often simpler than full equality proofs.

Working with complements De Morgan's laws are fundamental and used to convert unions to intersections when complements are involved. They also simplify working with set equations that include complements. Remember to always work inside a clearly defined universal set U so complements are meaningful.

Practice and examples Regularly prove the standard identities by element-wise method until the pattern becomes automatic. Use small finite examples to verify results numerically and then present the formal proof. This approach is accepted in board exams and builds mathematical rigor for future topics.

Ambiguous domain or codomain A frequent error is not specifying the domain and codomain for a function. Without these, claims about surjectivity, injectivity and inverse functions can be incorrect. Always state domain and codomain explicitly when defining or analysing a function. For example, f(x)=1/x must be written as f : R\{0} → R to be meaningful.

Confusing range and codomain Students often treat the codomain as if it were the range. Remember: codomain is part of the function definition, while range is the set of actual outputs. This matters when answering whether a function is onto: onto means range = codomain. A function can have a larger codomain than its range and then it will not be surjective.

Mistakes with ordered pairs Treat (a,b) as an ordered object; do not confuse it with the unordered set {a,b}. Cartesian products and relations depend on order, so swapping coordinates changes the pair. When listing ordered pairs, keep the order consistent and check that pairs are inside the correct Cartesian product.

Incorrect Venn diagram usage When solving counting problems with Venn diagrams, always fill the innermost intersections first (triple intersection for three sets) before filling pairwise-only and only-one regions. Failing to do so causes incorrect subtraction or double counting. Also check totals: after filling all regions the sum of counts inside circles plus those outside should equal the universal set size when given.

Uniqueness in functions To prove a rule defines a function, show uniqueness: each input maps to one output. For example, writing f(x)=±√x without restricting to positive outputs does not define a single-valued function. Make domain restrictions explicit when the formula yields multiple values.

Careless algebra in proofs In proving injectivity or surjectivity, perform algebraic steps carefully, check domain restrictions introduced while solving, and verify final conclusions for all elements of the domain/codomain. Show counterexamples clearly when disproving a property. Clear, stepwise reasoning and checking edge cases prevent most common mistakes and result in full credit in exams.