Set Language and Membership

A Language for Belonging

Suppose we are interested in the even numbers from \(1\) through \(10\). We could keep describing them in words, or we could collect them together:

We have just made a set.

A set is a collection of distinct objects considered together. The objects belonging to a set are called its elements or members.

That may sound like a small idea, but sets become part of the language used throughout mathematics. Numbers can form sets. Points can form sets. Solutions to equations can form sets. Functions can form sets. Even other sets can be elements of a set.

The basic question is remarkably simple:

Does this object belong to this collection?

Learning how to answer that question precisely gives us the foundation for relations, functions, probability, logic, geometry, algebra, and much more.

Sets and Elements

Sets are normally named with capital letters such as \(A\), \(B\), or \(S\). Their elements are commonly written between curly braces.

For example, let

Here \(A\) is the name of the set, while

are its elements.

Elements do not have to be numbers. We could just as easily write

The important idea is not what the objects are. The important idea is that we have specified which objects belong to the collection.

Sets Can Contain Mathematical Objects

As your mathematics develops, the elements of sets can become increasingly sophisticated. A set might contain:

• numbers,
• points,
• ordered pairs,
• matrices,
• functions,
• geometric figures,
• or even other sets.

This is one reason set notation becomes so useful. The same basic language continues working even when the mathematical objects become much more advanced.

Membership

Mathematics has a special symbol meaning is an element of:

If

then we may write

This is read:

“Four is an element of \(A\).”

or simply:

“Four belongs to \(A\).”

Because \(5\) is not in the set, we write

The symbol

means is not an element of.

Membership Is a Mathematical Statement

Notice that

is not merely notation naming an object. It makes a statement that can be true or false.

For our set \(A\),

is true, while

is false.

This gives us an early connection between sets and logic. Membership can be treated as a question with two possible answers:

• yes, the object belongs to the set, or
• no, the object does not belong to the set.

Later, this simple connection becomes extremely important when sets are defined using logical conditions.

Roster Notation

Writing the elements of a set between braces is called roster notation.

For example,

describes the set of prime numbers less than \(10\).

Roster notation is especially convenient when a set contains a manageable number of elements.

The Braces Matter

Compare

with

These are different mathematical objects.

The first is the number \(5\). The second is a set whose only element is the number \(5\).

This distinction will become increasingly important as we begin working with sets inside other sets.

Set-Builder Notation

Sometimes listing every member of a set would be inconvenient or impossible. Instead, we can describe the condition that an object must satisfy in order to belong.

This is called set-builder notation.

Consider

The vertical bar \(\mid\) can be read as “such that.”

So the expression says:

“The set of all integers \(x\) such that \(x\) is between \(-6\) and \(6\), inclusive, and \(x\) is even.”

Written as a roster, the same set is

The General Pattern

Set-builder notation often has the form

where

• \(x\) represents a possible element,
• \(U\) tells us what kind of object \(x\) may be, and
• the condition determines whether \(x\) belongs to the set.

This gives us a powerful way to build sets by rules rather than by lists.

Membership as a Test

Consider

To decide whether \(2\) belongs to \(S\), test the defining condition:

Therefore,

But for \(4\),

would require

which is false. Therefore,

A set-builder definition therefore acts much like a mathematical membership test.

When Two Lists Describe the Same Set

Sets have two properties that can feel unusual at first: order does not matter and repeated elements do not create new elements.

Order Does Not Matter

The sets

and

contain exactly the same elements. Therefore,

A set records membership, not position.

Repetition Does Not Matter

Similarly,

Once \(2\) belongs to the set, writing it again does not make it belong “more.”

This is different from an ordinary list, where order or repetition may carry information.

So when you see braces, remember that we are describing a set of distinct members, not merely writing a sequence of entries.

Infinite Sets

Some sets contain infinitely many elements.

The integers, for example, may be written

The dots indicate that the established pattern continues indefinitely.

Dots should only be used when the intended pattern is reasonably clear. For a more precise description, set-builder notation is often better.

For example, the positive even integers can be written as

or more explicitly as

The second version tells us exactly how every element is produced.

The Empty Set

A set is allowed to contain no elements at all.

Such a set is called the empty set.

It is written

or

For example, consider the set of real numbers satisfying

There are no real numbers with this property, so the solution set over the real numbers is

An Important Distinction

Do not confuse

with

The first set has no elements.

The second set has one element, and that element happens to be the empty set.

This may look like a technical distinction now, but it is an excellent example of why mathematical notation must be read carefully.

Elements versus Sets of Elements

One of the most common early set-notation errors is confusing an element with a set containing that element.

Let

Then

The number \(2\) itself is an element of \(A\).

But

The set \(A\) does not contain the set \(\{2\}\) as one of its elements. It contains the number \(2\).

