Skip to main content

Section SET Sets

We will frequently work carefully with sets, so the material in this review section is very important. If these topics are new to you, study this section carefully and consider consulting another text for a more comprehensive introduction.

Subsection SET Sets

Definition SET. Set.

A set is an unordered collection of objects. If \(S\) is a set and \(x\) is an object that is in the set \(S\text{,}\) we write \(x\in S\text{.}\) If \(x\) is not in \(S\text{,}\) then we write \(x\not\in S\text{.}\) We refer to the objects in a set as its elements.

Hard to get much more basic than that. Notice that the objects in a set can be anything, and there is no notion of order among the elements of the set. A set can be finite as well as infinite. A set can contain other sets as its objects. At a primitive level, a set is just a way to break up some class of objects into two groupings: those objects in the set, and those objects not in the set.

From the set of all possible symbols, construct the following set of three symbols,

\begin{align*} S&=\set{\blacksquare,\,\blacklozenge,\,\bigstar}\text{.} \end{align*}

Then the statement \(\blacksquare\in S\) is true, while the statement \(\blacktriangle\in S\) is false. However, then the statement \(\blacktriangle\not\in S\) is true.

A portion of a set is known as a subset. Notice how the following definition uses an implication (if whenever… then…). Note too how the definition of a subset relies on the definition of a set through the idea of set membership.

Definition SSET. Subset.

If \(S\) and \(T\) are two sets, then \(S\) is a subset of \(T\text{,}\) written \(S\subseteq T\) if whenever \(x\in S\) then \(x\in T\text{.}\)

If we want to disallow the possibility that \(S\) is the same as \(T\text{,}\) we use the notation \(S\subset T\) and we say that \(S\) is a proper subset of \(T\text{.}\) We will do an example, but first we will define a special set.

Definition ES. Empty Set.

The empty set is the set with no elements. It is denoted by \(\emptyset\text{.}\)

If \(S=\set{\blacksquare,\,\blacklozenge,\,\bigstar}\text{,}\) \(T=\set{\bigstar,\,\blacklozenge}\text{,}\) \(R=\set{\blacktriangle,\,\bigstar}\text{,}\) then

\begin{align*} T&\subseteq S & R&\not\subseteq T & \emptyset&\subseteq S\\ T&\subset S & S&\subseteq S & S&\not\subset S\text{.} \end{align*}

What does it mean for two sets to be equal? They must be the same. Well, that explanation is not really too helpful, is it? How about: If \(A\subseteq B\) and \(B\subseteq A\text{,}\) then \(A\) equals \(B\text{.}\) This gives us something to work with, if \(A\) is a subset of \(B\text{,}\) and vice versa, then they must really be the same set. We will now make the symbol “\(=\)” do double-duty and extend its use to statements like \(A=B\text{,}\) where \(A\) and \(B\) are sets. Here is the definition, which we will reference often.

Definition SE. Set Equality.

Two sets, \(S\) and \(T\text{,}\) are equal, if \(S\subseteq T\) and \(T\subseteq S\text{.}\) In this case, we write \(S=T\text{.}\)

Sets are typically written inside of braces, as \(\set{\ }\text{,}\) as we have seen above. However, when sets have more than a few elements, a description will typically have two components. The first is a description of the general type of objects contained in a set, while the second is some sort of restriction on the properties the objects have. Every object in the set must be of the type described in the first part and it must satisfy the restrictions in the second part. Conversely, any object of the proper type for the first part, that also meets the conditions of the second part, will be in the set. These two parts are set off from each other somehow, often with a vertical bar (\(\vert\)) or a colon (:).

I like to think of sets as clubs. The first part is some description of the type of people who might belong to the club, the basic objects. For example, a bicycle club would describe its members as being people who like to ride bicycles. The second part is like a membership committee, it restricts the people who are allowed in the club. Continuing with our bicycle club analogy, we might decide to limit ourselves to “serious” riders and only have members who can document having ridden 100 kilometers or more in a single day at least one time.

The restrictions on membership can migrate around some between the first and second part, and there may be several ways to describe the same set of objects. Here is a more mathematical example, employing the set of all integers, \({\mathbb Z}\text{,}\) to describe the set of even integers.

\begin{align*} E &=\setparts{x\in{\mathbb Z}}{x\text{ is an even number}}\\ &=\setparts{x\in{\mathbb Z}}{2\text{ divides }x\text{ evenly}}\\ &=\setparts{2k}{k\in{\mathbb Z}}\text{.} \end{align*}

Notice how this set tells us that its objects are integer numbers (not, say, matrices or functions, for example) and just those that are even. So we can write that \(10\in E\text{,}\) while \(17\not\in E\) once we check the membership criteria. We also recognize the question

