Localization Sequence
The localization sequence is the most important computational tool in algebraic K-theory. It relates the K-groups of a ring (or scheme) to those of a localization and the "fiber" at the removed points, producing a long exact sequence analogous to the Mayer--Vietoris sequence in topology.
Localization for abelian categories
Let be an abelian category and a Serre subcategory (closed under subobjects, quotients, and extensions). Let be the Serre quotient category. Then there is a long exact sequence
extending to the left indefinitely and terminating on the right:
Localization for rings
Let be a Dedekind domain with fraction field . Let denote the category of finitely generated -modules supported on a set of primes . For a non-zero prime , devissage gives .
The localization sequence takes the form:
where the direct sum is over all non-zero primes of , and is the boundary map (or tame symbol in low degrees).
For , , and residue fields :
Since is regular, . In low degrees:
:
This gives , where is the -adic valuation. The cokernel of is (the class group of is trivial).
:
The tame symbol . The sequence gives which is , the product of signs.
Localization for schemes
For a Noetherian scheme with closed subscheme and open complement , there is a long exact sequence in G-theory:
where is the closed immersion and is the open immersion. The map is restriction of coherent sheaves, and is pushforward.
Consider , , :
Since is regular, by homotopy invariance. The sequence becomes:
The map factors as , which is the identity. So the connecting map is zero, and we get short exact sequences . These split, giving
which is the BHS decomposition for regular rings.
The boundary map
The boundary map in the localization sequence for a DVR generalizes classical residue maps:
-
: is the valuation .
-
: is the tame symbol: .
-
Higher : is a "higher tame symbol" that can be described in terms of Milnor K-theory or motivic cohomology.
The exactness of the localization sequence at means: an element lies in the image of (i.e., has "no pole" at ) if and only if .