There is another relationship we can use to say that every member of \(\{2\}\) is also a member of \(A\):

The symbol \(\subseteq\) describes a subset relationship, not membership. We will study that relationship separately. For now, the important distinction is:

Those are related ideas, but they are not the same relationship.

Sets Can Themselves Be Elements

Now consider

Here the set \(\{2,3\}\) really is one of the elements of \(B\). Therefore,

However,

The number \(2\) is inside the inner set \(\{2,3\}\), but it is not directly an element of \(B\).

Braces therefore tell us something about mathematical structure, not merely how far to the left or right a number appears on the page.

Sets in Mathematics

Sets become useful almost immediately because many mathematical questions can be interpreted as questions about which objects satisfy a condition.

Solution Sets

Consider the equation

Its real solutions are

We can collect those answers into a solution set:

Then saying

is another way of saying that \(3\) is a solution of the equation.

Domains

Suppose a function contains division by \(x\):

Because division by zero is undefined, its real domain can be described as

The domain is simply the set of inputs that are allowed.

Geometry as a Set of Points

A geometric object can also be described as a set.

For example, the circle centered at the origin with radius \(5\) consists of every point \((x,y)\) satisfying

We can therefore write the circle as

This is an important mathematical perspective: a curve is not just a picture. It can be understood as a set of points satisfying a condition.

Probability

If a coin is tossed once, the possible outcomes can be collected into a set:

Probability will eventually build events from collections of possible outcomes, so set language becomes part of the foundation of probability as well.

Classification and Data

Sets are also useful whenever objects must be classified according to a rule. A database query, for example, can be thought of as asking for the set of records that satisfy certain conditions.

The mathematical notation may be different from the software syntax, but the underlying idea is closely related:

Keep the objects that satisfy the condition.

Worked Examples

Example 1: Testing Membership

Let

Determine whether each statement is true.

a. \(-2\in A\)

Yes. The number \(-2\) appears among the elements of \(A\), so

b. \(3\in A\)

No. The number \(3\) is not an element of \(A\), so

c. \(\{2\}\in A\)

No. The number \(2\) belongs to \(A\), but the set \(\{2\}\) does not.

Example 2: Converting Set-Builder Notation to a Roster

Consider

We want integers beginning at \(-3\) and continuing up to, but not including, \(4\).

Therefore,

Example 3: Finding a Solution Set

Find the integer solution set of

Factor:

Therefore,

The solution set is

So we can say

Example 4: A Set of Points

Let

Is the point \((2,5)\) an element of \(L\)?

Test the defining condition:

The condition is true, so

Notice what happened: membership in this set is exactly the same as lying on the line.

Common Errors

1. Confusing an Element with a Set Containing the Element

If

then

but

2. Treating Order as Important

The sets

and

are equal.

3. Counting Repeated Entries More Than Once

A set records whether an element belongs, not how many times it was written.

4. Confusing the Empty Set with a Set Containing the Empty Set

The first has no elements. The second has one.

5. Using Dots When the Pattern Is Ambiguous

An expression such as

does not tell us enough by itself. Are we doubling? Listing divisors? Following some other rule?

When the continuation is not obvious, describe the membership condition explicitly.

Practice

Let

1. Is \(3\in A\)?
2. Is \(0\in A\)?
3. Is \(-5\notin A\)?
4. Is \(\{1\}\in A\)?

Set-Builder Practice

Write the following set in roster notation:

The Deeper Idea

Sets may initially look like little more than lists inside braces. Their real importance is deeper.

A set allows us to turn a condition into a mathematical object.

For example,

takes the statement

and collects every real number for which that statement is true.

Similarly,

collects every point satisfying the equation of a circle.

This pattern appears everywhere:

That is one of the reasons set language sits so close to the foundations of modern mathematics. It gives us a common way to describe many seemingly different mathematical ideas.

Summary

A set is a collection of distinct mathematical objects, called its elements or members.

• \(x\in A\) means that \(x\) is an element of \(A\).
• \(x\notin A\) means that \(x\) is not an element of \(A\).
• Roster notation lists the elements: \[ A=\{1,2,3\}. \]
• Set-builder notation describes the members by a condition: \[ A=\{x\in\mathbb{Z}\mid 1\leq x\leq3\}. \]
• The order in which elements are written does not change a set.
• Repeating an element does not create a new element.
• The empty set, \[ \varnothing, \] contains no elements.
• An element such as \(2\) is different from the set \(\{2\}\).
• Sets can contain sophisticated objects, including ordered pairs and even other sets.

The most useful habit to develop is simple: whenever you encounter a set, ask what objects are allowed to belong, and what condition decides membership?

That question will carry directly into subsets, relations, functions, solution sets, domains, probability, and many other parts of mathematics.

Sets, Relations, and Functions

• Sets, Relations, and Functions — return to the lesson directory.