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.

558 14 Butler <strong>Groups</strong><br />

(i) there exists a solid chain from A to G;<br />

(ii) there is a balanced-exact sequence<br />

0 ! B ! A ˚ C !G ! 0 (14.7)<br />

where C is completely decomposable, A is the inclusion, and B is a B 2 -<br />

group;<br />

(iii) the same as (ii) with prebalanced-exact (14.7).<br />

Proof. (i) ) (ii) We place ourselves in the following setting: we have a solid chain<br />

A D G 0 < < G < G C1 < < G with factors of rank 1. We build a relative<br />

balanced-projective resolution of G with the aid of this chain as follows: from a<br />

relative balanced-projective resolution 0 ! B ! A ˚ C ! G ! 0 of G <br />

we form a relative balanced-projective resolution 0 ! B C1 ! A ˚ C C1 !<br />

G C1 ! 0 of G C1 by choosing C C1 D C ˚ C for a suitable completely<br />

decomposable group C and mapping C into G C1 such that in an arbitrarily<br />

chosen direct decomposition of C , no rank 1 summand maps into G .<br />

In this way, we obtain commutative diagrams with exact rows and columns:<br />

0 0 0<br />

⏐<br />

⏐<br />

⏐<br />

↓<br />

↓<br />

↓<br />

0 −−−−→ B σ −−−−→ A ⊕ C σ −−−−→ G σ −−−−→ 0<br />

⏐<br />

⏐<br />

⏐<br />

↓<br />

↓<br />

↓<br />

0 −−−−→ B σ+1 −−−−→ A ⊕ C σ ⊕ C ∗ −−−−→ G σ+1 −−−−→ 0<br />

⏐<br />

⏐<br />

⏐<br />

↓<br />

↓<br />

↓<br />

0 −−−−→ B σ+1 /B σ −−−−→ C ∗ −−−−→ G σ+1 /G σ −−−−→ 0<br />

⏐<br />

⏐<br />

⏐<br />

↓<br />

↓<br />

↓<br />

0 0 0<br />

Evidently, B is balanced in B C1 , since it is balanced in A˚C which is a summand<br />

of A ˚ C ˚ C . It is routine to check that at limit ordinals the direct limits provide<br />

relative balanced-projective resolutions.<br />

Now, if G is solid in G C1 , then the ideal I generated by the types of summands<br />

in C has a countable set of generators, thus jC j D @ 0 may be assumed. In<br />

the diagram, B C1 =B is a corank one pure subgroup of the countable completely<br />

decomposable group C , so Theorem 6.8 guarantees that B C1 =B is a B 2 -group.<br />

Consequently, B is the union of a smooth chain 0 D B 0 < < B < B C1 < :::<br />

of subgroups such that each is balanced in its successor, and each of the factors

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

Saved successfully!

Ooh no, something went wrong!