CC BY
8
УДК 517.9
The Tensor Product and Quasiorder of an Algebra Related to Cohen-Macaulay Rings
Ali Molkhasi*
Department of Mathematics University of Tabriz Tabriz
Iran
Received 01.10.2014, received in revised form 10.11.2014, accepted 10.12.2014 This paper shows how the tensor products of the distributive lattices and the finite solvable groups can used to WB-height-unmixed of the method of Stanley and Reisner.
Keywords: quasiorder, polytopes, order complex, tensor product, distributive lattice.
Introduction
N. Funayama and T. Nakayama proves that congruence relations on an arbitrary lattice have an interesting connection with distributive lattices. For terminology and basic results of lattice theory and universal algebra see [3, 8], and [9]. By using distributive lattice and Stanley-Reisner theory, we formulate new characterizations of Cohen-Macaulay ring. Recall that the local ring R is Cohen-Macaulay when so is R as an R-module. A Noetherian ring (which may not be local) R is said to be Cohen-Macaulay when its localization at any maximal ideal is Cohen-Macaulay local. In this paper relationships among quasiorder of an algebra, Cohen-Macaulay rings, the order complex of the lattice of all subgroups of a finite group and polytopes are considered. We denote the set of all quasiorders of an algebra A = (A,F), the set of all almost principal ideals of the lattice distributive L, the set of all almost principal filters of the lattice distributive L, and the lattice of all congruence relations of lattice L by Quord(A), I(L), F(L), and Con(L), respectively. Notice that Rd is the d-dimensional Euclidean space, S C Rd is a polytope and K is a ring, and E = K[S]. In section 1, it is proved that if A is an algebra with a majority term function, then rings E[Quord(A)][Xi, X2,...] and E[F(I(L))][Xi, X2, ...] are WB-height-unmixed. Also, if A is an algebra in any n-permutable variety, then E[Con(A)][X1, X2, ...] is WB-height-unmixed. Finally in section 2, it is shown that if G is a finite solvable group and K is the order complex of L(G), the set of all subgroups of G, then K[X1, X2,...] is WB-height-unmixed. Finally, it is prove that if C and B are distributive lattices, then E[C®B][X1, X2, ...] is WB-height-unmixed.
1. Quasiorder of an algebra and the polytopes
In this section relationship among quasiorder of an Algebra, the Cohen-Macaulay ring, and the polytopes are considered. Let we start the detailed investigation of the definition of a term function and quasiorder of an algebra. So, we recall some basic definitions.
*[email protected] © Siberian Federal University. All rights reserved
For an algebra A = (A,F), a term function m(x\, ..., xk) is called a k-majority term (or sometimes, k-ary near unanimity term) if:
m(y, x, x, . .. ,x) = m(x, y, x, . .. ,x) = • • • = m(x, .. ., x, y) = x
holds for all x, y e A. For instance, any lattice (L, A, V) admits a majority term. A quasiorder of an algebra A is a reflexive, transitive, binary relation which is compatible with the operations of A. Let Quord(A) stand for the set of all quasiorders of A. It is easy to see that (Quord(A), C) is an algebraic lattice where the meet operation A is the set intersection n of the binary relations. Let L be an arbitrary lattice. Then Con(L), the lattice of all congruence relations of L, is distributive (Funayama and Nakayama) and Con(A) is an algebraic (Birkhoff and Frink 1948). Stanley-Reisner theory provides the central link between combinatorics and commutative algebra. In the following, we explain the basics of the Stanley-Reisner correspondence.
Definition 1.1. Let R be a commutative ring, and P be a finite poset(= partially ordered set), we say that A is a ASL (algebra with straightening lows) on P over R if the followings hold:
ASL-0. An injective map P ^ A is given, A is a graded R-algebra generated by P, and each element of P is a homogeneous of positive degree. We call a product of elements of P a monomial in P. In general, a monomial M is a map P ^ and we denote M = x£p xM(x) such that it also stands for an element of A. A monomial in P of the form
with xi1 ^ • • • ^ Xii iS called standard.
ASL-1. The set of standard monomials in P is an R-free basis of A.
ASL-2. For x, y £ P that x ^ y and y ^ x, there is an expression of the form
xy = £ cMM (cM £ R)
M
where the sum is taken over all standard monomials M = xi • • • xrM (xi ^ • • • ^ xrM) with xi < x,y and deg M = deg(xy).
The most simple example of an ASL on P over R is the Stanley-Reisner ring R[P] = R[x | x £ P]/(xy |x ^ y, y ^ x). The Stanley-Reisner rings play central role in theory of ASL.
We consider Rd, the d-dimensional Euclidean space the points of which are d-tuples x = (€i, ■ ■ ■, €d) of real numbers, and the scalar product of which is given by
d
(x,y) =$3x = (£iy = (m i=i
A subset K of Rd is convex, if for any two points x0, xi £ K the line segment with end points xo and xi, that is, the set of points x = (1 — A)xo + Axi, A £ R, 0 < A < 1, belongs to K. The intersection of any non-empty family of convex sets is again convex. This makes the definition of the convex hull, conv X, of a subset X c Rd to be the intersection of all convex sets K c Rd which contain X. The convex hull of X can also be described as the set of all convex combinations of finite subsets of X, that is, as the set of linear combinations
with
Aixi + ... + Xr xr
xi e X, a > o^Ai = 1.
i=i
x
x
«1
r
Definition 1.2. A polytope is the convex hull of a finite set of points in Rd.
Let S C Rd be a polytope such that its vertex set is V = {x1, ..., xr}. A subset {u1, ..., ur} C V is called a face of S, if S has a geometric face in which the vertices are u1, ..., ur. Let K be a ring and define the ring
k[S] = K[X1,..., Xr],
where K[X1, ..., Xr] is the polynomial ring and I is the ideal generated by the set of all monomials Xj1, ..., Xjk , in which the set uj1, ..., ujk is not a face. The ring K[S] is called the associated Stanley-Reisner ring of S over K. It is proved in [2], that for any polytope S, this ring is Cohen-Macaulay, (see that reference for the basic definitions of Cohen-Macaulay rings).
In the following, we will investigate the relations among distributive lattice and WB-height-unmixed, and quasiorder of an algebra to establish the main theorem of this paper. Recall that the height of a prime ideal P is the maximum length of the chains of prime ideals of the ring R of the following form,
P1 C P2 C • • • C Pk = P.
We will denote the height of P by ht(P). An ideal I of R is said to be height-unmixed, if all the associated primes of I have equal height. That is ht(P) = ht(Q), for all P, Q G Ass(I), where Ass(I) denotes the set of associated primes of I. An ideal I is said to be unmixed if there are no embedded primes among the associated primes of I. That is, P C Q ^ P = Q, for all P, Q G Ass(I). We will say that an ideal is WB-height-unmixed, if it is height-unmixed with respect to the set of weak Bourbaki associated primes and an ideal is WB-unmixed if it is unmixed with respect to the set of weak Bourbaki associated primes. A prime ideal P is a weak Bourbaki associated prime of the ideal I of the ring R if it is a minimal ideal of the form I : a, for some a G R. Let R be a Cohen-Macaulay ring. Then we know that R[X1, X2,...] is Cohen-Macaulay ring. Now we are ready to present our main theorem.
Theorem 1.1. Let A = (A, F) be an algebra with a majority term function. Let S C Rd be a polytope, K be a ring, and E = K[S]. Then the ring E[Quord(A)][X1, X2,...] is WB-height-unmixed.
Proof. Let a1, a2, a G Quord(A). It is known that the join a1 V a2 in the lattice Quord(A) is the transitive closure of the union a1 U a2 C A x A. Hence
a1 V a2 = y {a^ o ... o ain | ¿1,. .., in G {1, 2}, n > 1}. Now, we prove that Quord(A) is distributive lattice.
(a A a1) V (a A a2) = (a O a1) V (a O a2) = = U{(a O ai1) o. .. o (a O ain)| ¿1,. .. ,in G {1, 2},n > 1} =
= a O (^ {ai1 o...o ain | ¿1,.. ., in G {1, 2}, n > 1}) = a A (a1 V a2).
So, (Quord(A), A, V) is a distributive lattice. It is known that if the ring R is a Cohen-Macaulay ring and P is a distributive lattice, then R[P] is a Cohen-Macaulay ring (see [14]). On the other hand, we have S is a polytope. Consequently, K[S] is a Cohen-Macaulay ring and Quord(A) is a distributive lattice (see [4]). Therefore, by applying Theorem 3.5 of [5], we can concluded that E[Quord(A)] is a Cohen-Macaulay ring. We also know if ring R is a Cohen-Macaulay ring, then R[X1, X2,...] is WB-height-unmixed. Thus, E[Quord(A)][X1, X2,...] is WB-height-unmixed. □
Definition 1.3. A variety V is said to have n-permutable congruences if every algebra from V has 'n-permutable congruences.
Recall that Hagemann and Mitschke proved that a variety V is n-permutable (n > 2) if and only if there are ternary terms mi, ■ ■mn-i such that V satisfies the identities:
Theorem 1.2. Let A = (A, F) be an algebra in any n-permutable variety, and S C Rd be a polytope, K be a ring, and E = K[S]. Then E[Con(A)][Xi, X2, ■ ■ ■] is WB-height-unmixed.
Proof. Well-known 2-permutability is just permutability and n-permutability implies (n +1)-permutability. Let A be an algebra in any n-permutable variety then every quasiorder of A is a congruence of A, so Quord(A) = Con(A) (see [16] and [13]), and E[Con(A)][Xi; X2, ■ ■ ■] is WB-height-unmixed. □
2. Tensor product of the distributive lattices and the finite solvable groups
In this section we study property of a finite solvable group and tensor product of distributive lattices. For a finite group G, we will denoted by L(G) the set of all subgroups of G which it partially ordered by inclusion. Then L(G) is a lattice, with respective meet and join operations H A K = H n K, H V K =< H, K > ■ The order complex A(n) of a poset n is a set of chains of n. Recall that a subset C of n is a chain if any of elements of C are comparable. Obviously, A(n) is a simplicial complex.
Definition 2.1. A pure simplicial complex △ is called shellable if the facets of △ can be given a linear order Fi, ■ ■ ■, Fm in such a way that (Fi) n (Fi, ■ ■ ■, Fi-i) is generated by a non-empty set of maximal proper faces of (Fi) for all i, 2 ^ i ^ m (see [10] and [2]).
It is clear that the following implications hold for simplicial complexes:
We have G is solvable if and only if the order complex of L(G) is (nonpure) shellable (see [1] and [19]). Now we have the following theorem:
Theorem 2.1. Let G be a finite solvable group and K be the order complex of L(G). Then K[Xi, X2, ■ ■ ■] is WB-height-unmixed.
The concepts of almost principal ideals and filters will be important in our investigations. Let us recall that an ideal I of a lattice L is said to be almost principal if its intersection with every principal ideal of L is a principal ideal of L. If L has a largest element, then every almost principal ideal is principal. In general, there are almost principal ideals which are not principal (see [12] or [15]). The notions of principal filter and almost principal filter are defined dually. The whole lattice L is also regarded as an (almost principal) ideal and filter. The almost principal ideals have been first considered in the context of semilattices in [11]. Their relevance for affine completeness of distributive lattices and Stone algebras has been established in [15] and [10], respectively. Let I(L) and F(L) denote the sets of all almost principal ideals and almost principal filters of the lattice L, respectively. For every distributive lattice L, the set I(L) ordered by the set inclusion is again a distributive lattice. In fact, it is a sublattice of the lattice I(L) of all ideals of L. Dually, we can consider L as a sublattice of the distributive lattice F(L). Note that the natural ordering of F(L) is given by the inverse set inclusion: Fi < F2 iff Fi F2. So we proved that the following theorem:
x = mi(x, z, z),
m«(x, x, z) = m«+i(x, z, z) for all i.
shellable Cohen-Macaulay.
Theorem 2.2. Let S C Rd be a polytope, K be a ring, and E = K[S]. Then E[F(I(L))][X1, X2, ...] is WB-height-unmixed.
A principal element is an element that is both meet-principal and join-principal or A A E = (A : E)E and AE : E = A V (0 : E), for all A G L. Here, the residual quotient of two elements A and B is denoted by A : B, so A : B = V{X G L | XB < A}. Also a lattice (L, A, V) is called principal lattice if each of its elements is principal and it called distributive lattice if a A (b V c) = (a A b) V (a A c) for all a, b, c G L (see [6]). Let R be a commutative ring with identity. Then L(R) is a principal lattice, if and only if, R is a Noetherian multiplication ring and Cohen-Macaulay ring.
Corollary 2.1. Let R be a commutative ring with identity, A = (A, F) be an algebra with a majority term function, and L(R) be a principal lattice. Then R[Quord(A)][X1, X2, ...] is WB-height-unmixed.
Corollary 2.2. Let R be a commutative ring with identity, A = (A, F) be an algebra in any n-permutable variety, and L(R) be a principal lattice. Then R[Con(A)][X1, X2, ...] is WB-height-unmixed.
The uniqueness of a tensor product is clear from its definition as a solution of a universal problem. The tensor product of C and B is denoted by C < B and the image of (c, b) under the canonical bihomomorphism f : C x B —► C < B is written as c < b.
Theorem 2.3. Let C and B be distributive lattices. Also, let S C Rd be a polytope, K be a ring, and E = K[S]. Then E[C < B][X1, X2, ...] is WB-height-unmixed.
Proof. We know if the ring R is a Cohen-Macaulay ring and P is a distributive lattice, then R[P] is a Cohen-Macaulay ring (see [14]). On the other hand, we have S is a polytope. Consequently, K[S] is a Cohen-Macaulay ring and C < B is a distributive lattice (Theorem 2.6 of [7]). Therefore, by applying Theorem 3.5 of [5], E[C < B] is a Cohen-Macaulay ring. Furthermore, we have if ring R is a Cohen-Macaulay ring, then R[X1, X2,...] is WB-height-unmixed. Hence, E[C < B)][X1, X2,...] is WB-height-unmixed. □
References
[1] M.Bruggesser, P.Mani, Shellable decompositions of cells and spheres, Math. Scand., 29(1971), 197-205.
[2] W.Bruns, J.Herzog, Cohen-Macaulay rings, Cambridge University Press, 1998.
[3] G.Birkhoff, Lattice theory, Amer. Math. Soc. Colloq. Publ., vol. 25, 1967.
[4] I.Chajda, S.Radeleczki, Congruence schemes and their applications, Comment. Math. Univ. Carolinae, 46(2005), no. 1, 1-14.
[5] C.De Concini, D.Eisenbud, C.Procesi, Hodge algebras, Asterisque, vol. 91, Societe Mathematique de France, Paris, 1982.
[6] R.P.Dilworth, Abstract commutative ideal theory, Pacific J. Math., 12(1962), 481-498.
[7] G.A.Fraser, The semilattice tensor product of distributive lattices, Tran. Amer. Math. Soc., 217(1976), 183-194.
[8] G.Gratzer, Universal algebra, D.Van Nostrand Company, Princeton, 1968.
G.Gratzer, Lattice theory. First concepts and distributive lattices, Freeman, San Francisco, Calif., 1971.
M.Haviar, M.Ploscica, Affine complete Stone algebras, Algebra Universalis, 34(1995), 355-365.
K.Kaarli, L.Marki, E.T.Schmidt, Affine complete semilattices, Monatshefte Math., 99(1985), 297-309.
K.Kaarli, A.F.Pixley, Polynomial Completeness in Algebraic Systems, Chapman and Hall/CRC, 2000.
O.M.Mamedov, A.Molkhasi, On congruence shcemes and compatible relations of algebras, Transactions of National Academy of sciences of Azer., 4(2009), 101-106.
A.Molkhasi, Polynomials, a-ideals and the principal lattice, Journal of Siberian Federal University. Mathematics and Physics, 4(2011), no. 3, 292-297.
M.Ploisicica, Affine complete distributive lattices, Order, 11(1994), 385-390.
A.G.Pinus, I.Chajda, Quasiorders on universal algebras, Algebra Logika, 32(1993), no. 3, 308-325.
M.Suzuki, On the lattice of subgroups of finite groups, Trans. Amer. Math. Soc., 70(1951), 345-371.
J.Usan, Congruences of n-group and of associated Hosszfu-Gluskin algebras, Novi Sad. J. Math., 28(1998), 91-108.
R.Woodroofe, An EL-labeling of the subgroup lattice, Proc. Amer. Math. Soc., 136(2008), 3795-3801.
Тензорное произведение алгебры отношений в кольцах Коэна-Маколея
Али Молкхаси
Эта статья показывает, как тензорное произведение дистрибутивных решеток и конечных разрешимых групп можно использовать в WB несмешанной высоте метода Стенли и Райснера.
Ключевые слова: квазипорядок, политопы, порядковый комплекс, тензорное произведение, дистрибутивные решетки.
