homomorphism
C2Pronunciation
UK
- /hˈɒməmˌɔːfɪzəm/
US
- /hˈɑːməmˌɔːrfɪzəm/
Description
- rule-preserving mapping
- structure-preserving map
- math translation
Imagine you have two systems that work by similar rules. This word means a map from one system to another that keeps the main rules the same. In math, it is often used for things like groups, rings, or other algebraic systems.
You can think of it as a translator between two math worlds. If you combine two parts in the first system and then map the result, you get the same answer as when you map the parts first and then combine them in the second system. It is a basic idea in abstract algebra because it helps show how different structures are connected.
The word "homomorphism" comes from Greek roots: homos, meaning "same," and morphē, meaning "form." Essentially, a homomorphism is a mapping between two algebraic structures (like groups, rings, or vector spaces) that preserves the operations defined on those structures. It is a way of showing how different mathematical worlds connect while maintaining their internal consistency.
Here is a simpler way to picture it. Imagine two games that use different pieces but follow the same kind of rule for combining moves. A homomorphism is a rule that converts moves from the first game into moves in the second game without breaking that pattern. The names may change, but the way the system works stays aligned.
In mathematics, if f is a homomorphism between two groups G and H, then for any elements a and b in G, the following must hold: f(a b) = f(a) f(b). This means that applying the operation to the inputs before mapping is equivalent to mapping the inputs then applying the operation in the new set.
Homomorphisms are important because they let mathematicians compare systems without losing the rules that matter. They are used in group theory, ring theory, linear algebra, and other parts of mathematics to simplify problems and spot deeper connections. Some special kinds of these maps are given their own names, such as isomorphisms, which preserve structure so completely that the two systems are essentially the same in form. So while the term may sound technical, the core idea is straightforward: it is a way to move from one mathematical structure to another while keeping the main operations and relationships intact.
Examples
- 1
Introductory math
The lecture starts with a homomorphism from the integers to the even numbers, so students can see a simple case first.
Pattern
a homomorphism from A to B
one that maps things in A into B
- 2
Structure preservation
Under this homomorphism, adding two numbers before mapping gives the same result as mapping them first and then adding.
- 3
Computer science
In computer science, a parser can sometimes be described as a homomorphism from strings to syntax trees.
Forms and spellings
1 form open this card.
Main spelling
- homomorphismnoun