Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 30, Number 2, April 2025
Page(s) 133 - 138
DOI https://doi.org/10.1051/wujns/2025302133
Published online 16 May 2025

© Wuhan University 2025

Licence Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

0 Introduction

A module MMathematical equation is called type FPMathematical equation if MMathematical equation has a projective resolution by finitely generated projective modules. This concept is a generalization of finitely generated modules and finitely presented modules, which is studied by Bravo et al[1]. Also a module NMathematical equation is called FPMathematical equation-injective or absolutely clean if ExtR1(M,N)=0Mathematical equation for all modules MMathematical equation of type FPMathematical equation, these modules have properties that injective modules only have over Noetherian rings. Specifically, if RMathematical equation is left Noetherian, the modules of type FPMathematical equation are precisely the finitely generated modules.

The category of complexes plays an important role in the theory of homological algebra, and many results of the category of modules have been generalized to the category of complexes. As we know, in the category of complexes, the relationship between complexes and its level modules and cycle modules is an important research topic. For example, a complex is injective if and only if it is exact and each cycle module is injective. A complex XMathematical equation is absolutely clean if and only if XMathematical equation is exact and each Znt(X)Mathematical equation is an absolutely clean module for each nMathematical equation and t=1,2,,NMathematical equation. A complex XMathematical equation is Gorenstein AC-injective if and only if XnMathematical equation is a Gorenstein AC-injective module and HomR(A,-)Mathematical equation is exact for any absolutely clean complex AMathematical equation[2].

The notion of N-complexes was introduced by Mayer in his study of simplicial complexes[3-4], that is, it satisfies differentials dN=0Mathematical equation. The category of N-complexes is consistent with the category of complexes whenever N=2Mathematical equation. In 1996, Kapranov[5], Dubois-Violette and Kerner[6] gave an abstract framework of homological theory of N-complexes. Since then, the N-complexes have been concerned by many authors, for example Refs.[7-11]. Recently, Lu[12] introduced the concept of FP-injective N-complexes, which has shown that an N-complex XMathematical equation is FP-injective if and only if XMathematical equation is N-exact and Znt(X)Mathematical equation is an FP-injective module for each nMathematical equation and t=1,2,,NMathematical equation.

In present paper, we establish relationships between the absolutely clean N-complex and its level modules and cycle modules. And from this, we prove that under certain hypotheses, an N-complex XMathematical equation is Gorenstein AC-injective if and only if Znt(X)Mathematical equation is a Gorenstein AC-injective module for each nMathematical equation and t=1,2,,NMathematical equation.

More precisely, our results can be stated as follows:

Theorem 1   Let X Mathematical equation be an N-complex. Then XMathematical equation is absolutely clean if and only if XMathematical equation is N-exact and Zni(X)Mathematical equation is an absolutely clean module for each nMathematical equation and i=1,2,,NMathematical equation.

As an application of Theorem 1, the following result is established.

Proposition 1   Let XMathematical equation be a bounded above N-complex. Then XMathematical equation is absolutely clean if and only if XMathematical equation is N-exact and XnMathematical equation is an absolutely clean module for nMathematical equation.

It is well known that an N-complex XMathematical equation is Gorenstein AC-injective if and only if XnMathematical equation is a Gorenstein AC-injective module and HomR(A,X)Mathematical equation is N-exact for any absolutely clean N-complex AMathematical equation[9]. As another application of Theorem 1, we also obtain the following result, which extends the above classical result to the Gorenstein AC-injective N-complexes.

Proposition 2   Let XMathematical equation be an N-exact N-complex with HomR(Dn1(M),X)Mathematical equationN-exact for any absolutely clean module MMathematical equation. Then XMathematical equation is a Gorenstein AC-injective N-complex if and only if Znt(X)Mathematical equation is a Gorenstein AC-injective module for each nMathematical equation and t=1, 2, , NMathematical equation.

1 Preliminaries

Throughout this paper, unless stated otherwise, RMathematical equation denotes an associative ring with an identity and by the term "module" we always mean a left RMathematical equation-module and use RMathematical equation-ModMathematical equation to denote the category of left RMathematical equation-modules.

This section is devoted to recalling some notions and basic consequences for use throughout this paper. For terminology we shall follow Refs. [7] and [10] when working with N-complexes.

