Power Set Calculator – Guide & Formulas
Generate the complete power set of any set. Enter elements separated by commas to see all 2ⁿ subsets listed systematically with cardinality and cardinality breakdown.
Try the free calculator
Put these formulas into practice with our instant, step-by-step Power Set Calculator.
Our free **Power Set Calculator** generates the complete **power set** of any set instantly. Enter elements separated by commas (like 1, 2, 3) to see all **2ⁿ subsets** listed systematically, organized by size from the **empty set** ∅ to the full set itself. The calculator shows the **cardinality** of the power set, groups subsets by their size, and provides a clear breakdown of the combinatorial structure. Whether you are studying **set theory**, working on **probability problems**, or exploring **combinatorics**, this tool helps you visualize and enumerate all possible subsets of any set.
Key Takeaway
Use the free Power Set Calculator to generate the complete power set of any set. enter elements separated by commas to see all 2ⁿ subsets listed systematically with cardinality and cardinality breakdown. Get instant results with step-by-step explanations.
How to Use the Power Set Calculator
- Enter set elements separated by commas (e.g., 1, 2, 3 or a, b, c, d).
- The calculator generates all 2ⁿ subsets where n is the number of elements.
- Review subsets organized by size (cardinality) from 0 to n.
- Check the total count and subset breakdown by size.
- Verify specific subsets or count how many subsets meet certain criteria.
The Formula
Variable Definitions
- P(A): The power set of A: the set of all subsets of A
- |A|: The cardinality (number of elements) of set A
- 2ⁿ: Total number of subsets in the power set
- ∅: The empty set, which is always a subset
- Subset: A set B is a subset of A if every element of B is in A
Power Set of {1, 2, 3}
Generate all subsets of a 3-element set.
- Step 1: n = 3 elements, so there are 2³ = 8 subsets.
- Step 2: Size 0 (1 subset): ∅.
- Step 3: Size 1 (3 subsets): {1}, {2}, {3}.
- Step 4: Size 2 (3 subsets): {1,2}, {1,3}, {2,3}.
- Step 5: Size 3 (1 subset): {1,2,3}. Total: 1 + 3 + 3 + 1 = 8 subsets.
Financial Advisory Notice
This calculator is for educational purposes only. Always verify results independently for academic or professional applications.
Frequently Asked Questions
What is a power set?
The power set of a set A is the set of all possible subsets of A, including the empty set and A itself. For a set with n elements, the power set contains exactly 2ⁿ subsets.
Why does the power set have 2ⁿ elements?
Each element can either be included or excluded from a subset (2 choices per element). With n elements, there are 2 × 2 × ... × 2 = 2ⁿ total combinations.
Is the empty set always in the power set?
Yes. The empty set ∅ is a subset of every set, so it is always an element of the power set. It corresponds to the case where no elements are chosen.
Is the set itself always in the power set?
Yes. Every set is a subset of itself, so A ∈ P(A). It corresponds to the case where all elements are chosen.
How large can the power set get?
A set with 20 elements has 2²⁰ = 1,048,576 subsets. A set with 30 elements has over 1 billion subsets. The power set grows exponentially.
What is the notation for power set?
The power set is denoted P(A), 𝒫(A), or 2ᴬ. The superscript notation 2ᴬ directly reflects the 2ⁿ cardinality.
Can I compute the power set of a multiset?
For multisets (sets with repeated elements), the power set concept extends but requires careful handling of multiplicities. This calculator treats all elements as distinct.
What are applications of power sets?
Applications include: probability (event spaces), logic (propositional combinations), database theory (query optimization), and combinatorics (counting problems).
How do I generate a power set by hand?
Use binary counting: assign each element a bit position. 000 = ∅, 001 = {first element}, 010 = {second element}, and so on up to 111 = {all elements}.
What is the difference between a subset and a power set?
A subset is a single set whose elements all belong to another set. The power set is the collection of ALL possible subsets, including ∅ and the original set.
Does order matter in power set subsets?
No. Sets are unordered, so {1,2} and {2,1} represent the same subset. The power set contains each unique subset exactly once regardless of element order.
What is the cardinality of the power set of the empty set?
P(∅) = {∅}, which has 1 element. Since |∅| = 0, the power set has 2⁰ = 1 subset (the empty set itself).
How does the power set relate to binary numbers?
Each subset corresponds to a binary number: bit i is 1 if element i is included, 0 if excluded. A set with n elements maps to binary numbers 0 through 2ⁿ - 1.
Can the power set contain duplicate subsets?
No. By definition, a power set contains each unique subset exactly once. Since sets are unordered and have no duplicate elements, each combination appears once.
What is the power set of {a, b}?
P({a,b}) = {∅, {a}, {b}, {a,b}}. There are 2² = 4 subsets: the empty set, each single element, and the full set.
How many proper subsets does a power set have?
A set with n elements has 2ⁿ - 1 proper subsets (all subsets except the set itself). The empty set has 0 proper subsets.
What is the relationship between power set and Cartesian product?
The power set P(A) contains all subsets of A. The Cartesian product A × A contains all ordered pairs. They are different concepts but both fundamental in set theory.
Is the power set always larger than the original set?
Yes. Cantor's theorem proves that |P(A)| > |A| for any set A. For finite sets, 2ⁿ > n for all n ≥ 0. This shows there are always more subsets than elements.
What is the power set used for in probability?
In probability, the power set of a sample space represents all possible events. Each event is a subset of outcomes, and the power set gives the complete event space.
Can I find the power set of a set with letters?
Yes. The calculator works with any elements: numbers, letters, or symbols. For example, P({a, b, c}) = {∅, {a}, {b}, {c}, {a,b}, {a,c}, {b,c}, {a,b,c}}.
What is the power set of a 4-element set?
A 4-element set has 2⁴ = 16 subsets: 1 of size 0, 4 of size 1, 6 of size 2, 4 of size 3, and 1 of size 4.
How do I use the power set in combinatorics?
The power set counts all possible selections from a set. It connects to binomial coefficients: the number of subsets of size k is C(n,k) = n!/(k!(n-k)!).