Square map is endomorphism iff abelian: Difference between revisions

Latest revision as of 20:10, 10 August 2012

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

Let $G$ be a group and $σ : G \to G$ be the square map of $G$ defined as $σ (x) = x^{2}$ . Then, $σ$ is an endomorphism of $G$ (i.e., $σ (x y) = σ (x) σ (y) \forall x, y \in G$ ) if and only if $G$ is abelian.

Another way of putting it is that $G$ is 2-abelian if and only if it 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 $p^{3}$ .

Majority criterion

Endomorphism sends more than three-fourths of elements to squares implies abelian

Other $n^{t h}$ power maps

The $n^{t h}$ power map for a fixed integer $n$ is termed a universal power map, and if it is also an endomorphism, it is termed a universal power endomorphism and the group is termed a n-abelian group. This statement gives a necessary and sufficient condition for a group where $n = 2$ gives an endomorphism. Here are results for other values of $n$ .

n-abelian iff (1-n)-abelian
The set of $n$ for which $G$ is $n$ -abelian is termed the exponent semigroup of $G$ . It is a submonoid of the multiplicative monoid of integers.
abelian implies n-abelian for all n
n-abelian implies every nth power and (n-1)th power commute
n-abelian implies n(n-1)-central
n-abelian iff abelian (if order is relatively prime to n(n-1))
nth power map is surjective endomorphism implies (n-1)th power map is endomorphism taking values in the center
(n-1)th power map is endomorphism taking values in the center implies nth power map is endomorphism
Frattini-in-center odd-order p-group implies p-power map is endomorphism
Frattini-in-center odd-order p-group implies (mp plus 1)-power map is automorphism
Characterization of exponent semigroup of a finite p-group
Alperin's structure theorem for n-abelian groups

Value of $n$ (note that the condition for $n$ is the same as the condition for $1 - n$ )	Characterization of $n$ -abelian groups	Proof	Other related facts
0	all groups	obvious
1	all groups	obvious
2	abelian groups only	2-abelian iff abelian	endomorphism sends more than three-fourths of elements to squares implies abelian
-1	abelian groups only	-1-abelian iff abelian
3	3-abelian group means: 2-Engel group and derived subgroup has exponent dividing three	Levi's characterization of 3-abelian groups	cube map is surjective endomorphism implies abelian, cube map is endomorphism iff abelian (if order is not a multiple of 3), cube map is endomorphism implies class three
-2	same as for 3-abelian	(based on n-abelian iff (1-n)-abelian)

Related facts for Lie rings

Here are some related facts for Lie rings:

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 $G$ such that the map $σ = x \mapsto x^{2}$ is an endomorphism, i.e., $(x y)^{2} = x^{2} y^{2}$ for all $x, y \in G$ .

To prove: $x y = y x$ for all $x, y \in G$ .

Proof: We let $x, y$ be arbitrary elements of $G$ .

Step no.	Assertion/construction	Facts used	Given data used	Previous steps used	Explanation	What algebraic assumptions does this use?
1	$(x y)^{2} = (x^{2}) (y^{2})$	--	square map is endomorphism	--	--	None, works over any magma
2	$(x y) (x y) = (x x) (y y)$	--		Step (1)	--	None, just using definition of square. Works over any magma.
3	$(x (y x)) y = (x (x y)) y$	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	$y x = x y$	Fact (2)		Step (3)	Cancel the right-most $y$ from both sides, then the left-most $x$ from both sides.	The cancellation requires that we are working in a cancellative magma, such as a cancellative monoid or a quasigroup or loop.

From abelian to square map being endomorphism

This follows directly from fact (3).

@@ Line 1: / Line 1: @@
 {{elementary nonbasic fact}}