By an N-complex X(N2)Mathematical equation we mean a sequence of left RMathematical equation-modules

d n + 2 X X n + 1 d n + 1 X X n d n X X n - 1 d n - 1 X Mathematical equation

satisfying dN=dn+1Xdn+2Xdn+NX=0Mathematical equation for any nMathematical equation. That is, composing any N-consecutive morphisms gives 0Mathematical equation. So a 2Mathematical equation-complex is a chain complex in the usual sense. A chain map or simply map f: XYMathematical equation of N-complexes is a collection of morphisms fn: XnYnMathematical equation making all the rectangles commute. In this way, we get a category of N-complexes of left RMathematical equation-modules, denoted by CN(R)Mathematical equation, whose objects are N-complexes and whose morphisms are chain maps. This is an abelian category having enough projectives and injectives. Let CMathematical equation and DMathematical equation be N-complexes. We use HomCN(R)(C,D)Mathematical equation to denote the Abelian group of morphisms from CMathematical equation and DMathematical equation and ExtCN(R)i(C,D)Mathematical equation for i0Mathematical equation to denote the groups we get from the right derived functor of HomMathematical equation.

For an N-complex XMathematical equation, there are N-1Mathematical equation choices for homology. Indeed for t=1,2,,NMathematical equation, we define Znt(X)=Ker(dn-(t-1)dn-1dn)Mathematical equation and Bnt(X)=Im(dn+1dn+2dn+t)Mathematical equation. In particular, we have Zn1(X)=KerdnMathematical equation,ZnN(X)=XnMathematical equation and Bn1(X)=Imdn+1Mathematical equation,BnN(X)=0Mathematical equation. Finally, we define Hnt(X)=Znt(X)/BnN-t(X)Mathematical equation the amplitude homology objects of XMathematical equation for all tMathematical equation. We say XMathematical equation is N-exact, or just exact, if Hnt(X)=0Mathematical equation for all nMathematical equation and tMathematical equation.

An N-complex XMathematical equation is called bounded, if there is only a finite number nMathematical equation such that Xn0Mathematical equation; if Xn=0Mathematical equation when nMathematical equation is sufficiently large, which is called bounded above. Similarly, we can define lower bounded N-complexes. As we know, an N-complex XMathematical equation is called finitely generated if XMathematical equation is bounded and XnMathematical equation is a finitely generated module for each nMathematical equation.

Unless stated otherwise, in the following complexes will always denote 2Mathematical equation-complexes. Given a module AMathematical equation, we define N-complexes Dnt(A)Mathematical equation for t=1,2,,NMathematical equation, as follows: Dnt(A)Mathematical equation consists of AMathematical equation in degrees n,n-1,,n-(t-1)Mathematical equation, all joined by identity morphisms, and 0Mathematical equation in every other degree. Let {Mn|n}Mathematical equation be objects of modules. Then (nDnN(Mn))k=(nDnN(Mn))k=Mk+N-1MkMathematical equation for all kMathematical equation. Therefore,

n D n N ( M n ) = n D n N ( M n ) . Mathematical equation

Two chain maps f, g: XYMathematical equation are called chain homotopic, or simply homotopic if there exists a collection of morphisms  {sn:XnYn+N-1}Mathematical equation such that

g n - f n = d N - 1 s n + d N - 2 s n - 1 d + + s n - ( N - 1 ) d N - 1 = i = 0 N - 1 d ( N - 1 ) - i s n - i d i ,   n . Mathematical equation(1)

If fMathematical equation and gMathematical equation are homotopic, then we write fgMathematical equation. We call a chain map fMathematical equation null homotopic if f0Mathematical equation. There exists an additive category KN(R)Mathematical equation, called the homotopy category of N-complexes, whose objects are the same as those of CN(R)Mathematical equation and whose HomMathematical equation sets are the equivalence classes of HomMathematical equation sets in CN(R)Mathematical equation. An isomorphism in KN(R)Mathematical equation is called a homotopy equivalence. Let  SN(R)Mathematical equation be the collection of sequences 0XYZ0Mathematical equation of morphisms in CN(R)Mathematical equation such that 0XiYiZi0Mathematical equation is split exact in KN(R)Mathematical equation for any integer iMathematical equation.

