Embedding dimension of a good semigroup
N. Maugeri, G. Zito
Abstract
In this paper, we study good semigroups of Nn, a class of semigroups that contains the value semigroups of algebroid curves with n branches. We give the definition of embedding dimension of a good semigroup showing that, in the case of good semigroups of N2, some of its properties agree with the analogue concepts defined for numerical semigroups.
Introduction
The concept of good subsemigroup of Nn was formally introduced in [1]. Its definition arises from the properties of the value semigroups of one dimensional analytically unramified rings (for example the local rings of an algebraic curve) that were initially studied in [2, 4, 5, 9, 11, 10, 14].
In [1], the authors proved that the class of good semigroups is actually larger than the one of value semigroups. Thus, such semigroups can be seen as a natural generalization of numerical semigroups and studied without necessarily referring to the ring theory context, using a more combinatorial approach.
Although, as we have already pointed out, good semigroups share traits with the numerical semigroups, there are some important properties of the latter that cannot be generalized to them. For instance, they are not finitely generated as monoids, and they are not closed under finite intersections.
This makes the study of good semigroups much more difficult than the numerical ones.
Thus, a relevant part of the literature dedicated to these objects is concerned to find a suitable way to represent them by means of a finite set of data.
For instance, for what concerns good semigroups which are also value semigroups, in [14, 18] singularities with only two branches are studied. In these papers, the finite set considered is the set of maximal elements (in [11], it is possible to find a generalization of this approach to the case of more than two branches).
In [7], the authors considered a new approach that is still valid for good semigroups not realizable as value semigroups of curves.
They firstly notice that the set of small elements of the semigroup, that is, the finite set of elements between [math] and the conductor of the semigroup with the usual partial order, completely describes it. Then they proved the uniqueness of the minimal subset G⊊Small(S), called minimal good generating system, from which is possible to recover completely the semigroup S, if also the conductor of S is known.
Another interesting approach is the one presented in [6], where the authors introduced the semiring of values Γ of an algebroid curve R where also the values of the zero-divisors elements are considered (v(0)=(∞,…,∞)).
Thus Γ contains the value semigroup of R and (Γ,+) is a semigroup setting γ+∞=∞ for all γ∈Γ.
The key point is that Γ, equipped with the
tropical operations
[TABLE]
is a finitely generated semiring. This leads the authors to introduce the concept of minimal standard basis.
The aim of this paper is to continue this kind of investigation, in order to find the smallest possible finite set that is able to encode some of the information of a good semigroup with two branches. Specifically, we introduce the concept of minimal set of representatives of a good subsemigroup S of N2. Although a minimal set of representatives η of S does not univocally describe the semigroup (however S is still among the minimal good semigroups containing η), it is possible to show that it stores relevant data. For instance, in the case of value semigroup, a system of representatives contains all the information regarding the value of a minimal system of generators of the corresponding ring. This leads us to generalize in a reasonable way, to the good semigroups of N2, the concept of embedding dimension that plays an important role in the numerical case.
The structure of the paper is the following.
In Section 1 we give all the basic definitions and we introduce all the main tools of the paper. In particular, in Subsection 1.1 we recall the definition of good semigroup and we explain how to associate to a good semigroup S of N2
a semiring ΓS.
Then, in Proposition 3, we prove that, in the case of value semigroups, our semiring coincides with the one given in [6].
In Subsection 1.2 we define the concept of irreducible and absolute element of ΓS, and in Theorem 10, we prove that ΓS is generated as a semiring by its set IA of irreducible absolute elements generalizing to all good semigroups a result proved by Carvalho E. and Hernandes M.E. [6, Thm 11, Cor 20] for the value semigroups of a ring.
In Section 2, we introduce the notation Sη for the set of the minimal good semigroups containing η. In Proposition 13 we give some conditions on η in order to have finitely many elements in Sη.
Then, given a good semigroup S, a set η is called a * system of representatives* of S if S∈Sη.
This lets us to define the embedding dimension of a good semigroup S as the smallest cardinality of a system of representatives of S.
Starting from this point we work on good semigroups of N2 in order to study the property of the embedding dimension.
In Subsection 2.1 we introduce the definition of track of a good semigroup S and with Lemma 21 we show how to obtain a good semigroup S′ contained in S by removing one of its tracks. Using this lemma we can compute an inferior bound for the embedding dimension. In Subsection 2.2 it is given the definition of reducibility of an element of IA(S) with respect to a subset η⊆IA(S). Then, Theorem 31 gives a way to use this concept in order to develop a strategy to find a superior bound for the embedding dimension.
In Subsection 2.3 we present a series of functions implemented in GAP [13] that, using the computational vantages of calculating the previous bounds, allow us to describe a fast algorithm to find the embedding dimension.
In the examples proposed in this section, for reasons of legibility and space, some verifications are not reported; these were made using functions written in GAP [13].
Finally, Section 3 is dedicated to studying whether the embedding dimension defined in N2 retains some of the features of the numerical case.
In particular in Theorem 39 we prove that a good semigroup S, realizable as a value semigroup, has embedding dimension greater or equal than the corresponding ring (as in the numerical case). Then we give some examples, when the previous inequality is strict, where it is possible to observe the limits of the combinatorial structure of a good semigroup that is not always able to store all the information contained in the ring in the same amount of data given by a system of generators.
In Subsection 3.2 we give the definition of levels of the Apéry set of a good semigroup as in [8], and we use it to prove that edim(S)≤e1+e2, where e=(e1,e2) is the multiplicity vector of S (extending the relation edim(S)≤e of the numerical case and the corresponding relation for one-dimensional rings). This result also lets us to prove Corollary 50, where we show that the Arf good semigroups of N2 have maximal embedding dimension, generalizing another important property valid in the numerical case.
1 Semiring associated to a good semigroup and Irreducible Absolutes
1.1 Semiring ΓS and basic properties
We start this section recalling the definition of good semigroup introduced in [1].
Definition 1**.**
A submonoid S of (Nn,+) is a good semigroup if it satisfies the following properties:
If α,β∈S, then min(α;β)=(min{α1,β1},…,min{αn,βn})∈S;
There exists δ∈Nn such that S⊇δ+Nn;
If (α,β)∈S; α=β and αi=βi for some i∈{1,…,n}; then there exists ϵ∈S such that ϵi>αi=βi and ϵj≥min{αj,βj} for each j=i (and if αj=βj, the equality holds).
Furthermore, we always suppose to work with a local good semigroup S, i.e. if α=(α1,…,αn)∈S and αi=0 for some i∈{1,…,n}, then α=0.
As a consequence of property (G2), the element c=min{δ∣S⊇δ+Nn}=(c1,…,cn) is well defined and it is called conductor of the good semigroup. We denote by ≤, the partial order on the elements of S induced by the standard order on Nn.
Furthermore, we denote by e=min(S\{0}) the multiplicity vector of the good semigroup.
In order to simplify the notation and some proofs, in this paper, we often work with good semigroups S⊆N2 but most of the definitions and proofs remain true also in the general case.
According to the work of Carvalho and Hernandes [6], we wish to introduce a semiring ΓS associated with the good semigroup S⊆N2.
We set N=N∪{∞}, where ∞ is just a symbol that will correspond to the value of the element [math] if the semigroup is the value semigroup of a ring.
We extend the natural order and the sum over N to N, setting respectively, a<∞ for all a∈N and x+∞=∞+x=∞.
We set:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
If α=(α1,α2), β=(β1,β2)∈ΓS, we set min{α,β}:=(min{α1,β1},min{α2,β2}).
Now we define over ΓS the following tropical operations:
[TABLE]
[TABLE]
It is easy to prove that, with these operations, (ΓS,⊕,⊙) is a semiring.
We observe that, with the symbols + and ⊙, we denoted exactly the same operation on ΓS. For this reason these two symbols will be used with the same meaning in the following.
Now we recall some facts and fix some notations that will be useful for the following.
Let be R=K[[x1,…,xn]]/Q a two-branches algebroid curve, where Q=P1∩P2 is an ideal of K[[x1,…,xn]] such that P1,P2 are prime ideals.
We can embed R↪R1×R2 where Ri=K[[x1,…,xn]]/Pi, i=1,2. Furthermore R↪R≅R1×R2≅K[[t1]]×K[[t2]].
Given r∈R, r=(r1,r2)∈K[[t1]]×K[[t2]] that is a product of DVRs, so we can associate to each element of R a valuation.
If vi is the valuation function on K[[ti]], we set:
[TABLE]
and v(r)=(v1(r),v2(r)).
According to the notation of Carvalho and Hernandes [6], we introduce the following sets:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
ΓR and S will be called respectively semiring of values and semigroup of values associated to R.
It is easy to observe that S=ΓR∩N2.
At this point, we wish to prove that, if R is a two-branches algebroid curve, and S is its semigroup of values, then ΓS=ΓR.
Lemma 2**.**
The following statements hold:
(a,∞)∈ΓS* if and only if (a,y)∈S for any y≥c2.*
(∞,b)∈ΓS* if and only if (x,b)∈S for any x≥c1.*
Proof.
We prove i), the other statement is analogue. If (a,∞)∈ΓS, then there exists y~∈N such that (a,y~),…,
(a,y~+\nolinebreakn)∈S for any n∈N.
If y~≤c2 the statement is proved, otherwise y~=c2+n, with n∈N. Since S is a good semigroup, for all i<n, a<c1, we have that (a,c2+i)=min{(a,y~),(c1,c2+i)}∈S.
∎
Proposition 3**.**
If R is a two-branches algebroid curve and S is its semigroup of values, then ΓS=ΓR.
Proof.
We have observed that S=ΓR∩N2, thus we need to prove that ΓR\S=S∞. If α∈ΓR\S, we can write α=v(r), where r is a zerodivisor in R or r=0; in both cases we have r∈P1∪P2. If r=0, v(r)=(∞,∞); if r∈P1, then r=0 in R1, v1(r)=∞, hence α∈S2∞; if r∈P2, then r=0 in R2, v2(r)=∞, hence α∈S1∞. If α∈S∞, without loss of generality, we can suppose α∈S2∞, we can write α=(∞,b), and, as a consequence of Lemma 1, (c1,b)∈S. Since S=v(R) and the conductor ideal is C=(tc1,uc2)(K[[t]]×K[[u]]), there exists an element in R of the form (tc1,by(u)) with v(by(u))=b.
Since the element (tc1,0)∈R, we have that the element (0,by(u))∈R, thus (∞,b)∈ΓR.
∎
1.2 A system of generators of ΓS as a semiring
Definition 4**.**
We will say that an element α∈ΓS∖{0} is irreducible if, from α=β+γ, with β,γ∈ΓS, it follows α=β or α=γ. An element that is not irreducible will be said reducible.
We denote by I(S) the set of irreducible elements of ΓS.
Remark 5**.**
We observe that:
-
If α=(a,b)∈ΓS with a≥c1+e1 and b≥c2+e2, then α is reducible.
2. 2.
If α=(a,∞)∈ΓS with a≥c1+e1, then α is reducible.
3. 3.
If α=(∞,b)∈ΓS with b≥c2+e2, then α is reducible.
Given a good semigroup S⊆N2, and an element α∈N2, following the notation in [1], we set:
[TABLE]
Furthermore we define:
[TABLE]
Extending the previous definitions to infinite elements of N2, we set
[TABLE]
Definition 6**.**
An element α∈ΓS will be said absolute in ΓS if α∈S and ΔS(α)=∅ (finite absolute), or if α∈S∞ (infinite absolute).
Remark 7**.**
We observe that an element α∈ΓS is an absolute in ΓS if and only if it is irreducible with respect to the operation ⊕. If we suppose that α∈ΓS is not an absolute, then ΔS(α)=∅, hence there exists β∈ΔiS(α), with i∈{1,2}. Therefore, by property (G3) of the good semigroups, there exists γ∈Δ3−iS(α), hence we would have α=β⊕γ, which is a contradiction. If we suppose that an element α∈ΓS is such that α=β⊕γ with β,γ=α, then α∈S and ΔS(α)=∅.
We denote by Af(ΓS) the set of finite absolutes in ΓS, by A∞(ΓS) the set of infinite absolutes in ΓS and by A(ΓS) the set of all absolutes in ΓS.
We call IAf(ΓS) the set of finite irreducible absolutes in ΓS, IA∞(ΓS) the set of infinite irreducible absolutes in ΓS and IA(ΓS) the set of all irreducible absolutes in ΓS.
Remark 8**.**
By Remark 7, IA(S) can be seen as the set
of the elements of ΓS that are irreducible with respect to both the operations defined in it. Notice that this interpretation lets us to naturally generalize the concept of irreducible absolute elements to good subsemigroups of Nn, with n>2.
As a consequence of the Remark 5, the set of irreducible absolutes is finite.
Now we introduce other sets that will be considered in the following:
[TABLE]
The sets small(S), small(ΓS), B∞(ΓS) will be said respectively: small elements of S, small elements of ΓS and beyond elements of ΓS.
Remark 9**.**
It is easy to observe the following facts:
- i)
Each element in the semiring can be written as a tropical product of irreducible elements, i.e. if α∈ΓS, α=α1⊙…⊙αn where αi∈I(ΓS).
2. ii)
Each element in the semiring can be written as a tropical sum of two absolute elements, i.e. if β∈ΓS, β=β1⊕β2 where β1,β2∈A(ΓS).
Now we prove that the set of irreducible absolutes generates ΓS as a semiring.
Theorem 10**.**
(ΓS,⊕,⊙)* is generated as a semiring by the irreducible absolutes, i.e. if α∈ΓS∖{0},*
[TABLE]
with γji∈IA(S).
Proof.
First of all, we observe that we can reduce to prove the thesis only for the elements α∈small(ΓS)∪B(ΓS). Indeed, if α∈/small(ΓS)∪B(ΓS), then there exists k∈N such that β=α−ke∈small(ΓS)∪B(ΓS). In this case we would have α=β⊙ke, where β∈small(ΓS)∪BS and e is trivially irreducible.
We can reduce again the proof only for the elements α∈I(ΓS)∩S (finite irreducibles). In fact, if α is reducible, by Remark 9, we can write α=α(1)⊙…⊙α(n), with α(i) irreducibles. Furthermore, we observe that if α(i)∈S∞, then α(i)∈IA(ΓS); thus we can write:
[TABLE]
where α(i)∈I(ΓS)∩S. If we prove the thesis for the elements α(i) with i∈{1,…,f}, using the distributive property of ⊙ with respect to ⊕, the result is true also for α.
Therefore we can suppose α∈I(ΓS)∩S and prove the thesis. By Remark 9, we can write α=β⊕γ with β=(β1,β2)∈A, γ=(γ1,γ2)∈A and we can assume β1=α1≤γ1 and γ2=α2≤β2.
We consider
[TABLE]
the decompositions in irreducible elements of β and γ.
We define β′(i)=β(i)⊕γ, for all i∈{1,…,n} and γ′(j)=γ(j)⊕β for all j∈{1,…,m}. Defining β′=β′(1)⊙…⊙β′(n), γ′=γ′(1)⊙…⊙γ′(m), it is easy to observe that β1′=β1 and γ2′=γ2, thus we have α=β′⊕γ′.
We can definitely write:
[TABLE]
where each β′(i) and γ′(j) is strictly smaller than α (that is γ′(j)≤α and γ′(j)=α). If we express each of these elements as a tropical product of irreducibles, we can write α as a tropical sum of tropical products, where all the terms are irreducible and strictly smaller than α. This means that if we repeat the same argument on each element in this expression, in a finite number of iteration we will surely obtain the required expression.
∎
Remark 11**.**
In the case of good semigroups that are value semigroup of a ring, the theorem above follows by [6, Thm 11] and [6, Thm 19].
But we recall that not all good semigroups are value semigroup of a ring (for an example cf.[1, Example 2.16]).
Thus, the previous theorem generalizes this property to all semirings obtained by semigroups of N2, also if they are not value semigroup of a ring.
2 Embedding dimension of a good semigroup
It is a well known fact that every numerical semigroup S⊆N admits a unique minimal system of generators as a monoid and the embedding dimension of the numerical semigroup is defined as the number of these generators. This name follows from the fact that it is equal to the embedding dimension of the monomial curve associated with the numerical semigroup.
Now we will define a set of vectors that, although it does not uniquely determine a good semigroup, will allow us to give a definition of embedding dimension of a good semigroup. This embedding dimension, in the case of good semigroup of N2, will satisfy some of the properties that are valid in the case of numerical semigroups.
Starting from this point, in order to lighten the notations, when we consider a good semigroup S, we suppose that it coincides with the semiring ΓS, i.e. we treat the infinite elements as elements of S.
Given a set of vectors η⊆Nn, we denote by ⟨η⟩⊕ the semiring generated by η.
Furthermore, given a set of vectors η⊆Nn, we denote by Sη the family of all the good semigroups containing η and that are minimal with respect to the set inclusion. Sη can be finite, infinite or empty as in the following example.
Example 12**.**
Let us consider η={[2,2],[3,3]}⊆N2, and suppose that there exists a good semigroup S∈Sη.
First of all we prove that, for any n∈N\{1}, we have (n,n)∈S. In fact, it is easy to observe that each natural number n=1 can be written as n=2α+3β, with α,β∈N. Hence we can write (n,n)=(2α+3β,2α+3β)=α(2,2)+β(3,3)∈S.
We denote by c(S)=(c1,c2) the conductor of S. If c1=1, we have that (1,2)=min{(1,c2), (2,2)}∈S; hence, as a consequence of properties (G1) and (G3) of the good semigroups, either c(S)=(1,2) or S=N2. In both cases, if we consider S′ such that small(S′)={(0,0),(2,2)} we have that S′ is a good semigroup containing η and such that S′⊂S; but this contradicts the minimality of S. Therefore we have obtained c1=1 and, using the same argument, we can suppose c2=1.
If c1>1 and c2>1 we prove that c(S)=(c,c), with c∈N. Let us assume by contradiction that c(S)=(c1,c2) with c1<c2; in this case, there exists α=(α1,α2) with α1≥c1, c1≤α2<c2 such that α∈/S. If α1≤α2, we would have α=min{(α1,c2),(α2,α2)}∈S, hence we necessarily have α1>α2. Now we observe that (c1,α2)=min{c(S),(α2,α2)}∈S and by property (G3) of good semigroups applied to c(S) and (c1,α2), there exists (x1,α2)∈S with x1>c1. If x1≥α1, we would have α=min{(x1,α2),(α1,c2)}∈S that is a contradiction. Thus we necessarily have x1<α1. Now, if we consider (x1,α2),(x1,c2)∈S, using again property (G3), we observe that there exists (x2,α2)∈S with x2>x1. We can repeat this argument until we find an element (xi,α2)∈S with xi≥α1. In this case we obtain α=min{(xi,α2),(α1,c2)}∈S, that is a contradiction.
Now, by repeatedly using the properties (G2) and (G3), it is easy to observe that, small(S)={(0,0),(2,2),(3,3),…,(c−1,c−1),(c,c)}. If we define S′ such that small(S′)={(0,0),(2,2), (3,3),…,(c,c),(c+1,c+1)}, we have found a minimal good semigroup containing (2,2),(3,3) and strictly contained in S, in contradiction with the minimality of S.
The following proposition gives a condition that guarantees that Sη is finite.
Proposition 13**.**
Suppose we have η={η(1)=(η11,…,ηn1),…,η(k)=(η1k,…,ηnk)}⊆Nn.
Then the set Sη is finite if the following conditions hold:
gcd{ηih,h=1,…,k}=1* for i=1,…,n;*
For all i,j∈{1,…,n} with i=j there exists a l∈{1,…,k} such that ηil=ηjl.
Proof.
We denote by ⟨η⟩⊕ the semiring generated by η.
We claim that for each i=1,…,n, we can obtain two vectors α(i)=(α1i,…,αni) and β(i)=(β1i,…,βni) in ⟨η⟩⊕ such that
[TABLE]
We will prove this fact by induction on n.
Base case n=2.
Suppose that i=1. By the second property assumed on the set η, there exists a η(l)∈η such that η1l=η2l. Then η must contain a vector η(m) such that η1mη2m=η1lη2l.
We assume by contradiction that η1hη2h=η1lη2l=1 for all h=1,…,k. If η1l did not divide η2l, it would follow from η2h=η1lη2lη1h that η1l divides η1h for all h=1,…,k. Hence η1l would divide gcd{η1h,h=1,…,k}=1; but this contradicts the first assumption on the set η. Therefore we have
η1lη2l∈N. Since the integer η1lη2l, divides η2h for all h=1,…,k; it divides gcd{η2h,h=1,…,k}=1 but this is a contradiction.
Then, we consider η(m) such that η1mη2m=η1lη2l and the vectors
[TABLE]
satisfy our condition because η2lη1m=η1lη2m and they belong to ⟨η⟩⊕ .
For i=2 we can use the same strategy.
Inductive step:
Let us suppose that the claim is true for n−1 and we prove it for n. We suppose that i=1 (the other cases can be treated in the same way).
We consider the set η~={η(h)=(η1h,…,ηn−1h),h=1,…,k} that satisfies the conditions of the theorem. Then, by the inductive step, it easily follows that in ⟨η⟩⊕ there exist two vectors γ(1)=(γ11,…,γn1) and δ(1)=(δ11,…,δn1) such that
[TABLE]
If γn1<δn1, then the claim is true for α(1)=γ(1) and β(1)=δ(1). If γn1>δn1, we consider α(1)=min(2γ(1),2δ(1)) and β(1)=γ(1)⊙δ(1).
In fact we have α11=2γ11=β11. If j∈{2,…,n−1}, then αj1=2γj1<γj1+δj1=βj1. Finally, we have αn1=2δn1<γn1+δn1=βn1. Thus suppose that γn1=δn1.
In this case we can consider η={η(h)=(η1h,η3h,…,ηnh),h=1,…,k}. By the inductive step there exist two vectors
γ(2)=(γ12,…,γn2) and δ(2)=(δ12,…,δn2) ∈⟨η⟩⊕ such that
[TABLE]
Then, as we have just seen, if γ22=δ22 the claim is true. Therefore we suppose that γ22=δ22. Then, it is very easy to check that the claim is true with α(1)=γ(1)⊙γ(2) and β(1)=δ(1)⊙δ(2).
Now, we denote by c(i) the conductor of the numerical semigroup generated by {ηih:h=1,…,k} and we choose α(i)=(α1i,…,αni) and β(i)=(β1i,…,βni) in ⟨η⟩⊕ as in the previous claim. We will prove that for each i∈{1,…,n} there exist ci,j for j=1,…,i−1,i+1,…,n such that the vectors
[TABLE]
for each S∈Sη, and y∈N.
If this is true then it is clear that
[TABLE]
for all S∈Sη.
Suppose that i=1 (the proof is identical in the other cases). Let us consider an arbitrary S∈Sη. We obviously have ⟨η⟩⊕⊆S. We will denote by m=α11=β11. Since c(1) is the conductor of ⟨{η1h:h=1,…,k}⟩, we can find the vectors:
[TABLE]
such that σ1h=c(1)+h for all h=0,…,m−1.
For each i=0,…,m−1 we consider λ(i)=⨁k=im−1σ(k). Then we have λ(0)≤…≤λ(m−1) and, if λ(h)=(λ1h,…,λnh), then λ1h=c(1)+h.
Now we want to show that (c(1)+m+y,λ20+α21,…,λn0+αn1)∈S for each y∈N.
We notice that
[TABLE]
thus, recalling that αj1<βj1 for all j=2,…,n, it follows by (G3) that there exists x>c(1)+m such that (x,λ20+α21,…,λn0+αn1)∈S.
Now we consider
[TABLE]
Since λh0≤λh1 for all h=2,…,n and αj1<βj1 for all j=2,…,n, we have
[TABLE]
Now, as before, from
[TABLE]
we can deduce that there exists x>c(1)+m+1 such that (x,λ20+α21,…,λn0+αn1)∈S.
Repeating the previous considerations and using the fact that λ(0)≤λ(i) for each i≤m−1, we can show that
[TABLE]
for all y=0,…,m−1.
Now, we can consider
[TABLE]
and since λhj+βh1>λh0+αh1 for all j=0,…,m−1 and h=2,…,n, we can use the same strategy to show that
[TABLE]
for all y=0,…,2m−1. Now it is clear that we can endlessly repeat the strategy and we finally proved that
[TABLE]
for all y∈N and for all the S∈Sη (S was arbitrarily chosen).
Therefore we proved that if S∈Sη, then the conductor of S is smaller than cη. Now we know that a good semigroup is completely characterized by its small elements. This implies that the set of good semigroups with a conductor smaller than cη is finite and therefore also Sη must be finite.
∎
Remark 14**.**
Let us consider a set of vector η⊆Nn which satisfies the hypothesis of the previous theorem. The proof of the theorem gives us also a way to determine a bound for the conductor of all good semigroups containing η.
Definition 15**.**
Given a good semigroup S⊆N2 and a set of vector η⊆IA(S), we say that η is a system of representatives of S, or more simply sor, if S∈Sη.
Remark 16**.**
As a consequence of the Theorem 10, IA(S) is a sor of S, because every semigroup containing the elements of IA(S) must contain S.
Definition 17**.**
A system of representatives η of S is minimal, if given another set of representatives η′⊆η, it follows η′=η. We call such a set a msor of S.
It is possible to show that two msor can have different cardinalities (see Example 35).
Definition 18**.**
Given a good semigroup S, we define embedding dimension of S:
[TABLE]
From this point onwards we will start to analyze the properties of the embedding dimension. We will consider only good semigroups S⊆N2.
Computing all the minimal good semigroups containing a set of vectors is computationally very dispensing, also in the two-branches case. At this point, our first aim is to produce a "fast" algorithm that, in the case of good semigroup S⊆N2, returns a msor of S. In order to do this we will calculate two bounds for the embedding dimension.
2.1 An inferior bound for the embedding dimension
First of all we want to produce an inferior bound for the embedding dimension. We give the following definitions.
Definition 19**.**
Given α,β∈IA(S) we say that α and β are connected by a piece of track if they are not comparable, i.e. α≤β and β≤α, and denoted by γ=α⊕β, we have ΔS(γ)∩(S∖I(S))=∅.
Definition 20**.**
Given α1,…,αn∈IA(S), with α11<…<αn1 we say that α1,…,αn are connected by a track if we have:
2ΔS(α1)∩(S∖I(S))=∅;
1ΔS(αn)∩(S∖I(S))=∅;
αi* and αi+1 are connected by a piece of track for all i∈{1,…,n−1}.*
In this case, denoted with γi=αi⊕αi+1 for i∈{1,…,n−1}, we set:
[TABLE]
and we call this set the track connecting α1,…,αn.
We will simply say that T⊆S is a track in S if there exist α1,…,αn∈IA(S) such that T is the track connecting α1,…,αn.
Notice that the previous definition implies that a track T of S never contains elements α such that α≥c(S)+e(S).
In the following lemma we will show how these definitions are related to the embedding dimension.
Lemma 21**.**
Given a good semigroup S, and a track T=T((α1,…,αn)) in S, then, S′=S∖T is a good semigroup strictly contained in S.
Proof.
If α,β∈S′, since
α,β∈S and T∩(S∖I(S))=∅, we have α+β∈S′, thus S′ is a semigroup. Now, we have to check that S′ satisfies the property (G1); therefore, considering α,β∈S′, we have to prove that α⊕β∈S′. If we suppose
α⊕β∈T, then: there exists a γi=αi⊕αi+1 such that
α⊕β∈ΔS(γi); or α⊕β∈1ΔS(α1); or α⊕β∈2ΔS(αn). But, in all the previous cases, by the definition of track,
this would imply that α,β∈T. Furthermore, for all α∈S with α≥c(S)+e(S) we have α∈S′, thus S′ satisfies property (G2). We complete the proof verifying
the property (G3). Therefore, we take α,β∈S′ and suppose that β∈ΔiS′(α), we need to show that ΔjS′(α)=∅, where
j∈{1,2}∖{i}. Since α,β∈S, for property (G3), there
exists δ∈ΔjS(α). If δ∈ΔjS′(α), the
thesis is proved; hence we suppose the converse, in this case δ necessarily belongs to
T′. We have two cases. Case 1: there exists γk=αk⊕αk+1 such that
δ∈ΔjS(γk), but this implies γk∈ΔjS′(α). Case 2: there exists γk=αk⊕αk+1 such that
δ∈ΔiS(γk). We notice that, if δ∈IA(S) we can reduce to the
previous case, hence we can suppose that there exists ρ=δ with ρ∈ΔiS(γk)∩IA(S). But, since ρ,δ∈S, by property (G3)
in S and by definition of track, ΔjS′(δ)=∅, then we also have
ΔjS′(α)=∅. Case 3: δ∈ΔiS(α1) if i=2 or δ∈ΔiS(αn) if i=1; in this case we can conclude the proof with the same argument of Case 2.
∎
Definition 22**.**
Given M⊂IA(S), we say that M is an hitting set (HS) of S, if for any track T in S there exists an element α∈M such that α∈T.
We say that M is a minimal hitting set (MHS), if for any hitting set M such that M′⊆M, we have M′=M.
Remark 23**.**
Given a hypergraph (V,E), with E={E1,…En}, Ei⊆V, a set of vertices H⊂V such that H∩Ei=∅ for all i=1,…,n is called transversal or hitting set [3].
If we consider the hypergraph with vertices V=IA(S)⊂ΓS and edges E={T⊂S : T is a track}, then the hitting sets of the good semigroup S correspond exactly to the hitting sets of this hypergraph.
The problem of finding the minimal hitting set of an hypergraph is an NP-hard problem and there are several algorithms related to its computation (see for example [12], [16]).
We set H={M∣M is a HS}.
Proposition 24**.**
If M is a sor, then M∈H.
Proof.
If we suppose that M is not a HS, then it would exist a track T in S that does not contain elements of M. Using the same construction of Lemma 21 we could build a good semigroup S′ such that M⊆S′⊊S, but it is a contradiction.
∎
The converse of the previous theorem is not true in general as it is shown by the following example.
Example 25**.**
Let us consider the good semigroup S with the following set of irreducible absolute elements:
[TABLE]
From Figure 2 we can easily deduce that S contains only the following tracks:
T1=T((6,3));
T2=T((12,17),(19,6));
T3=T((39,∞),(∞,31));
T4=T((41,∞),(∞,23));
T5=T((41,∞),(∞,31));
T6=T((41,∞));
T7=T((46,∞),(∞,15));
T8=T((46,∞),(∞,23));
T9=T((46,∞),(∞,31)).
Then, it is easy to verify that M={(6,3),(12,17),(39,∞),(41,∞),(46,∞)} is a MHS for S.
However, M is not a sor for S, in fact it is possible to check that there exists a good semigroup S′ with
[TABLE]
such that S′ is strictly contained in S and we have M⊆S′.
Now we define: bedim(S)=min{∣M∣,M∈H}.
Corollary 26**.**
Given a good semigroup S⊆N2, bedim(S)≤edim(S).
Example 27**.**
The inequality of Corollary 26 can be strict. In fact, for instance, it is possible to check that each minimal hitting set of the semigroup S described in Example 25 is not a sor for S, implying that bedim(S)<edim(S).
2.2 A superior bound for the embedding dimension
Let S⊆N2 be a good semigroup; given η⊆IA(S), and α∈IA(S), we want to define the reducibility of α with respect to η. By convention we will say that all the elements α∈η are reducible by η.
We take α∈IA(S)\η and we will treat the finite and infinite elements separately.
Finite case:
We suppose α=(α1,α2)∈IAf(S)\η.
Given a semiring Γ⊆N2, we introduce the following notations:
[TABLE]
Notice that the fact that α is an absolute finite element implies that iδΓ(α) is finite.
In the following, given η⊆IA(S), we will work with the semiring ⟨η⟩⊕. In order to simplify the notation we will write iΔη(α) instead of iΔ⟨η⟩⊕(α)
Remark 28**.**
If iΔη(α)=∅, we have iδη(α)≤iδS(α).
If1Δη(α)=∅ , we define Yη(α)={y∈{1δη(α),…,1δS(α)}∣(α1,y)∈S} and similarly if 2Δη(α)=∅ , we define Xη(α)={x∈{2δη(α),…,2δS(α)}∣(x,α2)∈S} .
Definition 29**.**
We say that α=(α1,α2)∈IAf(S)\η is reducible by η, if 1Δη(α)∪2Δη(α)=∅ and one of the following conditions is satisfied:
-
1Δη(α)=∅, and for all y∈Yη(α), there exists (x,y)∈⟨η⟩⊕ such that x>α1.
2. 2.
2Δη(α)=∅, and for all x∈Xη(α), there exists (x,y)∈⟨η⟩⊕ such that y>α2.
Infinite case:
If α=(α1,∞)∈IA(S)∞\η, then we consider y~ such that (α1,y)∈S for all y≥y~ (it exists by Lemma 2). Let us consider the set:
[TABLE]
If α=(∞,α2)∈IA(S)∞\η, then we consider x~ such that (x,α2)∈S for all x≥x~ (it exists by Lemma 2). Let us consider the set:
[TABLE]
Definition 30**.**
We say that α=(α1,∞) is reducible by η, if 1Δη(α)=∅ and for all y∈Yη(α), there exists an element (x,y)∈⟨η⟩⊕ with x>α1.
We say that α=(∞,α2) is reducible by η, if 2Δη(α)=∅ and for all x∈Xη(α), there exists an element (x,y)∈⟨η⟩⊕ with y>α2.
As we will see in detail in the proof of Theorem 31, the previous definitions are motivated by the fact that the reducibility of an element α∈IA(S) by a set η⊆IA(S) essentially ensures that the presence of α in IA(S) is forced by η as a consequence of property (G3) of good semigroups.
Given η⊆IA(S), we set:
[TABLE]
Let us consider the following algorithm:
The input of Algorithm 1 is a subset η of IA(S). As long as we can, we expand η by including elements of IA(S)∖η that are reducible by it. Notice that the algorithm produces an output in finite time, since IA(S) is finite.
We denote by red(η) the output of the previous algorithm and we introduce the set R(S)={η⊆IA(S)∣red(η)=IA(S)}. We will say that η⊆IA(S) satisfy the reducibility condition if η∈R(S).
We have the following statement:
Theorem 31**.**
If η∈R(S), then η is a sor.
Proof.
From η∈R(S) it follows that there exists a chain of subset of IA(S):
[TABLE]
such that ηi=⟨⟨ηi−1⟩⟩
We prove that η is a sor using a decreasing induction on this chain. We have that ηn=IA(S) is a sor for Remark 16, now we prove that if ηi+1 is a sor, then ηi is a sor.
We assume by contradiction that S∈/Sηi; in this case there exists a good semigroup Si such that ηi⊆Si⊊S.
If we suppose ηi+1⊆IA(Si), we would have ηi+1⊆⟨ηi+1⟩⊕⊆⟨IA(Si)⟩⊕=Si⊊S, against the fact that ηi+1 is a sor for S.
For this reason, we can always suppose that there exists α=(α1,α2)∈ηi+1\IA(Si). Furthermore we observe that α∈/ηi, indeed, assuming the opposite, we should have α∈Si and since Si⊆S and α∈ηi+1⊆IA(S), it would imply that α∈IA(Si). We distinguish two case: α∈ηi+1∩IAf(S) and α∈ηi+1∩IA∞(S).
Case 1: α∈ηi+1∩IAf(S).
Since ⟨⟨ηi⟩⟩=ηi+1, α is reducible by ηi. Without loss of generality we can assume 1Δηi(α)=∅; in this case there exists (α1,1δηi(α))∈⟨ηi⟩⊕⊆Si. We have 1δηi(α)∈Yη1(α) and, from the reducibility of α by ηi, there exists (xη(α),1δηi(α))∈⟨ηi⟩⊕⊆Si.
We have obtained two elements (α1,1δηi(α)), (xη(α),1δηi(α))∈Si, by property (G3), there exists (α1,y)∈Si, with y>1δηi(α). We observe that, from the definition of 1δS(α), y≤1δS(α). Hence y∈Yηi(α). We can repeat the same argument until we obtain that (α1,1δS(α))∈Si. Using again the property (G3) we should obtain α∈Si (notice that Δ1Si(α)=∅), but this is a contradiction.
Case 2: α∈ηi+1∩IA∞(S).
Without loss of generality we can suppose α=(α1,∞). Since α is reducible by ηi, we have 1Δηi(α)=∅. We set M(α):=max{y~,u}+e2−1, where y~ is such that (α1,y)∈S for any y>y~. Now, using the same argument of the finite case, we obtain that (α1,M(α))∈Si, but, by Lemma 2, this implies (α1,∞)∈Si which is a contradiction.
∎
The following example shows that the converse of the previous theorem is not true in general.
Example 32**.**
Let us consider the good semigroup S with the following set of irreducible absolute elements:
[TABLE]
Notice that, since S contains only the tracks T1=T((3,4)),T2=T((6,∞),(7,8)),T3=T((6,∞),(10,15),(∞,12)) and T4=T((10,15),(∞,12)), we have that η={(3,4),(7,8), (10,15),(14,18),(∞,12),(∞,22)} is a HS for S. Let us show that red(η)=IA(S). It suffices to show that ⟨⟨η⟩⟩=η, i.e. all the elements in IA(S)∖η are not reducible by η.
We have
α1=(6,∞) is not reducible by η. Notice that there exists (6,8)=2(3,4)∈1Δη(α1), thus we have 1δη(α1)=8. Furthermore, y~=22 and we have:
[TABLE]
For each element y in Yη(α1) we need to find (x,y)∈⟨η⟩⊕ with x>6.
It is not difficult to notice that for y=25∈Yη(α1), it is not possible to produce such an element in ⟨η⟩⊕.
α2=(17,25) is not reducible by η. Notice that there exists (17,23)=(7,8)⊙(10,15)∈1Δη(α2), thus we have 1δη(α2)=23 (while 2Δη(α2)=∅). Furthermore, 1δS(α2)=24 and we have:
[TABLE]
For each element y in Yη(α2) we need to find (x,y)∈⟨η⟩⊕ with x>17.
However for y=23∈Yη(α2), it is not possible to produce such an element in ⟨η⟩⊕
α3=(∞,19) is not reducible by η. Notice that there exists (13,19)=(3,4)⊙(10,15)∈2Δη(α3), thus we have 2δη(α3)=13. Furthermore, x~=15 and we have:
[TABLE]
For each element x in Xη(α3) we need to find (x,y)∈⟨η⟩⊕ with y>19.
It is not difficult to notice that for x=13∈Xη(α3), it is not possible to do that.
α4=(∞,29) is not reducible by η, since 2Δη(α4)=∅.
However it is possible to check that there are no good semigroups S′ such that η⊆S′⊊S. Thus η is actually a sor for S and it is not difficult to check that the minimal hitting set
M={(3,4),(7,8),(10,15)} contained in it, is a sor itself, thus a msor for S.
Now we define: Bedim(S)=min{∣η∣,η∈R(S)},
Corollary 33**.**
Given a good semigroup S⊆N2, edim(S)≤Bedim(S).
Example 34**.**
The inequality in Corollary 33 can be strict. An example of this behaviour is the good semigroup S with the following set of irreducible absolute elements:
[TABLE]
It is possible to prove that for each MHS
η of S we have that η is a sor for S but red(η)=IA(S). This easily implies that edim(S)<Bedim(S).
Example 35**.**
Let us consider the good semigroup S, with
[TABLE]
This is an example of good semigroup having msor with distinct cardinalities. In fact, it is possible to prove that the sets η1={(4,3),(6,7),(8,8),(11,∞),(13,∞)} and η2={(4,3),(6,7),(8,8), (11,∞),(∞,9),(∞,11)}
are both MHS of S satisfying the reducibility condition. In particular edim(S)=5.
2.3 An algorithm for the computation of the embedding dimension of a semigroup S⊆N2
We will conclude this section presenting an algorithm for the computation of the embedding dimension and with some remarks concerning the definition that we have given.
We proved that:
[TABLE]
and both inequalities are sharp as we will see in Example 38.
We implemented in GAP [13] the following functions:
ComputeMHS(S): it takes in input a good semigroup and returns the set of its MHS.
VerifyReducibility(list): it takes in input a list of subsets of IA(S) and returns the first set that satisfy the condition of reducibility if there exists, otherwise it returns "fail".
IsThereAMGSContainedInAndContaining(S,V): it takes in input a good semigroup S and a subset V of IA(S) and returns "true" if there exists a good semigroup S′ such that V⊆S′⊊S
Remark 36**.**
Testing in GAP these functions on a sample of about 200000 semigroups, we observed empirically that VerifyReducibility is about seventy times faster than IsThereAMGSContainedInAndContaining.
We introduce the following algorithm to compute the embedding dimension and a set of representatives with minimal cardinality.
Remark 37**.**
We tested the algorithm on a sample of 200000 good semigroups and we noticed that, for n=bedim(S):
The condition "VerifyReducibility(H)=fail" occurred only in 82 cases.
Both the conditions "VerifyReducibility(H)=fail" and "IsThereAMGSContainedInAndContaining(S,η)=true for all η∈H" occurred only in 2 cases. In these cases bedim(S)=edim(S).
The situation which all MSH of minimal cardinality are not reducible and at least one of them is a sor occurred only in one case. In this case Bedim(S)=edim(S)).
For this reasons and by Remark 36 this algorithm is considerably faster than to computing the embedding dimension using the definition.
Example 38**.**
Let us consider the good semigroup S, represented in Figure 4, we want to find a msor for S and the embedding dimension of S.
We have that
[TABLE]
First of all we need to compute the minimal hitting sets of S. It contains the following tracks:
T1=T((4,3));
T2=T((7,13));
T3=T((11,17),(∞,16));
T4=T((15,∞),(16,20),(∞,12));
T5=T((15,∞),(16,20),(∞,16));
T6=T((24,∞),(∞,26)).
Thus the following is the complete list of the MHS of S.
η1={(4,3),(7,13),(∞,12),(∞,16),(∞,26)};
η2={(4,3),(7,13),(11,17),(15,∞),(∞,26)};
η3={(4,3),(7,13),(11,17),(16,20),(24,∞)};
η4={(4,3),(7,13),(11,17),(16,20),(∞,26)};
η5={(4,3),(7,13),(15,∞),(24,∞),(∞,16)};
η6={(4,3),(7,13),(15,∞),(∞,16),(∞,26)};
η7={(4,3),(7,13),(16,20),(24,∞),(∞,16)};
η8={(4,3),(7,13),(16,20),(∞,16),(∞,26)};
η9={(4,3),(7,13),(24,∞),(∞,12),(∞,16)};
η10={(4,3),(7,13),(11,17),(15,∞),(24,∞)}.
Thus for this semigroup bedim(S)=5.
We consider η=η1={(4,3),(7,13),(∞,12),(∞,16), (∞,26)} and we want to show that η∈R(S).
We have η1=⟨⟨η⟩⟩={(4,3),(7,13),(11,17),(14,∞),(16,20),(24,∞),(∞,12),(∞,16), (∞,26)}.
In fact
α1=(11,17) is reducible by η because we have
1Δη(α1)=∅ since (4,3)⊙(7,13)=(11,16)∈⟨η⟩⊕. Furthermore 1δη(α1)=16.
Since 1δS(α1)=16 we need only to find an element of the type (x,16)∈⟨η⟩⊕ with x>11. The element (∞,16)∈η satisfies this property.
α2=(14,∞) is reducible by η because we have 1Δη(α2)=∅; in fact we have 2(7,13)=(14,26)∈⟨η⟩⊕. Furthermore 1δη(α2)=26.
Since y~=18, for all
[TABLE]
we need to find an element of the type (x,y)∈⟨η⟩⊕ with x>14. The following elements of ⟨η⟩⊕ satisfy this property:
[TABLE]
α3=(16,20) is reducible by η. In fact we have 1Δη(α3)=∅; since 4(4,3)=(16,12)∈⟨η⟩⊕. Furthermore 1δη(α3)=12.
Since 1δS(α3)=19, for all y∈Yη(α3)={12,15,16,18,19} we need to find an element of the type (x,y)∈⟨η⟩⊕ with x>16. The following elements of ⟨η⟩⊕ satisfy this property:
[TABLE]
α4=(24,∞) is reducible by η. In fact 1Δη(α4)=∅ since 6(4,3)=(24,18)∈⟨η⟩⊕. Thus 1δη(α4)=18.
Since y~=24, for all
[TABLE]
we need to find an element of the type (x,y)∈⟨η⟩⊕ with x>24. The following elements of ⟨η⟩⊕ satisfy this property:
[TABLE]
Notice that α5=(15,∞) is not reducible by η, but it is reducible by η1.
In fact 1Δη1(α5)=∅ since (4,3)⊙(11,17)=(15,20)∈⟨η1⟩⊕. Thus 1δη1(α5)=20.
Since y~=18, for all
[TABLE]
we need to find an element of the type (x,y)∈⟨η1⟩⊕ with x>15. The following elements of ⟨η1⟩⊕ satisfy this property:
[TABLE]
Thus ⟨⟨η1⟩⟩=IA(S), and this means η∈R(S) since red(η)=IA(S).
Hence Bedim(S)≤5=∣η∣.
Since we have
[TABLE]
we can finally deduce that edim(S)=5 and η is an msor.
It is possible to check that all the minimal hitting sets previously found satisfy the reducibility condition, thus they are all msor for S.
All the previous computations were realized implementing all the previous algorithms in GAP [13].
3 Properties of embedding dimension
3.1 Relationship between embedding dimension of a ring and embedding dimension of its value semigroup
Theorem 39**.**
Let S be a good semigroup of N2 such that there exists an algebroid curve R with v(R)=S. Then edim(S)≥edim(R).
Proof.
Let us consider an algebroid curve R such that v(R)=S and denote by ε the embedding dimension of S. Thus there exists η⊂IA(S), msor of S, with ∣η∣=ε. We want to prove edim(R)≤ε.
We denote by
[TABLE]
and we want to show that it is possible to choose elements ϕ1,…,ϕε in R, such that:
v(ϕj)=αj for each j=1,…,ε;
v(K[[ϕ1,…,ϕε]]) is a good semigroup.
Denote by R1=K[[ϕ1,…,ϕε]].
By construction, for each choice of the elements ϕj, the subsemigroup v(R1)⊆N2 always satisfies the properties (G1) and (G3) of good semigroups, thus we need to guarantee the existence of a conductor.
This can be done by forcing in v the presence of vectors that fulfil the conditions of Proposition 13 (it is not difficult to do that by accordingly adding to the ϕi elements of R with value greater than its conductor).
Now,
[TABLE]
and, since η is a msor of S and v(R1) is a good semigroup, we have v(R1)=S.
Notice that R1⊆R with v(R)=v(R1) implies that
R1=R.
In fact, considered an element r∈R, there exists an element r1∈R1 such that v(r)=v(r1). Thus we can fin a k1∈K such that v(r−k1r1) is strictly greater than v(r). We eventually find kj∈K and rj∈R1 such that v(r−∑kjrj)≥c(S)=c(v(R1)), implying that r−∑kjrj∈R1, and r∈R1.
Thus edim(R)=edim(R1)≤ε=edim(S). ∎
We want to show that the inequality can be strict and we want to analyze the cases when this happens.
Example 40**.**
Let us consider the ring R≅K[[(t4,u4),(t6+t9,u6+u7),(2t15+t18,2u13+u14)]].
We observe that R=K[[(t4,u4),(t6+t9,u6+u7),(2t15+t18,2u13+u14)]]=K[[(t4,u4),(t6+t9,u6+u7)]], in fact:
[TABLE]
We have that edim(R)=2, but edim(v(R))=3, since M={(4,4),(6,6),(15,13)} is the only hitting set of the semigroup v(R)
This fact happens because in the ring R the element of value (15,13) is obtained by the sum of the elements of value (4,4) and (6,6) because of a cancellation.
This situation cannot be controlled by the property (G3) of the good semigroups. This gap in embedding dimension can be justified by the fact that this piece of information is lost in the passage from the ring to the semigroup.
For this value semigroup it is possible to find a ring, namely T=K[[(t4,u4),(t6,u6),(t15,u13)]] with v(T)=v(R), and such that edim(T)=edim(v(T)). This situation is not guaranteed to happen in general, as it is shown in the following example.
Example 41**.**
Let us consider the ring R=[[(t4,u3),(t7,u13),(t11,u17),(t16,u20)]] that has embedding dimension 4. Its value semigroup is the good semigroup that appeared in Example 38, where we proved that its embedding dimension is five.
We focus on one of its msor, namely η={(4,3),(7,13),(11,17),(16,20),(∞,26)}.
If we analyze in detail what happens, we oberve that (t23,u33)=(t7,u13)⋅(t16,u20)∈R and (t23,u26)=(t11,u17)⋅(t12,u9)∈R, thus (0,u26−u33)∈R.
But η={(4,3),(7,13),(11,17),(16,20)} is not a sor, since we have seen in the Example 38 that all MHS have to contain either (∞,26) or (24,∞).
This fact happens because in the ring R all the elements of value (x,26) with x≥25 appear because we have a complete cancellation on the first component (i.e. we obtain [math] on the first component).
In the semiring ⟨η⟩⊕ the existence of the elements (23,33) and (23,26) guarantees, by property (G3) of the good semigroups, only the existence of one element of value (>23,26), but not the presence of all elements (x,26), with x≥24.
Also in this case in the semigroup we lose a piece of information present in the ring.
Differently from the previous example, it is not possible to find a ring T such that v(T)=v(R) and edim(T)=edim(v(T))=5.
To see this, let us suppose by contradiction that such a ring T exists. Let us consider
ψ1,…,ψ5∈T, such that
v(ψ1)=(4,3);
v(ψ2)=(7,13);
v(ψ3)=(11,17);
v(ψ4)=(16,20);
v(ψ5)=(∞,26).
From the proof of Theorem 39 we have that T≅K[[ψ1,ψ2,ψ3,ψ4,ψ5]].
Let us consider the ring T′≅K[[ψ1,ψ2,ψ3,ψ4]]. We must have v(T′)⊊v(T) because otherwise T=T′, against the fact that edim(T)=5.
Now we have that {(4,3),(7,13),(11,17),(16,20)}⊆v(T′) and it is not difficult to show that there exists only one good semigroup D containing these vectors and contained in v(T). The good semigroup D is the one appeared in [1, Example 2.16] as the first example of a good semigroup that cannot be a value semigroup of a ring. Thus v(T′)=v(T) and we have a contradiction.
3.2 Relationship between embedding dimension and multiplicity
Now we want to prove the following theorem.
Theorem 42**.**
Let S be a good semigroup. Denote by e=(e1,e2) the multiplicity vector of S. Then edim(S)≤e1+e2.
We recall that, if S is a numerical semigroup with multiplicity e(S), it is possible to prove that edim(S)≤e(S) using the fact that the set Ap(S)∖{0}∪{e(S)} is a system of generators of S with cardinality e(S).
Using the properties of the Apéry set of a good semigroup, introduced in [8], we wish to prove the same inequality for good semigroups contained in N2.
First of all, we recall the notion of Apéry set and levels.
Definition 43**.**
The Apéry set of the good semigroup S (with respect to the multiplicity) is defined as the set:
[TABLE]
We say that (α1,α2)≤≤(β1,β2) if and only if (α1,α2)=(β1,β2) or (α1,α2)=(β1,β2) and we have
(α1,α2)≪(β1,β2) where the last means α1<β1 and α2<β2.
As described in [8], it is possible to build up a partition of the Apéry set, in the following way. Let us define, D0=∅:
[TABLE]
[TABLE]
[TABLE]
For a certain N∈N, we have Ap(S)=∪i=1ND(i) and D(i)∩D(j)=∅. In according to notation of [8], we rename these sets in an increasing order setting Ai=D(N+1−i). Thus we have
[TABLE]
Notice that the first level A1 of Ap(S) consists only of the zero vector.
It was proved [Thm. 3.4 [8]] that N=e1+e2, a key result in the proof of our inequality.
In order to simplify the notation in the following results we define the set Ap(S)=(Ap(S)∖{0})∪{e}.
Since we are only interchanging the role of the multiplicity vector and the zero vector, we have
[TABLE]
where Ai=Ai′ for i=2,…,N, and A1′={e}.
In order to prove Theorem 42, it is useful to introduce the following new definition of reducibility of an element of IA(S) by a subset η⊆IA(S).
Definition 44**.**
Let α=(α1,α2)∈IA(S) and η⊆IA(S).
Case* (α1,α2)∈IAf(S).
Then α is ρ-reducible by η if*
-
∃h1,…,hk∈η* such that
h1⊙⋯⊙hk=(β1,α2) with β1<α1.*
2. 2.
∀x∈{β1,…,2δS(α)}* such that (x,α2)∈S we can find j1,…,jl∈η such that j1⊙⋯⊙jl=(x,β2) with β2>α2.*
Case* α=(∞,α2)∈IA(S)∞. Denote, as we did before, by x~ the minimal element such that (x,α2)∈S for all x≥x~.
Then (∞,α2) is ρ-reducible by η if*
-
∃h1,…,hk∈η* such that
h1⊙⋯⊙hk=(β1,α2) with β1<∞.*
2. 2.
∀x~∈{x∈{β1,…,max(β1,x~)+e1−1}:(x,α2)∈S}* we can find j1,…,jl∈η such that j1⊙⋯⊙jl=(x~,β2) with β2>α2.*
Case* α=(α1,∞)∈IA(S)∞. Such an element is never ρ-reducible by η.*
Remark 45**.**
If an element of IA(S) is ρ-reducible by η, it is also reducible by η.
Remark 46**.**
If an element (α1,α2) of IA(S) is ρ-reducible by η, then it is also ρ-reducible by ηα1={(x,y)∈η:x<α1}.
In fact, the elements required to satisfy the condition 1) and 2) of Definition 44 cannot be obtained by using irreducible absolute elements of S with first component bigger than α1 (because we only allow the operation ⊙ to produce them).
Now we write
[TABLE]
where the elements are ordered in decreasing order with respect to the first coordinate, i.e. if j<l, then α1(j)>α1(l) or α1(j)=α1(l)=∞ and α2(j)>α2(l).
Let us consider the following algorithm to produce, starting from IA(S), a set η that is still a sor for S.
Proposition 47**.**
The output η of Algorithm 3 is a sor for S
Proof.
Let us prove by induction on k that the subset η produced by the algorithm is a sor for S. By Theorem 31, we can do it by showing that it satisfies the reduciblity condition.
At the first step η=IA(S), hence we have a sor for S. Suppose that at the kth step of the algorithm η∈R(S) and let us show that it still satisfies the reducibility condition after the k+1th step.
If α(k+1) is not ρ-reducible by IA(S)∖{α(k+1)}, then we have nothing to prove since η remains unchanged.
Now let us suppose that α(k+1) is ρ-reducible by IA(S)∖{α(k+1)}. We need to prove that η∖{α(k+1)}=η′∈R(S).
By Remark 46, α(k+1) is ρ-reducible by the set W={(α1,α2)∈IA(S)∖{α(k+1)}:α1<α1(k+1)}={α(k+2),…,α(n)}.
But at this step of the algorithm W⊆η′, thus α(k+1) is ρ-reducible by η′, thus also reducible by η and this means that η⊆red(η′). By the inductive step IA(S)=red(η)⊆red(η′), hence η′∈R(S) and it is still a sor.
∎
Proposition 48**.**
If α=(α1,α2)∈IA(S) is such that
2ΔS(α)⊆Ap(S), then α is ρ-reducible by IA(S)∖{α}.
Proof.
Let us choose (β1,α2)∈/Ap(S) with the largest possible β1.
Thus, there exists an integer k≥1 such that (α~1,α~2)⊙k(e1,e2)=(β1,α2), where (α~1,α~2)∈Ap(S)∪{0}.
Notice that, if (α~1,α~2)=0, then k≥2, otherwise we would have (β1,α2)=(e1,e2)∈Ap(S).
If (α~1,α~2)=0, we write it as
[TABLE]
where the hj are irreducible elements of S.
Each hj=(α1j,α2j) is an absolute element. In fact, if it were possible to write it as
[TABLE]
and (x,α2j),(α1j,y)∈S, then it would follow that
[TABLE]
and γ1>β1, this is against the maximality of β1.
Thus hi∈IA(S) for all i (and they are clearly distinct from (α1,α2)).
Now, if (e1,e2)∈IA(S), then
[TABLE]
is already the element required to fulfill condition 1. in Definition 44.
Thus, let us suppose that (e1,e2)=(e1~,e2)⊕(e1,e2~), where e1~>e1, e2~>e2 and (e1~,e2),(e1,e2~)∈IA(S)∖{(α1,α2)}.
Notice that α cannot be of the type (e1~,e2) or (e1,e2~) because in both cases we would have
2ΔS(α)⊆Ap(S) against our hypothesis.
First of all notice that e1~=∞. In fact, if it were equal to ∞, then there would exist x such that (x,e2)∈S for all x≥x.
This implies that
[TABLE]
for all x≥x. Thus (α1,α2)=(∞,α2) and this is a contradiction since
[TABLE]
is not an element of IA(S) being reducible (recall that if h1⊙⋯⊙hl=0, then k≥2).
Thus e1~=∞, and the element
[TABLE]
is the required element that satisfies the condition 1. of Definition 44.
Now we want to show that we can satisfy the condition 2. of ρ-reducibility.
Let us suppose that α=(α1,α2)∈IAf(S) (all the following considerations can be adapted to the case (α1,α2)=(∞,α2)).
We have to show that for each x~∈X={x∈{β1,…,2δS(α)}:(x,α2)∈S} we can find j1,…,jl∈η such that j1⊙⋯⊙jl=(x~,β2) with β2>α2.
Thus, let us consider an arbitrary x~∈X.
Since (x~,α2),(α1,α2)∈S, by the (G3) property of Definition 1, there exists β2>α2 such that (x~,β2)∈S.
Theorem 10 ensures that we can write
[TABLE]
It must exist an index i such that
[TABLE]
Notice that γji∈IA(S)∖{(α1,α2)} for all j=1,…,n (they all have first coordinate less than x~≤α1).
Furthermore β~2≥β2>α2, thus it is the element which we were looking for in order to satisfy the condition 2. of ρ-reducibility.
∎
As a consequence of Proposition 48 and Algorithm 3, we can immediately deduce the following Corollary.
Corollary 49**.**
Let S be a good semigroup.
Then the set
[TABLE]
is a sor for S.
Now we are ready to give a proof of Theorem 42.
Proof of Theorem 42.
Using Corollary 49 and the definition of embedding dimension, it suffices to show that ∣ηS∣≤e1+e2.
Let us write ηS={h(1)=(α1(1),α2(1)),…,h(k)=(α1(k),α2(k))} where if i<j then α2(i)<α2(j) or α2(i)=α2(j)=∞ with α1(i)<α2(j).
Furthermore we denote by c=(c1,c2) the conductor of S.
Now to each element h(i) of ηS we associate an element h(i) in the following way:
Case h(i)=(α1,∞). Then we set
h(i)=(α1,c2+i).
Case h(i)=(α1,α2), with α2=∞.
Then we set h(i)=min(2ΔS(h(i))∪{h(i)}).
We consider the set η′={h(1),…,h(k)}, and we want to show that distinct elements of η′ belong to distinct levels of the Apéry set of S.
In order to do that we consider two arbitrary elements h(i) and h(j) of η′ and we prove that they cannot belong to the same level of the Apéry set.
We have four possible configurations:
Case h(i)=(α1(i),α2(i)) and h(j)=(α1(j),α2(j)), with
α1(i)<α1(j) and α2(i)<α2(j).
In this case h(i)≪h(j) and from definition of Apéry levels it follows that h(j)∈An and h(i)∈Am with m<n.
Case h(i)=(α1(i),α2(i)) and h(j)=(α1(j),α2(j)), with
α1(i)<α1(j) and α2(i)=α2(j).
This configuration is not possible, because it is against the minimality of the element h(j) (it is easy to check that this situation cannot involve elements that come from h(i) of the type (α1,∞)).
Case h(i)=(α1(i),α2(i)) and h(j)=(α1(j),α2(j)), with
α1(i)<α1(j) and α2(i)>α2(j).
This configuration is not possible, since the element h(i)⊕h(j)∈S is against the minimality of the element h(j) (it is also easy to check that this situation cannot involve elements that come from h(i) of the type (α1,∞)).
Case h(i)=(α1(i),α2(i)) and h(j)=(α1(j),α2(j)), with
α1(i)=α1(j) and α2(i)>α2(j).
Suppose by contradiction that there exists n∈N such that h(i),h(j)∈An.
From the definition of ηS it follows that Δ2S(h(j))⊆Ap(S).
Thus from Lemma 3.3 (3) of [8], the minimal element β of Δ2S(h(j))∈Am with m≤n.
On the other hand h(j)≤β, thus β∈Al with l≥n.
Thus β∈An and this is a contradiction because we have
[TABLE]
that is against the definition of Apéry set level.
Since Theorem 3.4 of [8], states that the levels of the Apéry Set are exactly e1+e2, it follows that
[TABLE]
and the proof of Theorem 42 is complete.
∎
We recall that a good semigroup is said to be Arf if and only if S(α)={β∈S∣β≥α} is a semigroup for any α∈S. In [1, Proposition 3.19 and Corollary 5.8] the authors proved that an Arf semigroup can be always seen as the value semigroup of an Arf ring. From this result and Theorem 42 we can deduce the following corollary.
Corollary 50**.**
Let S be an Arf good subsemigroup of N2. Then, denoted as usual by e=(e1,e2) the multiplicity vector of S, we have edim(S)=e1+e2.
Proof.
By Theorem 42 we have edim(S)≤e1+e2.
Denote by R an Arf ring such that v(R)=S.
By Theorem 39 we have edim(S)≥edim(R).
But R is an Arf ring, thus its embedding dimension is equal to its multiplicity (cf.[15, Theorem 2.2]). Since the multiplicity of R is also equal to e1+e2, we have
[TABLE]
and the proof of the corollary is complete.
∎
We say that a good semigroup S⊆N2 is *maximal embedding dimension * if edim(S)=e1+e2. Thus, Arf good semigroups constitute a particular class of maximal embedding dimension semigroups.
It is known that a numerical semigroup is maximal embedding dimension if and only if M+M=e+M where M=S∖{0} is its maximal ideal and e is its multiplicity (cf.[17]).
Thus, we propose the following conjecture.
Conjecture 51**.**
Let S be a good subsemigroup of N2. Then S is maximal embedding dimension if and only if
M+M=e+M, where e is its multiplicity vector and M=S∖{0}.
At the moment we have tested Conjecture 51 for a large number of good semigroup, and we have a proof of the fact that M+M=e+M implies edim(S)=e1+e2.
Acknowledgements
The authors would like to thank Marco D’Anna and Pedro A. García Sánchez for their helpful comments and suggestions during the development of this paper. They also thank the "INdAM" and the organizers of the "International meeting on numerical semigroups (Cortona 2018)" for inviting them to attend the conference, which was of great help in developing some of the ideas in this paper. Finally, a special thank goes to the anonymous referee for the interesting and extensive comments on an earlier version of this paper.