Power Set Calculator

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.

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.

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.

Yes. Every set is a subset of itself, so A ∈ P(A). It corresponds to the case where all elements are chosen.

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.

The power set is denoted P(A), 𝒫(A), or 2ᴬ. The superscript notation 2ᴬ directly reflects the 2ⁿ cardinality.

For multisets (sets with repeated elements), the power set concept extends but requires careful handling of multiplicities. This calculator treats all elements as distinct.

Applications include: probability (event spaces), logic (propositional combinations), database theory (query optimization), and combinatorics (counting problems).

Use binary counting: assign each element a bit position. 000 = ∅, 001 = {first element}, 010 = {second element}, and so on up to 111 = {all elements}.

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.

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.

P(∅) = {∅}, which has 1 element. Since |∅| = 0, the power set has 2⁰ = 1 subset (the empty set itself).

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.

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.

P({a,b}) = {∅, {a}, {b}, {a,b}}. There are 2² = 4 subsets: the empty set, each single element, and the full set.

A set with n elements has 2ⁿ - 1 proper subsets (all subsets except the set itself). The empty set has 0 proper subsets.

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.

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.

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.

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}}.

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.

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)!).

The Power Set Calculator uses standard mathematical formulas validated against authoritative references. The specific formula is displayed in the calculator interface with a detailed explanation of each variable.

Each calculator includes a step-by-step worked example showing exactly how the formula is applied. You can follow these steps with pen and paper to verify any result.

The Power Set Calculator accepts numeric inputs including integers and decimals. Invalid inputs (letters, special characters) are rejected with clear error messages.