The Central Idea
The generalized algebraic structures developed in this section are built from sets, operations, identities, inverses, distributive laws, scalar actions, and other structural rules.
A natural next question is:
How can we compare two structures without focusing on the names or appearances of their elements?
The answer is to study maps that preserve the operations.
Structure-Preserving Maps
Suppose
\[ (A,\star) \]and
\[ (B,\diamond) \]are algebraic structures.
A map
\[ f:A\to B \]preserves the operation if
\[ \boxed{ f(a\star b) = f(a)\diamond f(b) } \]for all \(a,b\in A\).
What Is a Homomorphism?
A homomorphism is a map that preserves the relevant algebraic operations and structure.
For a one-operation structure, the basic condition is
\[ \boxed{ f(a\star b) = f(a)\diamond f(b) }. \]The exact preservation laws depend on the kind of structures involved.
Group Homomorphisms
Let
\[ (G,\star) \]and
\[ (H,\diamond) \]be groups.
A map
\[ f:G\to H \]is a group homomorphism if
\[ \boxed{ f(a\star b) = f(a)\diamond f(b) }. \]Example: Integers to Modular Classes
Define
\[ f:\mathbb{Z}\to\mathbb{Z}_n \]by
\[ f(k)=[k]_n. \]Under addition,
\[ f(a+b) = [a+b]_n \]and
\[ f(a)+f(b) = [a]_n+[b]_n = [a+b]_n. \]Therefore,
\[ \boxed{ f(a+b)=f(a)+f(b) }. \]So \(f\) is a group homomorphism.
Homomorphisms Preserve Identity Elements
Let \(e_G\) be the identity of \(G\) and \(e_H\) the identity of \(H\).
A group homomorphism satisfies
\[ \boxed{ f(e_G)=e_H }. \]This is a consequence of operation preservation rather than a separate axiom.
Why Identity Is Preserved
Since
\[ e_G\star e_G=e_G, \]apply \(f\):
\[ f(e_G) = f(e_G\star e_G) = f(e_G)\diamond f(e_G). \]Cancel \(f(e_G)\) in the group \(H\).
Therefore,
\[ f(e_G)=e_H. \]Homomorphisms Preserve Inverses
For a group homomorphism,
\[ \boxed{ f(a^{-1}) = f(a)^{-1} }. \]This follows because
\[ aa^{-1}=e_G. \]Applying \(f\),
\[ f(a)f(a^{-1})=e_H. \]Thus \(f(a^{-1})\) is the inverse of \(f(a)\).
Homomorphisms Preserve Powers
In multiplicative notation,
\[ \boxed{ f(a^n)=f(a)^n }. \]In additive notation,
\[ \boxed{ f(na)=nf(a) }. \]Repeated operation structure is therefore preserved.
Kernel of a Group Homomorphism
For
\[ f:G\to H, \]the kernel is the set of elements mapped to the identity of \(H\):
\[ \boxed{ \ker(f) = \{g\in G:f(g)=e_H\} }. \]This generalizes the kernel of a linear transformation.
Image of a Homomorphism
The image is
\[ \boxed{ \operatorname{im}(f) = \{f(g):g\in G\} }. \]The image of a group homomorphism is a subgroup of the codomain group.
Kernel and Injectivity
For group homomorphisms,
\[ \boxed{ f\text{ injective} \Longleftrightarrow \ker(f)=\{e_G\} }. \]This is the group-theoretic analogue of the linear-transformation result.
Example: Kernel of Reduction Modulo \(n\)
Consider
\[ f:\mathbb{Z}\to\mathbb{Z}_n \]defined by
\[ f(k)=[k]_n. \]The identity in \(\mathbb{Z}_n\) under addition is \([0]_n\).
Therefore
\[ \ker(f) = \{k\in\mathbb{Z}:k\equiv0\pmod n\}. \]Hence
\[ \boxed{ \ker(f)=n\mathbb{Z} }. \]Ring Homomorphisms
A ring homomorphism preserves both addition and multiplication.
Thus
\[ f:R\to S \]satisfies
\[ \boxed{ f(a+b)=f(a)+f(b) } \]and
\[ \boxed{ f(ab)=f(a)f(b) }. \]Under the unital ring convention used in Malone Math, we also require
\[ \boxed{ f(1_R)=1_S }. \]Example: Evaluation of Polynomials
Fix a real number \(c\).
Define
\[ E_c:\mathbb{R}[x]\to\mathbb{R} \]by
\[ E_c(p)=p(c). \]Then
\[ E_c(p+q) = p(c)+q(c) \]and
\[ E_c(pq) = p(c)q(c). \]Therefore \(E_c\) is a ring homomorphism.
Linear Transformations Are Homomorphisms
A linear transformation preserves vector addition and scalar multiplication.
Therefore linear transformations are structure-preserving maps for vector spaces.
They are the vector-space version of homomorphisms.
What Is an Isomorphism?
An isomorphism is a bijective homomorphism.
Thus
\[ f:A\to B \]is an isomorphism when:
- \(f\) preserves the relevant operations;
- \(f\) is one-to-one;
- \(f\) is onto.
We write
\[ \boxed{ A\cong B }. \]Structural Sameness
If
\[ A\cong B, \]then the two structures may contain completely different kinds of elements, but their algebraic behavior is the same.
An isomorphism provides a perfect relabeling of one structure as the other.
Example: Even Integers and Integers
Consider the additive groups
\[ (\mathbb{Z},+) \]and
\[ (2\mathbb{Z},+). \]Define
\[ f:\mathbb{Z}\to2\mathbb{Z} \]by
\[ f(n)=2n. \]Then
\[ f(a+b)=2(a+b)=2a+2b=f(a)+f(b). \]The map is bijective.
Therefore,
\[ \boxed{ (\mathbb{Z},+) \cong (2\mathbb{Z},+) }. \]Different Elements, Same Structure
The group \(\mathbb{Z}\) contains all integers.
The group \(2\mathbb{Z}\) contains only even integers.
As sets, they are not equal.
But as additive groups, their internal structure is the same.
Isomorphism captures this distinction between equality and structural equivalence.
Example: Triangle Symmetry and \(S_3\)
The full symmetry group of an equilateral triangle has six geometric transformations.
The symmetric group
\[ S_3 \]has six permutations of three objects.
Each triangle symmetry permutes the three vertices.
This correspondence preserves composition.
Therefore,
\[ \boxed{ D_3\cong S_3 }. \]Example: Coordinate Isomorphism
Let
\[ B=\{\mathbf{v}_1,\ldots,\mathbf{v}_n\} \]be a basis of an \(n\)-dimensional vector space \(V\).
The coordinate map
\[ \mathbf{v}\longmapsto[\mathbf{v}]_B \]gives an isomorphism
\[ \boxed{ V\cong F^n }. \]Thus every \(n\)-dimensional vector space over \(F\) has the same vector space structure as \(F^n\).
The Inverse of an Isomorphism
In standard algebraic settings, the inverse of an isomorphism is itself a homomorphism.
Therefore structural preservation works in both directions.
If
\[ f:A\to B \]is an isomorphism, then
\[ f^{-1}:B\to A \]restores the original structure exactly.
Automorphisms
An isomorphism from a structure to itself is called an automorphism.
Thus
\[ f:A\to A \]is an automorphism if it is a bijective homomorphism.
Automorphisms describe internal symmetries of algebraic structures.
Symmetry Groups as Automorphism Groups
Geometric symmetry can often be understood as automorphism.
A symmetry maps an object to itself while preserving the structure we care about.
This connects the earlier study of symmetry groups to the more general language of structure-preserving maps.
What Is an Invariant?
An invariant is a property or quantity that is preserved under the relevant notion of structural equivalence.
If two structures are isomorphic, then every isomorphism-invariant property must agree between them.
Invariants help classify structures and rule out impossible isomorphisms.
Cardinality as an Invariant
Isomorphic finite structures must have the same number of elements.
Therefore group order is an invariant under group isomorphism:
\[ \boxed{ G\cong H \Longrightarrow |G|=|H| }. \]Groups of different finite orders cannot be isomorphic.
Element Orders Are Preserved
If
\[ f:G\to H \]is a group isomorphism, then the order of \(g\in G\) equals the order of \(f(g)\in H\).
Therefore element-order patterns are group invariants.
Commutativity Is an Invariant
If one group is abelian and another is nonabelian, they cannot be isomorphic.
An isomorphism preserves multiplication patterns, so commutativity cannot disappear or appear under a relabeling.
Thus
\[ \boxed{ \text{abelian versus nonabelian} } \]is a structural invariant.
Cyclicity Is an Invariant
If \(G\) is cyclic and
\[ G\cong H, \]then \(H\) is also cyclic.
If
\[ G=\langle g\rangle, \]then
\[ H=\langle f(g)\rangle. \]Dimension Is a Vector-Space Invariant
If finite-dimensional vector spaces \(V\) and \(W\) are isomorphic, then
\[ \boxed{ \dim(V)=\dim(W) }. \]Therefore vector spaces of different dimensions cannot be isomorphic.
Rank Is Preserved Under Appropriate Equivalence
For linear transformations and matrix representations, rank measures the dimension of the image.
Changing bases alters matrix entries but does not change the rank of the underlying linear transformation.
Rank is therefore an important invariant of a linear map under basis change.
Characteristic Is a Ring Invariant
Ring isomorphisms preserve the additive and multiplicative identities.
Therefore the characteristic of a ring is preserved by isomorphism.
Rings of different characteristics cannot be isomorphic.
Zero-Divisor Behavior Is Structural
A ring isomorphism preserves multiplication and zero.
Therefore the existence of zero divisors is preserved under ring isomorphism.
An integral domain cannot be isomorphic to a ring that has zero divisors.
Field Structure Is Preserved
If two rings are isomorphic and one is a field, then the other is also a field.
Multiplicative inverses of nonzero elements correspond under the isomorphism.
Thus being a field is an isomorphism-invariant property.
Invariants Can Disprove Isomorphism
To show that two structures are not isomorphic, it is often enough to find one invariant that differs.
Examples include:
- different finite cardinalities;
- different element-order patterns;
- one structure commutative and the other noncommutative;
- different dimensions;
- different characteristics;
- zero divisors present in only one structure.
Matching Invariants Do Not Always Prove Isomorphism
If two structures share several invariants, they may still fail to be isomorphic.
Invariants are often necessary tests, not automatically sufficient ones.
To prove isomorphism, we normally construct an explicit bijective homomorphism or invoke a theorem that guarantees one.
Equality Versus Isomorphism
Equality means two mathematical objects are literally the same object.
Isomorphism means they have the same algebraic structure.
Thus
\[ A=B \]is stronger than
\[ A\cong B. \]Isomorphism allows different underlying elements.
Isomorphic Structures Can Be Studied Interchangeably
If two structures are isomorphic, a theorem proved using only the relevant structure transfers from one to the other.
This is why isomorphism is often described informally as
“the same structure with different labels.”
Homomorphisms Need Not Be Isomorphisms
A homomorphism may fail to be injective, surjective, or both.
For example, reduction modulo \(n\),
\[ f:\mathbb{Z}\to\mathbb{Z}_n, \]is surjective but not injective.
Infinitely many integers map to each congruence class.
Injective Homomorphisms
An injective homomorphism embeds one structure inside another without collapsing distinct elements.
Such a map allows the domain to be identified with an isomorphic copy of its image.
This idea underlies many algebraic embeddings.
Surjective Homomorphisms
A surjective homomorphism reaches every element of the codomain.
It may collapse different domain elements together.
The kernel records exactly which elements collapse to the identity.
Endomorphisms
A homomorphism from a structure to itself is called an endomorphism.
Thus
\[ f:A\to A \]is an endomorphism when it preserves the relevant structure.
An automorphism is an invertible endomorphism.
Linear Operators
In vector-space language, a linear transformation
\[ T:V\to V \]is often called a linear operator.
Therefore linear operators are endomorphisms of vector spaces.
Composition of Homomorphisms
If
\[ f:A\to B \]and
\[ g:B\to C \]are homomorphisms of the same type, then
\[ g\circ f:A\to C \]is also a homomorphism.
Structure preservation is stable under composition.
Identity Maps Are Isomorphisms
Every algebraic structure \(A\) has an identity map
\[ \operatorname{id}_A:A\to A \]defined by
\[ \operatorname{id}_A(a)=a. \]This map is an isomorphism.
Therefore every structure is isomorphic to itself.
Isomorphism Is an Equivalence Relation
Isomorphism satisfies:
- reflexivity: \(A\cong A\);
- symmetry: if \(A\cong B\), then \(B\cong A\);
- transitivity: if \(A\cong B\) and \(B\cong C\), then \(A\cong C\).
Thus isomorphism partitions algebraic structures into structural equivalence classes.
Classification by Isomorphism
A major goal of abstract algebra is classification:
Which structures are genuinely different, and which are merely different representations of the same structure?
Isomorphism provides the standard criterion for structural sameness.
Example: Groups of Order Two
Every group with exactly two elements is isomorphic to
\[ \mathbb{Z}_2 \]under addition modulo \(2\).
The nonidentity element must be self-inverse, so the operation table is forced.
Therefore all two-element groups have the same abstract group structure.
Common Error: Assuming Any Function Is a Homomorphism
A homomorphism must preserve the relevant operations.
For groups,
\[ f(a\star b) \]must equal
\[ f(a)\diamond f(b) \]for all inputs.
An arbitrary function need not satisfy this condition.
Common Error: Assuming Every Homomorphism Is Injective
Homomorphisms may collapse many elements together.
The kernel measures this collapse.
Only a trivial kernel guarantees injectivity for group homomorphisms.
Common Error: Assuming Every Bijective Function Is an Isomorphism
Bijectivity alone is not enough.
The function must also preserve the algebraic operations.
A bijection that scrambles the operation structure is not an isomorphism.
Common Error: Confusing Isomorphic with Equal
Isomorphic structures need not contain the same elements.
For example,
\[ (\mathbb{Z},+) \]and
\[ (2\mathbb{Z},+) \]are not equal as sets but are isomorphic as groups.
Common Error: Treating Every Shared Property as an Invariant
An invariant must be preserved by the relevant notion of isomorphism.
Accidental similarities between two examples are not automatically structural invariants.
The property must follow from the algebraic structure itself.
Common Error: Assuming Matching Invariants Prove Isomorphism
Matching order, dimension, or other basic invariants may be necessary but not sufficient.
A complete isomorphism proof usually requires constructing a bijective homomorphism or applying a classification theorem.
A Reliable Homomorphism Test
- Identify the domain and codomain structures.
- Identify the operations that must be preserved.
- Choose arbitrary elements of the domain.
- Compute the image of their operation.
- Compute the operation of their images.
- Compare the two results.
- Repeat for every required operation if the structure has more than one.
A Reliable Isomorphism Procedure
- Propose a candidate map \(f:A\to B\).
- Show that \(f\) preserves the required operations.
- Show that \(f\) is injective.
- Show that \(f\) is surjective.
- Conclude that \(f\) is an isomorphism.
- Record the structural equivalence as \(A\cong B\).
A Reliable Nonisomorphism Procedure
- Identify invariants relevant to the structure type.
- Compare finite cardinalities when applicable.
- Compare commutativity or cyclicity for groups.
- Compare element-order patterns when useful.
- Compare dimensions for vector spaces.
- Compare characteristic or zero-divisor behavior for rings.
- If any invariant differs, conclude the structures are not isomorphic.
Example: Full Homomorphism Analysis
Define
\[ f:\mathbb{Z}\to\mathbb{Z}_4 \]by
\[ f(n)=[n]_4. \]Operation preservation
For \(a,b\in\mathbb{Z}\),
\[ f(a+b) = [a+b]_4 = [a]_4+[b]_4 = f(a)+f(b). \]So \(f\) is a group homomorphism.
Kernel
The kernel consists of integers congruent to \(0\) modulo \(4\):
\[ \boxed{ \ker(f)=4\mathbb{Z} }. \]Image
Every residue class modulo \(4\) is hit.
Therefore,
\[ \operatorname{im}(f)=\mathbb{Z}_4. \]The map is surjective but not injective.
Therefore it is a homomorphism but not an isomorphism.
Example: Full Isomorphism Analysis
Define
\[ f:(\mathbb{R},+)\to(\mathbb{R}_{>0},\cdot) \]by
\[ f(x)=e^x. \]Operation preservation
Since
\[ e^{x+y}=e^x e^y, \]we have
\[ f(x+y)=f(x)f(y). \]Injectivity
The exponential function is one-to-one on \(\mathbb{R}\).
Surjectivity
Every positive real number \(y\) can be written as
\[ y=e^{\ln y}. \]Therefore \(f\) is onto \(\mathbb{R}_{>0}\).
Hence
\[ \boxed{ (\mathbb{R},+) \cong (\mathbb{R}_{>0},\cdot) }. \]Practice 1: Group Homomorphism
Define
\[ f:\mathbb{Z}\to\mathbb{Z} \]by
\[ f(n)=3n. \]Is \(f\) a homomorphism under addition?
Practice 2: Kernel
For
\[ f:\mathbb{Z}\to\mathbb{Z}_5, \qquad f(n)=[n]_5, \]find the kernel.
Practice 3: Image
For the same map
\[ f:\mathbb{Z}\to\mathbb{Z}_5, \]find the image.
Practice 4: Isomorphism or Not?
Is
\[ f:\mathbb{Z}\to2\mathbb{Z}, \qquad f(n)=2n, \]an isomorphism under addition?
Practice 5: Different Group Orders
Can a group of order \(6\) be isomorphic to a group of order \(8\)?
Practice 6: Commutativity Invariant
Can an abelian group be isomorphic to a nonabelian group?
Practice 7: Dimension Invariant
Can
\[ \mathbb{R}^2 \]be isomorphic to
\[ \mathbb{R}^3 \]as real vector spaces?
Practice 8: Ring Evaluation Map
Define
\[ E_2:\mathbb{R}[x]\to\mathbb{R} \]by
\[ E_2(p)=p(2). \]Does \(E_2\) preserve addition and multiplication?
Practice 9: Automorphism
What is an automorphism?
Practice 10: Identify the Error
A student says:
“Two finite groups are isomorphic whenever they have the same number of elements.”
Explain the error.
Practice Answers
Practice 1
Yes.
\[ f(a+b) = 3(a+b) = 3a+3b = f(a)+f(b). \]Therefore \(f\) is an additive group homomorphism.
Practice 2
The kernel consists of integers congruent to \(0\) modulo \(5\):
\[ \boxed{ \ker(f)=5\mathbb{Z} }. \]Practice 3
Every residue class modulo \(5\) is attained.
Therefore,
\[ \boxed{ \operatorname{im}(f)=\mathbb{Z}_5 }. \]Practice 4
Yes.
The map preserves addition, is one-to-one, and is onto the even integers.
Therefore,
\[ \boxed{ (\mathbb{Z},+) \cong (2\mathbb{Z},+) }. \]Practice 5
No.
Isomorphic finite groups must have the same number of elements.
Practice 6
No.
Commutativity is preserved under group isomorphism.
Practice 7
No.
Their dimensions are different:
\[ \dim(\mathbb{R}^2)=2, \qquad \dim(\mathbb{R}^3)=3. \]Dimension is preserved under vector-space isomorphism.
Practice 8
Yes.
\[ E_2(p+q) = p(2)+q(2) \]and
\[ E_2(pq) = p(2)q(2). \]Therefore \(E_2\) is a ring homomorphism.
Practice 9
An automorphism is an isomorphism from an algebraic structure to itself.
It is an invertible structure-preserving self-map.
Practice 10
Equal cardinality is necessary but not sufficient for isomorphism.
Two groups with the same number of elements may have different operation structures, element orders, or commutativity behavior.
To prove isomorphism, one must establish a bijective homomorphism or use an appropriate classification theorem.
What to Remember
A homomorphism preserves algebraic structure.
For one-operation structures,
\[ \boxed{ f(a\star b) = f(a)\diamond f(b) }. \]An isomorphism is a bijective homomorphism:
\[ \boxed{ A\cong B }. \]Isomorphic structures are structurally the same even when their elements differ.
Important ideas include:
- homomorphisms preserve operations;
- group homomorphisms preserve identities, inverses, and powers;
- kernels measure collapse to the identity;
- images record the structure actually reached;
- isomorphisms preserve structure in both directions;
- automorphisms are self-isomorphisms;
- invariants are properties preserved under structural equivalence;
- different invariants can prove that two structures are not isomorphic.
Examples of invariants include:
- finite cardinality;
- element-order patterns;
- commutativity;
- cyclicity;
- dimension;
- rank;
- characteristic;
- zero-divisor behavior.
Section Perspective
Generalized algebraic structures reveal a recurring mathematical pattern:
\[ \boxed{ \text{objects} + \text{operations} + \text{laws} = \text{structure} }. \]Semigroups, monoids, groups, rings, fields, vector spaces, and related systems differ in which operations and laws they require.
Homomorphisms tell us how structure can be preserved between systems. Isomorphisms tell us when two systems are structurally equivalent. Invariants tell us what features survive every valid relabeling.
Together, these ideas provide a general language for recognizing the same mathematical architecture across numbers, symmetries, matrices, polynomials, functions, modular systems, and many other settings.