**Counterexample**

To form a counterexample, take the smallest non-abelian group, the symmetric group on three letters. Let *A* denote the alternating subgroup, and let . Let *q* and *r* denote the inclusion map and the sign map respectively, so that

is a short exact sequence. Condition (3) fails, because is not abelian. But condition (2) holds: we may define *u*: *C* → *B* by mapping the generator to any two-cycle. Note for completeness that condition (1) fails: any map *t*: *B* → *A* must map every two-cycle to the identity because the map has to be a group homomorphism, while the order of a two-cycle is 2 which can not be divided by the order of the elements in A other than the identity element, which is 3 as A is the alternating subgroup of, or namely the cyclic group of order 3. But every permutation is a product of two-cycles, so *t* is the trivial map, whence *tq*: *A* → *A* is the trivial map, not the identity.

Reference.

Mac Lane, S. Homology. Reprint of the 1975 edition. Springer Classics in Mathematics ISBN 3-540-58662-8

Read more about this topic: Splitting Lemma, Non-abelian Groups

### Other articles related to "counterexample, counterexamples":

... Schweitzer's construction was then modified by Jenny Harrison in 1988 to make a

**counterexample**for some ... The existence of smoother

**counterexamples**remained an open question until 1993 when Krystyna Kuperberg constructed a very different

**counterexample**...

... Ford also proved that if there exists a

**counterexample**to the Conjecture, then a positive fraction (that is infinitely many) of the integers are likewise

**counterexamples**... Pomerance gave a sufficient condition for an integer n to be a

**counterexample**to the conjecture (Pomerance 1974) ... According to this condition, n is a

**counterexample**if for every prime p such that p − 1 divides φ(n), p2 divides n ...

**Counterexample**

... In mathematics, the method of considering a minimal

**counterexample**(or minimal criminal) combines the ideas of inductive proof and proof by contradiction ... it is false, and that therefore there is at least one

**counterexample**... need to be chosen skillfully, one assumes that there is such a

**counterexample**C that is minimal ...

**Counterexample**- Further Reading

... Using

**counterexamples**in this way proved to be so useful that there are several books collecting them Lynn Arthur Steen and J ...

**Counterexamples**in Topology, Springer, New York 1978, ISBN 0-486-68735-X ... Siegel

**Counterexamples**in Probability and Statistics, Chapman Hall, New York, London 1986, ISBN 0-412-98901-8 ...

... He showed that the conjecture has a

**counterexample**, which he estimated to be around 1.845 × 10361 ... An explicit

**counterexample**, of n = 906,180,359 was given by R ... Sherman Lehman in 1960 the smallest

**counterexample**is n = 906,150,257, found by Minoru Tanaka in 1980 ...