### Definition 11.7.1. Isomorphic Systems/Isomorphism - Informal Version.

Two algebraic systems are isomorphic if there exists a translation rule between them so that any true statement in one system can be translated to a true statement in the other.

The following informal definition of isomorphic systems should be memorized. No matter how technical a discussion about isomorphic systems becomes, keep in mind that this is the essence of the concept.

Two algebraic systems are isomorphic if there exists a translation rule between them so that any true statement in one system can be translated to a true statement in the other.

Imagine that you are a six-year-old child who has been reared in an English-speaking family, has moved to Greece, and has been enrolled in a Greek school. Suppose that your new teacher asks the class to do the following addition problem that has been written out in Greek.

\begin{equation*}
\tau \rho \acute{\iota} \alpha \quad \sigma \upsilon \nu \quad \tau \acute{\epsilon} \sigma \sigma \varepsilon \rho \alpha \quad \iota \sigma o \acute{\upsilon} \tau \alpha \iota \quad \_\_\_\_
\end{equation*}

The natural thing for you to do is to take out your Greek-English/English-Greek dictionary and translate the Greek words to English, as outlined in Figure 11.7.3 After you’ve solved the problem, you can consult the same dictionary to find the proper Greek word that the teacher wants. Although this is not the recommended method of learning a foreign language, it will surely yield the correct answer to the problem. Mathematically, we may say that the system of Greek integers with addition (\(\sigma \upsilon \nu\)) is isomorphic to English integers with addition (plus). The problem of translation between natural languages is more difficult than this though, because two complete natural languages are not isomorphic, or at least the isomorphism between them is not contained in a simple dictionary.

In this example, we will describe how set variables can be implemented on a computer. We will describe the two systems first and then describe the isomorphism between them.

System 1: The power set of \(\{1, 2, 3, 4, 5\}\) with the operation union, \(\cup\text{.}\) For simplicity, we will only discuss union. However, the other operations are implemented in a similar way.

System 2: Strings of five bits of computer memory with an OR gate. Individual bit values are either zero or one, so the elements of this system can be visualized as sequences of five 0’s and 1’s. An OR gate, Figure 11.7.5, is a small piece of computer hardware that accepts two bit values at any one time and outputs either a zero or one, depending on the inputs. The output of an OR gate is one, except when the two bit values that it accepts are both zero, in which case the output is zero. The operation on this system actually consists of sequentially inputting the values of two bit strings into the OR gate. The result will be a new string of five 0’s and 1’s. An alternate method of operating in this system is to use five OR gates and to input corresponding pairs of bits from the input strings into the gates concurrently.

The Isomorphism: Since each system has only one operation, it is clear that union and the OR gate translate into one another. The translation between sets and bit strings is easiest to describe by showing how to construct a set from a bit string. If \(a_1a_2a_3a_4a_5\text{,}\) is a bit string in System 2, the set that it translates to contains the number \(k\) if and only if \(a_k\) equals 1. For example, \(10001\) is translated to the set \(\{1, 5\}\text{,}\) while the set \(\{1, 2\}\) is translated to \(11000.\) Now imagine that your computer is like the child who knows English and must do a Greek problem. To execute a program that has code that includes the set expression \(\{1, 2\} \cup \{1, 5\}\text{,}\) it will follow the same procedure as the child to obtain the result, as shown in Figure 11.7.6.

This isomorphism is between \(\left[\mathbb{R}^+ ; \cdot \right]\) and \([\mathbb{R};+]\text{.}\) Until the 1970s, when the price of calculators dropped, multiplication and exponentiation were performed with an isomorphism between these systems. The isomorphism \(\left(\mathbb{R}^+\right.\) to \(\mathbb{R}\)) between the two groups is that \(\cdot\) is translated into \(+\) and any positive real number \(a\) is translated to the logarithm of \(a\text{.}\) To translate back from \(\mathbb{R}\) to \(\mathbb{R}^+\) , you invert the logarithm function. If base ten logarithms are used, an element of \(\mathbb{R}\text{,}\) \(b\text{,}\) will be translated to \(10^b\text{.}\) In pre-calculator days, the translation was done with a table of logarithms or with a slide rule. An example of how the isomorphism is used appears in Figure 11.7.8.

