24.11.2017 Views

Abelian Groups - László Fuchs [Springer]

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

258 9 <strong>Groups</strong> of Extensions and Cotorsion <strong>Groups</strong><br />

commutative. There is no difficulty in showing that in this way we have indeed<br />

defined a category which will be denoted E.<br />

In accordance with our definition of equivalent extensions above, we will say that<br />

the exact sequences e and e 0 (qua extensions) are equivalent (notation: e e 0 )if<br />

A D A 0 ; C D C 0 and there is a morphism .1 A ;ˇ;1 C / from e to e 0 .Thatˇ is then an<br />

isomorphism follows at once from Lemma 2.6 in Chapter 1.<br />

The beauty of treating extensions as short exact sequences lies in the fact that we<br />

can work with commutative diagrams, making most proofs more transparent. But<br />

first we must learn the basic facts about the category E.<br />

To start with, we concentrate on extensions of a fixed group A.If W C 0 ! C is a<br />

homomorphism, then there is a pull-back square<br />

0 −−−−→ A<br />

β<br />

B ′ ν ′<br />

⏐<br />

↓<br />

μ<br />

−−−−→ B<br />

−−−−→ C ′<br />

⏐<br />

γ↓<br />

ν<br />

−−−−→ C −−−−→ 0<br />

From Sect. 3(a) in Chapter 2 we know that 0 is an epimorphism (since so is ), and<br />

the pull-back property shows that Ker 0 Š Ker Š A. Hence there exists a monic<br />

map 0 W A ! B 0 acting as 0 W a 7! .a;0/2 B 0 . B ˚ C 0 /, so that the diagram<br />

μ ′<br />

−−−−→ A −−−−→ B ′ ν<br />

−−−−→ ′<br />

C ′ −−−−→ 0<br />

⏐ ⏐<br />

∥<br />

β↓<br />

γ↓<br />

−−−−→ A<br />

μ<br />

−−−−→ B<br />

ν<br />

−−−−→ C −−−−→ 0<br />

has exact rows and commutative squares. The top row is an extension of A by C 0<br />

which we have denoted by e to indicate its origin from e via . Note that D<br />

.1 A ;ˇ;/is a morphism e ! e in the category E.<br />

Now suppose we have a similar commutative diagram<br />

μ<br />

: 0 −−−−→ A −−−−→ ′′<br />

B ′′ ν<br />

−−−−→ ′′<br />

C ′ −−−−→ 0<br />

⏐ ⏐↓ ⏐<br />

∥ β ′ γ↓<br />

: 0 −−−−→ A<br />

μ<br />

−−−−→<br />

B<br />

ν<br />

−−−−→ C −−−−→ 0<br />

with exact rows, for another group B 00 . By the pull-back property there is a unique<br />

W B 00 ! B 0 such that 0 D 00 and ˇ D ˇ0. Since the maps 00 ; 0 W A ! B 0<br />

are such that ˇ. 00 / D ˇ0 00 D D ˇ 0 and 0 . 00 / D 00 00 D 0 D 0 0 ,<br />

the uniqueness assertion on pull-backs implies 00 D 0 . Hence .1 A ;;1 C 0/ is an

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!