In this little tutorial, we’ll expand on what we’ve learned about sets and functions. Specifically, we’ll double-down on the claim that sets are vital to everything we do in mathematics. Functions are not just a way to describe interactions between sets: functions *are* sets!

Many people will be familiar with the idea of an *ordered pair*. This is often how we describe “points” created by the function. When we write the ordered pair in the context of an existing function , we typically mean . In this way, a function can be completely described by its set of ordered pairs: .

This “set-builder” notation is new, so let’s take a tangent and describe it briefly.

The first term, is the type, or form, of each element in the set. So, each element in will be an ordered pair. The vertical line can be read as “such that”, and whatever follows are the conditions on the elements in the set. Therefore, the set notation for can be read as “All ordered pairs such that .

Now, we have a way to describe a function as a set. Namely, a function is just a set where every element is an ordered pair; each ordered pair describes a rule of the form .

This is a great first step! We are back to sets being the backbone of everything. Yet, we can go further. An ordered pair is an arbitrary object, not immediately associated with sets. As you may recall from the Introduction to Sets, a set is unordered. In set notation, we would write . So, how do ordered pairs relate to sets? Let’s find out.

This will be our first dive into further abstraction, analyzing an object we are familiar with and want to express differently. Consider two ordered pairs, and . What does it mean for ? We could describe this equality by stating whenever and .

Next, we want to determine how to capture this information using sets, which are inherently unordered, and cannot have two of the same element. This means we will need at least one set inside of our set, in order to differentiate between the pairs.

##### Definition

We define an ordered pair as the set

This strikes most people as quite strange at first. Upon further thought though, it gives us a sense of order. The *first* element is , the one that exists in both sets. The second element is the element that remains.

The payoff is we now have a description definition of a function. Earlier, we discussed how a function is just a set of ordered pairs. Now, we see that an ordered pair is just a set as well (which happens to contain two more sets!) , so a function can be completely described using sets.

##### Definition

A function , with a collection of rules of the form , where , is a set:

When doing mathematics, most people do not concern themselves with this definition. It is crucial to having a rigorous development of math, and is a good way to begin understanding how mathematicians build objects to work with. However, once it is understood, it does not typically need to be something to worry about in the future.