Frequent Links
Open Access Articles Top Results for Subset
International Journal of Innovative Research in Computer and Communication Engineering
Feature subset selection using filtering with Mutual information and Maximal information coefficientInternational Journal of Innovative Research in Science, Engineering and Technology
A Subset of the Space of the Orlicz Space of SequencesInternational Journal of Innovative Research in Science, Engineering and Technology
Virtual Screening of Ligand molecules for target protein CYP26A1 by using AutoDockVinaInternational Journal of Innovative Research in Computer and Communication Engineering
Efficient Feature Subset Selection Techniques for High Dimensional DataInternational Journal of Innovative Research in Computer and Communication Engineering
Analysing the Efficiency of Data by Using Fast Clustering and Subset Selection AlgorithmSubset
In mathematics, especially in set theory, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B, that is, all elements of A are also elements of B. A and B may coincide. The relationship of one set being a subset of another is called inclusion or sometimes containment.
The subset relation defines a partial order on sets.
The algebra of subsets forms a Boolean algebra in which the subset relation is called inclusion.
Contents
Definitions
If A and B are sets and every element of A is also an element of B, then:
 A is a subset of (or is included in) B, denoted by <math>A \subseteq B</math>,
 or equivalently
 B is a superset of (or includes) A, denoted by <math>B \supseteq A.</math>
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 also a proper (or strict) subset of B; this is written as <math>A\subsetneq B.</math>
 or equivalently
 B is a proper superset of A; this is written as <math>B\supsetneq A.</math>
For any set S, the inclusion relation ⊆ is a partial order on the set <math>\mathcal{P}(S)</math> of all subsets of S (the power set of S).
When quantified, A ⊆ B is represented as: ∀x{x∈A → x∈B}.^{[1]}
⊂ and ⊃ symbols
Some authors use the symbols ⊂ and ⊃ to indicate subset and superset respectively; that is, with the same meaning and instead of the symbols, ⊆ and ⊇.^{[2]} So for example, for these authors, it is true of every set A that A ⊂ A.
Other authors prefer to use the symbols ⊂ and ⊃ to indicate proper subset and superset, respectively, instead of ⊊ and ⊋.^{[3]} This usage makes ⊆ and ⊂ analogous to the inequality symbols ≤ and <. For example, if x ≤ y then x may or may not equal y, but if x < y, then x may not equal y, and is less than y. Similarly, using the convention that ⊂ is proper subset, if A ⊆ B, then A may or may not equal B, but if A ⊂ B, then A definitely does not equal B.
Examples
 The set A = {1, 2} is a proper subset of B = {1, 2, 3}, thus both expressions A ⊆ B and A ⊊ B are true.
 The set D = {1, 2, 3} is a subset of E = {1, 2, 3}, thus D ⊆ E is true, and D ⊊ E is not true (false).
 Any set is a subset of itself, but not a proper subset. (X ⊆ X is true, and X ⊊ X is false for any set X.)
 The empty set { }, denoted by ∅, is also a subset of any given set X. It is also always a proper subset of any set except itself.
 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 power) than the former set.
Another example in an Euler diagram:
 Example of A is a proper subset of B.svg
A is a proper subset of B
 Example of C is no proper subset of B.svg
C is a subset but no proper subset of B
Other properties of inclusion
Inclusion is the canonical partial order in the sense that every partially ordered set (X, <math>\preceq</math>) 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 ≤ b if and only if [a] ⊆ [b].
For the power set <math>\mathcal{P}(S)</math> 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 < 1. This can be illustrated by enumerating S = {s_{1}, s_{2}, …, s_{k}} and associating with each subset T ⊆ S (which is to say with each element of 2^{S}) the ktuple from {0,1}^{k} of which the ith coordinate is 1 if and only if s_{i} is a member of T.
See also
References
 ^ Rosen, Kenneth H. (2012). Discrete Mathematics and Its Applications (7th ed.). New York: McGrawHill. p. 119. ISBN 9780073383095.
 ^ Rudin, Walter (1987), Real and complex analysis (3rd ed.), New York: McGrawHill, p. 6, ISBN 9780070542341, MR 924157
 ^ Subsets and Proper Subsets (PDF), retrieved 20120907
 Jech, Thomas (2002). Set Theory. SpringerVerlag. ISBN 3540440852.
External links

