This paper introduces a novel perspective on monoids and groups by exploring the structure of binary operations on sets, revealing a duality and partitioning that deepen understanding of these algebraic objects.
Contribution
It presents a new duality framework for binary operations on sets that form monoids and groups, along with a characterization distinguishing group operations from others.
Findings
01
Duality between monoid binary operations and their induced subsets
02
Partitioning of group binary operations into isomorphic copies
03
New characterization criteria for group binary operations
Abstract
In this paper we introduce novel views of monoids and groups. More specifically, for a given set S, let SS×S be the set of binary operations on S. We equip SS×S with canonical binary operations induced by the elements of S. Let SmnS×S (respectively, SgrS×S) be the set of binary operations that make S monoids (respectively, groups). Then we have the following "duality": for each z∈SmnS×S a certain subset of SS×S, denoted by Sz∗, is a monoid with a canonical binary operation and is isomorphic to (S,z). If z∈SgrS×S, then SgrS×S can be partitioned into copies of Sz∗. We also give a new characterization of group binary operations which distinguishes them from the other binary operations. These results give us new insights into monoids and groups, and will provide new…
Equations34
SsgS×S:={z∈SS×S∣(azb)zc=az(bzc),∀a,b,c∈S}.
SsgS×S:={z∈SS×S∣(azb)zc=az(bzc),∀a,b,c∈S}.
SmnS×S:={z∈SsgS×S∣∃e∈S such that eza=a=aze,∀a∈S}.
SmnS×S:={z∈SsgS×S∣∃e∈S such that eza=a=aze,∀a∈S}.
SgrS×S:={z∈SmnS×S∣∀a∈S,∃b∈S such that bza=azb=e},
SgrS×S:={z∈SmnS×S∣∀a∈S,∃b∈S such that bza=azb=e},
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.
Taxonomy
Topicssemigroups and automata theory · Rings, Modules, and Algebras · Advanced Algebra and Logic
Full text
Structure and a duality of binary operations on monoids and groups
Masayoshi Kaneda
Department of Mathematics and Natural Sciences, College of Arts and Sciences, American University of Kuwait, P.O. Box 3323, Safat 13034 Kuwait
In this paper we introduce novel views of monoids and groups. More specifically, for a given set S, let SS×S be the set of binary operations on S. We equip SS×S with canonical binary operations induced by the elements of S. Let SmnS×S (respectively, SgrS×S) be the set of binary operations that make S monoids (respectively, groups). Then we have the following “duality”: for each z∈SmnS×S a certain subset of SS×S, denoted by Sz∗, is a monoid with a canonical binary operation and is isomorphic to (S,z). If z∈SgrS×S, then SgrS×S can be partitioned into copies of Sz∗. We also give a new characterization of group binary operations which distinguishes them from the other binary operations. These results give us new insights into monoids and groups, and will provide new tools and directions in studying these objects.
Key words and phrases. Sets with binary operations, semigroups, monoids, groups
1. Introduction and Preliminaries.
Let us recall very basic definitions. A magma is a set equipped with a binary operation. A semigroup is a magma in which its binary operation is associative. A monoid is a semigroup with a two-sided identity. A group is a monoid in which every element has a two-sided inverse. A homomorphism is a function between magmas preserving their binary operations. An isomorphism is a homomorphism which is bijective (i.e., one-to-one and onto). An automorphism is an isomorphism from a magma onto itself.
For a given set S, let us denote by SS×S the set of all binary operations on S; that is, the set of all functions from S×S to S. Each element of SS×S makes S a distinct magma if no isomorphic identification is made. In general the set SS×S is huge compared with S if S is nontrivial. Indeed, if S is a nonempty finite set, then ∣SS×S∣=∣S∣∣S∣2. Thus if ∣S∣=2, then ∣SS×S∣=16; if ∣S∣=3, then ∣SS×S∣=19683; if ∣S∣=4, then ∣SS×S∣=4294967296; so on. In this paper, however, we mostly deal with relatively small subsets of SS×S with certain properties which we shall define in what follows.
Let us denote a magma S with binary operation z∈SS×S by the ordered pair (S,z). We denote by azb∈S the image of (a,b)∈S×S by z∈SS×S.
Now we define the following subclasses of SS×S.
SsgS×S is the set of elements z∈SS×S for which (S,z) is a semigroup; that is, the binary operation z is associative:
[TABLE]
SmnS×S is the set of elements z∈SsgS×S for which (S,z) is a monoid; that is, (S,z) is a semigroup with a two-sided identity (necessarily unique):
[TABLE]
SgrS×S is the set of elements z∈SmnS×S for which (S,z) is a group; that is, (S,z) is a monoid in which every element has a two-sided inverse (necessarily unique):
[TABLE]
where e is the identity of (S,z).
Besides, we define the following.
Definition 1.1**.**
We say that an element z∈SS×S is nondegenerate if z is onto; that is, for every a∈S there exist b,c∈S such that a=bzc. We denote by SndS×S the set of all nondegenerate elements in SS×S.**
Clearly,
[TABLE]
and these sets are nonempty as long as S=∅. It is not hard to see that if ∣S∣≥2, then each inclusion is proper and neither SndS×S nor SsgS×S is included in the other. However, elements of SndS×S and SsgS×S are closely related each other. Indeed, any element of SS×S that is compatible with an element of SndS×S must be an element of SsgS×S; that is, such an element must be associative. See Proposition 2.2 (1) and Question after the proposition.
When we try to equip the set SS×S with a binary operation naturally induced by a∈S, we encounter a situation in which we must consider associativity involving more than one binary operation on S as seen in what follows.
Each element a∈S induces two canonical binary operations ^ and ˇ on SS×S:
[TABLE]
[TABLE]
Definition 1.2**.**
We say that z1∈SS×S and z2∈SS×S are compatible if z1a^z2=z1aˇz2 and z2a^z1=z2aˇz1 hold for every a∈S; that is, if the following condition, which we shall call multiple associativity or multi-associativity, holds.
[TABLE]
The compatibility is a symmetric relation; however, it is neither reflexive nor transitive unless one restricts the domain. Indeed, SsgS×S can be defined as the set of those elements in SS×S each of which is compatible with itself; thus the compatibility is reflexive on SsgS×S. Also note that the compatibility is transitive on SndS×S which follows from Lemma 2.1.
Whenever z1 and z2 are compatible, we simply write az1bz2c for (az1b)z2c or az1(bz2c) without ambiguity, and write z1a^z2 for z1aˇz2, where z1,z2∈SS×S, a,b,c∈S. In this case z1a^z2 and z1b^z2 are compatible for all a,b∈S, for (c(z1a^z2)d)(z1b^z2)f=((cz1a)z2d)z1(bz2f)=(cz1a)z2(dz1(bz2f))=c(z1a^z2)(d(z1b^z2)f),∀a,b,c,d,f∈S. In particular, z1a^z2 is compatible with itself; thus z1a^z2∈SsgS×S even if z1 or z2 is not compatible with itself.
Now we collect all the elements that are compatible with a given element z∈SS×S.
Definition 1.3**.**
For each z∈SS×S, define
[TABLE]
that is, Sz∗ is the set of all elements in SS×S that is compatible with z. We call Sz∗ the dual of S with respect to the binary operation z.**
The reason why we call Sz∗ the dual of S will become clear in Theorem 2.3 (1). Note that z∈Sz∗ if and only if z∈SsgS×S. Also note that for z1,z2∈SS×S, z1∈Sz2∗ if and only if z2∈Sz1∗ since compatibility is symmetric. However, z1∈Sz2∗ does not always imply that Sz1∗=Sz2∗ unless z1∈SgrS×S, or z2∈SgrS×S, or z1,z2∈SndS×S. This means that z1 may not be compatible with all elements of Sz2∗ even though it is compatible with z2. See Lemma 2.1, Corollary 2.5, and Example 3.1 (toward the end of the example).
The main result of this paper is Theorem 2.3. In part (1) of the theorem we show that if z∈SmnS×S, then there is a bijection ϕ from S onto Sz∗ such that the monoid (S,ϕ(a)) is isomorphic to (Sz∗,a^) via ϕ for each a∈S. Part (2) of the theorem shows that SgrS×S is partitioned into copies of Sz∗ if z∈SgrS×S. Corollary 2.5 provides a new characterization of group binary operations.
This work was motivated by the author’s precedent works [1], [2], and [3] (joint with V. I. Paulsen) in which operator algebra products are characterized using quasi-multipliers of operator spaces. That is, the operator algebra products a given operator space can be equipped with are precisely the bilinear mappings on the operator space that are implemented by contractive quasi-multipliers. The present paper is the outcome of an attempt to introduce a counterpart to quasi-multipliers in the most primitive setting in pure algebra. The elements of SS×S play roles more or less similar to the quasi-multipliers.
2. Results.
The following lemma is useful throughout this section.
Lemma 2.1**.**
Let z1∈SndS×S and z2∈SS×S. If z1∈Sz2∗, or, equivalently, z2∈Sz1∗, then Sz1∗⊆Sz2∗. Therefore, if, in addition, z2∈SndS×S, then Sz1∗=Sz2∗.
Proof.
Suppose that z1∈SndS×S, z2∈SS×S, and z1∈Sz2∗. Let z∈Sz1∗ and a,b,c∈S. Then there exist d,f∈S such that b=dz1f, so that
(azb)z2c=(az(dz1f))z2c=((azd)z1f)z2c=(azd)z1(fz2c)=az(dz1(fz2c))=az((dz1f)z2c)=az(bz2c). Similarly, (az2b)zc=az2(bzc), hence Sz1∗⊆Sz2∗.
∎
It is interesting to note in the proof above that z1 plays the role of a “catalyst” to make z and z2 compatible.
The following proposition tells us that if z∈SndS×S, then any two elements in Sz∗ are compatible (we shall refer to this property as the pairwise compatibility of the elements of Sz∗), and Sz∗ is closed under the binary operation a^ for each a∈S, and the multiple associativity works in Sz∗. That is, (Sz∗,a^) is a semigroup for each a∈S. Note, however, that z∈/Sz∗ in general as remarked after Definition 1.3. Also note that assuming z∈SndS×S is essential in the proposition since otherwise the multiple associativity in S in part (1) might not hold. See the end of Example 3.1.
Proposition 2.2**.**
Let z∈SndS×S. Then the following hold.
(1)
(Multiple Associativity in S)* (az1b)z2c=az1(bz2c),∀a,b,c∈S,∀z1,z2∈Sz∗. In particular, Sz∗⊆SsgS×S. Furthermore, if z∈/SsgS×S, then Sz∗⊆SsgS×S∖SndS×S.*
2. (2)
(Closedness of Sz∗)* If z1,z2∈Sz∗, then z1a^z2∈Sz∗,∀a∈S.*
3. (3)
(Multiple Associativity in Sz∗)* (z1a^z2)b^z3=z1a^(z2b^z3),∀z1,z2,z3∈Sz∗,∀a,b∈S.*
Proof.
(1)
Let z1,z2∈Sz∗. Then by Lemma 2.1Sz∗⊆Sz1∗ since z∈SndS×S. But z2∈Sz∗, so that z2∈Sz1∗; that is, z1 is compatible with z2. To see the last claim, assume that z∈/SsgS×S and Sz∗∩SndS×S=∅. Pick z3∈Sz∗∩SndS×S, then by Lemma 2.1Sz3∗=Sz∗, so that z∈Sz3∗=Sz∗⊆SsgS×S, a contradiction.
2. (2)
For all a,b,c,d∈S, (bzc)(z1a^z2)d=((bzc)z1a)z2d=(bz(cz1a))z2d=bz((cz1a)z2d)=bz(c(z1a^z2)d). Similarly, (b(z1a^z2)c)zd=b(z1a^z2)(czd).
3. (3)
Let a,b,c,d∈S and z1,z2,z3∈Sz∗. Then repeated use of the pairwise compatibility of elements in Sz∗ proved in part (1) yields that c((z1a^z2)b^z3)d=(c(z1a^z2)b)z3d=((cz1a)z2b)z3d=(cz1(az2b))z3d=cz1((az2b)z3d)=cz1(a(z2b^z3)d)=c(z1a^(z2b^z3))d, where in the last equality we used the fact that z2b^z3∈Sz∗, a conclusion from part (2).
∎
With reference to part (1) of the above proposition, we leave the following as open question.
Question**.**
Does Sz∗ exhaust SsgS×S∖SndS×S when z moves around in SndS×S∖SsgS×S; that is, ⋃{Sz∗∣z∈SndS×S∖SsgS×S}=SsgS×S∖SndS×S? Or, at least Sz∗∩SndS×S=∅ whenever z∈SsgS×S? **
An affirmative answer to the first part implies one to the second which says that every associative binary operation is compatible with at least one nondegenerate binary operation (which may or may not be associative).
Now we are in a position to state our main result.
Theorem 2.3**.**
Suppose that S=∅.
(1)
(Duality)* Let z0∈SmnS×S, and let e∈S be the identity of the monoid (S,z0). Then there is a bijection ϕ from S onto Sz0∗ such that ϕ(e)=z0, and for each a∈S, the semigroup (S,ϕ(a)) is isomorphic to the semigroup (Sz0∗,a^) via ϕ. In particular, (Sz0∗,e^) is a monoid with identity z0.*
2. (2)
Let z0∈SgrS×S, and let e∈S be the identity of the group (S,z0). Then, in addition to the conclusions of (1), the following hold.
(a)
Sz0∗⊆SgrS×S, and for every z∈Sz0∗, Sz∗=Sz0∗, and the group (S,z) is isomorphic to (S,z0) (hence by (1) it is also isomorphic to (Sz0∗,a^) for every a∈S).
2. (b)
Let SgrS×S(e) be the set of those elements z∈SgrS×S for which e is the identity of the group (S,z). Then SgrS×S is partitioned into SgrS×S=∐{Sz∗∣z∈SgrS×S(e)} (disjoint union).
3. (c)
Let us say that z1∈SgrS×S(e) and z2∈SgrS×S(e) are equivalent and write z1∼z2 if (S,z1) and (S,z2) are isomorphic (obviously ∼ is an equivalence relation). Let R:={zλ∣λ∈Λ} be a complete set of representatives of the equivalence classes in SgrS×S(e)/∼, where Λ is an index set, and denote the equivalence class of zλ by [zλ]. Then each element of R equips S with a distinct group structure on S, and the elements of R exhaust all the possible group structures on S. In particular, if S is a finite set, then the number of distinct group structures on S is ∣R∣(=∣Λ∣). Furthermore, let us denote by Syme(S) the group of permutations on S that fix e, and for each zλ∈R, let us say that σ1,∈Syme(S) and σ2,∈Syme(S) are zλ-equivalent*** and write σ1∼zλσ2 if σ2−1∘σ1∈Aut(S,zλ), where Aut(S,zλ) is the group of automorphisms on (S,zλ) which is a subgroup of Syme(S). Then [zλ] has the same cardinality as the quotient Syme(S)/Aut(S,zλ). In particular, if ∣S∣=n, a positive integer, then ∣[zλ]∣=∣Sn−1∣/∣Aut(S,zλ)∣=(n−1)!/∣Aut(S,zλ)∣, where Sn−1 is the symmetric group of degree n−1.*
Proof.
(1)
Define ϕ:S→Sz0∗ by ϕ(a):=z0a^z0,∀a∈S. Clearly the range is in Sz0∗ noting that z0 is compatible with itself since z0∈SmnS×S⊆SsgS×S. We shall show that this ϕ has the desired properties. It is obvious that z0=z0e^z0, so that ϕ(e)=z0. It is also easy to see that ϕ is one-to-one, for ϕ(a)=ϕ(b)(a,b∈S) yields that a=e(z0a^z0)e=eϕ(a)e=eϕ(b)e=e(z0b^z0)e=b. To see that ϕ is onto, first note that for every z∈Sz0∗ and every a,b∈S, we have that azb=az(ez0b)=(aze)z0b=((az0e)ze)z0b=(az0(eze))z0b, which implies that the value of eze completely determines z as an element of Sz0∗. When a takes all elements of S, eϕ(a)e takes all elements of S since eϕ(a)e=e(z0a^z0)e=a,∀a∈S. Thus ϕ is onto. Finally, the assertion that ϕ:(S,ϕ(a))→(Sz0∗,a^) is an isomorphism follows from dϕ(bϕ(a)c)f=(dz0((bz0a)z0c))z0f=((dz0(bz0a))z0c)z0f=(dϕ(b)a)ϕ(c)f=d(ϕ(b)a^ϕ(c))f,∀a,b,c,d,f∈S.
2. (2)
(a)
Let ϕ be as in (1) and z∈Sz0∗. Then by (1) there exists an a∈S such that z=ϕ(a). We denote the inverse of each element b∈S in the group (S,z0) by b−1. Define ψ from the group (S,z0) to the semigroup (S,z) by ψ(b):=bz0a−1,∀b∈S. It is straightforward to check that ψ is a homomorphism noting that z=z0az0, so that (S,z) is a group and Sz0∗⊆SgrS×S, hence by Lemma 2.1Sz0∗=Sz∗. It is also an easy routine work to check that ψ is one-to-one and onto; thus (S,z0) is isomorphic to (S,z). (In fact, a−1 is the identity of (S,z), and a−1z0b−1z0a−1 is the inverse of b∈S in (S,z).)
2. (b)
Suppose that z1,z2∈SgrS×S(e) and Sz1∗∩Sz2∗=∅. Pick z3∈Sz1∗∩Sz2∗ the right-hand side of which is a subset of SgrS×S by part (a), then by Lemma 2.1Sz1∗=Sz3∗=Sz2∗; that is, z1 and z2 are compatible. Therefore for all a,b∈S, az1b=az1(ez2b)=(az1e)z2b=az2b, hence z1=z2. Next let z∈SgrS×S, and let a be the identity of the group (S,z), and let e−1 be the inverse of e in (S,z). Define z4∈SsgS×S by z4:=ze−1z. Clearly, z4∈Sz∗⊆SgrS×S, hence (S,z4) is a group and z∈Sz4∗ as well. Since ez4b=eze−1zb=azb=b and similarly bz4e=b, ∀b∈S, we know that e is the identity of (S,z4), and hence z4∈SgrS×S(e).
3. (c)
We shall show the only nontrivial statement that for each zλ∈R, [zλ] has the same cardinality as Syme(S)/Aut(S,zλ). For each σ∈Syme(S) define zσ∈SS×S by σ(a)zσσ(b)=σ(azλb),∀a,b∈S. Note that this zσ is the only binary operation on S that makes σ:(S,zλ)→(S,zσ) an isomorphism. Then (S,zσ) is a group with identity σ(e)=e which is isomorphic to (S,zλ), and thus zσ∈[zλ]. Define a function φ:Syme(S)→[zλ] by φ(σ)=zσ. It is easy to see that φ is onto. Indeed, let z∈[zλ]. Then there is an isomorphism σ0∈Syme(S) from (S,zλ) onto (S,z); that is, σ0(azλb)=σ0(a)zσ0(b),∀a,b∈S. Thus z=zσ0, and hence φ is onto. Now suppose that σ1,σ2∈Syme(S) and zσ1=zσ2. Then σ1(azλb)=σ1(a)zσ1σ1(b)=σ1(a)zσ2σ1(b)=σ2(σ2−1(σ1(a)))zσ2σ2(σ2−1(σ1(b)))=σ2(σ2−1(σ1(a))zλσ2−1(σ1(b))), so that σ2−1(σ1(azλb))=σ2−1(σ1(a))zλσ2−1(σ1(b)),\linebreak∀a,b∈S, which tell us that σ2−1∘σ1∈Aut(S,zλ); that is, σ1∼zλσ2.
∎
Remark 2.4**.**
(1)
The key part in the proof of part (1) of the theorem is that the value of eze completely determines the structure of the semigroup (S,z).
2. (2)
In part (1) of the theorem Sz0∗ need not be a subset of SndS×S in general even if z0∈SmnS×S (see Example 3.1). Also it could happen that ∅=Sz1∗∩Sz2∗⊂SsgS×S∖SndS×S for z1,z2∈SmnS×S (see also Example 3.1). For these reasons SmnS×S cannot be partitioned in general in the way we did for SgrS×S in part (2a) of the theorem.
3. (3)
If we express the binary operation z0∈SmnS×S by concatenation and the new product ϕ(a) by “⋅” in the proof of (1), then b⋅c=bac for b,c∈S. This means that each binary operation in Sz0∗ can be obtained by “sandwiching” each element of S. In particular, if z0∈SgrS×S, then part (2a) of the theorem is saying that every element z∈Sz0 is “equivalent” and every element is qualified for an identity by redefining a binary operation by sandwiching.
4. (4)
In (1) (respectively, (2)) of the theorem, if S is equipped with a topology τ (the set of open sets in S), then τ∗:={{z0bz0∣b∈U}∣U∈τ} defines a topology on Sz0∗, and with this topology (S,ϕ(a)) is isomorphic to (Sz0∗,a^) as topological monoids (respectively, topological groups) via ϕ for each a∈S; that is, ϕ is a homeomorphism as well as an isomorphism.
5. (5)
Given a binary operation z∈SS×S and a permutation σ on S, the binary operation zσ defined by σ(a)zσσ(b)=σ(azb),∀a,b∈S is the only one that makes σ an isomorphism from the magma (S,z) onto the magma (S,zσ). Of course, zσ=z if and only if σ∈Aut(S,z).
6. (6)
In (2c) of the theorem Aut(S,zλ) is not a normal subgroup of Syme(S) in general. See Example 3.2.
The following corollary tells us that no element z∈/SgrS×S is compatible with any element of SgrS×S. This property distinguishes the elements of SgrS×S from the other binary operations, and provides a new characterization of group binary operations.
Corollary 2.5**.**
Let z1∈SgrS×S and z2∈SS×S. Then either Sz1∗∩Sz2∗=∅ or Sz1∗=Sz2∗ occurs.
Proof.
Suppose that Sz1∗∩Sz2∗=∅ and pick z3∈Sz1∗∩Sz2∗. By Theorem 2.3 (2a), Sz1∗⊆SgrS×S, so that z3∈SgrS×S, hence Sz1∗=Sz3∗⊆Sz2∗ by Lemma 2.1. But z3∈Sz2∗ implies that z2∈Sz3∗=Sz1∗⊆SgrS×S, so that Sz2∗⊆Sz1∗ by Lemma 2.1 again.
∎
3. Examples
Although our results in Section 2 apply to sets of any cardinalities, in this section we restrict ourselves to two simple examples of finite sets to illustrate situations in Theorem 2.3 and clarify remarks made in Sections 1 and 2. These examples provide only commutative monoids or groups, but the results in Section 2 are valid for noncommutative cases as well.
Example 3.1**.**
Let S={a,b,c}, where a, b, and c are distinct. Although ∣SS×S∣=19683, SgrS×S consists of only 3 elements, say z1, z2, and z3, which are defined by the following Cayley tables.
[TABLE]
It is easy to verify that Sz1∗=Sz2∗=Sz3∗={z1,z2,z3}=SgrS×S. The elements of S define binary operations on Sz1∗(=Sz2∗=Sz3∗) as follows.
[TABLE]
We see that (S,z1)≅(S,z2)≅(S,z3)≅(Sz1∗,a^)≅(Sz1∗,b^)≅(Sz1∗,c^) as parts (1) and (2a) of Theorem 2.3 assert. In this case SgrS×S is partitioned into only one component which is itself, and [z1]=1, which concludes the trivial fact that there is only one group structure of order 3; that is the cyclic group of order 3. In this example Syma(S)≅S2 and it is known that the automorphism group on a cyclic group of order 3 is a cyclic group of order 2, so that ∣Syma(S)∣/∣Aut(S,z1)∣=∣S2∣/2=2!/2=1 which is equal to [z1] as asserted in Theorem 2.3 (2c).
Now let z4∈SmnS×S∖SgrS×S be defined in the left table below. Then it is easy to know that Sz4∗={z4,z5,z6} referring to Remark 2.4 (1) if necessary, where z5 and z6 are also defined below.
[TABLE]
Although z4,z5∈SmnS×S, z6∈/SndS×S, which provides an example of the first statement of Remark 2.4 (2). The elements of S define binary operations on Sz4∗ as follows.
[TABLE]
We see that (S,z4)≅(Sz4∗,a^), (S,z5)≅(Sz4∗,b^), and (S,z6)≅(Sz4∗,c^) as Theorem 2.3 (1) asserts.
Next we define z7∈SmnS×S∖SgrS×S by the left table below. Then we see that Sz7∗={z7,z8,z6}, where z8 is defined by the right table below.
[TABLE]
Two distinct sets Sz4∗ and Sz7∗ with z4,z7∈SmnS×S share a common element z6∈SsgS×S∖SndS×S, which provides an example of the second statement of Remark 2.4 (2). It is not hard to see that Sz6∗ consists of all elements z of the form
[TABLE]
where each ∗ represents any element of S and different ∗’s can take different elements of S. Thus ∣Sz6∗∣=34=81, and Sz4∗⊊Sz6∗ with z4∈Sz6∗, which provides an example of a remark in the paragraph after Definition 1.3. Also note that z4 and z7 are not compatible while z4,z7∈Sz6∗, which provides an example of the remark right before Proposition 2.2.**
Example 3.2**.**
Let S:={a,b,c,d}, where a, b, c, and d are distinct. Let z1,z2,z3,z4∈SgrS×S be defined as follows.
[TABLE]
It is easy to verify that the above are all possible groups of which a is the identity, hence by Theorem 2.3 (2b) we can conclude that SgrS×S=Sz1∗⨿Sz2∗⨿Sz3∗⨿Sz4∗ (disjoint union). As one can easily verify, (S,z1)≅(S,z2)≅(S,z3) are cyclic groups of order 4, and (S,z4) is a Klein four-group, so we reconfirm the well-known fact that there are only two distinct group structures of order 4, and we have that ∣[z1]∣=3 and ∣[z4]∣=1. In this example Syma(S)≅S3. Since it is known that the automorphism group on a cyclic group of order 4 is a cyclic group of order 2, ∣Syma(S)∣/∣Aut(S,z1)∣=∣S3∣/2=3!/2=3 which is equal to ∣[z1]∣. It is also known that the automorphism group on a Klein four-group is isomorphic to the symmetric group S3, so that ∣Syma(S)∣/∣Aut(S,z4)∣=∣S3∣/∣S3∣=1 which is equal to ∣[z4]∣.
Now let σ0 be the permutation on S interchanging b and c, and let τ0 be the permutation on S interchanging b and d. Then σ0∈Syme(S), and it is easy to check that τ0∈Aut(S,z1) and that zτ0∘σ0=z3. (For the superscript notation, see the proof of Theorem 2.3 (2c).) However, for any τ∈Aut(S,z1), zσ0∘τ=z2, so zτ0∘σ0=zσ0∘τ. Since zσ is the only bilinear operation that makes σ:(S,z1)→(S,zσ) isomorphism (see also the proof of Theorem 2.3 (2c)), σ0∘τ=τ0∘σ0. Thus σ0Aut(S,z1)=Aut(S,z1)σ0, and hence Aut(S,z1) is not a normal subgroup of σ0∈Syma(S) as noted in Remark 2.4 (6).**
Bibliography3
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] M. Kaneda, Multipliers and Algebrizations of Operator Spaces , Ph.D. Thesis, University of Houston, August 2003.
2[2] M. Kaneda, Quasi-multipliers and algebrizations of an operator space, Journal of Functional Analysis 251(1) (2007), 346–359, ar Xiv:math.OA/0404376.
3[3] M. Kaneda and V. I. Paulsen, Quasi-multipliers of operator spaces, Journal of Functional Analysis 217(2) (2004), 347–365, ar Xiv:math.OA/0312501.