Following Ref.[8], let XCN(R)Mathematical equation, we have morphisms ρnXn+N-1:Dn+N-1N(Xn+N-1)XMathematical equation and λnXn:XDn+N-1N(Xn)Mathematical equation. Set ρX:nDn+N-1N(Xn+N-1)XMathematical equation and λX:XnDn+N-1NMathematical equation

( X n ) Mathematical equation. Then we have the following exact sequences in SN(R)Mathematical equation,

0 K e r ρ X ε X n D n N ( X n ) ρ X X 0 Mathematical equation(2)

and

0 X λ X n D n + N - 1 N ( X n ) η X C o k e r λ X 0 Mathematical equation(3)

Now we define functors ΣMathematical equation,Σ-1:CN(R)CN(R)Mathematical equation by Σ-1X=KerρXMathematical equation and ΣX=CokerλXMathematical equation in the exact sequences above. Then ΣMathematical equation and Σ-1Mathematical equation induce the suspension functor and its quasi-inverse of the triangulated category KN(R)Mathematical equation. On the other hand, we define the shift functor Θ:CN(R)CN(R)Mathematical equation by Θ(X)i=Xi+1Mathematical equation and diΘ(X)=di+1XMathematical equation for X=(Xi,diX)CN(R)Mathematical equation. The N-complex Θ(ΘX)Mathematical equation is denoted as Θ2XMathematical equation and inductively we define ΘnXMathematical equation for all nMathematical equation. This induces the shift functor Θ:KN(R)KN(R)Mathematical equation which is a triangle functor. Unlike classical case, ΣMathematical equation does not coincide with ΘMathematical equation.

Following Refs. [8] or [10], for any N-complex XMathematical equation, ΣXMathematical equation and Σ-1XMathematical equation are given by the following explicit description,

( Σ X ) n = X n - 1 X n - 2 X n - ( N - 1 ) , d n Σ X = ( - d   1 0 0 0 0 - d 2 0 1 0 0 0      - d N - 3 0 0 0 1 0 - d N - 2 0 0 0 0 1 - d N - 1 0 0 0 0 0 ) , Mathematical equation

( Σ - 1 X ) n = X n + N - 1 X n + 2 X n + 1 , d n Σ - 1 X = ( 0     1      0       0    0    0   0     0      1       0    0    0                            0     0      0       0    1    0   0     0      0       0    0    1   - d N - 1 - d N - 2 - d N - 3 - d 3 - d 2 - d ) . Mathematical equation

2 Main Results

In this section, we investigate the concept of absolutely clean N-complexes and give some equivalence characterizations of absolutely clean N-complexes. In particular, we prove that an N-complex XMathematical equation is absolutely clean if and only if XMathematical equation is N-exact and Zni(X)Mathematical equation is an absolutely clean module for each nMathematical equation and i=1,2,,NMathematical equation.

Definition 1   An N-complex CMathematical equation is of type FPMathematical equation if CMathematical equation has a projective resolution P2P1P0C0Mathematical equation by finitely generated projective N-complexes PiMathematical equation for i0Mathematical equation.

Proposition 3   An N-complex CMathematical equation is of type FPMathematical equation if and only if it is bounded and each CnMathematical equation is a module of type FPMathematical equation.

Proof   Sufficiency. Let CMathematical equation be of type FPMathematical equation. Then it must be finitely generated, so it is bounded. We also see that each N-complex PiMathematical equation must consist of finitely generated projective modules in each degree by the definition of N-complex of type FPMathematical equation. So we get that each CnMathematical equation is a module of type FPMathematical equation.

Necessity. Suppose CMathematical equation is bounded and each CnMathematical equation is a module of type FPMathematical equation, we can construct a surjection P0fCMathematical equation where P0Mathematical equation is a finitely generated projective N-complex. Set K0=KerfMathematical equation and note that it also must be bounded. Since each CnMathematical equation must also be finitely presented, it follows that each KnMathematical equation is finitely generated. Thus K0Mathematical equation is finitely generated, and we can again construct a surjection P1f1K0Mathematical equation where P1Mathematical equation is a finitely generated projective N-complex. Set K1=Kerf1Mathematical equation and note that K1Mathematical equation must be bounded. Since each CnMathematical equation must be of type FPMathematical equation, it follows that K1Mathematical equation must also be finitely generated N-complex. Continuing this way, we can construct a projective resolution

