Power set: Difference between revisions

Revision as of 11:44, 30 November 2008

Citable Version ^[?]

This editable Main Article is under development and subject to a disclaimer.

[edit intro]

In set theory, the power set of a set X is the set of all subsets of X.

{\mathcal {P}}X=\{A:A\subseteq X\}.\,

The power set is ordered by inclusion, making it a lattice.

Revision as of 13:29, 28 November 2008 (view source) imported>Richard Pinch (subpages) ← Older edit		Revision as of 11:44, 30 November 2008 (view source) imported>Richard Pinch (mention order) Newer edit →
Line 3:		Line 3:

	:<math> \mathcal{P}X = \{ A : A \subseteq X \} . \, </math>		:<math> \mathcal{P}X = \{ A : A \subseteq X \} . \, </math>

			The power set is [[order (relation)\|ordered]] by [[inclusion (set theory)\|inclusion]], making it a [[lattice (order)\|lattice]].