What is the cardinality of the empty set?
The empty set contains no elements.
Source excerpt
When we say the empty set has a cardinality of zero, we are describing its most defining feature.
From the Knowverse course text.
Set theory basics starts with the fact that a set is determined by its elements, not their order. The quiz covers roster and set-builder notation, cardinality of finite sets, subsets and proper subsets, unions, intersections, power sets, and Cartesian products. Try the questions to check your understanding.
Your score is next.
The empty set contains no elements.
When we say the empty set has a cardinality of zero, we are describing its most defining feature.
From the Knowverse course text.
Zero is one element in this set.
If a set contains the number zero, its cardinality is 1, because zero is an item sitting inside the set.
From the Knowverse course text.
Roster notation explicitly lists members.
This straightforward method of listing every single element inside curly braces is called Roster notation.
From the Knowverse course text.
The domain supplies the collection to which the rule applies.
This larger collection from which we draw our elements is called the Domain.
From the Knowverse course text.
Subset membership requires every A member also to be in B.
A collection is a subset if every single item it contains is also found inside another, larger collection.
From the Knowverse course text.
A proper subset is a subset unequal to the containing set.
We call this a proper subset because it doesn't contain everything the larger set has.
From the Knowverse course text.
Union includes members of either set without duplicates.
The first way to combine these is to create a Union, which is a new collection containing every item from both lists.
From the Knowverse course text.
Intersection selects common members.
This is called an Intersection, a new set that contains only the items found in both collections at the same time.
From the Knowverse course text.
The power set includes both the empty set and A itself.
A Power Set is simply a collection that contains every possible grouping that can be made from a specific set of items.
From the Knowverse course text.
For A × B, the first entry comes from A and the second from B.
This complete set of all possible pairings is called the Cartesian product of the two sets.
From the Knowverse course text.
See the answer and explanation for each question below.
Find more quizzes and full courses in the free iOS app.
Read more about the topic
A set is determined by its elements. Roster notation lists them inside braces, while set-builder notation specifies a rule within a domain. Changing the order of listed elements does not change the set. A clear domain makes it possible to decide which objects are being considered when applying a membership rule.
Cardinality counts the elements of a finite set. The empty set has cardinality zero, but a set containing the number zero has one element. A subset contains only elements of another set. A proper subset also leaves out at least one element of that other set, so the two sets differ.
The number of elements in a set is called its cardinality.
From the Knowverse course text.

A union contains elements found in either of two sets, including their shared elements only once. An intersection contains just the shared elements. Disjoint sets have no shared elements, so their intersection is empty. Set difference keeps the elements of one set that do not belong to the other.
A power set contains all the subsets of a set, including the empty set and the original set. Ordered pairs introduce a different concern: position matters. A Cartesian product forms pairs by taking the first entry from one set and the second from another. If either set is empty, no such pairs exist.
This complete set of all possible pairings is called the Cartesian product of the two sets.
From the Knowverse course text.
Sources: The World of Sets. Each question or step includes an excerpt from the course.