P 2 P 1 P 0 C 0 Mathematical equation(4)

where each PiMathematical equation is a finitely generated projective N-complex.

Remark 1   1) If MMathematical equation is a module of type FPMathematical equation, then Dnt(M)Mathematical equation is an N-complex of type FPMathematical equation for each nMathematical equation and t=1,2,,NMathematical equation.

2) An N-complex of type FPMathematical equation is finitely generated.

Definition 2   An N-complex XMathematical equation is said to be absolutely clean if ExtCN(R)1(P,X)=0Mathematical equation for all N-complexes PMathematical equation of type FPMathematical equation.

Remark 2   1) If N=2Mathematical equation, then absolutely clean N-complexes are precisely absolutely clean complex.

2) The class of absolutely clean N-complexes is closed under direct products, summands and direct limits.

3) ΘnCMathematical equation is absolutely clean for any absolutely clean N-complex C Mathematical equation and nMathematical equation.

4) The class of absolutely clean N-complexes is coresolving. For any absolutely clean N-complex XMathematical equation and FMathematical equation of type FPMathematical equation, we have ExtCN(R)n(F,X)=0Mathematical equation for all n>0Mathematical equation.

5) The class of absolutely clean N-complexes is closed under clean N-subcomplexes and clean quotients.

It is well known that an N-complex XMathematical equation is injective if and only if XMathematical equation is N-exact and Zni(X)Mathematical equation is an injective module for each nMathematical equation and i=1,2,,NMathematical equation. In the following, we will generalize this characterization to the absolutely clean N-complexes. Firstly, we need to make the following preparations.

Lemma 1   An N-complex XMathematical equation is absolutely clean if and only if ExtCN(R)1(Dnt(Q),X)=0Mathematical equation for all modules QMathematical equation of type FPMathematical equation and nMathematical equation and t=1,2,,NMathematical equation.

Proof   Sufficiency. It is trivial.

Necessity. Without losing generality, we take PMathematical equation has the following form:

P = 0 P n d n P n - 1 d n - 1 P 0 0 Mathematical equation(5)

with each PiMathematical equation a module of type FPMathematical equation for 0inMathematical equation.

For any 0knMathematical equation, we put

P ( k ) = 0 P k d k P k - 1 d k - 1 P 0 0 Mathematical equation(6)

Then P=P(n)Mathematical equation. In the following, we prove the result by using induction on kMathematical equation. For k=0Mathematical equation, by the assumption,ExtCN(R)1(P(0),X)=0Mathematical equation. Assume that ExtCN(R)1(P(n-1),X)=0Mathematical equation. Applying the functor HomCN(R)(-,X)Mathematical equation to the exact sequence

0 P ( n - 1 ) P ( n ) D n 1 ( P n ) 0 Mathematical equation(7)

yields the following exact sequence

0 = E x t C N ( R ) 1 ( D n 1 ( P n ) , X ) E x t C N ( R ) 1 ( P ( n ) , X ) E x t C N ( R ) 1 ( P ( n - 1 ) , X ) = 0 . Mathematical equation(8)

Then ExtCN(R)1(P(n),X)Mathematical equation, as desired.

Lemma 2[11] Let MRMathematical equation-ModMathematical equation, X,YCN(R)Mathematical equation and nMathematical equation,i=1,2,,NMathematical equation. Then we have the following natural isomorphisms:

1) HomCN(R)(DnN(M),Y)HomR(M,Yn)Mathematical equation.

2) HomCN(R)(X,Dn+N-1N(M))HomR(Xn,M)Mathematical equation.

3) HomCN(R)(Dni(M),Y)HomR(M,Zni(Y))Mathematical equation.

4) HomCN(R)(X,Dni(M))HomR(Xn-(i-1)/Bn-(i-1)i(X),M)Mathematical equation.

5) ExtCN(R)1(DnN(M),Y)ExtR1(M,Yn)Mathematical equation.

6) ExtCN(R)1(X,Dn+N-1N(M))ExtR1(Xn,M)Mathematical equation.

7) If YMathematical equation is N-exact, then ExtCN(R)1(Dni(M),Y)Mathematical equationExtR1(M,Zni(Y))Mathematical equation.

8) If XMathematical equation is N-exact, then ExtCN(R)1(X,Dni(M))Mathematical equationExtR1(Xn-(i-1)/Bn-(i-1)i(X),M)Mathematical equation.