The following definition of an isomorphism between two groups is a more formal one that appears in most abstract algebra texts. At first glance, it appears different, it is really a slight variation on the informal definition. It is the common definition because it is easy to apply; that is, given a function, this definition tells you what to do to determine whether that function is an isomorphism.

If \(\left[G_1 ; *_1\right]\) and \(\left[G_2 ; *_2\right]\) are groups, \(f: G_1 \to G_2\) is an isomorphism from \(G_1\) into \(G_2\) if:

- \(f\) is a bijection, and
- \(f\left(a *_1 b\right) = f(a) *_2f(b)\) for all \(a, b\in G_1\)

If such a function exists, then we say \(G_1\) is isomorphic to \(G_2\text{,}\) denoted \(G_1 \cong G_2\text{.}\)

We should note that “is isomorphic to” is an equivalence relation on the set of all groups. We leave it to the reader to verify the following.

- The identity function on a group \(G\) is an isomorphism.
- Bijections have inverses, the inverse of an isomorphism is an isomorphism.
- The composition of any two isomorphisms that can be composed is an isomorphism.

- There could be several different isomorphisms between the same pair of groups. Thus, if you are asked to demonstrate that two groups are isomorphic, your answer need not be unique.
- Any application of this definition requires a procedure outlined in Figure 11.7.10. The first condition, that an isomorphism be a bijection, reflects the fact that every true statement in the first group should have exactly one corresponding true statement in the second group. This is exactly why we run into difficulty in translating between two natural languages. To see how Condition (b) of the formal definition is consistent with the informal definition, consider the function \(L:\mathbb{R}^+\to \mathbb{R}\) defined by \(L(x) = \log _{10}x\text{.}\) The translation diagram between \(\mathbb{R}^+\) and \(\mathbb{R}\) for the multiplication problem \(a \cdot b\) appears in Figure 11.7.12. We arrive at the same result by computing \(L^{-1} (L(a) + L(b))\) as we do by computing \(a \cdot b\text{.}\) If we apply the function \(L\) to the two results, we get the same image:\begin{gather} L(a \cdot b) = L\left(L^{-1}(L(a) + L(b))\right) = L(a) + L(b) \tag{11.7.1} \end{gather}since \(L\left(L^{-1}(x)\right) = x\text{.}\) Note that (11.7.1) is exactly Condition b of the formal definition applied to the two groups \(\mathbb{R}^+\) and \(\mathbb{R}\text{.}\)

Consider \(G= \left\{\left.\left(
\begin{array}{cc}
1 & a \\
0 & 1 \\
\end{array}
\right) \right| a \in \mathbb{R}\right\}\) with matrix multiplication. The group \([\mathbb{R};+]\) is isomorphic to \(G\text{.}\) Our translation rule is the function \(f: \mathbb{R} \to G\) defined by \(f(a)=\left(
\begin{array}{cc}
1 & a \\
0 & 1 \\
\end{array}
\right)\text{.}\) Since groups have only one operation, there is no need to state explicitly that addition is translated to matrix multiplication. That \(f\) is a bijection is clear from its definition.

If \(a\) and \(b\) are any real numbers,

\begin{equation*}
\begin{split}
f(a) f(b) & = \left(
\begin{array}{cc}
1 & a \\
0 & 1 \\
\end{array}
\right)\left(
\begin{array}{cc}
1 & b \\
0 & 1 \\
\end{array}
\right)\\
& = \left(
\begin{array}{cc}
1 & a + b \\
0 & 1 \\
\end{array}
\right)\\
& = f(a + b)
\end{split}
\end{equation*}

We can apply this translation rule to determine the inverse of a matrix in \(G\text{.}\) We know that \(a + (-a)=0\) is a true statement in \(\mathbb{R}\text{.}\) Using \(f\) to translate this statement, we get

\begin{equation*}
f(a) f(-a) = f(0)
\end{equation*}

or