\begin{align*} \begin{bmatrix} 1&-3&5\\ 2&0&3 \end{bmatrix} \in E\text{?} \end{align*}

as being simply ridiculous.

Subsection SC Set Cardinality

On occasion, we will be interested in the number of elements in a finite set. Here is the definition and the associated notation.

Definition C. Cardinality.

Suppose \(S\) is a finite set. Then the number of elements in \(S\) is called the cardinality or size of \(S\text{,}\) and is denoted \(\card{S}\text{.}\)

If \(S=\set{\blacklozenge,\,\bigstar,\,\blacksquare}\text{,}\) then \(\card{S}=3\text{.}\)

Subsection SO Set Operations

In this subsection we define and illustrate the three most common basic ways to manipulate sets to create other sets. Since much of linear algebra is about sets, we will use these often.

Definition SU. Set Union.

Suppose \(S\) and \(T\) are sets. Then the union of \(S\) and \(T\text{,}\) denoted \(S\cup T\text{,}\) is the set whose elements are those that are elements of \(S\) or of \(T\text{,}\) or both. More formally,

\begin{gather*} x\in S\cup T\text{ if and only if }x\in S\text{ or }x\in T\text{.} \end{gather*}

Notice that the use of the word “or” in this definition is meant to be non-exclusive. That is, it allows for \(x\) to be an element of both \(S\) and \(T\) and still qualify for membership in \(S\cup T\text{.}\)

If \(S=\set{\blacklozenge,\,\bigstar,\,\blacksquare}\) and \(T=\set{\blacklozenge,\,\bigstar,\,\blacktriangle}\) then \(S\cup T=\set{\blacklozenge,\,\bigstar,\,\blacksquare,\,\blacktriangle}\text{.}\)

Definition SI. Set Intersection.

Suppose \(S\) and \(T\) are sets. Then the intersection of \(S\) and \(T\text{,}\) denoted \(S\cap T\text{,}\) is the set whose elements are only those that are elements of \(S\) and of \(T\text{.}\) More formally,

\begin{gather*} x\in S\cap T\text{ if and only if }x\in S\text{ and }x\in T\text{.} \end{gather*}

If \(S=\set{\blacklozenge,\,\bigstar,\,\blacksquare}\) and \(T=\set{\blacklozenge,\,\bigstar,\,\blacktriangle}\) then \(S\cap T=\set{\blacklozenge,\,\bigstar}\text{.}\)

The union and intersection of sets are operations that begin with two sets and produce a third, new, set. Our final operation is the set complement, which we usually think of as an operation that takes a single set and creates a second, new, set. However, if you study the definition carefully, you will see that it needs to be computed relative to some “universal” set.

Definition SC. Set Complement.

Suppose \(S\) is a set that is a subset of a universal set \(U\text{.}\) Then the complement of \(S\text{,}\) denoted \(\setcomplement{S}\text{,}\) is the set whose elements are those that are elements of \(U\) and not elements of \(S\text{.}\) More formally,

\begin{gather*} x\in\setcomplement{S}\text{ if and only if }x\in U\text{ and }x\not\in S\text{.} \end{gather*}

Notice that there is nothing at all special about the universal set. This is simply a term that suggests that \(U\) contains all of the possible objects we are considering. Often this set will be clear from the context, and we will not think much about it, nor reference it in our notation. In other cases (rarely in our work in this course) the exact nature of the universal set must be made explicit, and reference to it will possibly be carried through in our choice of notation.

If \(U=\set{\blacklozenge,\,\bigstar,\,\blacksquare,\,\blacktriangle}\) and \(S=\set{\blacklozenge,\,\bigstar,\,\blacksquare}\) then \(\setcomplement{S}=\set{\blacktriangle}\text{.}\)

There are many more natural operations that can be performed on sets, such as an exclusive-or and the symmetric difference. Many of these can be defined in terms of the union, intersection and complement. We will not have much need of them in this course, and so we will not give precise descriptions here in this preliminary section.

There is also an interesting variety of basic results that describe the interplay of these operations with each other. We mention just two as an example, these are known as DeMorgan's Laws,

\begin{align*} \setcomplement{\left(S\cup T\right)}& =\setcomplement{S}\cap\setcomplement{T} & \setcomplement{\left(S\cap T\right)}&= \setcomplement{S}\cup\setcomplement{T}\text{.} \end{align*}

Besides having an appealing symmetry, we mention these two facts, since constructing the proofs of each is a useful exercise that will require a solid understanding of all but one of the definitions presented in this section. Give it a try.