Isomorphic — Definition, Formula & Examples
Isomorphic describes two algebraic structures (like groups, rings, or vector spaces) that are structurally identical — they have the same form even if their elements look different. An isomorphism is a bijective map between them that preserves the operation.
Two algebraic structures and are isomorphic, written , if there exists a bijection such that for all . The map is called an isomorphism.
Key Formula
Where:
- = A bijective map from structure G to structure H
- = The operation in G
- = The operation in H
How It Works
To show two structures are isomorphic, you must (1) define a function between them, (2) prove it is a bijection (one-to-one and onto), and (3) prove it preserves the operation. If any step fails, the structures are not isomorphic. To show two structures are *not* isomorphic, find a structural property one has that the other lacks — for example, one is cyclic and the other is not, or they have different orders of elements.
Worked Example
Problem: Show that the group is isomorphic to the group , where is a primitive cube root of unity.
Define the map: Let be defined by .
Verify bijection: The map sends 0, 1, 2 to three distinct elements, so it is both injective and surjective.
Verify operation preservation: For any , check that . Since , the operation is preserved.
Answer: Since is a bijection that preserves the group operation, .
Why It Matters
Isomorphism is the central notion of "sameness" in abstract algebra. Recognizing that two structures are isomorphic lets you transfer known theorems from one to the other, which is essential throughout group theory, ring theory, and in applications like cryptography and coding theory.
Common Mistakes
Mistake: Confusing a homomorphism with an isomorphism.
Correction: A homomorphism only needs to preserve the operation. An isomorphism must also be bijective (one-to-one and onto). Every isomorphism is a homomorphism, but not every homomorphism is an isomorphism.
