###### (Originally written for my Intro to Homological Algebra Summer Seminar Group at SJC)

One of the first things you learn in *Algebra*, is how to manipulate equations. Given the equation:

we quickly learned how to *subtract 3 from both sides of the equation.* In this post, I would like to go through the very formal definitions which make this possible.

### The Definition of a Group and Why We Can Cancel

Recall that a *group* is a set, , together with a binary operation , which is associative, has a unique identity, and has unique inverses. Before going forward, it is important to understand what it means to have a function, , and what it means to have pairs in as its input. For a quick review of some foundations for this post, check out the section *Review: Sets, Cartesian Products, Equality, and Functions, *below.

OK, once you feel like you understand Cartesian Products and functions, let’s say what addition is! So addition on a set, , by the definition of a group, is a *binary operation*, i.e. a function,

Let’s unpack this. So for two elements, and in the set , we have a way to *add* them together to produce a third element, call it :

but we normally just write:

OK, but let’s look at what it means to be a *function*, and what this has to do with the whole point of this post! Recall we started with the equation

Well suppose that the set, is the set of all of our numbers. Then and are two elements in , but that are equal. Two other numbers that are equal are and . Therefore, we have two ways to write the same pair:

and

Since their first components are equal and their second components are equal then we have

Now, remember our function, ? For the moment let’s call the set , so that . Well then being a *function, *,* * means that if then we must have that . Note that for our setup, we have

and

But since , then we must have that

**So now you finally know that the reason you can add to both sides is that addition is a function!!! **Anyway, now you could use the associative property of our group,

and then the additive inverse property,

and now the identity property,

to **finally see why we can cancel something from both sides of an equation.**

**Concept Check**: You should feel free to move on from the ideas in this post when you can easily understand and show that, similarly, we can cancel the being multiplied on the right hand side of the equation

### Review: Sets, Cartesian Products, Equality, and Functions

Assuming we have basic understanding of set theory, we need to first consider the set of all pairs of elements from a set and a set , which is called the *Cartesian Product*, and written . More formally, we define the Cartesian Product by:

Note that the only way two pairs and are allowed to be equal is if both **and **. As it turns out, in order to say what a *function* is, we will need Cartesian products.

First we define a *relation, *which is simply a subset of a Cartesian Product. That is to say, a relation, , between and , is simply some subset

For example, if I consider the set of all teams participating in the world cup this year, call it , and the set of all locations of the stadiums being used in the world cup this year, call it , then I can consider the relation of locations in which certain teams have played during the tournament this year as the subset . So for some examples:

- (Egypt, Ekaterinburg), (Egypt, St. Petersburg), (Senegal, Moscow), (Portugal, Sochi), and (Russia, Moscow) are all elements of while
- (Iran, Moscow) is not an element in , since Iran did not play in Moscow during this World Cup (I looked it up).

Notice how for my relation, , it allows for both the -values and -values to repeat (you would often call these the -values and -values, respectively, in your experience). Since you were told presumably that for a function, the first component is not allowed to repeat, then you have just observed that *not all relations are functions*. A function is a special type of relation, that is:

A

functionis a relation, , in which if both and are in the set, , then it must be that .

Note that usually you simply write an element as: . But it’s important to realize that technically, the definition using the pairs is the more careful and formal one.

**Concept Check**: You should feel free to move on from this definition of a function using Cartesian Products if you can explain why this definition *implies* the *vertical line test* which we were all taught when we first learned to distinguish functions from non-functions.

OK, now you are ready to move back to the original discussion.