betaFeedback

WorksMathematics

Minimal primes and radicality of join-meet ideals of modular lattices with one diamond

Abstract

Let LL be a finite modular lattice with exactly one diamond, that is, exactly one interval of length two with at least three atoms. We describe the minimal primes of the join-meet ideal ILI_L in terms of maximal closed distributive sublattices of LL, and we show that ILI_L has height ∣L∣−rank(L)|L|-\mathrm{rank}(L). Moreover, we characterize the radicality of ILI_L, over any field, in terms of the complements of the atoms of the diamond in their fibres. Finally, we prove that ILI_L is unmixed if and only if all its minimal primes have the same height, if and only if the rank of every maximal closed distributive sublattice through an atom of the diamond is rank(L)−1\mathrm{rank}(L)-1; in this case ILI_L is radical.

Introduction

Let LL be a finite lattice and KK a field. The join-meet ideal of LL is

IL=(xaxb−xa∧bxa∨b:a,b∈L incomparable)⊆SL=K[xa:a∈L].I_L=(x_ax_b-x_{a\wedge b}x_{a\vee b}:a,b\in L\text{ incomparable})\subseteq S_L=K[x_a:a\in L].

Join-meet ideals have been widely studied; see [10 Chapter 6] and the references therein. If LL is distributive, that is, if LL has no sublattice isomorphic to the pentagon N5N_5 or to M3M_3, much is known: ILI_L is the toric ideal of the Hibi ring of LL, which is a normal Cohen–Macaulay domain [11]. If LL is modular but not distributive, that is, if LL has a sublattice isomorphic to M3M_3 but none isomorphic to N5N_5, most algebraic properties of ILI_L are still unknown. The first systematic study of this case is due to Ene and Hibi [3]: they proved that no initial ideal of ILI_L is squarefree as conjectured in [8], found a class of modular non-distributive lattices whose join-meet ideal is radical, and described the minimal primes of radical join-meet ideals in terms of admissible sets. For modular non-distributive lattices, the questions of when ILI_L is radical or unmixed are still open, and they seem to be difficult in general. Inspired by [3], in this paper we answer these questions, and we determine the minimal primes of ILI_L, when LL is a modular lattice with exactly one diamond; since every modular non-distributive lattice has at least one diamond, this is the first case beyond the distributive one.

Let LL be a finite modular lattice with exactly one diamond, that is, exactly one interval [p,q][p,q] of length two with at least three atoms. Let A⋄A_{\diamond} be the set of atoms of [p,q][p,q], n=∣L∣n=|L| and r=rank⁡Lr=\operatorname{rank} L, where the rank of a lattice, or of a sublattice, is the largest length of a chain contained in it. A nonempty set W⊆LW\subseteq L is closed if, for all incomparable a,b∈La,b\in L, we have a,b∈Wa,b\in W if and only if a∧b,a∨b∈Wa\wedge b,a\vee b\in W; equivalently, L∖WL\setminus W is an admissible set in the sense of [3 Definition 2.2]. Closed sets are sublattices of LL. A closed distributive sublattice of LL is a closed set which is a distributive lattice, and it is maximal if no other closed distributive sublattice of LL contains it. We denote by D(L)\mathcal{D}(L) the set of maximal closed distributive sublattices of LL containing an atom of [p,q][p,q], and by N(L)\mathcal{N}(L) the set of maximal closed distributive sublattices WW of LL with W∩[p,q]=∅W\cap[p,q]=\varnothing and rank W=r−1W=r-1; see Definition 2.5 and Example 2.6. For a closed set WW, let PWP_W be the ideal generated by the variables xax_a with a∉Wa\notin W and by the saturation IW:(∏a∈Wxa)∞I_W:(\prod_{a\in W}x_a)^\infty of the join-meet ideal of the lattice WW; it is a prime ideal containing ILI_L (Proposition 3.2). Our first result is a complete description of the minimal primes of ILI_L.

Theorem A. Let LL be a finite modular lattice with exactly one diamond [p,q][p,q]. Then

Min⁡(IL)={PL}∪{PD:D∈D(L)}∪{PW:W∈N(L)},\operatorname{Min}(I_L)=\{P_L\}\cup\{P_D:D\in\mathcal{D}(L)\}\cup\{P_W:W\in\mathcal{N}(L)\},

Key words and phrases. Join-meet ideal, modular lattice, binomial ideal, minimal prime, radical ideal, unmixed ideal.

