Power set: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(new entry, just a stub)
 
mNo edit summary
 
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
In [[set theory]], the '''power set''' of a set ''X'' is the set of all subsets of ''X''.
{{subpages}}
{{dambigbox||Power}}
In [[set theory]], the '''power set''' of a set ''X'' is the set of all [[subset]]s of ''X''.


:<math> \mathcal{P}X = \{ A : A \subsetseq 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]].[[Category:Suggestion Bot Tag]]

Latest revision as of 12:01, 6 October 2024

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.
This article is about Power set. For other uses of the term Power, please see Power (disambiguation).

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

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