\begin{equation*}
\left(
\begin{array}{cc}
1 & a \\
0 & 1 \\
\end{array}
\right)\left(
\begin{array}{cc}
1 & -a \\
0 & 1 \\
\end{array}
\right)=\left(
\begin{array}{cc}
1 & 0 \\
0 & 1 \\
\end{array}
\right)
\end{equation*}

therefore,

\begin{equation*}
\left(
\begin{array}{cc}
1 & a \\
0 & 1 \\
\end{array}
\right)^{-1}= \left(
\begin{array}{cc}
1 & -a \\
0 & 1 \\
\end{array}
\right)
\end{equation*}

The next theorem summarizes some of the general facts about group isomorphisms that are used most often in applications. We leave the proof to the reader.

If \([G;*]\) and \([H;\diamond ]\) are groups with identities \(e\) and \(e'\text{,}\) respectively, and \(T:G \to H\) is an isomorphism from \(G\) into \(H\text{,}\) then:

- \(\displaystyle T(e) = e'\)
- \(T(a)^{-1} = T\left(a^{-1}\right)\) for all \(a \in G\text{,}\) and
- If \(K\) is a subgroup of \(G\text{,}\) then \(T(K) = \{T(a) : a \in K\}\) is a subgroup of \(H\) and is isomorphic to \(K\text{.}\)

“Is isomorphic to” is an equivalence relation on the set of all groups. Therefore, the set of all groups is partitioned into equivalence classes, each equivalence class containing groups that are isomorphic to one another.

This topic is somewhat obscure. It doesn’t appear in most texts, but is a nice companion to degree sequences in graph theory. Recall that every undirected graph has a degree sequence, and graphs with different degree sequences 9.1.31 are not isomorphic. This is a convenient way to identify non-isomorphic graphs. We see below that order sequences play exactly the same role in identifying whether two finite groups are isomorphic. Furthermore, identical order sequences of two finite groups give an excellent set of hints for constructing an isomorphism, if one such exists. My colleague, Jim Propp, has been using this idea for a while in his classes and I “discovered” it later. Neither of us can claim originality. Much of the following discussion is paraphrased from Jim’s notes.

The order sequence of a finite group is the sequence whose terms are the respective orders of all the elements of the group, arranged in increasing order.

In \(\mathbb{Z}_3\) the element 0 has order 1, the element 1 has order 3, and the element 2 has order 3, so the order sequence of this group is 1,3,3.

In \(\mathbb{Z}_4\) the element 0 has order 1, the element 1 has order 4, the element 2 has order 2, and the element 3 has order 4, so the order sequence of this group is 1,2,4,4. (Note that we have arranged the numbers 1,4,2,4 in increasing order.)

If \(G_1\) and \(G_2\) are finite groups and \(f\) is an isomorphism between them, with \(g \in G_1\) and \(f(g) \in G_2\text{,}\) the order of \(g\) in \(G_1\) equals the order of \(f(g)\) in \(G_2\text{.}\)

Consequently:

If two groups are isomorphic, they have the same order sequence.

The theorem is a handy tools for proving that two particular groups are not isomorphic. Consider the group \(\mathbb{Z}_2 \times \mathbb{Z}_2\text{;}\) the element \((0,0)\) has order 1 while the other elements \((0,1)\text{,}\) \((1,0)\text{,}\) and \((1,1)\) each have order 2, implying that the order sequence is 1,2,2,2. Since this is different from the sequence 1,2,4,4, the group \(\mathbb{Z}_2 \times \mathbb{Z}_2\) is not isomorphic to the group \(\mathbb{Z}_4\text{.}\)

Order sequences are also useful in helping one find isomorphisms. Consider the group \(\mathbb{U}_5\) (the set \(\{1,2,3,4\}\) with mod-5 multiplication). Its order sequence is \(1,2,4,4\text{,}\) which suggests that it might be isomorphic to \(\mathbb{Z}_4\text{.}\) In fact, any isomorphism \(f\) from \(\mathbb{Z}_4\) to \(\mathbb{U}_5\) must map \(0\) (the only element of order 1 in \(\mathbb{Z}_4\)) to \(1\) (the only element of order 1 in \(\mathbb{U}_4\)) and must map \(2\) (the only element of order 2 in \(\mathbb{Z}_4\)) to \(4\) (the only element of order 2 in \(\mathbb{U}_4\)). There are only two bijections \(f\) from \(\mathbb{Z}_4\) to \(\mathbb{U}_4\) satisfying \(f(0) = 1\) and \(f(2) = 4\text{,}\) so these are the only two candidate isomorphisms (and both candidates turn out to be true isomorphisms).

The following code will compute the order sequence for the group of integers mod \(n\text{.}\) The default value of \(n\) is 12 and you can change it in the last line of input.

How do you decide that two groups are not isomorphic to one another? The negation of “\(G\) and \(H\) are isomorphic” is that no translation rule between \(G\) and \(H\) exists. If \(G\) and \(H\) have different cardinalities, then no bijection from \(G\) into \(H\) can exist. Hence they are not isomorphic. Given that \(\left| G\right| =\left| H\right|\text{,}\) it is usually impractical to list all bijections from \(G\) into \(H\) and show that none of them satisfy Condition b of the formal definition. The best way to prove that two groups are not isomorphic is to find a true statement about one group that is not true about the other group. We illustrate this method in the following checklist that you can apply to most pairs of non-isomorphic groups in this book.

Assume that \([G;*]\) and \([H;\diamond ]\) are groups. The following are reasons for \(G\) and \(H\) to be not isomorphic.

- \(G\) and \(H\) do not have the same cardinality. For example, \(\mathbb{Z}_{12} \times \mathbb{Z}_5\) can’t be isomorphic to \(\mathbb{Z}_{50}\) and \([\mathbb{R};+]\) can’t be isomorphic to \(\left[\mathbb{Q}^+ ; \cdot \right]\text{.}\)
- \(G\) is abelian and \(H\) is not abelian since \(a * b = b * a\) is always true in \(G\text{,}\) but \(T(a) \diamond T(b) = T(b) \diamond T(a)\) would not always be true. We have seen two groups with six elements that apply here. They are \(\mathbb{Z}_6\) and the group of \(3 \times 3\) rook matrices (see Exercise 11.2.4.5). The second group is non-abelian, therefore it can’t be isomorphic to \(\mathbb{Z}_6\text{.}\)
- \(G\) has a certain kind of subgroup that \(H\) doesn’t have. Part (c) of Theorem 11.7.14 states that this cannot happen if \(G\) is isomorphic to \(H\text{.}\) \(\left[\mathbb{R}^* ; \cdot \right]\) and \(\left[\mathbb{R}^+ ; \cdot \right]\) are not isomorphic since \(\mathbb{R}^*\) has a subgroup with two elements, \(\{-1, 1\}\text{,}\) while the proper subgroups of \(\mathbb{R}^+\) are all infinite (convince yourself of this fact!).
- The number of solutions of \(x * x = e\) in \(G\) is not equal to the number of solutions of \(y \diamond y = e'\) in \(H\text{.}\) \(\mathbb{Z}_8\) is not isomorphic to \(\mathbb{Z}_2{}^3\) since \(x +_8 x = 0\) has two solutions, 0 and 4, while \(y + y = (0, 0, 0)\) is true for all \(y\in \mathbb{Z}_2{}^3\text{.}\) If the operation in \(G\) is defined by a table, then the number of solutions of \(x * x = e\) will be the number of occurrences of \(e\) in the main diagonal of the table. The equations \(x^3 = e\text{,}\) \(x^4= e, \dots\) can also be used in the same way to identify pairs of non-isomorphic groups.
- One of the cyclic subgroups of \(G\) equals \(G\) (i. e., \(G\) is cyclic), while none of \(H\)’s cyclic subgroups equals \(H\) (i. e., \(H\) is noncyclic). This is a special case of Condition c. \(\mathbb{Z}\) and \(\mathbb{Z} \times \mathbb{Z}\) are not isomorphic since \(\mathbb{Z} = \langle 1\rangle\) and \(\mathbb{Z} \times \mathbb{Z}\) is not cyclic.

State whether each pair of groups below is isomorphic. For each pair that is, give an isomorphism; for those that are not, give your reason.

- \(\mathbb{Z} \times \mathbb{R}\) and \(\mathbb{R} \times \mathbb{Z}\)
- \(\mathbb{Z}_2\times \mathbb{Z}\) and \(\mathbb{Z} \times \mathbb{Z}\)
- \(\mathbb{R}\) and \(\mathbb{Q} \times \mathbb{Q}\)
- \(\mathcal{P}(\{1, 2\})\) with symmetric difference and \(\mathbb{Z}_2{}^2\)
- \(\mathbb{Z}_2{}^2\) and \(\mathbb{Z}_4\)
- \(\mathbb{R}^4\) and \(M_{2\times 2}(\mathbb{R})\) with matrix addition
- \(\mathbb{R}^2\) and \(\mathbb{R} \times \mathbb{R}^+\)
- \(\mathbb{Z}_2\) and the \(2 \times 2\) rook matrices
- \(\mathbb{Z}_6\) and \(\mathbb{Z}_2\times \mathbb{Z}_3\)

Answer.

- Yes, \(f(n, x) = (x, n)\) for \((n, x) \in \mathbb{Z} \times \mathbb{R}\) is an isomorphism.
- No, \(\mathbb{Z}_2\times \mathbb{Z}\) has a two element subgroup while \(\mathbb{Z} \times \mathbb{Z}\) does not.
- No. \(\mathbb{Q} \times \mathbb{Q}\) is countable and \(\mathbb{R}\) is not. Therefore, no bijection can exist between them.
- Yes.
- No.
- Yes, one isomorphism is defined by \(f\left(a_1, a_2,a_3,a_4\right)=\left( \begin{array}{cc} a_1 & a_2 \\ a_3 & a_4 \\ \end{array} \right)\text{.}\)
- Yes, one isomorphism is defined by \(f\left(a_1,a_2\right)=\left(a_1,10^{a_2}\right)\text{.}\)
- Yes.
- Yes \(f(k) = k(1,1)\text{.}\)

If you know two natural languages, show that they are not isomorphic.

Prove that the relation “is isomorphic to” on groups is transitive.

Answer.

Consider three groups \(G_1\text{,}\) \(G_2\text{,}\) and \(G_3\) with operations \(*, \diamond , \textrm{ and } \star \text{,}\) respectively. We want to show that if \(G_1\) is isomorphic to \(G_2\text{,}\) and if \(G_2\) is isomorphic to \(G_3\) , then \(G_1\) is isomorphic to \(G_3\text{.}\)

\begin{equation*}
G_1 \textrm{ isomorphic} \textrm{ to } G_2\Rightarrow \textrm{ there} \textrm{ exists} \textrm{ an} \textrm{ isomorphism } f:G_1\to G_2
\end{equation*}

\begin{equation*}
G_2 \textrm{ isomorphic} \textrm{ to } G_3\Rightarrow \textrm{ there} \textrm{ exists} \textrm{ an} \textrm{ isomorphism } g:G_2\to G_3
\end{equation*}

If we compose \(g\) with \(f\text{,}\) we get the function \(g\circ f:G_1\to G_3\text{,}\) By Theorem 7.3.6 and Theorem 7.3.7, \(g\circ f\) is a bijection, and if \(a,b\in G_1\text{,}\)

\begin{equation*}
\begin{split}
(g\circ f)(a*b) &=g(f(a*b))\\
&=g(f(a)\diamond f(b))\quad \textrm{ since } f \textrm{ is an isomorphism}\\
& =g(f(a))\star g(f(b))\quad \textrm{ since } g \textrm{ is an isomorphism}\\
& =(g\circ f)(a) \star (g\circ f)(b)
\end{split}
\end{equation*}

Therefore, \(g\circ f\) is an isomorphism from \(G_1\) into \(G_3\text{,}\) proving that “is isomorphic to” is transitive.

- Write out the operation table for \(G = [\{1, -1, i, -i \}; \cdot ]\) where \(i\) is the complex number for which \(i^2 = - 1\text{.}\) Show that \(G\) is isomorphic to \(\left[\mathbb{Z}_4;+_4\right]\text{.}\)
- Solve \(x^2= -1\) in \(G\) by first translating the equation to \(\mathbb{Z}_4\) , solving the equation in \(\mathbb{Z}_4\text{,}\) and then translating back to \(G\text{.}\)

The two groups \(\left[\mathbb{Z}_4;+_4\right]\) and \(\left[U_5;\times _5\right]\) are isomorphic. One isomorphism \(T:\mathbb{Z}_4\to U_5\) is partially defined by \(T(1)=3\text{.}\) Determine the values of \(T(0)\text{,}\) \(T(2)\text{,}\) and \(T(3)\text{.}\)

Answer.

By Theorem 11.7.14(a), \(T(0)\) must be 1. \(T(2)=T(1+_4 1)=T(1)\times_5 T(1) = 3 \times_5 3 = 4\text{.}\) Since \(T\) is a bijection, \(T(3)=2\text{.}\)

Prove Theorem 11.7.14.

Prove that all infinite cyclic groups are isomorphic to \(\mathbb{Z}\text{.}\)

Answer.

Let \(G\) be an infinite cyclic group generated by \(a\text{.}\) Then, using multiplicative notation, \(G=\left\{\left.a^n\right| n\in \mathbb{Z}\right\}\text{.}\) The map \(T: G \rightarrow \mathbb{Z}\) defined by \(T\left(a^n\right)=n\) is an isomorphism. This is indeed a function, since \(a^n=a^m\) implies \(n =m\text{.}\) Otherwise, \(a\) would have a finite order and would not generate \(G\text{.}\)

- \(T\) is one-to-one, since \(T\left(a^n\right) = T\left(a^m\right)\) implies \(n = m\text{,}\) so \(a^n= a^m\text{.}\)
- \(T\) is onto, since for any \(n\in \mathbb{Z}\text{,}\) \(T\left(a^n\right) = n\text{.}\)
- \(\displaystyle T\left(a^n*a^m \right) = T\left(a^{n+m}\right) =n + m\ =T\left(a^n\right)+T\left(a^m\right)\)

- Prove that \(\mathbb{R}^*\) is isomorphic to \(\mathbb{Z}_2 \times \mathbb{R}\text{.}\)
- Describe how multiplication of nonzero real numbers can be accomplished doing only additions and translations.

Prove that if \(G\) is any group and \(g\) is some fixed element of \(G\text{,}\) then the function \(\phi _g\) defined by \(\phi_g(x) = g*x*g^{-1}\) is an isomorphism from \(G\) into itself. An isomorphism of this type is called an inner automorphism.

Prove that “is isomorphic to” is an equivalence relation on the set of all groups by expanding on the observations made immediately after the definiton of an isomorphism.

It can be shown that there are five non-isomorphic groups of order eight. You should be able to describe at least three of them. Do so without use of tables. Be sure to explain why they are not isomorphic.

Answer.

\(\mathbb{Z}_8\text{,}\) \(\mathbb{Z}_2\times \mathbb{Z}_4\) , and \(\mathbb{Z}_2^3\text{.}\) One other is the fourth dihedral group, introduced in Section 15.3.

In Section 11.2 we posed the question of whether the two monoids \([\mathcal{P}(U);\cap]\) and \([\mathcal{P}(U);\cup]\text{,}\) both monoids on the power set of some nonempty universal set \(U\text{,}\) are different or really the same. At the time we didn’t have the notion of isomorphism to draw upon. Now that we do, determine whether they are isomorphic monoids.

Prove that the number of 3’s in an order sequence is even.

Answer.

Each 3 is the order of an element whose inverse is it’s square; i. e., if \(a\) has order 3, \(a^2=a^{-1}\) is distinct from \(a\) and also has order 3 and contributes a second matching 3.

Prove that the number of 5’s an order sequence is a multiple of four.

You have attempted of activities on this page.