Periodic modules and acyclic complexes (Q2198612)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Periodic modules and acyclic complexes
    scientific article

      Statements

      Periodic modules and acyclic complexes (English)
      0 references
      0 references
      0 references
      0 references
      10 September 2020
      0 references
      Let \(\mathcal{C}\) be a class of modules. The authors study \(\mathcal{C}\)-periodic and pure \(\mathcal{C}\)-periodic modules. More especifically, in section 3, they prove, in Theorem 1.1, a generalization of the results of \textit{D. J. Benson} and \textit{K. R. Goodearl} [Pac. J. Math. 196, No. 1, 45--67 (2000; Zbl 1073.20500)] (each pure \(Proj\)-periodic module is trivial) and \textit{D. Simson} [Pac. J. Math. 207, No. 1, 235--256 (2002; Zbl 1056.16004)] (each pure \(PProj\)-periodic module is trivial). They also find \(Proj\)-periodic modules that are not pure projective, and \(Flat\)-periodic modules that are not trivial. In section 4, dualizing they obtain that each pure \(PInj\)-periodic module is trivial. In section 5, they state several applications to prove facts on the category of unbounded chain complexes more easily as a direct consequence of properties of periodic modules. Some of these results were previously proved by \textit{J. Stovícek} [``On purity and applications to coderived and singularity categories'', Preprint, \url{arXiv:1412.1615}] and Simson [loc. cit.]. Also, they give some applications to finitely accessible additive categories.
      0 references
      periodic \(\mathcal{C}\)-module
      0 references
      pure \(\mathcal{C}\)-periodic module
      0 references
      locally split short exact sequence
      0 references
      hereditary cotorsion pair
      0 references
      acyclic complex
      0 references

      Identifiers

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