The second author is supported by Scientific and Technological Research Council of Turkey TÜBİTAK under the Grants 126F175; he is thankful to TÜBİTAK for their support. He is also a member of GNSAGA Indam and he acknowledges their support. and distinct sets give distinct primes. Moreover ht⁡PL=ht⁡PW=n−r\operatorname{ht} P_L = \operatorname{ht} P_W = n-r for W∈N(L)W \in\mathcal{N}(L), and ht⁡PD=n−1−rank⁡D≥n−r\operatorname{ht} P_D = n-1-\operatorname{rank} D \ge n-r for D∈D(L)D \in\mathcal{D}(L). In particular ht⁡IL=n−r\operatorname{ht} I_L = n-r.

For c∈A⋄c \in A_{\diamond}, the elements xx with (x∨p)∧q=c(x \vee p) \wedge q = c form an interval [mc,Mc][m_c,M_c], the fibre of cc (Lemma 4.6), and we say that cc is complemented in its fibre if there is c′∈[mc,Mc]c' \in[m_c,M_c] with c∧c′=mcc \wedge c' = m_c and c∨c′=Mcc \vee c' = M_c. Intuitively, the map x↦(x∨p)∧qx \mapsto(x \vee p) \wedge q projects LL onto its diamond, and the fibre of cc is the part of LL lying over cc.

It turns out that the radicality of ILI_L depends only on whether the atoms of the diamond are complemented in their fibres, and this leads to a characterization of unmixed join-meet ideals.

Theorem B. Let LL be a finite modular lattice with exactly one diamond. Then ILI_L is radical if and only if every atom of the diamond is complemented in its fibre.

Corollary C. Let LL be a finite modular lattice with exactly one diamond. The following are equivalent:

(a) ILI_L is unmixed;

(b) all minimal primes of ILI_L have the same height;

(c) rank⁡D=r−1\operatorname{rank} D = r-1 for every D∈D(L)D \in\mathcal{D}(L).

If they hold, then ILI_L is radical.

The two theorems are linked by Proposition 6.2: an atom that is not complemented in its fibre forces some D∈D(L)D \in\mathcal{D}(L) of rank at most r−2r-2, while the converse fails. Figure 2 and Examples 8.1–8.4 illustrate Theorem B and Corollary C. Since no initial ideal of ILI_L is squarefree when LL is modular and not distributive [3 Theorem 1.3], Gröbner degenerations cannot prove Theorem B, and our proof is combinatorial: ILI_L is radical if and only if, in every multidegree, at most one class of monomials under the moves xaxb↔xa∧bxa∨bx_a x_b \leftrightarrow x_{a \wedge b}x_{a \vee b} is not supported on a closed distributive sublattice (Theorem 7.2).

The lattices A, Z, B and L

Figure 2. The lattices AA, ZZ, BB and LL of Examples 8.1, 8.2, 8.3 and 8.4, with the properties of their join-meet ideals.

The paper is organized as follows. § 2 recalls the background. In § 3, for an arbitrary finite modular lattice, we identify the saturation of ILI_L with a toric ideal, we show that the minimal primes of ILI_L are among the primes PWP_W, and we give a criterion for inclusions among them. § 4 describes the structure of a modular lattice with one diamond; we use it in § 5 to compare the primes PWP_W, and in § 6 to prove Theorem A. § 7 is devoted to Theorem B and Corollary C, and § 8 to examples and conjectures. In particular, Examples 8.1 and 8.2 show that unmixedness cannot be characterized by forbidden sublattices: the lattice AA is an interval of the lattice ZZ, and IZI_Z is unmixed while IAI_A is not.

Preliminaries

Lattices

All posets and lattices are finite. A chain of a poset Π\Pi is a totally ordered subset of Π\Pi, its length is its cardinality minus one, the rank rank⁡Π\operatorname{rank}\Pi of Π\Pi is the largest length of a chain of Π\Pi. A subset U⊆ΠU \subseteq\Pi is an order ideal if y∈Uy \in U whenever y≤xy \le x and x∈Ux \in U. We denote by J(Π)\mathcal{J}(\Pi) the set of order ideals of Π\Pi, ordered by inclusion; it is a sublattice of the Boolean lattice 2Π2^\Pi of all subsets of Π\Pi.

A lattice is a poset LL in which any two elements a,ba,b have a greatest lower bound a∧ba \wedge b, their meet, and a least upper bound a∨ba \vee b, their join; we denote by 0^\hat{0} and 1^\hat{1} the least and the greatest element of LL, and rank⁡L\operatorname{rank} L is the largest length of a chain of LL. A sublattice of LL is a nonempty subset closed under meet and join; it is a lattice with the order of LL, and its rank is defined as above. For a≤ba \le b we put [a,b]={x∈L:a≤x≤b}[a,b]=\{x \in L:a \le x \le b\}, ↓a=[0^,a]\downarrow a=[\hat{0},a] and ↑a=[a,1^]\uparrow a=[a,\hat{1}]; these intervals are sublattices, and every nonempty sublattice is an interval. If a<ba<b and [a,b]={a,b}[a,b]=\{a,b\}, then bb covers aa, we write a≺ba\prec b, and [a,b][a,b] is a prime interval. The length of [a,b][a,b] is its rank, and the atoms of [a,b][a,b] are the elements of [a,b][a,b] covering aa. An element c′∈[a,b]c' \in[a,b] is a complement of c∈[a,b]c \in[a,b] in [a,b][a,b] if c∧c′=ac \wedge c'=a and c∨c′=bc \vee c'=b. The lattice LL is graded if all its maximal chains have the same length, and then rank⁡a\operatorname{rank} a is the length of ↓a\downarrow a. An element a≠0^a \ne\hat{0} is join-irreducible if a=b∨ca=b \vee c implies a∈{b,c}a \in\{b,c\}. The dual lattice LopL^{\mathrm{op}} has the reverse order.

