Skip to content
Miscellaneous Examples · Example 24

Q.List all the subsets of the set { –1, 0, 1 }

Yanam CbseNCERTSubjective· 2mImportance★★★★★est
48% · 63/132 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

The key idea is to systematically list every possible combination of elements from the set {−1,0,1}\{-1, 0, 1\}. The total number of subsets is 23=82^3 = 8, and the complete list is: ∅\emptyset, {−1}\{-1\}, {0}\{0\}, {1}\{1\}, {−1,0}\{-1, 0\}, {−1,1}\{-1, 1\}, {0,1}\{0, 1\}, {−1,0,1}\{-1, 0, 1\}.

The question asks for all subsets of {−1,0,1}\{-1, 0, 1\}. A subset is any collection of elements taken from the original set, including the possibility of taking none (the empty set) or all (the set itself). The number of subsets of a set with nn elements is 2n2^n, because each element has two choices: either it is in the subset or it is not. Here n=3n = 3, so we expect 23=82^3 = 8 subsets.

The most reliable way to list them is to go by size — from 0 elements up to 3 elements — so you never miss one.

  1. 0-element subset (the empty set): ∅\emptyset (also written as {}\{\}). This is always a subset of any set.

  2. 1-element subsets (singletons): Pick each element alone.

    • {−1}\{-1\}
    • {0}\{0\}
    • {1}\{1\}
  3. 2-element subsets: Choose any two of the three elements.

    • {−1,0}\{-1, 0\}
    • {−1,1}\{-1, 1\}
    • {0,1}\{0, 1\}
  4. 3-element subset (the set itself): Take all three elements.

    • {−1,0,1}\{-1, 0, 1\}

That gives us 1 + 3 + 3 + 1 = 8 subsets, which matches the 232^3 count. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.