Following Ref. [5], let CMathematical equation and DMathematical equation be N-complexes of left RMathematical equation-modules. We will denote by HomR(C,D)Mathematical equation the sequence of Abelian groups with HomR(C,D)n=ΠtHomR(Ct,Dn+t)Mathematical equation and such that if fHomR(C,D)nMathematical equation then (dn(f))m=dn+mDfm-(q)nfm-1dmCMathematical equation, where qMathematical equation is a N-th root of unity, qN=1Mathematical equation and q1Mathematical equation. Then HomR(C,D)Mathematical equation is also an N-complex. fMathematical equation is called a chain map of degree nMathematical equation if dn(f)=0Mathematical equation. A chain map of degree 0Mathematical equation is called a morphism.

Lemma 3[13] Let CMathematical equation and DMathematical equation be N-complexes. Then Hn1HomR(C,D)HomKN(R)(C,Θ-nD)Mathematical equation. In particular, HomRMathematical equation

( C , D ) Mathematical equation is N-exact if and only if HomKN(R)(C,D)=0Mathematical equation, i.e.,HntHomR(C,D)=0Mathematical equation is equivalent to HomKN(R)(C,Θ-nD)=0Mathematical equation for nMathematical equation and t=1,2,,NMathematical equation.

Proof  of Theorem 1

Sufficiency. Let XMathematical equation be an absolutely clean N-complex. Then ExtCN(R)1(ΣDni(P),Θ-nX)=0Mathematical equation for any module PMathematical equation of type FPMathematical equation, nMathematical equation and i=1,2,,NMathematical equation. This implies that N-complex HomR(Dni(P),X)Mathematical equation is N-exact[13]. Note that PMathematical equation is of type FPMathematical equation. It follows that XMathematical equation must be an N-exact N-complex. Also, ExtCN(R)1(Dni(P),X)=0Mathematical equation for all modules PMathematical equation of type FPMathematical equation, nMathematical equation and i=1,2,,NMathematical equation. Using Lemma 2, we get Zni(X)Mathematical equation is an absolutely clean module for nMathematical equation and i=1,2,,NMathematical equation.

Necessity. It follows by Lemma 1 and Lemma 2.

Then the following result can be obtained by Theorem 1.

Corollary 1   If an N-complex XMathematical equation is absolutely clean, then Zni(X)Mathematical equation is an absolutely clean module for each nMathematical equation and i=1,2,,NMathematical equation. Moreover,XnMathematical equation is an absolutely clean module for each nMathematical equation.

Corollary 2   A module MMathematical equation is absolutely clean if and only if the N-complex Dnt(M)Mathematical equation is absolutely clean for each nMathematical equation and t=1,2,,NMathematical equation.

In the following, we obtain a result for bounded above N-complex XMathematical equation.

Proof  of Proposition 1

Sufficiency. Obviously, XMathematical equation is N-exact and XnMathematical equation is an absolutely clean module for nMathematical equation by Theorem 1 and Corollary 1.

Necessity. Assume that XMathematical equation has the following form:

0 X 0 d 0 X - 1 d - 1 X - 2 d - 2 X - 3 Mathematical equation(9)

Since XMathematical equation is N-exact,

K e r ( d 0 ) = K e r ( d - 1 d 0 ) = = K e r ( d - N + 2 d 0 ) = 0 Mathematical equation(10)

This implies that Z0i(X)=0Mathematical equation for -N+1i-1Mathematical equation and Z0-N(X)=X0Mathematical equation. Also we have

K e r ( d - 1 ) = K e r ( d - 2 d - 1 ) = = K e r ( d - N + 2 d - 1 ) = 0 Mathematical equation(11)

Then Z-1i(X)=0 for -N+2i-1 and Z-1-N+1(X)X0, Z-1-N(X)X-1.Mathematical equation

Similarly, Z-2i(X)=0Mathematical equation for -N+3i-1Mathematical equation and

Z - 2 - N + 2 ( X ) X 0 , Z - 2 - N + 1 ( X ) X - 1 , Z - 2 - N ( X ) X - 2 Mathematical equation

