Power Set Calculator

In set theory, the power set of any given set S is the collection of all its subsets, which includes both the empty set and the set S itself. If a set contains n distinct elements, the total number of subsets in its power set is calculated using the exponential formula 2ⁿ. For instance, a set with 3 elements will yield 2³ = 8 unique subsets. The calculation builds combinations systematically, starting from subsets of size zero (the empty set) up to size n.

Let us find the power set for a simple set containing three distinct elements: {A, B, C}. First, we identify the number of elements, which is n = 3. Using our formula, the power set will contain 2³ = 8 total subsets. We list them systematically by size: Size 0 yields the empty set (∅). Size 1 yields {A}, {B}, and {C}. Size 2 yields {A, B}, {A, C}, and {B, C}. Finally, Size 3 yields the full set {A, B, C}. Grouping all these together gives us the complete power set: {∅, {A}, {B}, {C}, {A, B}, {A, C}, {B, C}, {A, B, C}}.

When working with power sets manually, always remember to include the empty set and the original set itself as subsets. Be mindful of set cardinality; because the size of a power set grows exponentially (2ⁿ), adding just a few elements will drastically increase the total number of subsets. Always organize your subsets by length to ensure you do not miss any combinations or accidentally duplicate entries.