Learn the fundamentals of sets, cardinality, the empty set, and subsets β essential foundations of discrete mathematics.
β¬ οΈ Back to Course OverviewDiscrete Mathematics is the study of mathematical structures that are countable or otherwise distinct and separable β such as combinations, graphs, and logical statements. These structures can be finite or infinite.
A set is an unordered collection of distinct objects, called elements. If an object a
belongs to a set A
, we write a β A
. If not, a β A
.
Examples:
Vowels = { a, e, i, o, u } Students = { Fred, Tom, Mary, Jane }
For infinite or large sets, use ellipsis:
A = {1, 2, 3, 4, 5, ...}
Cardinality refers to the number of elements in a set. Itβs denoted as |A|
. Finite sets have natural number cardinality; infinite sets are just referred to as infinite.
An empty set contains no elements. Itβs written as {}
or β
. Note: { β
}
is a set with one element β the empty set.
If all elements of set A
are in set B
, then A β B
. If B
has extra elements, A
is a proper subset: A β B
. If both sets contain exactly the same elements: A = B
.
π‘ Tip: Set theory forms the basis for functions, relations, and logic β all foundational in computer science.