Generate all subsets, proper subsets, and the power set \(\mathcal{P}(S)\) of any finite set. Features cardinality groupings, binary bitmask mapping, and an interactive subset lattice diagram.
Duplicates are automatically removed. Sets with up to 10 elements supported for real-time visualization.
Input elements separated by commas or spaces. Duplicate elements are automatically detected and consolidated.
Review the total subset count \(2^n\), proper subsets \(2^n - 1\), and binomial coefficient combinations \(\binom{n}{k}\).
Browse subsets categorized by cardinality, observe the subset containment hierarchy, and copy the full power set.
Students frequently miss the empty set \(\emptyset\) or subset pairs when listing by hand. Our binary bitmask generator guarantees 100% complete listings.
Instantly verifies Pascal's identity \(\sum_{k=0}^n \binom{n}{k} = 2^n\), sorting subsets cleanly by cardinality from singletons to the full set.
The subset inclusion relation \((\mathcal{P}(S), \subseteq)\) forms a Boolean algebra. The lattice diagram provides intuitive geometric representation.
Crucial for computer science applications like relational database query optimization, power set testing in cryptography, and feature selection in machine learning.
Generates all subsets systematically via binary mapping from \(0\) to \(2^n - 1\), preventing duplicate or omitted sets.
Displays an interactive level-by-level vector diagram illustrating subset inclusion edges from \(\emptyset\) to \(S\).
Formats and copies the entire power set in standard mathematical bracket notation \(\{\emptyset, \{a\}, \dots, S\}\) to the clipboard.
Set theory is the fundamental alphabet of all modern mathematics. Understanding how elements group into subsets provides the bedrock for probability theory, database queries, and binary computer logic.
Imagine a control board with \(n\) light switches, each labeled with one element from your set. To build a subset, you walk down the board and make a binary choice for each switch: Leave it OFF (0) or Flip it ON (1). Since each of the \(n\) elements has independently 2 choices (Include or Exclude), the total number of unique switch combinations is:
All switches OFF corresponds to the empty set \(\emptyset\). All switches ON corresponds to the original set \(S\) itself.
Rule 1: The empty set \(\emptyset\) is a subset of every set. Rule 2: Every set is a subset of itself (\(S \subseteq S\)). Always include these two extremes when listing subsets on homework.
Subsets of size \(k\) are counted by binomial coefficients \(\binom{n}{k}\). Summing row \(n\) of Pascal's triangle proves that \(\sum_{k=0}^n \binom{n}{k} = 2^n\). For \(n=3\): \(1 + 3 + 3 + 1 = 8\).
In programming, an integer bitmask from \(0\) to \(2^n - 1\) iterates through all subsets in \(O(1)\) space. In probability, the power set of sample space \(\Omega\) defines the \(\sigma\)-algebra of all measurable events.
A proper subset (\(\subset\)) cannot equal the entire set \(S\). If asked for proper subsets, subtract 1 from \(2^n\): \(2^n - 1\). Leaving the full set in loses marks!
Writing \(a \subseteq S\) is mathematically invalid! \(a\) is an element (\(a \in S\)), whereas \(\{a\}\) wrapped in curly braces is a subset (\(\{a\} \subseteq S\)).
The empty set \(\emptyset\) is a proper subset of any non-empty set because \(\emptyset \ne S\) and \(\emptyset \subseteq S\). It is only excluded if asked specifically for "non-empty" proper subsets.
| Category | Formula | Includes \(\emptyset\)? | Includes Full Set \(S\)? |
|---|---|---|---|
| Total Subsets (Power Set) | \(2^n\) | Yes | Yes |
| Proper Subsets | \(2^n - 1\) | Yes | No |
| Non-Empty Subsets | \(2^n - 1\) | No | Yes |
| Non-Empty Proper Subsets | \(2^n - 2\) | No | No |
Step 1: Count elements: \(n = 3\). Total subsets: \(2^3 = 8\).
Step 2: Subsets of size 0 (\(\binom{3}{0} = 1\)): \(\emptyset\).
Step 3: Subsets of size 1 (\(\binom{3}{1} = 3\)): \(\{a\}, \{b\}, \{c\}\).
Step 4: Subsets of size 2 (\(\binom{3}{2} = 3\)): \(\{a, b\}, \{a, c\}, \{b, c\}\).
Step 5: Subsets of size 3 (\(\binom{3}{3} = 1\)): \(\{a, b, c\}\).
Total: \(1 + 3 + 3 + 1 = 8\) subsets. Proper subsets: \(8 - 1 = 7\).
Step 1: \(n = 2\). Total subsets: \(2^2 = 4\).
Step 2: Binary representation:
• 00 → \(\emptyset\)
• 01 → \(\{2\}\)
• 10 → \(\{1\}\)
• 11 → \(\{1, 2\}\)
Proper Subsets: \(\emptyset, \{1\}, \{2\}\) (3 proper subsets).
