The Lumenary · First-year graduate
Modules
Name: ______________________
Date: ______________________
You will learn to
- Work with module homomorphisms, submodules, quotients, kernels, cokernels and exact sequences, and recognise free, projective and injective modules
- Prove that free modules are projective, that projective means "direct summand of a free module", and that over a PID submodules of finite free modules are free
- Prove the Smith normal form and the structure theorem for finitely generated modules over a PID, including uniqueness of the invariant factors
- Deduce the classification of finitely generated abelian groups and the Jordan normal form
- Compute tensor products of modules, prove that is right exact via the tensor–hom adjunction, and show that it is not exact in general
- 1.
Which of these -modules are free? (Choose all that apply.)
- A.
- B.
- C.
- D.
- E.
- F.
- 2.
How many abelian groups of order are there, up to isomorphism?
- 3.
Which group is (the quotient by the subgroup generated by these two vectors)?
- A.
- B.
- C.
- D.
- 4.
A linear map on has characteristic polynomial , minimal polynomial , and . What are the sizes of its Jordan blocks?
- A.
- B.
- C.
- D.
- 5.
In the proof that a submodule over a PID is free, why does the sequence split?
- A. is an ideal of a PID, hence free, hence projective
- B.Every short exact sequence of modules splits
- C.By the induction hypothesis, is free
- D. is a domain, so there are no zero divisors
- 6.
Over which of these rings does some submodule of a free -module (of finite rank) fail to be free? (Choose all that apply.)
- A.
- B.
- C.
- D.
- E. for a field
- F.
- 7.
How many elements does have?
- 8.
Which Lean statement expresses that tensoring with does not preserve injectivity (as proved in
tensor_not_left_exact)?- A.
Function.Injective (2 • LinearMap.id : ℤ →ₗ[ℤ] ℤ) ∧ ¬ Function.Injective ((2 • LinearMap.id : ℤ →ₗ[ℤ] ℤ).rTensor (ZMod 2)) - B.
¬ Function.Injective ((0 : ℤ →ₗ[ℤ] ℤ).rTensor (ZMod 2)) - C.
Function.Surjective (g.rTensor Q)wheneverFunction.Surjective g - D.
¬ Module.Free ℤ (ZMod 2)
- A.
- 9.
Write
invariant_factors(orders): given positive integers , return the invariant factors of as a list with (empty for the zero group). For example , soinvariant_factors([4, 6]) == [2, 12].Computational — Practice