Subset

Set whose elements all belong to another set

"Superset" redirects here. For other uses, see Superset (disambiguation).

"⊃" redirects here. For the logic symbol, see Horseshoe (symbol). For other uses, see Horseshoe (disambiguation).

Euler diagram showing
A is a subset of B (denoted  A ⊆ B {\displaystyle A\subseteq B} ) and, conversely, B is a superset of A (denoted  B ⊇ A {\displaystyle B\supseteq A} )

In mathematics, a set A is a subset of a set B if all elements of A are also elements of B; B is then a superset of A. It is possible for A and B to be equal; if they are unequal, then A is a proper subset of B. The relationship of one set being a subset of another is called inclusion (or sometimes containment). A is a subset of B may also be expressed as B includes (or contains) A or A is included (or contained) in B. A k-subset is a subset with k elements.

When quantified,  A ⊆ B {\displaystyle A\subseteq B} is represented as  ∀ x ( x ∈ A ⇒ x ∈ B ) . {\displaystyle \forall x\left(x\in A\Rightarrow x\in B\right).} [1]

One can prove the statement  A ⊆ B {\displaystyle A\subseteq B} by applying a proof technique known as the element argument[2]:

> Let sets A and B be given. To prove that  A ⊆ B , {\displaystyle A\subseteq B,}

>   1. suppose that a is a particular but arbitrarily chosen element of A
>   2. show that a is an element of B.

The validity of this technique can be seen as a consequence of universal generalization: the technique shows  ( c ∈ A ) ⇒ ( c ∈ B ) {\displaystyle (c\in A)\Rightarrow (c\in B)} for an arbitrarily chosen element c. Universal generalisation then implies  ∀ x ( x ∈ A ⇒ x ∈ B ) , {\displaystyle \forall x\left(x\in A\Rightarrow x\in B\right),} which is equivalent to  A ⊆ B , {\displaystyle A\subseteq B,} as stated above.

## Definition

