Generate the power set P(S) of any set with up to 6 elements. See all subsets organized by size, cardinality 2ⁿ, size distribution bars, and a complete subset listing.
The power set of a set S, written P(S) or 2^S, is the collection of all possible subsets of S — including the empty set ∅ and S itself. If S has n elements, its power set contains exactly 2ⁿ subsets. This fundamental concept in set theory and discrete mathematics underpins topics from combinatorics and probability to database theory and formal logic.
Understanding power sets helps build intuition for how quickly possibilities grow: even a modest set of 6 elements produces 64 subsets. In computer science, power sets are used to model state spaces, design test cases, and reason about access-control policies. In probability, every event in a sample space corresponds to an element of that space's power set.
This generator lets you enter up to 6 elements, then instantly enumerates every subset, groups them by size, and shows how the binomial coefficients C(n, k) govern the count at each size. The distribution bars reveal the symmetric, bell-curved shape of binomial coefficients, and the properties table lets you compare power-set sizes for sets of different cardinalities. Use the presets to explore classic examples quickly, or type in your own elements to investigate a custom set.
Power Set Generator helps you solve power set generator problems quickly while keeping each step transparent. Instead of redoing long algebra by hand, you can enter Set elements (comma-separated, max 6) once and immediately inspect Set S, Cardinality |P(S)|, Number of Proper Subsets to validate your work.
This is useful for homework checks, classroom examples, and practical what-if analysis. You keep the conceptual understanding while reducing arithmetic mistakes in multi-step calculations.
|P(S)| = 2ⁿ, where n = |S|. Number of subsets of size k = C(n, k) = n! / (k!(n−k)!).
Result: Set S shown by the calculator
Using the preset "{a, b}", the calculator evaluates the power set generator setup, applies the selected algebra rules, and reports Set S with supporting checks so you can verify each transformation.
This calculator takes Set elements (comma-separated, max 6) and applies the relevant power set generator relationships from your chosen method. It returns both final and intermediate values so you can audit the process instead of treating it as a black box.
Start with the primary output, then use Set S, Cardinality |P(S)|, Number of Proper Subsets, Number of Non-empty Subsets to confirm signs, magnitude, and internal consistency. If anything looks off, change one input and compare the updated outputs to isolate the issue quickly.
A strong workflow is manual solve first, calculator verify second. Repeating that loop improves speed and accuracy because you learn to spot common setup errors before they cost points on multi-step algebra problems.
The power set of S is the set of all possible subsets of S, including the empty set and S itself. Use this as a practical reminder before finalizing the result.
Each element is either included or excluded from a subset, giving 2 choices per element — so 2ⁿ total subsets. Keep this note short and outcome-focused for reuse.
P(∅) = {∅}. It contains exactly one subset: the empty set itself. So |P(∅)| = 2⁰ = 1.
A set with 6 elements has 64 subsets, which is practical to display. At 10 elements there would be 1,024 subsets, making the listing unwieldy.
The subsets themselves are unordered sets. The calculator groups them by size for readability, but there is no inherent ordering among subsets.
The number of subsets of size k is exactly C(n, k), the binomial coefficient "n choose k". The power set organizes all these combinations together.