\(n\)-cotorsion pairs (Q2223355)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    \(n\)-cotorsion pairs
    scientific article

      Statements

      \(n\)-cotorsion pairs (English)
      0 references
      0 references
      0 references
      0 references
      28 January 2021
      0 references
      Let \(n\) be a positive integer, and let \(\mathcal{A}\) and \(\mathcal{B}\) be classes of objects of an abelian category \(\mathcal{C}\). The pair \((\mathcal{A},\mathcal{B})\) is called a left (resp. right) \(n\)-cotorsion pair in \(\mathcal{C}\) if \(\mathcal{A}\) (resp. \(\mathcal{B}\)) is closed under direct summands, \(\mathrm{Ext}^{i}_{\mathcal{C}}(\mathcal{A},\mathcal{B})=0\) for every \(1\leq i\leq n\), and every object \(C\) of \(\mathcal{C}\) is a homomorphic image (resp. subobject) of an object \(A\in \mathcal{A}\) (resp. \(B\in \mathcal{B}\)) with kernel (resp. cokernel) having the \(\mathcal{B}\)-resolution (the \(\mathcal{A}\)-coresolution) dimension at most \(n-1\). An \(n\)-cotorsion pair is defined as a left and right \(n\)-cotorsion pair. These notions generalize complete cotorsion pairs, and they are thoroughly investigated in the present paper. The authors study approximations from \(n\)-cotorsion pairs and hereditary pairs in higher cotorsion. They illustrate and delimit the theory in a substantial section of applications and examples, including applications to Gorenstein projective modules, Ding projective modules, Gorenstein flat modules, Cluster tilting subcategories and higher cotorsion for chain complexes.
      0 references
      \(n\)-cotorsion pairs
      0 references
      unique mapping property
      0 references
      Gorenstein modules
      0 references
      cluster tilting subcategories
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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