Compatible algebras with straightening laws on distributive lattices
Daniel Banaru, Viviana Ene

TL;DR
This paper characterizes finite distributive lattices that admit a unique compatible algebra with straightening laws, providing a clear understanding of their algebraic structure.
Contribution
It introduces a characterization of finite distributive lattices with a unique compatible algebra with straightening laws, advancing the theoretical understanding of these algebraic structures.
Findings
Identifies conditions for the existence of a unique compatible algebra with straightening laws.
Provides a classification of finite distributive lattices based on their algebraic compatibility.
Enhances the theoretical framework connecting distributive lattices and straightening laws.
Abstract
We characterize the finite distributive lattices on which there exists a unique compatible algebra with straightening laws.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Compatible algebras with straightening laws on distributive lattices
Daniel Bănaru and Viviana Ene
Daniel Bănaru, Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014 Bucharest, Romania
Viviana Ene, Faculty of Mathematics and Computer Science, Ovidius University, Bd. Mamaia 124, 900527 Constanta, Romania
Abstract.
We characterize the finite distributive lattices on which there exists a unique compatible algebra with straightening laws.
Key words and phrases:
Distribuive lattice, algebras with straightening laws
2010 Mathematics Subject Classification:
13P10, 52B20
Introduction
Let be a finite partial ordered set (poset for short) and the distributive lattice of the poset ideals of By a famous theorem of Birkhoff [1], for every finite distributive lattice , there exists a unique subposet of such that The order polytope and the chain polytope were introduced in [7]. In [3] it was shown that the toric ring over a field is an algebra with straightening laws (ASL in brief) on the distributive lattice over the field In [5] it was shown that the ring associated with the chain polytope shares the same property.
Let be the polynomial ring over a field and be a set of monomials in indexed by . Let be the toric ring generated over by the set of monomials where for all Clearly, is a graded algebra if we set for all Let be the injective map defined by for all Assume that is an ASL on over According to [5], is a *compatible * ASL if each of its straightening relations is of the form with and where are incomparable elements in If and are compatible ASL on over we identify them if they have the same straightening relations. In this case, we write
In [5, Question 5.1 (b)], Hibi and Li asked the following question:* For which posets , does there exists a unique compatible ASL on over *
In this note, we give a complete answer to this question. Namely, we prove the following.
Theorem 1**.**
Let be a finite poset. Then, the following statements are equivalent:
- (i)
There exists a unique compatible ASL on over
- (ii)
* where denotes the dual poset of *
- (iii)
Each connected component of is a chain, that is, is a direct sum of chains.
1. Order polytopes, chain polytopes, and their associated toric rings
Let be a finite poset. For the basic terminology regarding posets which is used in this paper we refer to [1] and [8, Chapter 3]. The order polytope is defined as
[TABLE]
In [7, Corollay 1.3] it was shown that the vertices of are Here denotes the unit coordinate vector in If then the corresponding vertex in is the origin of
The chain polytope is defined as
[TABLE]
[TABLE]
In [7, Theorem 2.2], it was proved that the vertices of are where is an antichain in Recall that an antichain in is a subset of such that any two distinct elements in the subset are incomparable. Since every poset ideal is uniquely determined by its antichain of maximal elements, it follows that and have the same number of vertices. However, as it was observed in [7], in general, these two polytopes are not combinatorially equivalent, that is, and need not have the same number of -dimensional faces for Combinatorially equivalence of order and chain polytopes is studied in [6].
The toric rings and
To each subset we attach the squarefree monomial If then The toric ring , known as the Hibi ring associated with the distributive lattice is generated over by all the monomials where The toric ring is generated by all the monomials where is an antichain in Also, as we have already mentioned in Introduction, both rings are algebras with straightening laws on over
We recall the definition of an ASL. For a quick introduction to this topic we refer to [2] and [4, Chapter XIII]. Let be a field, with be a graded -algebra, a finite poset, and an injective map which maps each to a homogeneous element with . A standard monomial in is a product where in
Definition 2**.**
The -algebra is called an algebra with straightening laws on over if the following conditions hold:
- (1)
The set of standard monomials is a –basis of
- (2)
If are incomparable and if where and is the unique expression of as a linear combination of standard monomials, then for all
The above relations are called the straightening relations of and they generate the defining ideal of
Let us go back to the toric rings and
One considers defined by for every As it was proved by Hibi in [3], is an ASL on over with the straightening relations where are incomparable elements in
On the other hand, one defines by setting for all where denotes the set of the maximal elements in Note that, for every is an antichain in and each antichain determines a unique ideal namely, the poset ideal generated by Therefore, is an injective well defined map and by [5, Theorem 3.1], the ring is an ASL on over with the straightening relations
[TABLE]
where is the poset ideal of generated by
We observe that one may also consider as an ASL on , where is the dual poset of We may define by for where is the set of minimal elements in and is the filter of We recall that a filter in (or dual order ideal) is a subset of with the property that for every and every with we have Thus, a filter in is simply a poset ideal in the dual poset The ring is an ASL on over as well with the straightening relations
[TABLE]
for incomparable elements where is the poset ideal of which is the complement in of the filter generated by Let us also observe that all the algebras , and are compatible algebras with straightening laws.
2. Proof of Theorem 1
We clearly have (i) (ii). Let us now prove (ii) (iii). By hypothesis, the straightening relations of and coincide. Therefore, we must have
[TABLE]
for all incomparable elements in From the second equality in (1), it follows that is the filter of generated by Assume that there exists two incomparable elements such that there exists with and Consider the filter generated by and the filter generated by Then , but obviously, This shows that, for any two incomparable elements there is no element with
Similarly, by using the first equality in (1), we derive that, for any two incomparable elements there is no element with . This shows that every connected component of the poset is a chain.
Finally, we prove (iii) (i). Let be a poset such that all its connected components are chains and assume that the cardinality of is equal to Let be the generators of and assume that the straightening relations of are where and are incomparable elements in We have to show that, for all incomparable elements in we have and
We proceed by induction on
[TABLE]
If that is, , then and thus and Assume that the desired conclusion is true for with Let us choose now incomparable in such that and assume that we have a straightening relation with or By duality, we may reduce to considering In other words, in we have
[TABLE]
As is a direct sum of chains, we may find and such that covers in , that is, there is no other element in with Without loss of generality, we may assume that Let be the poset ideal of generated by As all the connected components of are chains, we have since there are no other elements in which are smaller than except those which are on the same chain as and which are in Moreover, by the choice of we have
[TABLE]
On the other hand,
[TABLE]
[TABLE]
By the inductive hypothesis, it follows that or, equivalently, in we have the equality Thus, we have obtained the following equalities in
[TABLE]
This implies that
[TABLE]
In addition, we have:
[TABLE]
This implies that both monomials in (2) are standard monomials in which is in contradiction to the condition that the standard monomials form a -nasis in Therefore, our proof is completed.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Birkhoff, Lattice Theory (3rd ed.), Amer. Math. Soc. Colloq. Publ. No. 25. Providence, R. I.: Amer. Math. Soc. 1940
- 2[2] D. Eisenbud, Introduction to algebras with straightening laws , in Ring theory and algebra, III: Proceedings of the third Oklahoma Conference, Lect. Notes Pure Appl. Math. 55 (1980), 243–268.
- 3[3] T. Hibi, Distributive lattices, affine semigroup rings and algebras with straightening laws , In: “Commutative Algebra and Combinatorics” (M. Nagata and H. Matsumura, Eds.), Adv. Stud. Pure Math. 11 , North–Holland, Amsterdam, (1987), 93–109.
- 4[4] T. Hibi, Algebraic combinatorics on convex polytopes , Carslaw Publications, Glebe (1992).
- 5[5] T. Hibi, N. Li, Chain polytopes and algebras with straightening laws , Acta Math. Vietnam. 40 (3) (2015), 447–452.
- 6[6] T. Hibi, N. Li, Unimodular equivalence of order and chain polytopes , Math. Scand. 118 (2016), 5–12.
- 7[7] R. Stanley, Two poset polytopes , Discrete Comput. Geom. 1 (1986), 9–23.
- 8[8] R. Stanley, Enumerative combinatorics , 2nd ed., vol. I. Cambridge University Press, Cambridge (2012).
