Square map is endomorphism iff abelian: Difference between revisions
| Line 37: | Line 37: | ||
* [[Multiplication by n map is an endomorphism iff derived subring has exponent dividing n(n-1)]] | * [[Multiplication by n map is an endomorphism iff derived subring has exponent dividing n(n-1)]] | ||
=== | ===Opposite facts for other algebraic structures=== | ||
{| class="sortable" border="1" | |||
! Statement !! Algebraic structure !! What step of the proof fails? !! Comment | |||
|- | |||
| [[Square map is endomorphism not implies abelian for loop]] || [[loop]] || The reparenthesization in Step (3) of the proof below, that requires associativity. || In fact, it is possible to have a noncommutative loop of exponent two. | |||
|- | |||
| [[Square map is endomorphism not implies abelian for monoid]] || [[monoid]] || The cancellation in Step (4), which requires that we are working over a [[cancellative monoid]]. || | |||
|} | |||
==Facts used== | ==Facts used== | ||
Revision as of 20:22, 25 February 2011
This article describes an easy-to-prove fact about basic notions in group theory, that is not very well-known or important in itself
View other elementary non-basic facts
VIEW FACTS USING THIS: directly | directly or indirectly, upto two steps | directly or indirectly, upto three steps|
VIEW: Survey articles about this
Statement
Verbal statement
The square map on a group, viz the map sending each element to its square, is an endomorphism if and only if the group is abelian.
Statement with symbols
Let be a group and be the map defined as . Then, is an endomorphism if and only if is Abelian.
Related facts
Applications
- Exponent two implies abelian: If the exponent of a group is 2 (i.e., the group is nontrivial and every non-identity element has order two) then the group is abelian. The analogous statement is not true for any other prime number, i.e., there can be a non-abelian group of prime exponent. The standard example for an odd prime is prime-cube order group:U(3,p) of order .
Majority criterion
Other power maps
The power map for a fixed integer is termed a universal power map, and if it is also an endomorphism, it is termed a universal power endomorphism. This statement gives a necessary and sufficient condition for a group where gives an endomorphism. Here are results for other values of :
- Inverse map is automorphism iff abelian
- Cube map is endomorphism iff abelian (if order is not a multiple of 3)
- Cube map is surjective endomorphism implies abelian
- nth power map is endomorphism iff abelian (if order is relatively prime to n(n-1))
- Frattini-in-center odd-order p-group implies p-power map is endomorphism
Related facts for Lie rings
Here are some related facts for Lie rings:
- Multiplication by n map is a derivation iff derived subring has exponent dividing n
- Multiplication by n map is an endomorphism iff derived subring has exponent dividing n(n-1)
Opposite facts for other algebraic structures
| Statement | Algebraic structure | What step of the proof fails? | Comment |
|---|---|---|---|
| Square map is endomorphism not implies abelian for loop | loop | The reparenthesization in Step (3) of the proof below, that requires associativity. | In fact, it is possible to have a noncommutative loop of exponent two. |
| Square map is endomorphism not implies abelian for monoid | monoid | The cancellation in Step (4), which requires that we are working over a cancellative monoid. |
Facts used
- Associative implies generalized associative: Basically this says that in a group, we can drop and rearrange parentheses at will.
- Invertible implies cancellative in monoid. Since every element of a group is invertible, cancellation is valid in groups.
- Abelian implies universal power map is endomorphism
Proof
From square map being endomorphism to abelian
This proof uses a tabular format for presentation. Provide feedback on tabular proof formats in a survey (opens in new window/tab) | Learn more about tabular proof formats|View all pages on facts with proofs in tabular format
Given: A group such that the map is an endomorphism, i.e., for all .
To prove: for all .
Proof: We let be arbitrary elements of .
| Step no. | Assertion/construction | Facts used | Given data used | Previous steps used | Explanation | What algebraic assumptions does this use? |
|---|---|---|---|---|---|---|
| 1 | -- | square map is endomorphism | -- | -- | None, works over any magma | |
| 2 | -- | Step (1) | -- | None, just using definition of square. Works over any magma. | ||
| 3 | Fact (1) | Step (2) | Reparenthesize | The reparenthesization requires associativity of expressions involving two variables. It works over any semigroup or monoid and even more generally over any diassociative magma. | ||
| 4 | Fact (2) | Step (3) | Cancel the right-most from both sides, then the left-most from both sides. | The cancellation requires that we are working in a cancellative magma, such as a cancellative monoid or a quasigroup. |
From abelian to square map being endomorphism
This follows directly from fact (3).