Computing P({a, b, c})

Discrete Math · Axiom Academy

Systematic construction of a power set, organizing subsets by size, with binary representation connections. Excellent work! You've successfully computed a power set. Here's what we learned: Power Set Definition: P(S) is the set of all subsets of S, including the empty set and S itself Systematic Organization: Grouping by size (0, 1, 2, ..., n elements) ensures we don't miss any subsets Cardinality Formula: If |S| = n, then |P(S)| = 2ⁿ. For our example: | a,b,c | = 3, so |P( a,b,c )| = 2³ = 8 Binary Correspondence: Each subset maps to a binary string where 1 = include element, 0 = exclude. This gives us another way to count: 2 × 2 × 2 = 8 Decision Perspective: For each element, we make a binary choice (include or exclude), leading to 2ⁿ total subsets This systematic approach works for any finite set! The binary representation provides a computational method for generating power sets and proves why the cardinality is always 2ⁿ.

This is the written version of the interactive lesson above. See the full Discrete Math course.