Computing Ext Groups
Techniques for computing Ext: choice of variable, use of the long exact sequences, standard computations over the integers, and Ext for cyclic and finitely generated modules.
Every page in the KEVOS library tagged Ext and Tor. 7 pages.
Techniques for computing Ext: choice of variable, use of the long exact sequences, standard computations over the integers, and Ext for cyclic and finitely generated modules.
Extensions of modules, equivalence of extensions, the Baer sum defined by pullback and pushout, and the resulting abelian group structure on Ext.
Ext defined via extensions, via projective resolutions and via injective resolutions, the agreement of the three definitions, and the basic vanishing criteria.
The Stein-Serre theorem characterising countable torsion-free abelian groups that are free, via vanishing of Ext, and related Whitehead-type problems.
The tensor product by universal property and construction, right exactness, flat modules, and the tensor-hom adjunction.
Tor defined by projective resolutions, symmetry in its two variables, vanishing criteria, and the standard computations over the integers.
The long exact sequences of Ext in the first and second variables, their connecting homomorphisms, naturality, and the direction reversal caused by contravariance.