Mathematical equation

          Z - N + 1 - 1 ( X ) X 0 , Z - N + 1 - 2 ( X ) X - 1 , , Z - N + 1 - N + 1 ( X ) X - N + 2 , Z - N + 1 - N ( X ) X - N + 1 . Mathematical equation(12)

Then Zti(X)Mathematical equation is absolutely clean for -N+1t0Mathematical equation, i=-1,,-NMathematical equation.

Note that

0 X 0 d 0 X - 1 B - N - N + 1 ( X ) 0 Mathematical equation

0 X 0 d - 1 d 0 X - 2 B - N - N + 2 ( X ) 0 Mathematical equation

Mathematical equation

0 X 0 d - N + 3 d - 1 d 0 X - N + 2 B - N - 2 ( X ) 0 Mathematical equation

0 X 0 d - N + 2 d - 1 d 0 X - N + 1 B - N - 1 ( X ) 0 Mathematical equation(13)

are exact. This implies that Z-Ni(X)Mathematical equation is absolutely clean for i=-1,,-NMathematical equation.

Using exact sequences

0 Z - N - 1 ( X ) X - N Z - N - 1 - N + 1 ( X ) 0 Mathematical equation

0 Z - N - 2 ( X ) X - N Z - N - 1 - N + 2 ( X ) 0 Mathematical equation

Mathematical equation

0 Z - N - N + 2 ( X ) X - N Z - N - 1 - 2 ( X ) 0 Mathematical equation

0 Z - N - N + 1 ( X ) X - N Z - N - 1 - 1 ( X ) 0 Mathematical equation(14)

we can obtain Z-N-1i(X)Mathematical equation is absolutely clean for i=-1,,-NMathematical equation.

We also obtain Zti(X)Mathematical equation is absolutely clean for t-N-2Mathematical equation,i=-1,,-NMathematical equation, by a similar method. Thus XMathematical equation is absolutely clean by Theorem 1.

As we know, absolutely clean N-complex is important for the characterization of Gorenstein AC-injective N-complexes. An N-complex XMathematical equation is Gorenstein AC-injective if and only if XnMathematical equation is a Gorenstein AC-injective module and HomR(A,X)Mathematical equation is N-exact for any absolutely clean N-complex AMathematical equation[9]. Next we obtain an equivalent characterization for N-exact absolutely clean N-complex in Gorenstein AC-injective N-complexes.

Proof  of Proposition 2

Sufficiency. From the definition of the Gorenstein AC-injective N-complexes[8], there is an exact sequence of injective N-complexes

I = I 1 f 1 I 0 f 0 I - 1 f - 1 Mathematical equation(15)

with X=Ker(f0)Mathematical equation and which remains exact after applying HomCN(R)(A,-)Mathematical equation for any absolutely clean N-complex AMathematical equation. Since Ker(f0)=XMathematical equation and IiMathematical equation are N-exact, we have Ker(fi)Mathematical equation is N-exact for all iMathematical equation.

For the exact sequence

0 K e r ( f 1 ) I 1 X 0 Mathematical equation(16)

according to Ref. [14] we have the following exact sequence

0 Z n t ( K e r ( f 1 ) ) Z n t ( I 1 ) Z n t ( X ) 0 Mathematical equation(17)

Thus there is an exact sequence of injective modules

Z n t ( I 1 ) Z n t ( I 0 ) Z n t ( I - 1 ) Mathematical equation(18)

with Znt(X)Ker(Znt(I0)Znt(I-1))Mathematical equation. Next we only show that HomR(M,-)Mathematical equation applying the sequence (18) exact for any absolutely clean module MMathematical equation.

Let MMathematical equation be an absolutely clean module and g:MZnt(X)Mathematical equation be a morphism of modules. Since HomR(Dn1(M),X)Mathematical equation is N-exact, there exists a morphism f:MXn+N-tMathematical equation such that the following diagram commute (Fig. 1).

Thumbnail: Fig. 1 Refer to the following caption and surrounding text. Fig. 1 The commutative diagram of pf=gMathematical equation

Note   that IMathematical equation is HomCN(R)(Dnt(M),-)Mathematical equation exact since Dnt(M)Mathematical equation is an absolutely clean N-complex by Corollary 2. Thus, it follows the exact sequence (16), there is an exact sequence

       0 H o m C N ( R ) ( D n t ( M ) , K e r ( f 1 ) ) H o m C N ( R ) ( D n t ( M ) , I 1 ) H o m C N ( R ) ( D n t ( M ) , X ) 0 Mathematical equation(19)