+[[difficulty level::1| ]]
+==Statement==
+Let <math>G</math> be a group and <math>\sigma:G \to G</math> be the [[square map]] of <math>G</math> defined as <math>\sigma(x) = x^2</math>. Then, <math>\sigma</math> is an [[endomorphism]] of <math>G</math> (i.e., <math>\sigma(xy) = \sigma(x)\sigma(y) \ \forall \ x,y \in G</math>) if and only if <math>G</math> is [[abelian group|abelian]].
+Another way of putting it is that <math>G</math> is [[n-abelian group|2-abelian]] if and only if it is [[abelian group|abelian]].
-==Statement==
+==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 <math>p^3</math>.
+===Majority criterion===
+* [[Endomorphism sends more than three-fourths of elements to squares implies abelian]]
+===Other <math>n^{th}</math> power maps===
+The <math>n^{th}</math> power map for a fixed integer <math>n</math> is termed a [[universal power map]], and if it is also an endomorphism, it is termed a [[universal power endomorphism]] and the group is termed a [[n-abelian group]]. This statement gives a necessary and sufficient condition for a group where <math>n = 2</math> gives an endomorphism. Here are results for other values of <math>n</math>.
+{{#lst:n-abelian group|general facts}}
+{{#lst:n-abelian group|particular values}}
+===Related facts for Lie rings===
-===Verbal statement===
+Here are some related facts for Lie rings:
-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 group|Abelian]].
+* [[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)]]
-===Statement with symbols===
+===Opposite facts for other algebraic structures===
-Let <math>G</math> be a group and <math>\sigma:G \to G</math> be the map defined as <math>\sigma(x) = x^2</math>. Then, <math>\sigma</math> is an endomorphism if and only if <math>G</math> is Abelian.
+{| 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]]. ||
+|}
-==Related facts==
+==Facts used==
-The <math>n^{th}</math> power map for a fixed integer <math>n</math> 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 <math>n = 2</math> gives an endomorphism. Here are results for other values of <math>n</math>:
+# [[uses::Associative implies generalized associative]]: Basically this says that in a group, we can drop and rearrange parentheses at will.
+# [[uses::Invertible implies cancellative in monoid]]. Since every element of a group is invertible, cancellation is valid in groups.
+# [[uses::Abelian implies universal power map is endomorphism]]
-* [[Inverse map is automorphism iff Abelian]]
-* [[Cube map is endomorphism iff Abelian (if order is not a multiple of 3)]]
-* [[Frattini-in-center odd-order p-group implies p-power map is endomorphism]]
 ==Proof==
-===From endomorphism to Abelian===
+===From square map being endomorphism to abelian===
-Suppose <math>\sigma = x \mapsto x^2</math> is an endomorphism of the group <math>G</math>. Then for any <math>x,y \in G</math> we want to show that <math>x</math> and <math>y</math> commute. This can be proved as follows:
+{{tabular proof format}}
-<math>\sigma(xy) = \sigma(x)\sigma(y)</math> becaus <math>\sigma</math> is an endomorphism
+'''Given''': A group <math>G</math> such that the map <math>\sigma = x \mapsto x^2</math> is an endomorphism, i.e., <math>(xy)^2 = x^2y^2</math> for all <math>x,y \in G</math>.
-Thus:
+'''To prove''': <math>xy = yx</math> for all <math>x,y \in G</math>.
-<math>xyxy = x^2y^2</math>
+'''Proof''': We let <math>x,y</math> be arbitrary elements of <math>G</math>.
-Cancelling the leftmost <math>x</math> and the rightmost <math>y</math>, we get:
+{| class="sortable" border="1"
+! Step no. !! Assertion/construction !! Facts used !! Given data used !! Previous steps used !! Explanation !! What algebraic assumptions does this use?
+|-
+| 1 ||  <math>(xy)^2 = (x^2)(y^2)</math> || -- || square map is endomorphism || -- || -- || None, works over any [[magma]]
+|-
+| 2 || <math>(xy)(xy) = (xx)(yy)</math> || -- || || Step (1) || -- || None, just using definition of square. Works over any [[magma]].
+|-
+| 3 || <math>(x(yx))y = (x(xy))y</math> || 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 || <math>yx = xy</math> || Fact (2) || || Step (3) || Cancel the right-most <math>y</math> from both sides, then the left-most <math>x</math> from both sides. || The cancellation requires that we are working in a [[cancellative magma]], such as a [[cancellative monoid]] or a [[quasigroup]] or [[loop]].
+|}
-<math>yx = xy</math>
+===From abelian to square map being endomorphism===
-and hence <math>x,y</math> commute.
+This follows directly from fact (3).