A note on isomorphisms between submonoids of Nk and numerical semigroups
Jerson Borja
Abstract.
Given a submonoid H of Nk, we give some characterizations of the minimum r∈N+ such that H is isomorphic to a submonoid of Nr. In the context of submonoids of N, we prove that if two numerical semigroups are isomorphic submonoids of N, then they are equal and the identity map is the unique isomorphism between them.
1. Introduction
The symbol N stands for the set {0,1,2,…,}. Elements in Nk will be regarded as functions h:{1,2,…,k}→N. Sometimes it is more convenient to see h∈Nk as the k-tuple (h(1),h(2),…,h(k)), and we also write h=(h(1),h(2),…,h(k)) for simplicity.
The set Nk with the usual sum is a monoid with identity element (0,0,…,0) that we will denote by 0k.
For simplicity we will call a submonoid of Nk a k-monoid.
One interesting property of every k-monoid H is that H has a minimal generating set that we denote β(H). This set β(H) has the property that if X⊆H generates H, then β(H)⊆X. Moreover, β(H)=H∗∖(H∗+H∗), where H∗=H∖{0k}.
When H is finitely generated, we can define the dimension of H, dim H, as the cardinality of the set β(H), dim H=∣β(H)∣.
If H is a k-monoid and F is an l-monoid, then a function φ:H→F is additive if it satisfies φ(h1+h2)=φ(h1)+φ(h2) for all h1,h2∈H. If φ:H→F is additive, then φ(0k)=0l. An ismomorphism between H and F is a bijective additive function φ:H→F.
A result of J. C. Rosales [2] establishes that a finitely generated commutative monoid is isomorphic to k-monoid if and only if it is cancellative, torsion free and has no other units than zero. There exist k-monoids that are not finitely generated. For instance, for k>1, the set {h∈Nk:1≤h(1)≤h(2)≤⋯≤h(k)}∪{0k} is a k-monoid that is not finitely generated. If k=1, every 1-monoid is finitely generated, and furthermore every nontrivial 1-monoid is isomorphic to a numerical semigroup (see [1]).
To state our main results we make some comments and introduce terminology.
Let H be a k-monoid. Then for every r>k there exists an r-monoid that is isomorphic to H. In fact, for any r∈N+ consider the map ιr:Nr→Nr+1 given by ιr(h)=(0,h(1),…,h(r)) for all h∈Nr. This map ιr is a monomorphism. So, if r>k, then H≅ιr−1(⋯ιk(H)⋯). Thus, the question of interest is to determine when there exists an r-monoid isomorphic to H if r<k.
We associate to H the set \mathcal{I}(H):=\{r\in\mathbb{N}^{+}:H\cong K\text{ for some r-monoid }K\}. We define the index of H, ind H, as the minimum element of I(H):
[TABLE]
Given a nonempty subset A of Nk, let QA be the Q-vector space of all functions α:A→Q with the usual sum and scalar product. For each i∈Ik we define αiA:A→Q by αiA(f)=f(i) for all f∈A. We will denote by vect A the subspace of QA spanned by the set {αiA:i∈Ik}.
For any k∈N+, let Ik={1,2,…,k}. Let A be a nonempty subset of Nk. We say a nonempty subset X of Ik is independent over A if {αiA:i∈X} is a linearly independent subset of QA. If {αiA:i∈X} is linearly dependent in QA, we say that X is dependent over A.
We easily see that if X⊆Ik is independent over A and ∅=Y⊆X, then Y is independent over A; also, if X=∅ is dependent over A and X⊆Y⊆Ik, then Y is dependent over A. Besides, if ∅=B⊆A⊆Nk and X is dependent over A, then X is dependent over B, or equivalently, if X is independent over B, then X is independent over A.
We say that X⊆Ik is maximal independent over A if X is independent over A and there does not exist Y⊆Ik independent over A such that X⊊Y. In other words, X is maximal independent over A if and only if {αiA:i∈X} is a basis of vect A. Note that if A={0k} is nonempty, then there exists some nonempty set X⊆Ik that is maximal independent over A, since there is some basis of vect A contained in {αiA:i∈Ik}.
For a k-monoid H we define the index of free submonoids of H, denoted free H, as the maximal dimension of a free submonoid of H:
[TABLE]
One of our main results is that for any nontrivial k-monoid H, the equality
[TABLE]
holds, where X⊆Ik is maximal independent over H.
When H is a finitely generated k-monoid and β(H)={h1,h2,…,hr} where r=dim H, we associate to H a k×r matrix MH that we will call the matrix of H (that depends on the order of the elements in β(H)) given by
[TABLE]
In case H is a finitely generated k-monoid, we also prove that
[TABLE]
where rank MH is the rank of the matrix MH.
We will give some characterizations of k-monoids of index 1. Here, we come to the ambit of numerical semigroups. A numerical semigroup is a 1-monoid H such that N∖H is finite. This condition is equivalent to say that H is nontrivial and gcdH=1. Our main result in this context is that if two numerical semigroups are isomorphic, then they are actually equal. This means that the relation of isomorphism on numerical semigroups is trivial.
2. Index of k-monoids
The following basic properties of ind H are easy to prove.
Lemma 2.1**.**
The following statements are true.
- (1)
If H is k-monoid, then ind H≤k.
2. (2)
ind Nk=k.
3. (3)
I(H)={r∈Z+:r≥ind H}.
4. (4)
If H and F are k-monoids and F⊆H, then ind F≤ind H.
5. (5)
For any f∈Nk, ind ⟨f⟩=1.
6. (6)
If H≅F, then ind H=ind F.
Property (3) in Lemma 2.1 means that if H is a k-monoid and r≥ind H, then we can find an r-monoid F isomorphic to H, but if r<ind H, there does not exist such r-monoid F. Thus, we can find r-monoids isomorphic to H for some r<k only if ind H<k. We will see how under certain conditions on H and 1≤r<k we can construct an r-monoid isomorphic to H (Proposition 2.3 below).
Proposition 2.2**.**
If H is a free and nontrivial k-monoid, then ind H=dim H.
Proof.
If r=dim H, then H≅Nr and therefore ind H=ind Nr=r=dim H.
∎
Let Ik={1,2,…,k}. For a subset X={a1,a2,…,ar} of Ik, where a1<a2<⋯<ar, let ηX:Ir→Ik be defined by ηX(j)=aj, for j∈Ir. For h∈Nk we define h∣X:=h∘ηX∈Nr; for A⊆Nk we define A∣X:={h∣X:h∈A}⊆Nr.
Proposition 2.3**.**
Let H be a submonoid of Nk and X⊆Ik nonempty. Assume that for each j∈Ik∖X, αjH∈span {αiH:i∈X}. Then the map ϕ:H→H∣X given by ϕ(h)=h∣X for all h∈H is an isomorphism.
Proof.
It is easy to see that ϕ is additive and surjective. By hypothesis, if j∈Ik∖X, then for each i∈X there exists ci,j∈Q such that h(j)=∑i∈Xci,jh(i) for all h∈H. If g∣X=h∣X for g,h∈H, then g(i)=h(i) for all i∈X and then, for all j∈Ik∖X, g(j)=∑i∈Xci,jg(i)=∑i∈Xci,jh(i)=h(j). Thus g=h. This shows that ϕ is injective and therefore ϕ is an isomorphism.
∎
Proposition 2.4**.**
Let H be a nontrivial k-monoid and X⊆Ik nonempty. Then X is independent over H if and only if X is independent over β(H).
Proof.
Since β(H)⊆H, if X is independent over β(H), then X is also independent over H. Now, if X is dependent over β(H), then there are rationals numbers ci, i∈X, not all zero, such that ∑i∈Xciαiβ(H)=0; this means that ∑i∈Xcig(i)=0 for all g∈β(H). If h∈H, then h=∑g∈β(H)dgg for some nonnegative integers dg, g∈β(H), so
[TABLE]
Thus, X is dependent over H.
∎
Corollary 2.5**.**
If H is a nontrivial k-monoid, then X⊆Ik is maximal independent over H if and only if X is maximal independent over β(H).
If H is a k-monoid, F is an l-monoid and ϕ:H→F is an additive map, then we can define a Q-linear map ϕ∗:QF→QH given by ϕ∗(α)=α∘ϕ for α∈QF.
Proposition 2.6**.**
Let H be a nontrivial k-monoid and X⊆Ik independent over H. If r=∣X∣, then Ir is independent over H∣X.
Proof.
Write X={a1,a2,…,ar} where a1<a2<⋯<ar. If h∈H, then (h∣X)(j)=h(aj), that is, αjF∣X(h∣X)=αajH(h) for all 1≤j≤r. If ϕ:H→H∣X is the function defined by ϕ(h)=h∣X for h∈H, then we have that ϕ∗(αjH∣X)=αjH∣X∘ϕ=αajH, j=1,…,r.
If Ir were dependent over H∣X, then ∑j=1rcjαiH∣X=0, where c1,…,cr∈Q are not all zero. Hence
[TABLE]
that is, X would be dependent over H.
∎
Proposition 2.7**.**
Let H be a nontrivial k-monoid and X⊆Ik maximal independent over H.
Then, there exists a finitely generated k-monoid F such that F⊆H and X is maximal independent over F.
Proof.
If H is finitely generated, we take F=H. Suppose that H is not finitely generated and that β(H)={h1,h2,…,hn,…}. For each n∈N+ let Fn=⟨h1,h2,…,hn⟩⊆H.
For each n∈N+, the set {αiFn:i∈X} spans vect Fn. In fact, given that {αiH:i∈X} is a basis of vect H, if j∈Ik∖X, then αjH=∑i∈XciαiH for some ci∈Q, i∈X. Now, since the relation αrH∣Fn=αrFn holds for 1≤r≤k, it results that
[TABLE]
This shows that {αiFn:i∈X} spans vect Fn. Now, {αiF1:i∈X} spans vect F1 and so there exists X1⊆X such that {αiF1:i∈X1} is a basis of vect F1, that is, X1 is maximal independent over F1. Since F1⊆F2, X1 is independent over F2, and this means that {αiF2:i∈X1} is linearly independent in vect F2. Now, {αiF2:i∈X} spans vect F2 and so there exists X2⊆X that contains X1 and is maximal independent over F2. By continuing this way we construct an increasing sequence of subsets of X, X1⊆X2⊆⋯⊆Xn⊆⋯⊆X in such a way that Xn is maximal independent over Fn for all n∈N+. Since X is finite, the sequence {Xn} stabilizes and so there exists N∈N+ such that Xn=XN for all n≥N.
We claim that XN=X. Assume, on the contrary that XN=X. Let n≥N. Since {αiFn:i∈XN} is a basis of vect Fn, there exist unique ci,n∈Q, i∈XN, such that αjFn=∑i∈XNci,nαiFn.
Now, for n≥N, the relations αrFn+1∣Fn=αrFn, 1≤r≤k, implies that
[TABLE]
so that by uniqueness of the ci,n, it follows that ci,n=ci,n+1 for all i∈XN. In particular, ci,n=ci,N for all i∈XN and all n≥N.
Let us set ci=ci,N for each i∈XN. Since X=XN, there is some j∈X∖XN. For n≥N we have αjFn=∑i∈XNciαiFn. Let h∈H. Then h=a1g1+⋯atgt where a1,…,at∈N and g1,…,gt∈β(H). Choose n≥N big enough so that {g1,…,gt}⊆{h1,…,hn}⊆Fn. Then h∈Fn and
[TABLE]
This shows that αjH=∑i∈XNciαiH, that contradicts the fact that X is independent over H.
Let F=FN. Then F⊆H is finitely generated and X is independent over F. That X is maximal independent over F follows from the fact that if X⊆Y⊆Ik and Y is independent over F, then, since F⊆H, Y is also independent over H, and thus Y=X.
∎
Now we are ready to prove our main result.
Theorem 2.8**.**
Let H be a nontrivial k-monoid and X⊆Ik maximal independent over H. Then
[TABLE]
Moreover, if H is finitely generated, then
[TABLE]
Proof.
By Proposition 2.3, H≅H∣X and by Lemma 2.1, since H∣X is a ∣X∣-monoid, ind H=ind (H∣X)≤∣X∣. Besides, if F⊆H is a free k-monoid, then by Proposition 2.2 and Lemma 2.1, dim L=ind L≤ind H, so free H≤ind H.
To complete the proof, we construct a free k-monoid F⊆H such that dim F=∣X∣.
By Proposition 2.7, there exists a k-monoid L⊆H such that X is maximal independent over L. Consider the matrix ML, whose columns are basically the elements in β(L). By Corollary 2.5, X is maximal independent over β(L). This means that the matrix ML has rank ∣X∣. Since the rank of ML equals the maximal number of linearly independent columns of ML, we find that there are ∣X∣ elements of β(L), say h1,h2,…,h∣X∣, that are linearly independent in Qk.
Let F=⟨h1,h2,…,h∣X∣⟩. Then F is a free k-monoid, F⊆L⊆H and dim F=∣X∣.
Note that in case H is finitely generated, we can take L=M and have therefore ind H=rank MH.
∎
Corollary 2.9**.**
Let H be a nontrivial k-monoid and X⊆Ik independent over H. Then ind (H∣X)=∣X∣.
Proof.
By Proposition 2.6, if r=∣X∣ then Ir is independent over H∣X, and therefore, Ir is maximal independent over H∣X. By Theorem 2.8, ind (H∣X)=∣Ir∣=r=∣X∣.
∎
Proposition 2.10**.**
Let H be a nontrivial k-monoid. Then r=ind H if and only if there exists B⊆β(H) such that
- (1)
∣B∣=r,
2. (2)
⟨B⟩* is free, and*
3. (3)
for any h∈β(H)∖B there exist c∈N+ and f,g∈⟨B⟩ such that f+ch=g.
Proof.
If r=ind H, then, as in the last part of the proof of Theorem 2.8, we can take B={h1,h2,…,hr} (we know that r=∣X∣ where X is maximal independent over H). Then ∣B∣=r and ⟨B⟩ is free. Let h∈β(H)∖B. Since ⟨B∪{h}⟩ cannot be free (otherwise ind H≥r+1), there are n,n1,⋯,nr,m,m1,…,mr,∈N such that {n,n1,…,nr}={m,m1,…,mr} and
[TABLE]
If n=m, then n1h1+⋯+nrhr=m1h1+⋯+mrhr and n1=m1,…,nr=mr (since ⟨B⟩ is free), that is, {n,n1,…,nr}={m,m1,…,mr}, a contradiction. Thus, n=m, say m<n. If c=n−m, f=n1h1+⋯+nrhr and g=m1h1+⋯+mrhr, then c>0 and f+ch=g.
Conversely, if there is some B⊆β(H) that satisfy the three conditions, then by (1), (2) and Theorem 2.8, r≤ind H. If ind H>r, then, using the last part of the proof of Theorem 2.8, we can find a subset C⊆β(H) such that ∣C∣=ind H. We can form a k×(r+ind H) matrix M whose first r columns are the elements of B and its last ind H columns are those elements in C. Condition (3) assures that the rank of the matrix M is r. Also, there are ind H linearly independent columns coming from C, so that the rank of M is at least ind H>r. This is a contradiction. Therefore, ind H=r.
∎
For instance, if Hk:={h∈Nk:1≤h(1)≤h(2)≤⋯≤h(k)}∪{0k} then Hk is a k-monoid that is not finitely generated. We show that ind Hk=k by finding a free submonoid of Hk of dimension k. In fact, the k elements (1,1,1,…,1),(1,2,2,…,2),(1,2,3…,3),…,(1,2,3,…,k)∈Hk are linearly independent in Qk, so they generate a free submonoid of Hk of dimension k. Hence k≤Hk, but really ind Hk=k because Hk is a k-monoid. In particular, Hk≅Hr if k=r.
3. k-monoids of index 1
In this section we give characterizations of k-monoids of index 1. We start with the following lemma.
Lemma 3.1**.**
Let f,g∈Nk. If cf=dg for some c,d∈N+, then there exist h∈Nk, r,s∈N+ such that f=rh y g=sh. In particular, f,g∈⟨h⟩.
Proof.
We have that cf(i)=dg(i) for 1≤i≤k. By cancelling common factors we can assume that c and d are relatively prime. Then, for all 1≤i≤k, f(i)=df′(i) and g(i)=cg′(i) for some f′(i),g′(i)∈N. Then, cdf′(i)=cf(i)=dg(i)=dcg′(i) for all 1≤i≤k, from where f′(i)=g′(i) for all i. If h∈Nk is given by h(i)=f′(i) for all i, then f=dh and g=ch.
∎
Proposition 3.2**.**
A k-monoid H has index 1 if and only if there exists f∈Nk such that H⊆⟨f⟩.
Proof.
If H≤⟨f⟩, then 1≤ind H≤ind ⟨f⟩=1, so that ind H=1. Conversely, suppose that ind H=1. If H={0k}, then we can take f=0k.
Assume H is nontrivial. Since ind H=1, there exists a nontrivial 1-monoid F such that H≅F, but every 1-monoid is finitely generated (see [1]), so H is finitely generated. Let β(H)={h1,h2,…,hr} where r=dim H. The matrix MH associated to H has rank 1 by Theorem 2.8. Then, taking h1 and h2, there is a rational c1/d1 where c1,d1∈N+ such that h2=(c1/d1)h1, or the same, c1h1=d1h2. By Lemma 3.1, there is some f1∈Nk such that h1,h2∈⟨f1⟩. Now, take h2 and h3. Again, there are c2,d2∈N+ such that c2h2=d2h3; also, there is some e∈N+ such that h2=ef1. Then, (c2e)f1=d2h3. By Lemma 3.1, there is some f2∈Nk such that f1,h3∈⟨f2⟩ and therefore, h1,h2,h3∈⟨f2⟩. We continue in this way until we find f=fr−1∈Nk such that h1,h2,…,hr∈⟨f⟩ and hence H⊆⟨f⟩.
∎
The element f such that H⊆⟨f⟩ in Proposition 3.2 is not unique in general. We describe a method to determine all such f.
Let us call an element h∈Nk∖{0k} primitive if gcdh(Ik)=1.
If h∈Nk∖{0k}, then there are unique ch∈N+ and gh∈Nk such that h=chgh and gh is primitive. In fact, ch=gcdh(Ik) and gh:Ik→N is given by gh(i)=h(i)/ch for i∈Ik. Let us call gh the primitive part of h.
Proposition 3.3**.**
Let H be a k-monoid generated by h1,h2,…,hr (all nonzero). Then ind H=1 if and only if h1,h2,…,hr have the same primitive part.
Proof.
If ind H=1, then by Proposition 3.2, H⊆⟨f⟩ for some f∈Nk. Of course f=0k. For each 1≤j≤r, hj=djf for some dj∈N+. Then hj=(djcf)gf and the primitive part of hj is gf. Thus, all the hj have the same primitive part gf.
Conversely, if all hj have the same primitive part, say it is f∈Nk, then H⊆⟨f⟩ and so ind H=1 by Propostition 3.2.
∎
Proposition 3.4**.**
Let H be a nontrivial k-monoid such that ind H=1. Then there is a unique primitive f∈Nk such that H⊆⟨f⟩. If g∈Nk is such that H⊆⟨g⟩, then g=cf for some c∈N+.
Proof.
Assume H⊆⟨f1⟩ and H⊆⟨f2⟩ where f1,f2∈Nk are primitive. Let h∈H∖{0k}. Then there are c1,c2∈N+ such that h=c1f1 and h=c2f2. Thus c1f1=c2f2 and by Lemma 3.1 there are r,s∈N+ and g∈Nk such that f1=rg and f2=sg. Since f1 and f2 are primitive, r=s=1 and thus f1=g=f2. This proves uniqueness.
Now, if H⊆⟨f⟩ and H⊆⟨g⟩ where f,g∈Nk and f is primitive, then by taking h∈H, h=0k, we have that h=c1f and h=c2g for some c1,c2∈N+, so that c1f=c2g and by Lemma 3.1, there are c,d∈N+ and h0∈Nk such that g=ch0 and f=dh0. Since f is primitive, d=1, so f=h0 and g=cf.
∎
If H is a k-monoid generated by h1,h2,…,hr and all the hj have the same primitive part f, then f is the unique such that H⊆⟨f⟩ with f primitive. For 1≤j≤r we have hj=djf for some dj∈N+. The function {h1,h2,…,hr}→N that sends hj to dj extends additively to a monomorphism φ:H→N that gives an isomorphism between H and ⟨d1,d2,…,dr⟩. We can take d=gcd(d1,d2,…,dr) and H is isomorphic to ⟨d1/d,d2/d,…,dr/d⟩ (a numerical semigroup). Finally, if H⊆⟨g⟩ for some g∈Nk, then g=cf where c is some factor of d. This determines all f in Proposition 3.2.
4. Isomorphic numerical semigroups are equal
Let H be a numerical semigroup. If H=N, then there exists mH∈N+ such that H contains every natural number n≥mH and mH−1∈/H. This number mH−1 is known as the Frobenius number of H. If H=N we define mH=1.
If H is a numerical semigroup, then the multiplicity of H is the number h0=min (H∖{0}). The set H∖{h0} is a numerical semigroup, for h0 cannot be written as the sum of two nonzero elements of H.
If H and K are numerical semigroups and φ:H→K is an additive map, then, for n∈H and m∈N, φ(mn)=mφ(n), and if n,m∈H, then φ(nm)=nφ(m)=mφ(n).
The main result of this section is that if H and K are numerical semigroups and they are isomorphic, then H=K and there is only one automorphism of H, the identity map.
Lemma 4.1**.**
If H and K are isomomorphic numerical semigroups, then there is only one isomorphism φ:H→K, that is an increasing function.
Proof.
Let φ:H→K be an isomorphism. Then φ(min H∖{0})=min K∖{0}. In fact, if h0=min H∖{0}, k0=min K∖{0}, k1=φ(h0) and we assume that k1>k0, then there is h1∈H with h1>h0 such that φ(h1)=k0. Then
[TABLE]
and since h1>h0 and k1>k0, also h1k1>h0k0, a contradiction. Therefore k1=k0, that is, φ(h0)=k0.
If we write H={0<h0<h1<h2<⋯} and K={0<k0<k1<k2<⋯}, then φ(h0)=k0. Now, φ∣H∖{h0}:H∖{h0}→K∖{k0} is an ismomorphism of numerical semigroups, thus, by a similar argument as above, φ(h1)=k1. And by induction on n we obtain that φ(hn)=kn for all n∈N. This shows that φ is unique and is an increasing function.
∎
Lemma 4.2**.**
Suppose that φ:H→K is an isomorphism between numerical semigroups. If L⊆H is a numerical semigroup, then φ(L)⊆K is a numerical semigroup.
Proof.
Since L is a numerical semigroup, N∖L is finite, and therefore H∖L is finite. Then, φ(H∖L)=K∖φ(L) is finite and N∖φ(L)=(N∖K)∪(K∖φ(L)) is finite. Thus, φ(L) is a numerical semigroup.
∎
Theorem 4.3**.**
If H and K are isomorphic numerical semigroups, then H=K.
Proof.
Let H and K be numerical semigroups and let φ:H→K be the unique isomorphism, that by Lemma 4.1 is increasing.
First we prove that φ(mH)=mK. Let h0∈H such that φ(h0)=mK. If k∈K is such that k≥mK, then k=mK+r for some r≥0 and there exists h∈H such that φ(h)=k. Since φ is increasing, we have that h=h0+s(r) for some s(r)≥0. Then we have
[TABLE]
By replacing k=mK+r we get h0(mK+r)=(h0+s(r))mK, that yields to rh0=s(r)mK and therefore
[TABLE]
for all r≥0. Let c=h0/mK. Since cr=s(r) is a natural number for all r≥0, c is a natural number. Hence φ(h0+cr)=mK+r for all r≥0, and so φ−1(mK+r)=h0+cr, which means that
[TABLE]
Now we apply Lemma 4.2 to the isomorphism φ−1:K→H and the numerical semigroup L={0,mK,mK+1,mK+2,…}⊆K to obtain that φ−1(L)={0}∪{h0+cr: r≥0} is a numerical semigroup. Then, for some r big enough, h0+rc and h0+c(r+1) must be consecutive natural numbers, that is, h0+c(r+1)=h0+cr+1, that yields to c=1.
Therefore φ−1({mK,mK+1,mK+2,…})={h0+r: r≥0}. In particular, {h0+r: r≥0}⊆H and so mH≤h0. Then, φ(mH)≤φ(h0)=mK.
By a symmetric argument applied to the isomorphism φ−1:K→H we obtain that φ−1(mK)≤mH, so that mK≤φ(mH). Thus, we have prover that φ(mH)=mK.
Now we show that mH=mK. In fact, the restriction of φ to M={0,mH,mH+1,mH+2,…} gives an isomorphism between M and L={0,mK,mK+1,mK+2,…}, so these two numerical semigroups have the same dimension, but M has dimension mH and L has dimension mK, so that mH=mK.
By Lemma 4.1 there is only one isomorphism from M to L=M, that is indeed the identity map. The restriction φ∣M:M→M is thus the identity of M, so for all h≥mH, φ(h)=h.
Now we can show that H=K. If h∈H∖{0}, then for some m∈N+, mh>mH. Then, mφ(h)=φ(mh)=mh, and since m>0 it results that h=φ(h)∈K. This shows that H⊆K. The analog argument applied to φ−1:K→H shows the inclusion K⊆H. Thus, H=K.
∎
Note that by Lemma 4.1, if H is a numerical semigroup, then the identity map I:H→H is the only isomorphism that exists.
Corollary 4.4**.**
Every nontrivial k monoid of index 1 is isomorphic to a unique numerical semigroup. If H=⟨h1,h2,…,hr⟩ is a numerical semigroup, then a k-monoid F is isomorphic to H if and only if there exists f∈Nk∖{0k} such that F=⟨h1f,h2f,…,hrf⟩.
Proof.
The first part of the corollary follows directly from Theorem 4.3. Let H=⟨h1,h2,…,hr⟩ be a numerical semigroup. Let us assume without loss of generality that β(H)={h1,h2,…,hr} and 0<h1<h2<⋯<hr. If F is a k-monoid isomorphic to H, then there is a unique primitive g∈Nk and d1,d2,…,dr∈N+ such that d1<d2<⋯<dr and β(F)={d1g,d2g,…,drg}. If d=gcd{d1,d2,…,dr}, then F is isomomorphic to the numerical semigroup ⟨d1/d,d2/d,…,dr/d⟩. By Theorem 4.3, hj=dj/d, j=1,2,…,r. Thus, F=⟨(dh1)g,(dh2)g,…,(dhr)g⟩ and we can take f=dg. The converse is obvious.
∎