A lattice is modular if a∨(x∧b)=(a∨x)∧ba \vee(x \wedge b)=(a \vee x)\wedge b whenever a≤ba \le b, and distributive if x∧(y∨z)=(x∧y)∨(x∧z)x \wedge(y \vee z)=(x \wedge y)\vee(x \wedge z) for all x,y,zx,y,z. Both properties pass to sublattices, products, homomorphic images and dual lattices. By Birkhoff's theorem [9 Theorem 9.1.7], if LL is distributive and Π\Pi is the poset of its join-irreducible elements, then a↦{b∈Π:b≤a}a \mapsto\{b \in\Pi:b \le a\} is an isomorphism of lattices from LL onto J(Π)\mathcal{J}(\Pi); moreover, rank⁡J(Π)=∣Π∣\operatorname{rank}\mathcal{J}(\Pi)=|\Pi|. A lattice is modular if and only if it has no sublattice isomorphic to the pentagon N5N_5 (Dedekind [2], see also [1 pp. 65–66]), and a modular lattice is distributive if and only if it has no sublattice isomorphic to the diamond M3M_3 (Birkhoff [1 p. 152]); see also [10 Theorem 6.10]. We call diamond of LL an interval of length two with at least three atoms; a modular lattice with a diamond is not distributive.

Projectivity and the Jordan–Hölder valuation

Let LL be modular. For prime intervals we write [a,b]↗[c,d][a,b]\nearrow[c,d], or [c,d]↘[a,b][c,d]\searrow[a,b], if b∧c=ab\wedge c=a and b∨c=db\vee c=d, and we call [a,b][a,b] and [c,d][c,d] projective, [a,b]≈[c,d][a,b]\approx[c,d], if they are connected by a sequence of such transpositions. These are the perspectivities and the projectivity of [5 Section I.3.5], restricted to prime intervals; this is harmless, since perspective intervals of a modular lattice are isomorphic [5 Theorem 348]. Let C(L)\mathcal{C}(L) be the set of classes of ≈\approx and κ(L)=∣C(L)∣\kappa(L)=|\mathcal{C}(L)|. For instance, the six prime intervals of M3M_3 form a single class.

References

  1. [1]G. Birkhoff, Lattice Theory, 3rd ed., Amer. Math. Soc. Colloq. Publ. 25, Providence, RI, 1967.
  2. [2]R. Dedekind, Über die von drei Moduln erzeugte Dualgruppe, Math. Ann. 53 (1900), 371–403.DOI
  3. [3]V. Ene and T. Hibi, The join-meet ideal of a finite lattice, J. Commut. Algebra 5 (2013), 209–230.arxiv.org/abs/1203.6794
  4. [4]D. Eisenbud and B. Sturmfels, Binomial ideals, Duke Math. J. 84 (1996), 1–45.
  5. [5]G. Grätzer, Lattice Theory: Foundation, Birkhäuser, Basel, 2011.DOI
  6. [6]D. R. Grayson and M. E. Stillman, Macaulay2, a software system for research in algebraic geometry, available at https://macaulay2.com.
  7. [7]C. Herrmann, On the number of join irreducibles and acyclicity in finite modular lattices, Algebra Universalis 64 (2010), 433–444.DOI
  8. [8]J. Herzog and T. Hibi, Finite lattices and Gröbner bases, Math. Nachr. 285 (2012), 1969–1973.arxiv.org/abs/1109.4067
  9. [9]J. Herzog and T. Hibi, Monomial Ideals, Graduate Texts in Mathematics 260, Springer, London, 2011.
  10. [10]J. Herzog, T. Hibi and H. Ohsugi, Binomial Ideals, Graduate Texts in Mathematics 279, Springer, Cham, 2018.
  11. [11]T. Hibi, Distributive lattices, affine semigroup rings and algebras with straightening laws, in: Commutative Algebra and Combinatorics, Adv. Stud. Pure Math. 11 (1987), 93–109.

Paper details

vlnc:W_vwtfzjpe
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents