Skip to content
The Lumenary

Each worksheet prints cleanly on A4 or Letter. Answer keys are on a separate page.

The Lumenary · First-year graduate

Abelian categories

Name: ______________________

Date: ______________________

You will learn to

  • Define additive and abelian categories, kernels, cokernels, images and exact sequences, and exact functors
  • Verify that R-ModR\text{-}\cat{Mod} and sheaves of abelian groups on a space are abelian, and explain why free abelian groups, Banach spaces and vector bundles are additive but not abelian
  • Prove that in an abelian category a monic epimorphism is an isomorphism
  • Prove the five lemma and the snake lemma by diagram chasing, and explain how they transfer to every abelian category
  • State the Freyd–Mitchell embedding theorem and explain what it does and does not allow
  1. 1.

    Which of these categories are abelian? (Choose all that apply.)

    • A.Finite abelian groups
    • B.Finite-dimensional vector spaces over a field
    • C.Sheaves of abelian groups on a topological space
    • D.Free abelian groups
    • E.Banach spaces and bounded linear maps
    • F.All groups
  2. 2.

    In the proof that a monic epimorphism f:X→Yf : X \to Y in an abelian category is an isomorphism, we write f=ker⁡gf = \ker g for some g:Y→Zg : Y \to Z and conclude g=0g = 0. Which fact gives g=0g = 0?

    • A.gf=0=0∘fgf = 0 = 0 \circ f and ff is an epimorphism
    • B.ff is a monomorphism
    • C.Hom-sets are abelian groups
    • D.Kernels are unique up to isomorphism
  3. 3.

    A morphism of short exact sequences of finite-dimensional vector spaces has dim⁡ker⁡α=1\dim \ker\alpha = 1, dim⁡ker⁡β=2\dim\ker\beta = 2, dim⁡ker⁡γ=3\dim\ker\gamma = 3, dim⁡coker⁡α=2\dim\operatorname{coker}\alpha = 2 and dim⁡coker⁡β=1\dim\operatorname{coker}\beta = 1. What is dim⁡coker⁡γ\dim\operatorname{coker}\gamma?

  4. 4.

    In the five lemma (rows A1→⋯→A5A_1 \to \cdots \to A_5 and B1→⋯→B5B_1 \to \cdots \to B_5, vertical maps h1,…,h5h_1, \dots, h_5), which hypotheses does the proof that h3h_3 is injective use?

    • A.h2h_2 and h4h_4 injective, h1h_1 surjective
    • B.h2h_2 and h4h_4 surjective, h5h_5 injective
    • C.All four outer maps must be isomorphisms
    • D.Only h1h_1 surjective and h5h_5 injective
  5. 5.

    Which of the following are legitimate uses of the Freyd–Mitchell embedding theorem? (Choose all that apply.)

    • A.Proving the snake lemma in Sh(X;Ab)\mathrm{Sh}(X; \mathbf{Ab}) by chasing elements
    • B.Proving the four lemma in any abelian category
    • C.Concluding that Sh(X;Ab)\mathrm{Sh}(X; \mathbf{Ab}) has enough projectives, because module categories do
    • D.Computing Ext\mathrm{Ext} in A\mathcal{A} by computing Ext\mathrm{Ext} of the images in RR-Mod\mathbf{Mod}
    • E.Concluding that infinite products in A\mathcal{A} are exact, since they are in RR-Mod\mathbf{Mod}
  6. 6.

    On X=C∖{0}X = \mathbb{C} \setminus \{0\} consider 0→Z‾→O→exp⁡O×→00 \to \underline{\mathbb{Z}} \to \mathcal{O} \xrightarrow{\exp} \mathcal{O}^\times \to 0. Which statement is true?

    • A.It is exact in sheaves, but exp⁡:O(X)→O×(X)\exp : \mathcal{O}(X) \to \mathcal{O}^\times(X) is not surjective
    • B.It is not exact, because zz has no logarithm on XX
    • C.It is exact, and so is the sequence of global sections
    • D.The kernel of exp⁡\exp is the constant sheaf C‾\underline{\mathbb{C}}
  7. 7.

    The Lean theorem short_five_injective concludes Function.Injective β. Which set of hypotheses (besides commutativity) does it use?

    • A.Function.Exact f g, Function.Injective f', Function.Injective α, Function.Injective γ
    • B.Function.Surjective g, Function.Exact f' g', Function.Surjective α, Function.Surjective γ
    • C.α and γ are linear equivalences
    • D.Function.Injective α, Function.Injective γ only
  8. 8.

    For an integer matrix M=(abcd)M = \begin{pmatrix} a & b \\ c & d \end{pmatrix}, viewed as a map Z2→Z2\mathbb{Z}^2 \to \mathbb{Z}^2, the cokernel in Ab\mathbf{Ab} is Z/d1⊕Z/d2\mathbb{Z}/d_1 \oplus \mathbb{Z}/d_2 (with Z/0=Z\mathbb{Z}/0 = \mathbb{Z}), where d1=gcd⁡(a,b,c,d)d_1 = \gcd(a, b, c, d) and d1d2=∣det⁡M∣d_1 d_2 = |\det M| (if M=0M = 0, the cokernel is Z2\mathbb{Z}^2). Write cokernel_2x2(a, b, c, d) returning (torsion, free_rank): the sorted list of torsion orders greater than 11, and the rank of the free part.

    Computational — Practice

Code: Apache-2.0 · Content: CC BY-SA 4.0