Skip to main content

limn and the extension functors Extn

  • Chapter
Strong Shape and Homology

Part of the book series: Springer Monographs in Mathematics ((SMM))

  • 689 Accesses

Abstract

In this section we first define and analyze in detail the extension products Extn(A, X) of two inverse systems of modules. We then show that limn X coincides with Extn(Δ(Λ), X), where Δ(Λ) is the diagonal inverse system. The advantage of this description of limn X over the description given in 11 lies in the fact that limn X can be determined using, the same projective resolution of Δ(Λ), for all X.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mardešić, S. (2000). limn and the extension functors Extn . In: Strong Shape and Homology. Springer Monographs in Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-13064-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-13064-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08546-8

  • Online ISBN: 978-3-662-13064-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics