Chapter 1
Sets
Read chapter 1 in the bookSummary
A set is a collection you can decide membership for. The chapter covers roster and set-builder notation, the empty set, subsets, Venn diagrams, complements, and how to combine two sets. The size of a union is n(A) + n(B) − n(A ∩ B), because the overlap would otherwise be counted twice.
Key terms
Each term has a plain-language definition written for this guide. The book’s own key-terms page mostly names the word and sends you back to the section.
Open this chapter’s key terms in the book1.1 Basic Set Concepts
Definitions written for this guide, in enough detail to study from. The link opens the section in the book.
- set
- A set is a collection of objects treated as one group. For the set to be useful, you have to be able to decide whether any given object belongs to it.
- elements
- Elements are the individual objects inside a set. If 3 belongs to A, write 3 ∈ A and say that 3 is an element of A.
- well-defined set
- A set is well defined when every object is clearly in or clearly out, with no personal judgment. “Integers greater than 10” is well defined; “the tall buildings” is not, because people can disagree.
- empty set
- The empty set has no elements. It is written ∅ or { }, and it is a real set: it is not the same thing as the number 0.
- roster method
- The roster method names a set by listing its elements inside braces, as in {2, 4, 6}. Order and repeated names do not change the set, so {2, 4, 6} and {6, 2, 4, 2} are the same set.
- finite set
- A finite set comes to an end. You can count its elements and finish at a whole number, even when that number is large.
- infinite set
- An infinite set does not come to an end. The natural numbers are infinite because every number has a next one.
- natural numbers
- The natural numbers are the counting numbers 1, 2, 3, 4, and so on. They are the numbers used to count the elements of a set.
- integer
- Integers are the whole numbers together with their opposites and zero: …, −2, −1, 0, 1, 2, …. A fraction or a decimal that is not a whole number is not an integer.
- set-builder notation
- Set-builder notation describes a set by a rule instead of a list. {x | x is an even integer} is read “the set of all x such that x is an even integer.”
- cardinality of a set
- Cardinality is the number of elements in a set, written n(A) or |A|. The set {a, b, c} has cardinality 3. Repeated listings of the same element still count once.
- countably infinite
- A set is countably infinite when its elements can be matched one-to-one with the natural numbers, so they can be listed as a first, a second, a third, and so on. The integers are countably infinite even though they run in both directions.
- equal sets
- Two sets are equal when they contain exactly the same elements, nothing more and nothing missing. {1, 2} and {2, 1} are equal.
- equivalent sets
- Two sets are equivalent when they have the same number of elements, so each element of one can be paired with exactly one element of the other. The objects themselves do not have to be the same.
1.2 Subsets
Definitions written for this guide, in enough detail to study from. The link opens the section in the book.
- subset
- A is a subset of B, written A ⊆ B, when every element of A is also an element of B. Every set is a subset of itself, and the empty set is a subset of every set.
- proper subset
- A is a proper subset of B, written A ⊂ B, when A is a subset of B but the two sets are not equal. B has at least one element that A does not have.
- equivalent subsets
- Subsets are equivalent when they have the same cardinality. You can match their elements one-to-one even if the elements are different objects.
- exponential notation
- A set with n elements has 2ⁿ subsets, counting the set itself and the empty set. Exponential notation writes that count as a power of 2, so a set of 3 elements has 2³ = 8 subsets.
1.3 Understanding Venn Diagrams
Definitions written for this guide, in enough detail to study from. The link opens the section in the book.
- Venn diagram
- A Venn diagram draws each set as a loop, usually a circle, inside a rectangle. The overlap shows objects in more than one set, and the region outside a loop shows what is not in that set.
- universal set
- The universal set, U, is the whole collection you have agreed to consider for the problem. Every set in the diagram is inside U, and the rectangle stands for U.
- disjoint set
- Two sets are disjoint when they share no elements. Their loops do not overlap, and their intersection is the empty set.
- complement of a set
- The complement of A, written A′ or Aᶜ, is everything in the universal set that is not in A. If U = {1, 2, 3, 4} and A = {1, 2}, then A′ = {3, 4}.
1.4 Set Operations with Two Sets
Definitions written for this guide, in enough detail to study from. The link opens the section in the book.
- intersection of two sets
- The intersection A ∩ B contains only the elements that are in both A and B. If the sets share nothing, the intersection is empty.
- union of two sets
- The union A ∪ B contains every element that is in A, in B, or in both. Its size is n(A) + n(B) − n(A ∩ B), because the overlap would otherwise be counted twice.