MATH2001 Chap.2 Sets, Functions and Relations
Sets, Functions and Relations
Translate set notation into membership
Set arguments become systematic when each operation is read as logic about an arbitrary element. Union uses inclusive or, intersection uses and, and difference combines membership with non-membership. Inclusion says every element of one set belongs to another, whereas membership concerns one object.
Set equality can be proved through two inclusions or through a reversible chain of membership conditions. Power sets, Cartesian products and disjoint unions are different constructions because their elements have different forms.
A function includes its declared sets
A formula does not completely specify a function until its domain and codomain are named.
The image records outputs actually attained and may be smaller than the codomain. A fibre records all inputs mapped to one target. Preimage notation describes a set and works for any function; an inverse function exists only for a bijection.
These distinctions explain why direct images preserve some operations only by inclusion while preimages preserve unions, intersections and differences exactly.
Quotients forget representatives
An equivalence relation is reflexive, symmetric and transitive, and its classes form disjoint blocks covering the underlying set. The quotient set contains those classes.
A formula written with a representative defines a rule on the quotient only when equivalent representatives give the same result. That well-definedness proof comes before injectivity, surjectivity or any calculation using the rule. The chapter closes by treating partitions and equivalence relations as two views of the same structure.
What this chapter covers
- 01
Membership and inclusion
- 02
Set operations and identities
- 03
Power sets and products
- 04
Domain, codomain and graph
- 05
Images, preimages and fibres
- 06
Injective and surjective maps
- 07
Equivalence classes and quotients
Worked example · free
Separate direct image from preimage
- 2Compute the direct image from the listed inputs.
- 4Solve the three preimage conditions over the full integer domain.
- 4Use a repeated output and a missed target to classify the map.
Key terms
- Subset
- A set whose every element also belongs to another set, with equality allowed.
- Power Set
- The set of all subsets of a specified set, including the empty set and the set itself.
- Cartesian Product
- The set of ordered pairs whose first and second entries come from the stated factor sets.
- Image
- The set of outputs produced by applying a function to a specified subset of its domain.
- Preimage
- The set of inputs whose outputs lie in a specified subset of the codomain.
- Fibre
- The preimage of a singleton target, collecting all inputs that share one output.
- Quotient Set
- The set whose elements are the equivalence classes of a relation.
Sets, Functions and Relations FAQ
Why can image fail to preserve intersections?
An output may belong to both f(A) and f(B) because one input from A and a different input from B share that output. Neither input need lie in A intersect B. Injectivity prevents this witness mismatch, so under an injective function the image of an intersection equals the intersection of the images.
Is preimage notation the same as an inverse function?
No. The preimage of a subset is defined for every function and returns a subset of the domain. An inverse function must return one input for every codomain value and exists only when the original function is bijective. The same superscript notation is used, so braces and the declared sets matter.
How do I prove a quotient rule is well defined?
Take two representatives of the same class and translate class equality into the defining relation. Apply the proposed rule to both representatives and prove the outputs are equal or equivalent. State explicitly that the output therefore does not depend on the chosen representative. Testing one convenient representative is not sufficient.
Exam move
Draw small finite maps and label every domain element, codomain element, fibre and missed target. Then rewrite the drawing as definitions rather than relying on the picture. For set identities, practise a consistent membership-chain format and mark where each logical law is used. For quotient questions, reserve the first lines for well-definedness and do not discuss injectivity or surjectivity until that stage is complete.
This ordering turns several common errors into visible omissions before they reach the final answer. Add a type check beside every construction: write what kind of object enters and what kind leaves. In particular, distinguish an element, a subset, an ordered pair and an equivalence class.
When a proposed identity fails, use the smallest finite counterexample you can find, then state precisely which inclusion or implication broke.
Working through Sets, Functions and Relations in MATH2001? Sia is AskSia’s AI Mathematics tutor — ask any MATH2001 Sets, Functions and Relations question and get a clear, step-by-step explanation grounded in how MATH2001 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.