A Brown representability theorem via coherent functors (Q1601666)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1761016
Language Label Description Also known as
default for all languages
No label defined
    English
    A Brown representability theorem via coherent functors
    scientific article; zbMATH DE number 1761016

      Statements

      A Brown representability theorem via coherent functors (English)
      0 references
      0 references
      0 references
      27 June 2002
      0 references
      This paper concerns Brown representability theorems for triangulated categories with arbitrary coproducts. The author proves a theorem of this type for contravariant functors, on the assumption that there is a set of objects satisfying two simple conditions. A set of this type is called a set of perfect generators. The proof is by coherent functors and an analogue of iterated cell attachment. Examples arise from triangulated categories with small sets of generators, and from the well-generated triangulated categories of \textit{A. Neeman} [``Triangulated categories'', Ann. Math. Stud. 148 (2001; Zbl 0974.18008)]. There is a simple dualisation giving a Brown representability theorem for covariant functors. There is also a connection with the Brown representability theorem of \textit{J. Franke} [Topology 40, No. 4, 667-680 (2001; Zbl 1006.18012)], which is based on solution sets and Freyd's adjoint functor theorem. Indeed, in certain cases, the hypothesis of Franke's theorem can be got from a set of perfect generators via a filtration. This applies to well-generated categories, in particular.
      0 references
      Brown representability
      0 references
      triangulated category
      0 references
      coherent functor
      0 references
      perfect generator
      0 references
      iterated cell attachment
      0 references
      dualisation
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references