Set Theory & Combinatorics

Power Set Calculator

Generate all \(2^n\) subsets and \(2^n - 1\) proper subsets of any set \(\mathcal{P}(S)\). Groups subsets by cardinality, builds interactive binary bitmask tables, and verifies Pascal's triangle binomial combinations.

Quick Examples:
Duplicates are automatically consolidated per standard axiomatic set theory.
Cardinality |S|

3

Total Subsets 2ⁿ

8

Proper Subsets 2ⁿ - 1

7

Pascal's Row C(n, k)

1 - 3 - 3 - 1

Complete Power Set Collection \(\mathcal{P}(S)\)
Subsets Grouped by Size (\(k\))
Binary Bitmask Truth Table

Each bit 1/0 corresponds to inclusion or exclusion of that element.

Step-by-Step Mathematical Derivation

How to Use the Power Set Calculator

  1. Enter your set elements: Type items separated by commas, spaces, or semicolons (e.g. \(1, 2, 3\) or \(a, b, c, d\)).
  2. Select sorting preference: Organize by Cardinality (from empty set \(\emptyset\) to full set \(S\)), Binary Sequence (matching bitwise index), or Lexicographical (alphabetical).
  3. Choose notation format: Render as formal LaTeX mathematical set notation \(\mathcal{P}(S)\), plain text, or JSON array.
  4. Inspect the bitmask truth table: View the binary decision table showing how binary numbers \(0\) to \(2^n - 1\) generate all unique subsets.

Problems This Power Set Calculator Solves

Enumerating subsets by hand grows exponentially at \(2^n\), making it extraordinarily easy to omit subsets, double-count duplicates, or misapply combinatorics. This calculator resolves key challenges:

Exponential Subset Omission

For a set with 5 elements (\(2^5 = 32\) subsets) or 6 elements (64 subsets), humans almost always skip subsets. The tool deterministically generates all \(2^n\) subsets without error.

Duplicate Element Deduplication

Automatically sanitizes inputs by collapsing duplicate elements according to standard set axioms, ensuring the true underlying cardinality \(|S|\) is modeled.

Combinatorial Binomial Verification

Groups subsets by cardinality \(k\) and validates each group count against Pascal's triangle coefficients \(\binom{n}{k}\), confirming \(\sum_{k=0}^n \binom{n}{k} = 2^n\).

Binary Bitmask & Computer Science Bridging

Demystifies the connection between binary numbers and subset generation with an interactive bitmask table, teaching bitwise subset algorithms.

Key Features & Capabilities

01

Binary Bitmask Table

Visualizes element inclusion via 1/0 bitwise truth rows corresponding to binary values \(0\) through \(2^n-1\).

02

Multi-Format Set Export

Formats power sets into rigorous LaTeX mathematical set notation \(\mathcal{P}(S)\), clean plain text, or valid JSON arrays.

03

Cardinality Grouping

Categorizes generated subsets into discrete rows by subset length \(k\) with matching Pascal's row counts.

What is a Power Set in Mathematics?

In axiomatic set theory, the power set of a set \(S\) (denoted \(\mathcal{P}(S)\), \(\wp(S)\), or \(2^S\)) is the set containing all possible subsets of \(S\), including both the empty set \(\emptyset\) and the set \(S\) itself:

\(\mathcal{P}(S) = \{ A \mid A \subseteq S \}\)

Key mathematical principles governing power sets include:

  • Universal Inclusions: For every set \(S\), \(\emptyset \in \mathcal{P}(S)\) and \(S \in \mathcal{P}(S)\).
  • Empty Set Power Set: For \(S = \emptyset\) (where \(|S| = 0\)), its power set is \(\mathcal{P}(\emptyset) = \{ \emptyset \}\), containing exactly \(2^0 = 1\) element.
  • Subset vs. Element Distinction: An element \(x \in S\) becomes a singleton subset \(\{x\} \in \mathcal{P}(S)\).

Why is the Cardinality Strictly \(2^n\)?

The cardinality formula \(|\mathcal{P}(S)| = 2^n\) is a direct consequence of the Fundamental Counting Principle:

When building any arbitrary subset \(A \subseteq S = \{x_1, x_2, \dots, x_n\}\), you make an independent binary decision for each element:

  • Choice 1: Include \(x_1\) (1) or Exclude \(x_1\) (0) → 2 options
  • Choice 2: Include \(x_2\) (1) or Exclude \(x_2\) (0) → 2 options
  • ...
  • Choice \(n\): Include \(x_n\) (1) or Exclude \(x_n\) (0) → 2 options

Total Combinations: \(\underbrace{2 \times 2 \times \dots \times 2}_{n\text{ times}} = 2^n\)

Subsets vs. Proper Subsets Explained

Subsets (\(A \subseteq S\))

A subset is any collection of elements belonging to \(S\). A subset is permitted to be equal to \(S\) itself. Every finite set of size \(n\) has exactly \(2^n\) subsets.

Proper Subsets (\(A \subset S\))

A proper subset must contain strictly fewer elements than \(S\) (\(A \ne S\)). The only subset excluded is the original set \(S\). Therefore, every set of size \(n\) has exactly \(2^n - 1\) proper subsets.

Frequently Asked Questions

What is a power set in mathematics? ▼
In set theory, the power set of a set S, denoted P(S) or 2^S, is the collection of all possible subsets of S, including both the empty set (∅) and the set S itself.
Why is the cardinality of a power set always 2^n? ▼
When constructing any subset of S = {x1, x2, ..., xn}, each element has exactly 2 independent binary choices: either it is included in the subset (1) or excluded from the subset (0). By the fundamental counting principle, 2 * 2 * ... * 2 (n times) = 2^n distinct subsets exist.
What is the difference between a subset and a proper subset? ▼
A subset A ⊆ S can be equal to S itself. A proper subset A ⊂ S must not be equal to S; it must contain strictly fewer elements than S. While a set has 2^n total subsets, it has exactly 2^n - 1 proper subsets (all subsets excluding S itself).
What is the power set of the empty set? ▼
The empty set ∅ has n = 0 elements. Its power set has 2^0 = 1 element: P(∅) = { ∅ }. Note that P(∅) is not empty; it is a set containing one element (the empty set).
How does Pascal's Triangle relate to power sets? ▼
The number of subsets of size k from a set of size n is given by the binomial coefficient C(n, k) = n! / (k!(n-k)!), which corresponds exactly to the entries in row n of Pascal's Triangle. Summing all elements in row n yields sum(C(n, k)) = 2^n.