Skip to content
Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Recipe

Find the complement of a set

Use when: you're given a set A and a universal set U, either stated or clear from context, and asked for A's complement

Goal: the exact set of elements of U that are not in A

Taught in Complement and the universal set

  1. 1

    Before doing anything else, identify exactly which universal set the problem is using. The complement depends entirely on that choice.

    Example

    U = \{1,2,3,4,5,6,7,8\} is stated directly. In a different problem, U might only be described as "the days of the week," which still has to be written out as a set before Step 2.

    • U is stated explicitly — use exactly the set given, with no changes.
    • U is only implied by context (a class roster, the days of the week) — write out U's elements from that context before continuing.

    Why: the same set A has a different complement in a different universal set, so skipping this step makes every later step meaningless.

  2. 2

    Go through U one element at a time, keeping only the ones that do not appear in A.

    Example

    U = \{1,2,3,4,5,6,7,8\}, A = \{2,4,6,8\}: checking 1 through 8 against A's list keeps 1,3,5,7 and drops 2,4,6,8.

    Why: this is exactly the definition of complement rewritten as U setminus A, so checking element by element guarantees nothing is missed.

  3. 3

    Complementing a complement removes every element of U not already excluded, which lands right back on A.

    Example

    The complement of the weekend days is the five weekdays. Complementing again removes the weekdays from U, landing back on the weekend days.

    • asked for the complement of a complement — the result is always A itself, with no further computation needed.
    • asked to explain why — point out the first complement removes A's elements, and the second removes everything left over, restoring A.

    Why: removing A's elements once, then removing everything left over a second time, undoes the first removal exactly.

Common mistakes

  • Computing a complement without first fixing U, or borrowing U from an earlier, unrelated problem.
  • Treating complement as a brand-new rule instead of recognizing it as U setminus A.
  • Assuming complementing twice produces some new set rather than recovering A.