Subset: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (subpages) |
imported>Richard Pinch (define anchor inclusion) |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
In [[set theory]], a '''subset''' of a [[set (mathematics)|set]] ''X'' is a set ''A'' whose elements are all elements of ''X'': that is, <math>x \in A \Rightarrow x \in X</math>, denoted <math>A \subseteq X</math>. The [[empty set]] Ø and ''X'' itself are always subsets of ''X''. | In [[set theory]], a '''subset''' of a [[set (mathematics)|set]] ''X'' is a set ''A'' whose elements are all elements of ''X'': that is, <math>x \in A \Rightarrow x \in X</math>, denoted <math>A \subseteq X</math>. The [[empty set]] Ø and ''X'' itself are always subsets of ''X''. The relation between the subset and the containing set is '''inclusion'''. | ||
The [[power set]] of ''X'' is the set of all subsets of ''X''. | The [[power set]] of ''X'' is the set of all subsets of ''X''. | ||
Revision as of 11:19, 30 November 2008
In set theory, a subset of a set X is a set A whose elements are all elements of X: that is, , denoted . The empty set Ø and X itself are always subsets of X. The relation between the subset and the containing set is inclusion.
The power set of X is the set of all subsets of X.