Maths 1 Week 1: Sets, Relations & Functions

0. Prerequisites

NOTE

What you need to know before starting:

  • Basic Arithmetic: Addition, subtraction, multiplication, division.
  • Number Line: Understanding positive and negative integers.
  • Basic Algebra: Solving simple equations like .

Quick Refresher

  • Natural Numbers (): Counting numbers .
  • Integers (): Whole numbers plus negatives .
  • Rational Numbers (): Fractions where .
  • Real Numbers (): All numbers on the number line, including .

1. Core Concepts

1.1 Sets

A Set is a well-defined collection of distinct objects.

  • Notation: .
  • Cardinality (): The number of elements in set . If , then .
  • Subset (): Every element of is also in .
  • Power Set (): The set of all subsets of . If , then .

Operations

  • Union (): Everything in OR .
  • Intersection (): Everything in BOTH AND .
  • Difference (): Everything in that is NOT in .
  • Cartesian Product (): All pairs where .
    • Size: .

1.2 Relations

A Relation () from to is a subset of . It connects elements. If is on a set (subset of ), we check three properties:

  1. Reflexive: Every element relates to itself. .
    • Visual: Every node has a self-loop.
  2. Symmetric: If relates to , then relates to . .
    • Visual: If there’s an arrow , there must be .
  3. Transitive: If and , then .
    • Visual: Shortcuts must exist.

Equivalence Relation: A relation that is Reflexive, Symmetric, AND Transitive.

1.3 Functions

A Function () is a relation where every input in has exactly one output in .

  • Domain: The set of all inputs ().
  • Codomain: The set of potential outputs ().
  • Range: The set of actual outputs produced.

Types of Functions

  1. One-to-One (Injective): No two inputs give the same output.
    • Test: Horizontal Line Test (graph intersects at most once).
    • Algebra: .
  2. Onto (Surjective): Every element in Codomain is covered. Range = Codomain.
  3. Bijective: Both One-to-One and Onto. (Invertible).

2. Pattern Analysis & Goated Solutions

Pattern 1: Finding Cardinality (Inclusion-Exclusion)

Context: You are given sizes of sets and their intersections/unions and asked to find a missing value.

TIP

Mental Algorithm:

  1. Identify the sets involved (e.g., Students taking Math, Physics).
  2. Write down the known values: , , , etc.
  3. Use the formula: .
  4. For 3 sets: .

Example (Detailed Solution)

Problem: In a class of 50 students, 30 like Tea, 25 like Coffee, and 10 like both. How many like neither? Solution:

  1. Define Sets:
    • (Total students) = 50
    • (Tea) = 30
    • (Coffee) = 25
    • (Both) = 10
  2. Goal: Find students who like Neither. This is .
  3. Step 1: Find Union ().
    • Formula:
    • Calculation: .
    • Why? When we add Tea (30) and Coffee (25), we count the people who like both twice. Subtracting 10 fixes this double counting.
  4. Step 2: Subtract from Total.
    • Neither = Total - Union
    • Calculation: . Answer: 5 students like neither.

Pattern 2: Checking Equivalence Relations

Context: You are given a rule (e.g., if is even) and asked if it’s an equivalence relation.

TIP

Mental Algorithm (The β€œRST” Check):

  1. R (Reflexive): Check if is always true. Plug in the same value twice.
  2. S (Symmetric): Assume is true. Does this force to be true?
  3. T (Transitive): Assume AND . Does this force ?

Example (Detailed Solution)

Problem: Let be a relation on Integers defined by if is a multiple of 5. Is an equivalence relation? Solution:

  1. Reflexive Check ():
    • Is a multiple of 5?
    • .
    • Is 0 a multiple of 5? Yes ().
    • Reflexive: YES.
  2. Symmetric Check ():
    • Assume (multiple of 5).
    • We need to check .
    • .
    • Since is an integer, is a multiple of 5.
    • Symmetric: YES.
  3. Transitive Check ():
    • Assume and .
    • We need to check .
    • Trick: Add the two equations.
    • .
    • .
    • Since is integer, this is a multiple of 5.
    • Transitive: YES. Conclusion: Since R, S, and T are all YES, it is an Equivalence Relation.

Pattern 3: Finding Domain of Functions

Context: Given a function like , find valid values.

TIP

Mental Algorithm: Look for β€œIllegal Operations”:

  1. Division by Zero: Denominator .
  2. Square Root of Negative: Inside of .
  3. Log of Non-Positive: Inside of . Solve each condition and find the Intersection (overlap) of all valid regions.

Example (Detailed Solution)

Problem: Find the domain of . Solution:

  1. Condition 1: Square Root ()
    • Inside must be non-negative: .
    • .
    • This means is between -3 and 3: .
  2. Condition 2: Denominator ()
    • Denominator cannot be zero: .
    • .
  3. Combine (Intersection):
    • We need to be in AND .
    • Draw number line:
      • Valid:
      • Hole at:
    • Final Domain: .

3. Practice Exercises

  1. Cardinality: In a group of 100, 60 like Football, 50 like Cricket, 20 like neither. How many like both?
    • Hint: Use . Then use Inclusion-Exclusion.
  2. Relations: . . Is it Symmetric?
    • Hint: We have . Do we have ?
  3. Domain: Find domain of .
    • Hint: . Be careful with inequalities!

🧠 Level Up: Advanced Practice

Question 1: The Domain Trap

Problem: Find the domain of . Common Mistake: Thinking means and . Correct Logic:

  • The fraction is positive if BOTH numerator and denominator are positive OR if BOTH are negative.
  • Case 1 (+/+): AND AND .
  • Case 2 (-/-): AND AND .
  • Union: .

Question 2: Relation Cardinality

Problem: Set has elements. How many relations on are Reflexive? Logic:

  1. Total pairs in is .
  2. Reflexive means all must be present ( specific pairs).
  3. Remaining pairs: .
  4. Each remaining pair can be either IN or OUT (2 choices).
  5. Answer: .

Question 3: Subset Logic

Problem: If , what is ? Logic:

  • Draw Venn Diagram.
  • Since is inside , depends on .
  • Actually, simplify: is the part of inside .
  • Adding (which is already inside ) doesn’t simplify neatly unless we know more about .
  • Trap: Don’t assume .
  • Test: . . .