Study guide
9.3 Sets, Venn Relations & Functions
NTS Graduate Assessment Test GAT General
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: GAT General Overview & Test Administration
1.1 GAT General Test Structure & Logistics 1.2 Time Management & No-Negative-Marking Strategy 1.3 GAT Test Categories & Admissions Alignment
2 Chapter 2: Verbal Reasoning — Vocabulary, Analogies & Word Roots
2.1 Verbal Analogies & Relationship Mapping 2.2 Synonyms, Antonyms & Contextual Meaning 2.3 High-Frequency NTS Vocabulary & Word Roots
3 Chapter 3: Verbal Reasoning — Sentence Completion & Reading Comprehension
3.1 Sentence Completion & Single/Double-Blank Strategies 3.2 Reading Comprehension & Textual Analysis 3.3 Essential English Grammar & Sentence Structure
4 Chapter 4: Verbal Reasoning — Grammar: Tenses, Structure & Conditionals
4.1 Tenses & Aspects I: Simple and Progressive Forms 4.2 Tenses & Aspects II: Perfect Forms, Sequence of Tenses & Voice 4.3 Parts of Speech in Depth: Articles, Prepositions & Determiners 4.4 Conditional Sentences & Hypothetical Structures
5 Chapter 5: Verbal Reasoning — Language Functions & Passage Analysis
5.1 Language Functions & Situational Appropriacy 5.2 Linking Devices, Transitions & Textual Cohesion 5.3 Main Idea, Title Selection & Topic Sentences 5.4 Types of Passage, Author's Purpose & Tone
6 Chapter 6: Quantitative Reasoning — Arithmetic & Number Theory
6.1 Number Properties, Divisibility Rules & Prime Factorization 6.2 Fractions, Decimals, Percentages & Profit-Loss Math 6.3 Ratios, Proportions, Mixtures & Work-Time Rates
7 Chapter 7: Quantitative Reasoning — Business, Consumer & Islamic Financial Mathematics
7.1 Business, Financial & Consumer Mathematics 7.2 Zakat, Ushar & Inheritance Calculations
8 Chapter 8: Quantitative Reasoning — Algebra & Equations
8.1 Algebraic Simplification, Exponent Rules & Radicals 8.2 Linear Equations, Systems & Quadratic Equations 8.3 Inequalities, Absolute Value & Function Basics
9 Chapter 9: Quantitative Reasoning — Matrices, Sequences, Sets & Functions
9.1 Matrices & Determinants 9.2 Arithmetic & Geometric Sequences 9.3 Sets, Venn Relations & Functions
10 Chapter 10: Quantitative Reasoning — Geometry & Measurement
10.1 Lines, Angles, Triangles & Pythagorean Theorem 10.2 Quadrilaterals, Polygons, Circles & Coordinate Geometry 10.3 Perimeter, Area, Surface Area & 3D Volume Calculations
11 Chapter 11: Quantitative Reasoning — Triangle Theorems, Circles & Trigonometry
11.1 Congruent Triangles, Bisectors & the Projection Rule 11.2 Circle Theorems: Chords, Tangents, Arcs & Segments 11.3 Introduction to Trigonometry
12 Chapter 12: Quantitative Reasoning — Data Interpretation & Word Problems
12.1 Data Interpretation: Tables, Bar Charts, Line Graphs & Pie Charts 12.2 Basic Statistics, Permutations, Combinations & Probability 12.3 Quantitative Word Problems & Age/Coin/Venn Diagram Scenarios
13 Chapter 13: Analytical Reasoning — Fundamentals & Ordering Games
13.1 Analytical Reasoning Framework & Diagramming Notation 13.2 Linear Sequencing, Ranking & Slot-Based Puzzles 13.3 Circular Seating Arrangements & Spatial Relative Puzzles
14 Chapter 14: Analytical Reasoning — Grouping, Selection & Matrix Games
14.1 Grouping, Distribution & Bin-Assignment Puzzles 14.2 Selection Games & Team Formation Constraints 14.3 Attribute Matching & Multi-Dimensional Grid Puzzles
15 Chapter 15: Analytical Reasoning — Critical & Deductive Logic
15.1 Logical Arguments, Premise-Conclusion Structure & Unstated Assumptions 15.2 Strengthening, Weakening & Evaluating Logical Arguments 15.3 Formal Deductions, Syllogisms & Scenario-Based Inferences
16 Chapter 16: Analytical Reasoning — Inductive Logic & Causal Inference
16.1 Inductive Logic, Generalisation & Causal Reasoning
9.3 Sets, Venn Relations & Functions
Key Takeaways Explain This Topic AI
Sets and Functions is a named item in the NTS Algebra block and also underpins the Venn-diagram word problems in the arithmetic block.
The two-set counting rule subtracts the overlap once: n(A union B) equals n(A) plus n(B) minus n(A intersection B).
De Morgan's laws convert the complement of a union into an intersection of complements, and vice versa.
A relation is a function only when every element of the domain maps to exactly one element of the range.
Composition applies the inner function first, so fg(x) means f evaluated at g of x, and reversing the order usually changes the answer.
Last updated: August 2026
Sets, Venn Relations & Functions
Sets and Functions closes the eight-item NTS Algebra block. It earns its place twice: the notation appears throughout the quantitative paper, and the inclusion-exclusion counting rules solve the survey word problems that NTS places in the arithmetic block as well.
Set Notation and Operations
- Symbol Name Meaning
- ∈ \in ∈ membership x x x is an element of the set
- ⊆ \subseteq ⊆ subset every element of the first set lies in the second
- ∪ \cup ∪ union everything in either set
- ∩ \cap ∩ intersection only what lies in both
- A ′ A' A ′ or A c A^{c} A c complement everything in the universal set not in A A A
- A − B A - B A − B difference in A A A but not in B B B
- ∅ \varnothing ∅ empty set contains no elements
With U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 } U = \{1,2,3,4,5,6,7,8\} U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 } , A = { 1 , 2 , 3 , 4 } A = \{1,2,3,4\} A = { 1 , 2 , 3 , 4 } , B = { 3 , 4 , 5 , 6 } B = \{3,4,5,6\} B = { 3 , 4 , 5 , 6 } :
- A ∪ B = { 1 , 2 , 3 , 4 , 5 , 6 } A \cup B = \{1,2,3,4,5,6\} A ∪ B = { 1 , 2 , 3 , 4 , 5 , 6 }
- A ∩ B = { 3 , 4 } A \cap B = \{3,4\} A ∩ B = { 3 , 4 }
- A − B = { 1 , 2 } A - B = \{1,2\} A − B = { 1 , 2 }
- A ′ = { 5 , 6 , 7 , 8 } A' = \{5,6,7,8\} A ′ = { 5 , 6 , 7 , 8 }
Power set: a set with n n n elements has 2 n 2^{n} 2 n subsets, of which 2 n − 1 2^{n} - 1 2 n − 1 are proper subsets. A set of 5 elements therefore has 32 subsets. This is asked directly and is a free mark.
De Morgan's Laws ( A ∪ B ) ′ = A ′ ∩ B ′ ( A ∩ B ) ′ = A ′ ∪ B ′ (A \cup B)' = A' \cap B' \qquad\qquad (A \cap B)' = A' \cup B' ( A ∪ B ) ′ = A ′ ∩ B ′ ( A ∩ B ) ′ = A ′ ∪ B ′
The operation flips when the complement is distributed. Candidates who keep the union as a union lose the item.
Inclusion-Exclusion Counting
Two Sets n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B ) n(A \cup B) = n(A) + n(B) - n(A \cap B) n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B )
The overlap is counted once in each set, so it must be removed once.
Worked example. In a class of 90 students, 52 study Statistics, 45 study Economics, and 18 study both. How many study neither? n ( S ∪ E ) = 52 + 45 − 18 = 79 ⇒ neither = 90 − 79 = 11 n(S \cup E) = 52 + 45 - 18 = 79 \qquad\Rightarrow\qquad \text{neither} = 90 - 79 = 11 n ( S ∪ E ) = 52 + 45 − 18 = 79 ⇒ neither = 90 − 79 = 11
Three Sets n ( A ∪ B ∪ C ) = n ( A ) + n ( B ) + n ( C ) − n ( A ∩ B ) − n ( B ∩ C ) − n ( A ∩ C ) + n ( A ∩ B ∩ C ) n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A\cap B) - n(B\cap C) - n(A\cap C) + n(A\cap B\cap C) n ( A ∪ B ∪ C ) = n ( A ) + n ( B ) + n ( C ) − n ( A ∩ B ) − n ( B ∩ C ) − n ( A ∩ C ) + n ( A ∩ B ∩ C )
The triple overlap is subtracted three times by the pairwise terms, so it must be added back once.
Worked example. Of 120 candidates, 70 revised Verbal, 60 revised Quantitative, 50 revised Analytical; 30 revised Verbal and Quantitative, 25 Quantitative and Analytical, 20 Verbal and Analytical, and 10 revised all three. 70 + 60 + 50 − 30 − 25 − 20 + 10 = 115 70 + 60 + 50 - 30 - 25 - 20 + 10 = 115 70 + 60 + 50 − 30 − 25 − 20 + 10 = 115
So 115 revised at least one segment and 5 revised none.
Filling a Venn diagram correctly: always start from the centre and work outward, subtracting as you go. With 10 in all three, the Verbal-and-Quantitative-only region is 30 − 10 = 20 30 - 10 = 20 30 − 10 = 20 , and the Verbal-only region is 70 − 20 − 10 − 10 = 30 70 - 20 - 10 - 10 = 30 70 − 20 − 10 − 10 = 30 . Working inward from the outside is where sign errors creep in.
Functions
A relation pairs elements of a domain with elements of a range. It is a function only when every domain element has exactly one image.
Relation Function? Why
{ ( 1 , 3 ) , ( 2 , 5 ) , ( 3 , 7 ) } \{(1,3),(2,5),(3,7)\} {( 1 , 3 ) , ( 2 , 5 ) , ( 3 , 7 )} Yes each input used once
{ ( 1 , 3 ) , ( 1 , 5 ) , ( 2 , 7 ) } \{(1,3),(1,5),(2,7)\} {( 1 , 3 ) , ( 1 , 5 ) , ( 2 , 7 )} No the input 1 has two images
{ ( 1 , 4 ) , ( 2 , 4 ) , ( 3 , 4 ) } \{(1,4),(2,4),(3,4)\} {( 1 , 4 ) , ( 2 , 4 ) , ( 3 , 4 )} Yes repeated outputs are permitted
The vertical line test states this graphically: if any vertical line meets the graph more than once, the relation is not a function. A circle fails; a parabola opening upward passes.
Domain and Range
f ( x ) = 1 x − 3 f(x) = \dfrac{1}{x-3} f ( x ) = x − 3 1 — the domain excludes x = 3 x = 3 x = 3 , since division by zero is undefined.
f ( x ) = x − 5 f(x) = \sqrt{x-5} f ( x ) = x − 5 — the domain requires x ≥ 5 x \ge 5 x ≥ 5 , since a real square root needs a non-negative radicand.
f ( x ) = x 2 f(x) = x^{2} f ( x ) = x 2 — the domain is all real numbers but the range is y ≥ 0 y \ge 0 y ≥ 0 .
Types of Function
- Type Condition
- One-to-one (injective) different inputs always give different outputs
- Onto (surjective) every element of the codomain is used
- Bijective both, and therefore invertible
- Composition ( f ∘ g ) ( x ) = f ( g ( x ) ) (f \circ g)(x) = f\bigl(g(x)\bigr) ( f ∘ g ) ( x ) = f ( g ( x ) )
The inner function is applied first. With f ( x ) = 2 x + 1 f(x) = 2x + 1 f ( x ) = 2 x + 1 and g ( x ) = x 2 g(x) = x^{2} g ( x ) = x 2 : ( f ∘ g ) ( 3 ) = f ( 9 ) = 19 ( g ∘ f ) ( 3 ) = g ( 7 ) = 49 (f \circ g)(3) = f(9) = 19 \qquad\qquad (g \circ f)(3) = g(7) = 49 ( f ∘ g ) ( 3 ) = f ( 9 ) = 19 ( g ∘ f ) ( 3 ) = g ( 7 ) = 49
Composition is not commutative, and NTS builds an item on exactly that asymmetry almost every sitting.
Inverse Functions
To invert, swap x x x and y y y and solve. For f ( x ) = 3 x − 6 f(x) = 3x - 6 f ( x ) = 3 x − 6 : y = 3 x − 6 ⇒ x = 3 y − 6 ⇒ y = x + 6 3 ⇒ f − 1 ( x ) = x + 6 3 y = 3x - 6 \;\Rightarrow\; x = 3y - 6 \;\Rightarrow\; y = \frac{x + 6}{3} \;\Rightarrow\; f^{-1}(x) = \frac{x+6}{3} y = 3 x − 6 ⇒ x = 3 y − 6 ⇒ y = 3 x + 6 ⇒ f − 1 ( x ) = 3 x + 6
Check: f ( 4 ) = 6 f(4) = 6 f ( 4 ) = 6 and f − 1 ( 6 ) = 4 f^{-1}(6) = 4 f − 1 ( 6 ) = 4 ✓. Only one-to-one functions have inverses, which is why f ( x ) = x 2 f(x) = x^{2} f ( x ) = x 2 has no inverse over all real numbers but does have one when restricted to x ≥ 0 x \ge 0 x ≥ 0 .