Revision notes

Chapter 1 Sets: Foundation

The key points, rules to remember, tables and diagrams from all 5 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

What a set is and the two ways of writing it

Set or not a set?

  • Sets (well defined)
    • Vowels of the English alphabet
    • Factors of 18
    • Districts of a state on a given map
    • Even numbers between 1 and 20
  • Not sets (vague)
    • Beautiful gardens of a city
    • Difficult sums in a book
    • Famous singers
    • Good players in a team
Words such as beautiful, difficult, famous and good depend on opinion, so they do not define a set.
Standard number sets used in the Balbharati book
SymbolThe setSome elements
NNatural numbers1, 2, 3, 4, ...
WWhole numbers0, 1, 2, 3, ...
IIntegers..., −2, −1, 0, 1, 2, ...
QRational numbersnumbers p/q with p, q integers and q ≠ 0, such as 3/4 and −5
RReal numbersall rational and irrational numbers

Listing method: write each element once, in any order, inside { }. Rule method: { x | property of x }, where | is read 'such that'.

— Writing a set

Turning a rule into a list

  1. Read the rule Note the kind of number (N, W, I ...) and the condition.
  2. Find candidates Test values that could fit the condition.
  3. Keep only those that fit Discard values outside the stated number set.
  4. Write each once in { } Order does not matter.

Key takeaways: a set is a well-defined collection; use ∈ and ∉ for membership; N, W, I, Q and R are the standard number sets; listing method shows every element once, while rule method states the property that decides membership.

Read the full lesson

Lesson 2

Types of sets and equal sets

Types of sets
TypeMeaningExample
Singleton setHas exactly one element{x | x ∈ N, x + 3 = 4} = {1}
Empty (null) setHas no element at all; written { } or ∅{x | x ∈ N, x < 1} = ∅
Finite setEmpty, or its elements can be counted to an endDays of a week; {2, 4, 6, 8}
Infinite setIts elements never come to an endN, W, I, Q and R; multiples of 3

Classifying a set by its number of elements

  • Finite
    • Empty set: 0 elements
    • Singleton set: 1 element
    • Any other countable number of elements
  • Infinite
    • Elements never end
    • Examples: N, I, Q, multiples of 4

A = B exactly when they have the same elements: every element of A is in B, and every element of B is in A.

— Equal sets

Checking whether two sets are equal

  1. Write both in listing form Solve any rule first.
  2. Check each element of the first Is it in the second set?
  3. Check each element of the second Is it in the first set?
  4. Both checks pass The sets are equal; otherwise they are not.

Key takeaways: a singleton set has one element, the empty set ∅ has none, a finite set can be counted to an end and an infinite set cannot. Always find the elements before classifying. Equal sets have exactly the same elements, whatever the order of writing.

Read the full lesson

Lesson 3

Venn diagrams, subsets, the universal set and complement

A′ = {x | x ∈ U and x ∉ A}. The complement of the complement is the set itself: (A′)′ = A.

— Complement

Properties of the complement

  • Nothing in common
    • A and A′ share no element
  • Both inside U
    • A ⊆ U and A′ ⊆ U
  • Extreme cases
    • U′ = ∅
    • ∅′ = U
  • Double complement
    • (A′)′ = A

Key takeaways: B ⊆ A means every element of B is in A; ∅ and A itself are always subsets of A. The universal set U contains every set under study and is drawn as a rectangle. The complement A′ is everything in U outside A, and (A′)′ = A.

Read the full lesson

Lesson 4

Intersection, union and disjoint sets

Intersection and union

  • A ∩ B
    • Elements in both A and B
    • Keyword: and
    • Shaded: only the overlap
    • A ∩ B ⊆ A and A ∩ B ⊆ B
  • A ∪ B
    • Elements in A or B or both
    • Keyword: or
    • Shaded: both circles fully
    • A ⊆ A ∪ B and B ⊆ A ∪ B
Properties of intersection and union
IntersectionUnion
A ∩ B = B ∩ AA ∪ B = B ∪ A
If A ⊆ B then A ∩ B = AIf A ⊆ B then A ∪ B = B
A ∩ B ⊆ A and A ∩ B ⊆ BA ⊆ A ∪ B and B ⊆ A ∪ B
A ∩ A = AA ∪ A = A
A ∩ ∅ = ∅A ∪ ∅ = A
A ∩ A′ = ∅A ∪ A′ = U

Intersection = common part (and). Union = everything, each element once (or). If B ⊆ A, then A ∩ B = B and A ∪ B = A.

— Set operations

Key takeaways: A ∩ B holds the common elements and A ∪ B holds every element of either set, written once. Disjoint sets have A ∩ B = ∅. When one set is inside another, the intersection is the smaller set and the union is the larger set.

Read the full lesson

Lesson 5

Number of elements and word problems on sets

n(A ∪ B) = n(A) + n(B) − n(A ∩ B), which can also be written n(A) + n(B) = n(A ∪ B) + n(A ∩ B).

— Counting rule for two sets

Splitting U into four parts

  • Only A
    • n(A) − n(A ∩ B)
  • Both A and B
    • n(A ∩ B)
  • Only B
    • n(B) − n(A ∩ B)
  • Neither A nor B
    • n(U) − n(A ∪ B)
The four numbers always add up to n(U).

Steps for any two-set word problem

  1. Name the sets Let A and B be the two groups; U is everyone.
  2. Write what is given n(U), n(A), n(B), and any 'both' or 'neither' figure.
  3. Fill the overlap first Find n(A ∩ B) from the rule if it is missing.
  4. Fill only A and only B Subtract the overlap from each set.
  5. Find 'neither' n(U) − n(A ∪ B), then check that all four regions add to n(U).
Translating words into set language
Phrase in the questionMeans
at least one / A or Bn(A ∪ B)
bothn(A ∩ B)
only An(A) − n(A ∩ B)
neither / none of the twon(U) − n(A ∪ B)

Key takeaways: n(A) counts the elements of A. In n(A) + n(B) the common part is counted twice, so n(A ∪ B) = n(A) + n(B) − n(A ∩ B). Fill a Venn diagram from the middle outwards and check that the four regions add up to the total.

Read the full lesson

Privacy · Terms · Refunds · Delivery