Difference between revisions of "Power set"
| Line 9: | Line 9: | ||
Similarly, for any [[finite]] set with <math>n</math> elements, the power set has <math>2^n</math> elements. | Similarly, for any [[finite]] set with <math>n</math> elements, the power set has <math>2^n</math> elements. | ||
| − | Note that | + | Note that for any set <math>\displaystyle S</math> such that <math>\displaystyle a \in S</math>, <math>\displaystyle \{ a \} \subseteq S </math>, so the power set of any set <math>\displaystyle S</math> has a [[cardinality]] at least as large as that of <math>\displaystyle S</math> itself. |
===Proof=== | ===Proof=== | ||
Revision as of 21:10, 26 August 2006
The power set of a given set 
is the set 
of subsets of that set.
The empty set has only one subset, itself. Thus 
.
A set 
with a single element has two subsets, the empty set and the entire set. Thus 
.
A set 
with two elements has four subsets, and 
.
Similarly, for any finite set with 
elements, the power set has 
elements.
Note that for any set 
such that 
, 
, so the power set of any set has a cardinality at least as large as that of itself.
Proof
See Also
This article is a stub. Help us out by expanding it.