[edit]

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 ⊆ B {\displaystyle A\subseteq B} , or equivalently,
* B is a superset of A, denoted by  B ⊇ A . {\displaystyle 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 ⊊ B {\displaystyle A\subsetneq B} , or equivalently,
* B is a proper (or strict) superset of A, denoted by  B ⊋ A . {\displaystyle B\supsetneq A.}

The empty set, written  { } {\displaystyle \\{\\}} or  ∅ , {\displaystyle \varnothing ,} has no elements, and therefore is vacuously a subset of any set X.

## Basic properties

[edit]

A ⊆ B {\displaystyle A\subseteq B} and  B ⊆ C {\displaystyle B\subseteq C} implies  A ⊆ C . {\displaystyle A\subseteq C.}

* Reflexivity: Given any set  A {\displaystyle A} ,  A ⊆ A {\displaystyle A\subseteq A} [3]
* Transitivity: If  A ⊆ B {\displaystyle A\subseteq B} and  B ⊆ C {\displaystyle B\subseteq C} , then  A ⊆ C {\displaystyle A\subseteq C}
* Antisymmetry: If  A ⊆ B {\displaystyle A\subseteq B} and  B ⊆ A {\displaystyle B\subseteq A} , then  A = B {\displaystyle A=B} .

### Proper subset

[edit]

* Irreflexivity: Given any set  A {\displaystyle A} ,  A ⊊ A {\displaystyle A\subsetneq A} is False.
* Transitivity: If  A ⊊ B {\displaystyle A\subsetneq B} and  B ⊊ C {\displaystyle B\subsetneq C} , then  A ⊊ C {\displaystyle A\subsetneq C}
* Asymmetry: If  A ⊊ B {\displaystyle A\subsetneq B} then  B ⊊ A {\displaystyle B\subsetneq A} is False.

## ⊂ and ⊃ symbols

[edit]

Some authors use the symbols  ⊂ {\displaystyle \subset } and  ⊃ {\displaystyle \supset } to indicate subset and superset respectively; that is, with the same meaning as and instead of the symbols  ⊆ {\displaystyle \subseteq } and  ⊇ . {\displaystyle \supseteq .} [4] For example, for these authors, it is true of every set A that  A ⊂ A . {\displaystyle A\subset A.} (a reflexive relation).

Other authors prefer to use the symbols  ⊂ {\displaystyle \subset } and  ⊃ {\displaystyle \supset } to indicate proper (also called strict) subset and proper superset respectively; that is, with the same meaning as and instead of the symbols  ⊊ {\displaystyle \subsetneq } and  ⊋ . {\displaystyle \supsetneq .} [5] This usage makes  ⊆ {\displaystyle \subseteq } and  ⊂ {\displaystyle \subset } analogous to the inequality symbols  ≤ {\displaystyle \leq } and  < . {\displaystyle <.} For example, if  x ≤ y , {\displaystyle x\leq y,} then x may or may not equal y, but if  x < y , {\displaystyle x<y,} then x definitely does not equal y, and is less than y (an irreflexive relation). Similarly, using the convention that  ⊂ {\displaystyle \subset } is proper subset, if  A ⊆ B , {\displaystyle A\subseteq B,} then A may or may not equal B, but if  A ⊂ B , {\displaystyle A\subset B,} then A definitely does not equal B.

## Examples of subsets

[edit]

The regular polygons form a subset of the polygons.

* The set A = {1, 2} is a proper subset of B = {1, 2, 3}, thus both expressions  A ⊆ B {\displaystyle A\subseteq B} and  A ⊊ B {\displaystyle A\subsetneq B} are true.
* The set D = {1, 2, 3} is a subset (but not a proper subset) of E = {1, 2, 3}, thus  D ⊆ E {\displaystyle D\subseteq E} is true, and  D ⊊ E {\displaystyle 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 power) than the former set.

Another example in an Euler diagram:

* A is a proper subset of B.

* C is a subset but not a proper subset of B.

## Power set

[edit]

The set of all subsets of  S {\displaystyle S} is called its power set, and is denoted by  P ( S ) {\displaystyle {\mathcal {P}}(S)} .[6]

The inclusion relation ⊆ {\displaystyle \subseteq } is a partial order on the set  P ( S ) {\displaystyle {\mathcal {P}}(S)} defined by  A ≤ B ⟺ A ⊆ B {\displaystyle A\leq B\iff A\subseteq B} . We may also partially order  P ( S ) {\displaystyle {\mathcal {P}}(S)} by reverse set inclusion by defining  A ≤ B if and only if B ⊆ A . {\displaystyle A\leq B{\text{ if and only if }}B\subseteq A.}

For the power set  P ⁡ ( S ) {\displaystyle \operatorname {\mathcal {P}} (S)} of a set S, the inclusion partial order is—up to an order isomorphism—the Cartesian product of  k = | S | {\displaystyle k=|S|} (the cardinality of S) copies of the partial order on  { 0 , 1 } {\displaystyle \\{0,1\\}} for which  0 < 1. {\displaystyle 0<1.} This can be illustrated by enumerating  S = { s 1 , s 2 , … , s k } , {\displaystyle S=\left\\{s_{1},s_{2},\ldots ,s_{k}\right\\},} , and associating with each subset  T ⊆ S {\displaystyle T\subseteq S} (i.e., each element of  2 S {\displaystyle 2^{S}} ) the k-tuple from  { 0 , 1 } k , {\displaystyle \\{0,1\\}^{k},} of which the ith coordinate is 1 if and only if  s i {\displaystyle s_{i}} is a member of T.

The set of all  k {\displaystyle k} -subsets of  A {\displaystyle A} is denoted by  ( A k ) {\displaystyle {\tbinom {A}{k}}} , in analogue with the notation for binomial coefficients, which count the number of  k {\displaystyle k} -subsets of an  n {\displaystyle n} -element set. In set theory, the notation  [ A ] k {\displaystyle [A]^{k}} is also common, especially when  k {\displaystyle k} is a transfinite cardinal number.

## Other properties of inclusion

[edit]

* A set A is a subset of B if and only if their intersection is equal to A. Formally:

A ⊆ B if and only if A ∩ B = A . {\displaystyle 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 ⊆ B if and only if A ∪ B = B . {\displaystyle 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 ⊆ B if and only if | A ∩ B | = | A | . {\displaystyle 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 , ⪯ ) {\displaystyle (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 ] {\displaystyle [n]} of all ordinals less than or equal to n, then  a ≤ b {\displaystyle a\leq b} if and only if  [ a ] ⊆ [ b ] . {\displaystyle [a]\subseteq [b].}

## See also

[edit]

* Convex subset – In geometry, set whose intersection with every line is a single line segmentPages displaying short descriptions of redirect targets
* Inclusion order – Partial order that arises as the subset-inclusion relation on some collection of objects
* Mereology – Study of parts and the wholes they form
* Region – Connected open subset of a topological spacePages displaying short descriptions of redirect targets
* Subset sum problem – Decision problem in computer science
* Subsumptive containment – System of elements that are subordinated to each other
* Subspace – Mathematical set with some added structurePages displaying short descriptions of redirect targets
* Total subset – Subset T of a topological vector space X where the linear span of T is a dense subset of X

## References

[edit]

1. ^ Rosen, Kenneth H. (2012). Discrete Mathematics and Its Applications (7th ed.). New York: McGraw-Hill. p. 119. ISBN 978-0-07-338309-5.
2. ^ Epp, Susanna S. (2011). Discrete Mathematics with Applications (Fourth ed.). Cengage Learning. p. 337\. ISBN 978-0-495-39132-6.
3. ^ Stoll, Robert R. (1963). Set Theory and Logic. San Francisco, CA: Dover Publications. ISBN 978-0-486-63829-4. `{{cite book}}`: ISBN / Date incompatibility (help)
4. ^ Rudin, Walter (1987), Real and complex analysis (3rd ed.), New York: McGraw-Hill, p. 6, ISBN 978-0-07-054234-1, MR 0924157
5. ^ Subsets and Proper Subsets (PDF), archived from the original (PDF) on 2013-01-23, retrieved 2012-09-07
6. ^ Weisstein, Eric W. "Subset". mathworld.wolfram.com. Retrieved 2020-08-23.

## Bibliography

[edit]

* Jech, Thomas (2002). Set Theory. Springer-Verlag. ISBN 3-540-44085-2.

## External links

[edit]

* Media related to Subsets at Wikimedia Commons
* Weisstein, Eric W. "Subset". MathWorld.

* v
* t
* e

Mathematical logic

General|

* Axiom
* list
* Cardinality
* First-order logic
* Formal proof
* Formal semantics
* Foundations of mathematics
* Information theory
* Lemma
* Logical consequence
* Model
* Theorem
* Theory
* Type theory

Theorems (list)
and paradoxes|

* Gödel's completeness and incompleteness theorems
* Tarski's undefinability
* Banach–Tarski paradox
* Cantor's theorem, paradox and diagonal argument
* Compactness
* Halting problem
* Lindström's
* Löwenheim–Skolem
* Russell's paradox

Logics|

| Traditional|

* Classical logic
* Logical truth
* Tautology
* Proposition
* Inference
* Logical equivalence
* Consistency
* Equiconsistency
* Argument
* Soundness
* Validity
* Syllogism
* Square of opposition
* Venn diagram

|

Propositional|

* Boolean algebra
* Boolean functions
* Logical connectives
* Propositional calculus
* Propositional formula
* Truth tables
* Many-valued logic
* 3
* finite
* ∞

Predicate|

* First-order
* list
* Second-order
* Monadic
* Higher-order
* Fixed-point
* Free
* Quantifiers
* Predicate
* Monadic predicate calculus

Set theory|

* Set
* hereditary
* Class
* (Ur-)Element
* Ordinal number
* Extensionality
* Forcing
* Relation
* equivalence
* partition
* Set operations:
* intersection
* union
* complement
* Cartesian product
* power set
* identities

Types of sets|

* Countable
* Uncountable
* Empty
* Inhabited
* Singleton
* Finite
* Infinite
* Transitive
* Ultrafilter
* Recursive
* Fuzzy
* Universal
* Universe
* constructible
* Grothendieck
* Von Neumann

Maps and cardinality|

* Function/Map
* domain
* codomain
* image
* In/Sur/Bi-jection
* Schröder–Bernstein theorem
* Isomorphism
* Gödel numbering
* Enumeration
* Large cardinal
* inaccessible
* Aleph number
* Operation
* binary

Set theories|

* Zermelo–Fraenkel
* axiom of choice
* continuum hypothesis
* General
* Kripke–Platek
* Morse–Kelley
* Naive
* New Foundations
* Tarski–Grothendieck
* Von Neumann–Bernays–Gödel
* Ackermann
* Constructive

Formal systems (list),
language and syntax|

* Alphabet
* Arity
* Automata
* Axiom schema
* Expression
* ground
* Extension
* by definition
* conservative
* Relation
* Formation rule
* Grammar
* Formula
* atomic
* closed
* ground
* open
* Free/bound variable
* Language
* Metalanguage
* Logical connective
* ¬
* ∨
* ∧
* →
* ↔
* =
* Predicate
* functional
* variable
* propositional variable
* Proof
* Quantifier
* ∃
* !
* ∀
* rank
* Sentence
* atomic
* spectrum
* Signature
* String
* Substitution
* Symbol
* function
* logical/constant
* non-logical
* variable
* Term
* Theory
* list

Example axiomatic
systems (list)|

* of arithmetic:
* Peano
* second-order
* elementary function
* primitive recursive
* Robinson
* Skolem
* of the real numbers
* Tarski's axiomatization
* of Boolean algebras
* canonical
* minimal axioms
* of geometry:
* Euclidean:
* Elements
* Hilbert's
* Tarski's
* non-Euclidean

* Principia Mathematica

Proof theory|

* Formal proof
* Natural deduction
* Logical consequence
* Rule of inference
* Sequent calculus
* Theorem
* Systems
* axiomatic
* deductive
* Hilbert
* list
* Complete theory
* Independence (from ZFC)
* Proof of impossibility
* Ordinal analysis
* Reverse mathematics
* Self-verifying theories

Model theory|

* Interpretation
* function
* of models
* Model
* equivalence
* finite
* saturated
* spectrum
* submodel
* Non-standard model
* of arithmetic
* Diagram
* elementary
* Categorical theory
* Model complete theory
* Satisfiability
* Semantics of logic
* Strength
* Theories of truth
* semantic
* Tarski's
* Kripke's
* T-schema
* Transfer principle
* Truth predicate
* Truth value
* Type
* Ultraproduct
* Validity

Computability theory|

* Church encoding
* Church–Turing thesis
* Computably enumerable
* Computable function
* Computable set
* Decision problem
* decidable
* undecidable
* P
* NP
* P versus NP problem
* Kolmogorov complexity
* Lambda calculus
* Primitive recursive function
* Recursion
* Recursive set
* Turing machine
* Type theory

Related|

* Abstract logic
* Algebraic logic
* Automated theorem proving
* Category theory
* Concrete/Abstract category
* Category of sets
* History of logic
* History of mathematical logic
* timeline
* Logicism
* Mathematical object
* Philosophy of mathematics
* Supertask

Mathematics portal

* v
* t
* e

Set theory

Overview|

* Set (mathematics)

Axioms|

* Adjunction
* Choice
* countable
* dependent
* global
* Constructibility (V=L)
* Determinacy
* projective
* Extensionality
* Infinity
* Limitation of size
* Pairing
* Power set
* Regularity
* Union
* Martin's axiom

* Axiom schema
* replacement
* specification

Operations|

* Cartesian product
* Complement (i.e. set difference)
* De Morgan's laws
* Disjoint union
* Identities
* Intersection
* Power set
* Symmetric difference
* Union

* Concepts
* Methods

* Almost
* Cardinality
* Cardinal number (large)
* Class
* Constructible universe
* Continuum hypothesis
* Diagonal argument
* Element
* ordered pair
* tuple
* Family
* Forcing
* One-to-one correspondence
* Ordinal number
* Set-builder notation
* Transfinite induction
* Venn diagram

Set types|

* Amorphous
* Countable
* Empty
* Finite (hereditarily)
* Filter
* base
* subbase
* Ultrafilter
* Fuzzy
* Infinite (Dedekind-infinite)
* Recursive
* Singleton
* Subset · Superset
* Transitive
* Uncountable
* Universal

Theories|

* Alternative
* Axiomatic
* Naive
* Cantor's theorem

* Zermelo
* General
* Principia Mathematica
* New Foundations
* Zermelo–Fraenkel
* von Neumann–Bernays–Gödel
* Morse–Kelley
* Kripke–Platek
* Tarski–Grothendieck

* Paradoxes
* Problems

* Russell's paradox
* Suslin's problem
* Burali-Forti paradox

Set theorists|

* Paul Bernays
* Georg Cantor
* Paul Cohen
* Richard Dedekind
* Abraham Fraenkel
* Kurt Gödel
* Thomas Jech
* John von Neumann
* Willard Quine
* Bertrand Russell
* Thoralf Skolem
* Ernst Zermelo

* v
* t
* e

Common logical symbols

∧ or &

and

¬ or ~

not

implies

implies,
superset

↔ or ≡

iff

nand

universal
quantification

existential
quantification

true,
tautology

false,
contradiction

entails,
proves

entails,
therefore

therefore

because

|
|
|
|
|
|
|
|
|
|
|
|
|
|

Philosophy portal
Mathematics portal
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template