Power set

Version

v3 · 2026-09-28 · History

Prime #

1539

Domain group

Formal Sciences

Origin domain

Mathematics

Aliases

Powerset

Core Idea

Power set is the cross-domain set-forming operation that lifts a carrier of elements into the complete space of possible selections from that carrier. The abstraction is not exhausted by its familiar source-domain notation. Its autonomous core is total subset formation, distinct from one family of selected subsets, Cartesian product, partition, combinations of a fixed size or a list that fails extensional set identity.

The operative mechanism is this: Every membership choice over S determines one subset, and collecting all such choices produces P(S); for finite S this gives 2 to the cardinality of S subsets and the inclusion relation organizes them as a Boolean lattice. The mechanism separates identity from observation.

How would you explain it like I'm…

Every Way to Pick

Imagine a toy box with a ball and a duck. You could pick nothing, just the ball, just the duck, or both. The power set is the list of every possible way to pick — including picking nothing and picking everything.

All Possible Picks

The power set of a group is the collection of all the smaller groups you can make from it, including the empty group and the whole group itself. For the set {A, B}, the power set is: {}, {A}, {B}, and {A, B}. That's four groups. For each item, you just decide 'in' or 'out,' so with 3 items there are 2 × 2 × 2 = 8 possible groups. Every time you add one more item, the number of possible groups doubles.

Set of All Subsets

The power set of a set S, written P(S), is the set of all subsets of S. It always includes the empty set and S itself. Each subset corresponds to a yes/no choice for every element (in or out), so a set with n elements has 2ⁿ subsets. For example, the power set of {1, 2, 3} has 8 members, from {} up to {1, 2, 3}. Be careful to distinguish it from similar ideas: it's not just the subsets of one particular size (that's combinations), not a way of splitting S into non-overlapping pieces (that's a partition), and not the set of ordered pairs (that's a Cartesian product).

 

The power set P(S) of a set S is the set whose members are exactly the subsets of S. Every membership choice, deciding for each element of S whether it is in or out, determines one subset, and collecting all such choices yields P(S); equivalently, subsets correspond to characteristic functions S → {0, 1}. For finite S with |S| = n, |P(S)| = 2ⁿ, and P(S) always contains both ∅ and S. Ordered by inclusion, the power set forms a Boolean lattice, with union and intersection as join and meet and complement relative to S. It must be distinguished from a particular family of selected subsets, from combinations of a fixed size (one layer of the lattice), from partitions, from Cartesian products, and from lists, which fail extensional set identity because they track order and repetition. For infinite sets, Cantor's theorem shows P(S) is always strictly larger than S.

Broad Use

finite combinatorics. The carrier is a three-element set. The identity test is that enumerate every membership choice. This is a literal instantiation rather than decorative analogy because the carrier, observable organization, conserved relation, variation class, and failure test retain the same roles. The domain accent is obtain eight subsets. A responsible analysis states scale, observation window, representation and noise model before claiming the structure, then distinguishes the structure itself from the process used to discover, stabilize or exploit it. Removing the constitutive relation must make the classification fail; otherwise the label is only topical resemblance. Evidence can be mathematical, experimental, computational or documentary, but it must attach to the same role graph and expose uncertainty and counterexamples.

Clarity

A clear Power set claim can be rewritten as a testable sentence: on carrier C at scale S, relation R holds within tolerance T, remains under transformations V, and fails for counterexample K. This grammar exposes missing components and prevents a noun from standing in for an argument.

Manages Complexity

Power set manages complexity by replacing an unstructured inventory with a small set of relations that survive relevant variation. Compression becomes legitimate when the retained relation supports reconstruction, comparison or reliable discrimination and the discarded details are declared incidental for the task.

The abstraction also supports chunking. Once an organized unit is established, reasoning can treat it as one object while retaining an audit trail to its elements.

Abstract Reasoning

1. Type the carrier and explain why its elements are individuated at the selected scale.
2. Separate the target structure from the notation, image, model or story used to display it.
3. State the constitutive relation as an equation, rule, repeatability condition or traceable interpretive criterion.
4. List transformations expected to preserve identity and justify why they are incidental.
5. Choose at least one positive diagnostic and one collapse test.

Knowledge Transfer

Transfer begins from the role graph, not the name. Preserve carrier, relation, invariant, admissible variation, diagnostic and collapse test; then substitute domain occupants. A successful mapping explains how the target case would be recognized and how it would fail.

The most common transfer error is feature substitution. One field may represent the structure visually, another algebraically and another behaviorally. The visible features are not the invariant. Transfer must identify the relation those features evidence and state the target domain's measurement or proof obligations.

Relationships to Other Abstractions

Current abstraction Power set Prime

Parents (1) — outgoing typed relations

• Power set is a kind of Set and Membership Prime

  The accepted reference-grade review places Power set under Set and Membership because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.

Hierarchy path (1) — routes to 1 parentless root

• Power set → is a kind of Set and Membership