On the Auslander-Bridger type approximation of modules Tokuji Araya (Tokuyama college of technology) Kei-ichiro Iima (Nara national college of technology)

Throughout this article, let R be a commutative noetherian complete local ring with maximal ideal m and residue field k. All modules considered in this article are assumed to be finitely generated. An R-module C is said to be semidualizing if the natural homomorphism R → HomR (C, C) is an isomorphism and ExtiR (C, C) = 0 for all i > 0. Various homological dimensions with respect to a fixed semidualizing module C such as C-projective dimension are invented and investigated. Here the C-projective dimension of a nonzero R-module M , denoted by C-proj.dimR M , is defined as the infimum of integers n such that there is an exact sequence of the form 0 → C bn → C bn−1 → · · · → C b1 → C b0 → M → 0, where each bi is a positive integer. We denote by mod(R) the category of finitely generated R-modules, by TnC the full subcategory of mod(R) consisting of all modules X such that C TorR i (X, C) = 0 for any 1 ≤ i ≤ n, by Cn the full subcategory of mod(R) consisting of all ∼ modules X such that X = Y ⊗R C for some module Y ∈ TnC . A free module of rank one is a typical example of a semidualizing module. Let M be an R-module. Let ∂



n · · · → Fn → Fn−1 → · · · → F1 →1 F0 → M → 0

be a minimal free resolution of M . We define the C-transpose of M to be the cokernel of the map Hom(∂1 , C) : Hom(F0 , C) → Hom(F1 , C), and denote it by TrC M . We say that M is n-C-torsionfree if the R-modules ExtiR (TrC M, C) equal to zero for all 1 ≤ i ≤ n. If an R-module M belongs to CnC , then there exists an exact sequence ∂n+1







n C bn+1 → C bn → C bn−1 → · · · → C b1 →1 C b0 →0 M → 0.

We define the C-transpose prime of M to be the cokernel of the map Hom(∂1 , C) : Hom(C b0 , C) → Hom(C b1 , C), and denote it by Tr0(C,∂1 ) M . And we define the i-C-syzygy of M to be the image of the map ∂i : C bi → C bi−1 , and denote it by Ωi(C,∂· ) M for each 0 ≤ i ≤ n + 1. The following two theorems is well-known as Auslander-Bridger approximation theorem and Cohen-Macaulay approximation theorem.

Theorem 1 ([1]) The following are equivalent for a finitely generated R-module M : (1) ΩnR M is n-torsionf ree. (2) There exists an exact sequence 0 → Y → X → M → 0 of R-modules such that proj.dimR Y < n, ExtiR (X, R) = 0 (1 ≤ i ≤ n) and X is isomorphic to TrR ΩnR TrR ΩnR M . Theorem 2 ([2]) Let R be a Cohen-Macaulay local ring with the canonical module. Then, for every finitely generated R-module M , there exists an exact sequence 0 → Y → X → M → 0 of R-modules such that inj.dimR Y < n and X is a maximal Cohen-Macaulay R-module. Takahashi unifies above two approximation theorems using a semidualizing R-module. The approximation theorem of Takahashi is stated as follows. Theorem 3 ([5]) Let M and C be finitely generated R-modules. Assume that C is semidualizing. Then the following conditions on M are equivalent: (1) ΩnR M is n-C-torsionf ree. (2) There exists an exact sequence 0 → Y → X → M → 0 of R-modules such that i C-proj.dimR Y < n and ExtR (X, C) = 0 (1 ≤ i ≤ n). Our purpose is to give a middle term of the sequence in Theorem 3 explicitly. To prove our theorem, we establish the following lemma. Lemma 4 Let M and C be finitely generated R-modules. Assume that C is semidualizing, M belongs to C0C and ExtiR (Tr0C M, C) = 0 for 1 ≤ i ≤ n, then M is n-C-torsionf ree. The main result in this article is the following theorem. Theorem 5 Let M be an R-module and let n ≥ 0. If M belongs to CnC and ExtiR (Tr0C ΩnC M, C) = 0 for 1 ≤ i ≤ n, then there exists an exact sequence 0 → T → TrC ΩnR Tr0C ΩnC M → M → 0 of R-modules with C-proj.dimR T < n. We obtain another approximation theorem is the following. Theorem 6 Let M be an R-module and let n ≥ 0. If TrR ΩnR M belongs to TnC and ΩnR M is n-C-torsionfree, then there exists an exact sequence 0 → T → Tr0C ΩnC TrC ΩnR M → M → 0 of R-modules with proj.dimR T < n.

References [1] M. Auslander; M. Bridger, Stable module theory, Memoirs of the American Mathematical Society, No. 94, American Mathematical Society, Providence, R.I., 1969. [2] M. Auslander; R. -O. Buchweitz, The homological theory of maximal CohenMacaulay approximations. (French summary) M´em. Soc. Math. France (N.S.) No. 38 (1989), 5–37. [3] Osamu Iyama, Higher-dimensional Auslander-Reiten theory on maximal orthogonal subcategories, Advances in Mathematics 210 (2007), 22–50. [4] Ryo Takahashi, Syzygy modules with semidualizing or G-projective summands, Journal of Algebra 295 (2006), 179–194. [5] Ryo Takahashi, A new approximation theory which unifies spherical and CohenMacaulay approximations, Journal of Pure and Applied Algebra 208 (2007), 617– 634.

On the Auslander-Bridger type approximation of modules

where each bi is a positive integer. We denote by mod(R) the category of finitely generated. R-modules, by T C n the full subcategory of mod(R) consisting of all ...

