Definitions
A set is any collection of objects. The objects in a set are called elements. For example, is the set of all natural numbers, and any positive integer is an element of this set. Sets do not necessarily have to contain mathematical elements. For example, we can say {"red", "orange", "yellow", "green", "blue", "indigo", "violet"} is a set that contains the standard rainbow colors as its elements. To denote that an element is in a set , we write . This is read as " is an element of ". If is NOT in the set , we write . For example, looking at our set of colors , we can see that "green" and "grey" . If we consider the set of natural numbers, , while .
Some important sets in mathematics:
- The empty set: , which contains no elements. If a set is empty, we write or .
- The set of natural numbers: , which contains all positive integers (which numbers that can be written without decimals or fractions)
- The set of integers:
- The set of rational numbers: , which contains all numbers that can be written as , where p and q are integers and . For example, , , , etc. Note that this set contains all integers.
- The set of real numbers: , which is all numbers in the interval . This includes both rational numbers and irrational numbers (, , , and any other numbers that can't be expressed as a fraction of integers).
The set of irrationals doesn't have an official symbol, but it is typically stated as without (that is, the real numbers without the rational numbers), denoted as .
It is not always practical to list out the elements of a set. So, we can instead describe all of the elements in the set with specific criteria. For example, we could write the set of all even integers as . That is, S contains all elements x such that x = 2k for some integer k. In this notation, we list our criteria for an element of set S after the colon within the braces. More examples of this notation:
- The rational numbers: .
- An open bounded interval:
- A closed bounded interval:
- The set of perfect squares:
More definitions and notations for sets (let and be nonempty sets):
- If every element of is also an element of , then is a subset of , and we write .
- If is not a subset of (that is, there is at least one element in that is not in ), then we write .
- If and , then (that is, iff and contain the exact same elements, and neither set contains an element that isn't in the other).
- If is a subset of , and there is at least one element such that (that is, , but ), then is a proper subset of B, and we write . If is not a proper subset of , we write that .
- The power set of , denoted as , is the set of all subsets of (that is, ). For example, if , then . Note that if contains elements, then contains elements. will always contain and itself.
Resources