This post belongs to my “Intro Math” series, a set of posts designed to give the foundations to advanced mathematics. More info can be found in Intro Math.
I’ve done a few posts talking about functions that take one input, such as ,
, etc. Another class of functions, known as Binary Functions, are very interesting and give rise to many mathematical structures.
You already know several binary function, like addition and multiplication. Subtraction and division are alternative forms of these operations and we’ll get to that later.
There are a few ways to designate these functions, or
. The most common notation for a generic, binary functions is
, and I’ll use that unless there’s a more obvious choice.
Like many things in math, it is important to define what set we are working with. The properties of a function can vary based on the set being used. It is important that a function remains closed over the set. Meaning if is defined over
, then
.
These functions have many different properties, and I’ll devote the remainder of this post to listing them.
A function is called commutative if . This means that the order of elements in the function does not matter.
Example 1 – Define over
. This function is not commutative, consider
and
.
Example 2 – Define (meaning multiplication) over
. This function is commutative since multiplication is commutative.
A function is called associative if ,
. This means the order that the operation is done over multiple elements does not matter.
Example 3 – Define over
. Consider for a general
.
. So this function is associative.
Example 4 – Define over
. Consider for a general
.
, and
. These are not the same in general, so this function is not associative.
We’ve talked about properties of the function, but there are also elements that have special features. Define over
, the identity element of this function is
in
such that
.
The standard notation for the identity element is . Sometimes it is more intuitive to use
or
.
Example 5 – Define over
. This function does not have an identity element. You might be tempted to say
since
, but
.
Example 6 – Define over
. Here
works as an identity element since
. So for this function and set,
.
While the identity element is defined for a function and a set, there are some special elements defined for each element of the set. For example, define over
the inverse of an element
is an element
where
Obviously a function must have an identity element for an element to be invertible. Let’s look at a few examples.
Example 7 – Define over
. The function has an identity element,
. However, not all elements are invertible. For example the inverse of
would be
, but
is not in
. There is also no possible way for
to be
.
Example 8 – Let’s change the previous example to make it invertible. Now define over
. We must also check that it remains closed, but there’s no way for
unless
or
are
so this is still closed. Now we can say for
.
Example 9 – Define over
. We saw in Example 6 that the identity element is
. To find the inverse, let’s solve the equation
for
.
.
. This gives us a way to find the inverse, but there are some issues here. First, the inverse could be a fraction. The inverse is also undefined for
.
We can fix this by changed the set to be . Is this closed? We must make sure that
can never equal
. Let’s solve
for
.
.
.
.
. Since
and
cannot be
, this is definitely closed.
Ok! That was a lot of new vocab. These concepts are critical to understand functions. If you’ve understood this post, as well as all over the other Intro Math posts (especially Logical Implications, Modulo and Equivalence Relations, Set Theory Part 1, and Set Theory Part 2), then you can begin with Group Theory.