AoPSWiki
Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!

Homomorphism

From AoPSWiki

Revision as of 15:31, 21 February 2008 by JBL (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

This article is a stub. Help us out by expanding it.

Let A and B be algebraic structures of the same species, for example two groups or fields. A homomorphism is a function \phi : A \to B that preserves the structure of the species.

For example, if A is a substructure (subgroup, subfield, etc.) of B, the inclusion map i: A \to B such that i(a) = a for all a \in A is a homomorphism.

A homomorphism from a structure to itself is called an endomorphism. A homomorphism that is bijective is called an isomorphism. A bijective endomorphism is called an automorphism.

Examples

If A and B are partially ordered sets, a homomorphism from A to B is a mapping \phi : A \to B such that for all a, b \in A, if a \le b, then \phi(a) \le \phi(b).

If A and B are groups, with group law of *, then a homomorphism \phi : A \to B is a mapping such that for all a,b \in A, \phi( a*b) = \phi(a)* \phi(b) . Similarly, if A and B are fields or rings, a homomorphism from A to B is a mapping \phi : A \to B such that for all a,b \in A, \begin{align*}\phi(a+b) &= \phi(a) + \phi(b) \\\phi(ab) &= \phi(a)\phi(b) . \end{align*} In other words, \phi distributes over addition and multiplication.

See Also

Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us