It follows from Lemma 2

       0 H o m R ( M , Z n t ( K e r ( f 1 ) ) ) H o m R ( M , Z n t ( I 1 ) ) H o m R ( M , Z n t ( X ) ) 0 Mathematical equation(20)

is exact. Similarly, we can prove that

       0 H o m R ( M , Z n t ( K e r ( f i ) ) ) H o m R ( M , Z n t ( I i ) ) H o m R ( M , Z n t ( K e r ( f i - 1 ) ) ) 0 Mathematical equation(21)

is exact. Hence, HomR(M,-)Mathematical equation applying the sequence (18) exact.

Necessity. Note that there is an exact sequence

0 Z n + N - t N - t ( X ) X n Z n t ( X ) 0 Mathematical equation(22)

and Zn+N-tN-t(X)Mathematical equation and Znt(X)Mathematical equation are Gorenstein AC-injective modules, this implies XnMathematical equation is a Gorenstein AC-injective module for each nMathematical equation. Next we need to prove that HomR(M,X)Mathematical equation is N-exact for any absolutely clean N-complex MMathematical equation. The proof is similar to Theorem 3.2 in Ref. [2]. Thus XMathematical equation is a Gorenstein AC-injective N-complex.

References

  1. Bravo D, Gillespie J, Hovey M. The stable module category of a general ring[EB/OL]. [2014-06-25]. https://arxiv.org/abs/q-alg/1405.5768. [Google Scholar]
  2. Bravo D, Gillespie J. Absolutely clean, level, and Gorenstein AC-injective complexes[J]. Communications in Algebra, 2016, 44(5): 2213-2233. [Google Scholar]
  3. Mayer W. A new homology theory I[J]. Annals of Mathematics, 1942, 43(2): 370-380. [Google Scholar]
  4. Mayer W. A new homology theory II[J]. Annals of Mathematics, 1942, 43(3): 594-605. [Google Scholar]
  5. Kapranov M M. On the q-analog of homological algebra[EB/OL]. [1996-11-04]. https://arxiv.org/abs/q-alg/9611005. [Google Scholar]
  6. Dubois-Violette M, Kerner R. Universal q-dierential calculus and q-analog of homological algebra[EB/OL]. [1996-08-30]. https://arxiv.org/abs/q-alg/9608026. [Google Scholar]
  7. Gillespie J. The homotopy category of N-complexes is a homotopy category[J]. Journal of Homotopy and Related Structures, 2015, 10(1): 93-106. [Google Scholar]
  8. Iyama O, Kato K, Miyachi J I. Derived categories of N-complexes[J]. Journal of the London Mathematical Society, 2017, 96(3): 687-716. [Google Scholar]
  9. Lu B. Gorenstein objects in the category of N-complexes[J]. Journal of Algebra and Its Applications, 2021, 20(10): 2150174. [CrossRef] [Google Scholar]
  10. Yang X Y, Ding N Q. The homotopy category and derived category of N-complexes[J]. Journal of Algebra, 2015, 426: 430-476. [Google Scholar]
  11. Yang X Y, Gao T Y. Cotorsion pairs in Formula [J]. Algebra Colloquium, 2017, 24(4): 577-602. [Google Scholar]
  12. Lu B. FP-injective objective in the category of N-complexes[J]. Indian Journal of Pure and Applied Mathematics, 2024, 55(1): 242-255. [Google Scholar]
  13. Lu B, Di Z X. Gorenstein cohomology of N-complexes[J]. Journal of Algebra and Its Applications, 2020, 19(9): 2050174. [Google Scholar]
  14. Lu B. Cartan-Eilenberg Gorenstein projective N-complexes[J]. Communications in Algebra, 2021, 49(9): 3810-3824. [Google Scholar]

All Figures

Thumbnail: Fig. 1 Refer to the following caption and surrounding text. Fig. 1 The commutative diagram of pf=gMathematical equation

Note   that IMathematical equation is HomCN(R)(Dnt(M),-)Mathematical equation exact since Dnt(M)Mathematical equation is an absolutely clean N-complex by Corollary 2. Thus, it follows the exact sequence (16), there is an exact sequence

In the text

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.