Types of sets

The video introduces different types of sets, including empty sets, singleton sets, finite sets, infinite sets, equal sets, equivalent sets, universal sets, subsets, proper subsets, supersets, proper supersets, and power sets.

An empty set is a set with no elements, represented by a circle with a slash or curly braces with nothing inside. The cardinality of an empty set is zero. A singleton set is a set with exactly one element.

A finite set has a limited number of elements, meaning its cardinality can be counted. An infinite set has an unlimited number of elements, such as the set of all counting numbers, and its cardinality is infinite.

Two sets are equal if they contain the exact same elements. Equivalent sets have different elements but possess the same number of elements (same cardinality).

A universal set is a set that contains all elements relevant to a particular problem or context, from which all other sets under consideration are subsets. It is often represented by the capital letter 'U'.

Set A is a subset of Set B if every element in A is also an element in B. The number of subsets can be calculated using the formula 2^n, where n is the number of elements. A proper subset means that Set A is a subset of Set B, but Set A is not equal to Set B (there's at least one element in B not in A). The formula for proper subsets is 2^n - 1.

A superset is the reverse of a subset: Set A is a superset of Set B if Set A contains all the elements of Set B. A proper superset indicates that Set A is a superset of Set B, and Set A is not equal to Set B.

A power set is the set of all possible subsets of a given set, including the empty set and the set itself. The number of elements in a power set follows the same formula as the number of subsets, which is 2^n, where n is the number of elements in the original set.