subset

(definition)

Definition: A set S₁ is a subset of another set S₂ if every element in S₁ is in S₂. S₂ may have exactly the same elements as S₁.

Formal Definition: S₁ ⊆ S₂ iff ∀ s, s ∈ S₁ → s ∈ S₂.

Specialization (... is a kind of me.)
proper subset, combination.

See also superset.

Note: If S₁ is a subset of S₂, S₂ is a superset of S₁.

A combination is a subset with exactly n elements.

Author: PR

Implementation

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 2 March 2015.
HTML page formatted Mon Mar 2 16:13:48 2015.

Cite this as:
Patrick Rodgers, "subset", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 March 2015. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/subset.html