Exercise 2.9

Let 0 M M M ′′ 0 be an exact sequence of A -modules. If M and M ′′ are finitely generated, then so is M .

Answers

Proof. Since M , M are finitely generated, by Prop. 2.3 we have the diagram

           m          m     n     n
 0        <msup><mrow>A</mrow><mrow > </mrow></msup >         <msup><mrow>A</mrow><mrow >  </mrow></msup >⊕ <msup><mrow>A< /mrow><mrow ></mrow></msup >   <msup><mrow>A< /mrow><mrow ></mrow></msup >     0

            ′                     ″
αβγfg0        <msup><mrow>M </mrow><mrow ></mrow></msup >         M          <msup><mrow>M </mrow><mrow ></mrow></msup >      0

where α , γ are surjective, and each row is exact. Denote the generators of A m A n as x 1 , , x m , y 1 , , y n ; identifying x i , y j with their preimages and images in A m , A n respectively, define β ( x i ) = f ( α ( x i ) ) and β ( y j ) = g ( β ( y j ) ) . This makes the diagram commute, hence by the snake lemma (Prop. 2.10), we have that coker α coker β coker γ is exact. But coker α = coker γ = 0 , hence coker β = 0 , and so β is surjective, i.e., M is finitely generated by Prop. 2.3. □

User profile picture
2023-07-24 15:23
Comments