82KB Sizes 1 Downloads 286 Views

Recommend Documents

On the Impact of Kernel Approximation on ... - Research at Google
termine the degree of approximation that can be tolerated in the estimation of the kernel matrix. Our analysis is general and applies to arbitrary approximations of ...

On the Impact of Kernel Approximation on Learning ... - CiteSeerX
The size of modern day learning problems found in com- puter vision, natural ... tion 2 introduces the problem of kernel stability and gives a kernel stability ...

On Approximation Resistance of Predicates
Permuting the underlying k variables by a permutation π. (ζπ)i = ζπ(i). (ζπ)ij = ζπ(i)π(j). - Multiplying each variable xi by a sign bi ∈ {−1, 1}. (ζb)i = bi · ζi. (ζb)ij = bi ...

A Note on the Power of Truthful Approximation ...
Aug 26, 2009 - Email: [email protected]. 1 ... The private information of each bidder is vi (notice that the ki's are private information too). We will assume that the ... Of course, we can also implement a weighted versions of VCG: Definition ..

A vector similarity measure for linguistic approximation: Interval type-2 ...
interval type-2 fuzzy sets (IT2 FSs), the CWW engine's output can also be an IT2 FS, eA, which .... similarity, inclusion, proximity, and the degree of matching.''.

on the type-1 optimality of nearly balanced ... - Semantic Scholar
(RGD), to which they reduce when bk/v is an integer. If d is an RGD and ...... algebra is involved in checking the conditions of Theorem 3.4. The main ..... a simple exercise to write a computer routine to check the conditions (4) and. (5) for each .

Model Approximation for Learning on Streams of ...
cause ϵ is a user-defined parameter. The frequency of an item f in a bucket Bi is represented as Ff,i, the overall frequency of f is Ff = ∑i Ff,i. The algorithm makes.

On the Continuity of Type-1 and Interval Type-2 Fuzzy ...
modeling and control). Index Terms—Continuity, discontinuity, fuzzy logic modeling and control, hybrid and switched systems, interval type-2 fuzzy logic systems (FLSs), monotonicity, smoothness. I. INTRODUCTION. MODELING and control is the most wid

on the type-1 optimality of nearly balanced ... - Semantic Scholar
bound for the minimum eigenvalue zd1 is derived. These results are used in. Section 3 to derive sufficient conditions for type-1 optimality of NBBD(2)'s in. D(v, b ...

On the validity of the Boussinesq approximation for the ...
by V oss and S ou z a [ 20 ] , among others. H ere the density di ff ..... intersection of two branches does not mean two solutions coincide , since. L ( x l ) = L ( ~ l ) ...

numerical approximation of the boundary control for the ...
Oct 11, 2006 - a uniform time T > 0 for the control of all solutions is required. This time T depends on the size of the domain and the velocity of propagation of waves. In general, any semi-discrete dynamics generates spurious high-frequency oscilla

Approximation of the solution of certain nonlinear ODEs ...
polynomial system solving, condition number, complexity. 2000 MSC: 65H10 ... in [0,l],. (1). Email address: [email protected] (Ezequiel Dratman) .... the comparison between the stationary solutions of (2) and (4). In the second part of the ...

Efficient approximation of the solution of certain ...
May 24, 2011 - ing an ε-approximation of such a solution by means of a homotopy contin- .... the point of view of its solution by the so-called robust universal ...

Approximation of the Invariant Probability Measure of ...
Sep 14, 2007 - Since Pg E 9+the last summand tends to zero as k*~. Therefore we ... which is not a consequence of (ii)' and lim sup,,, Pmgmd Pg. Of course.

the cones of hilbert functions of squarefree modules c. bertone
For squarefree modules generated in degree zero, we compare ... The second author is grateful to the support from the graduate school ”Combinatorial ...

the cones of hilbert functions of squarefree modules ... - Le Matematiche
commutative in the sense that ab = (−1)degadegbba for homogeneous elements ... a,b ∈ Λ and a2 = 0 if a is homogeneous of odd degree. Λ has the same ...

EFFICIENT APPROXIMATION OF THE SOLUTION OF ...
an ε-approximation of such a solution by means of a homotopy continuation .... view of its solution by the so-called robust universal algorithms (cf. [26], [8], [16]).

boussinesq systems of bona-smith type on plane ...
Mar 18, 2010 - time step we used the Jacobi-Conjugate Gradient method of ITPACK, taking the relative residuals equal to 10−7 for terminating the iterations at ...

ARNOLD-TYPE INVARIANTS OF CURVES ON ...
surface F. Thus, we get that m{QSTF, A) is isomorphic to Z(X) < m{STF,X{a)). From the proof of the Hansen Proposition it follows that the isomorphism is induced.

Serviceable Reactive Programming on Vulnerable Data Type
Abstract. Serviceable Reactive Programming (SRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. SRP is based on the synchronous data-flow paradigm and supports both continuous time a

Information on Vitogate 200 type EIB - Groups
Service. Group. Data point read/write Data p.length¹ min. value2 max. value2 VS-Adress1. Operation HC1. Operating data HC1. Operating data write. 1-Byte. 0.

On Approximation Algorithms for Data Mining ... - Semantic Scholar
Jun 3, 2004 - problems where distance computations and comparisons are needed. In high ..... Discover the geographic distribution of cell phone traffic at.

Capabilities of the Discrete Dipole Approximation for ...
solution of the system of 3Nd complex linear equations, where. Nd is the number of .... [9] M. A. Yurkin, V. P. Maltsev, and A. G. Hoekstra, “The discrete dipole.