Subset

If A and B are sets and every element of A is also an element of B, then: :*A is a subset of B, denoted by A \subseteq B, or equivalently, :* B is a superset of A, denoted by B \supseteq A. If A is a subset of B, but A is not equal to B (i.e. there exists at least one element of B which is not an element of A), then: :*A is a proper (or strict) subset of B, denoted by A \subsetneq B, or equivalently, :* B is a proper (or strict) superset of A, denoted by B \supsetneq A. The empty set, written \{ \} or \varnothing, has no elements, and therefore is vacuously a subset of any set X. ==Basic properties==

• Reflexivity: Given any set A, A \subseteq A • Transitivity: If A \subseteq B and B \subseteq C, then A \subseteq C • Antisymmetry: If A \subseteq B and B \subseteq A, then A = B. Proper subset • Irreflexivity: Given any set A, A \subsetneq A is False. • Transitivity: If A \subsetneq B and B \subsetneq C, then A \subsetneq C • Asymmetry: If A \subsetneq B then B \subsetneq A is False. ==⊂ and ⊃ symbols==

Some authors use the symbols \subset and \supset to indicate and respectively; that is, with the same meaning as and instead of the symbols \subseteq and \supseteq. For example, for these authors, it is true of every set A that A \subset A. (a reflexive relation). Other authors prefer to use the symbols \subset and \supset to indicate (also called strict) subset and superset respectively; that is, with the same meaning as and instead of the symbols \subsetneq and \supsetneq. This usage makes \subseteq and \subset analogous to the inequality symbols \leq and For example, if x \leq y, then x may or may not equal y, but if x then x definitely does not equal y, and is less than y (an irreflexive relation). Similarly, using the convention that \subset is proper subset, if A \subseteq B, then A may or may not equal B, but if A \subset B, then A definitely does not equal B. == Examples of subsets ==

s form a subset of the polygons. • The set A = {1, 2} is a proper subset of B = {1, 2, 3}, thus both expressions A \subseteq B and A \subsetneq B are true. • The set D = {1, 2, 3} is a subset (but a proper subset) of E = {1, 2, 3}, thus D \subseteq E is true, and D \subsetneq E is not true (false). • The set {x: x is a prime number greater than 10} is a proper subset of {x: x is an odd number greater than 10} • The set of natural numbers is a proper subset of the set of rational numbers; likewise, the set of points in a line segment is a proper subset of the set of points in a line. These are two examples in which both the subset and the whole set are infinite, and the subset has the same cardinality (the concept that corresponds to size, that is, the number of elements, of a finite set) as the whole; such cases can run counter to one's initial intuition. • The set of rational numbers is a proper subset of the set of real numbers. In this example, both sets are infinite, but the latter set has a larger cardinality (or ) than the former set. Another example in an Euler diagram: File:Example of A is a proper subset of B.svg|alt=Euler diagram: A = {1, 9, 11}; B = {1, 4, 8, 9, 11}|A is a proper subset of B. File:Example of C is no proper subset of B.svg|alt=Euler diagram: C = B = {1, 4, 8, 9, 11}|C is a subset but not a proper subset of B. ==Power set==

The set of all subsets of S is called its power set, and is denoted by \mathcal{P}(S). The inclusion relation \subseteq is a partial order on the set \mathcal{P}(S) defined by A \leq B \iff A \subseteq B. We may also partially order \mathcal{P}(S) by reverse set inclusion by defining A \leq B \text{ if and only if } B \subseteq A. For the power set \operatorname{\mathcal{P}}(S) of a set S, the inclusion partial order is—up to an order isomorphism—the Cartesian product of k = |S| (the cardinality of S) copies of the partial order on \{0, 1\} for which 0 This can be illustrated by enumerating S = \left\{ s_1, s_2, \ldots, s_k \right\},, and associating with each subset T \subseteq S (i.e., each element of 2^S) the k-tuple from \{0, 1\}^k, of which the ith coordinate is 1 if and only if s_i is a member of T. The set of all k-subsets of A is denoted by \tbinom{A}{k}, in analogue with the notation for binomial coefficients, which count the number of k-subsets of an n-element set. In set theory, the notation [A]^k is also common, especially when k is a transfinite cardinal number. == Other properties of inclusion ==

• A set A is a subset of B if and only if their intersection is equal to A. Formally: : A \subseteq B \text{ if and only if } A \cap B = A. • A set A is a subset of B if and only if their union is equal to B. Formally: : A \subseteq B \text{ if and only if } A \cup B = B. • A finite set A is a subset of B, if and only if the cardinality of their intersection is equal to the cardinality of A. Formally: : A \subseteq B \text{ if and only if } |A \cap B| = |A|. • The subset relation defines a partial order on sets. In fact, the subsets of a given set form a Boolean algebra under the subset relation, in which the join and meet are given by intersection and union, and the subset relation itself is the Boolean inclusion relation. • Inclusion is the canonical partial order, in the sense that every partially ordered set (X, \preceq) is isomorphic to some collection of sets ordered by inclusion. The ordinal numbers are a simple example: if each ordinal n is identified with the set [n] of all ordinals less than or equal to n, then a \leq b if and only if [a] \subseteq [b]. ==See also==