This paper provides explicit formulas and methods for decomposing Alexander quandles into connected components and maximal subquandles, enhancing understanding of their structure.
Contribution
It introduces a formula for connected component decomposition of Alexander quandles and describes how to decompose quandles into maximal connected subquandles.
Findings
01
Explicit decomposition formula for Alexander quandles.
02
Isomorphism characterization of connected components.
03
Method to decompose quandles into maximal connected subquandles.
Abstract
We give a formula of the connected component decomposition of the Alexander quandle: Z[t±1]/(f1(t),…,fk(t))=⨆i=0a−1Orb(i), where a=gcd(f1(1),…,fk(1)). We show that the connected component Orb(i) is isomorphic to Z[t±1]/J with an explicit ideal J. By using this, we see how a quandle is decomposed into connected components for some Alexander quandles. We introduce a decomposition of a quandle into the disjoint union of maximal connected subquandles. In some cases, this decomposition is obtained by iterating a connected component decomposition. We also discuss the maximal connected sub-multiple conjugation quandle decomposition.
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
TopicsAlgebraic structures and combinatorial models · Geometric and Algebraic Topology · semigroups and automata theory
We give a formula of the connected component decomposition of
the Alexander quandle:
Z[t±1]/(f1(t),…,fk(t))=⨆i=0a−1Orb(i),
where a=gcd(f1(1),…,fk(1)).
We show that the connected component Orb(i) is isomorphic to Z[t±1]/J
with an explicit ideal J.
By using this, we see how a quandle is decomposed into connected components
for some Alexander quandles.
We introduce a decomposition of a quandle into the disjoint union of maximal connected subquandles.
In some cases, this decomposition is obtained by iterating a connected component decomposition.
We also discuss
the maximal connected sub-multiple conjugation quandle decomposition.
Key words and phrases:
quandle, Alexander quandle, connected component decomposition
1991 Mathematics Subject Classification:
57M25, 57M27
1. Introduction
A quandle [5, 6] is an algebraic structure
whose axioms are derived from the Reidemeister moves
on oriented link diagrams.
An inner automorphism group of a quandle has
an action to the quandle naturally.
We call an orbit of the quandle
by the action its connected component,
which is a subquandle.
A quandle is said to be connected
if the action is transitive.
It is known that
all connected quandles of prime square order are
Alexander quandles [2].
Any connected component of an Alexander quandle M
is isomorphic to (1−t)M.
S. Nelson [7] proved that
two finite Alexander quandles M and N of the same cardinality are isomorphic
if and only if
(1−t)M and (1−t)N are isomorphic as modules,
and showed connectivity of some Alexander quandles.
The numbers of Alexander quandles and connected ones
are listed up to order 16 in [7, 8].
In this paper,
for any f1(t),…,fk(t)∈Z[t±1],
we show that the connected component decomposition of
the Alexander quandle Z[t±1]/(f1(t),…,fk(t))
is ⨆i=0a−1Orb(i)
and that Orb(i) is isomorphic to Z[t±1]/J
with an explicit ideal J,
where a=gcd(f1(1),…,fk(1)).
A connected subquandle has played an important roll in colorings of a knot diagram.
However
a connected component of a quandle is not a connected quandle in general.
In this paper,
we introduce a decomposition of a quandle into
the disjoint union of maximal connected subquandles,
and
show that
it is obtained by iterating a connected component decomposition
when the quandle is finite,
where we note that
the decomposition of a finite quandle
obtained by iterating a connected component decomposition
was introduced in [1, 9].
We also give examples of the decompositions of some quandles.
For example,
we concretely determine the decompositions of
the Alexander quandle Z[t±1]/(n0,t+a)
for any n0∈Z>0 and a∈Z
and the dihedral quandle Rm
for any m∈Z≥0.
We also discuss
the similar decomposition
of a multiple conjugation quandle,
which is an algebraic structure
whose axioms are derived from the Reidemeister moves
on diagrams of spatial trivalent graphs and handlebody-links.
This paper is organized as follows.
In Section 2,
we recall the definition of a quandle
and its connected components.
In Section 3,
we determine the connected component decomposition of
the Alexander quandle Z[t±1]/(f1(t),…,fk(t)).
In Section 4,
we introduce a decomposition of a quandle into
the disjoint union of maximal connected subquandles
and show that
it is obtained by iterating a connected component decomposition
when the quandle is finite.
In Section 5,
we give examples
of the maximal connected subquandle decompositions
of some quandles.
In Section 6,
we recall the definition of
a multiple conjugation quandle
and introduce its properties we use in Section 7.
In Section 7,
we discuss
the similar decomposition
of a multiple conjugation quandle.
2. A quandle
A quandleX is a non-empty set
with a binary operation ∗:X×X→X
satisfying the following axioms.
•
For any a∈X,
a∗a=a.
•
For any a∈X,
the map Sa:X→X defined by Sa(x)=x∗a is a bijection.
•
For any a,b,c∈X,
(a∗b)∗c=(a∗c)∗(b∗c).
We give some examples of quandles.
Let G be a group.
We define a binary operation ∗:G×G→G
by a∗b=b−1ab for any a,b∈G.
Then G is a quandle,
which is called a conjugation quandle
and denoted by Conj(G).
The second example is obtained from a Z[t±1]-module M.
We define a binary operation ∗:M×M→M
by a∗b=ta+(1−t)b for any a,b∈M.
Then M is a quandle,
which is called an Alexander quandle.
The third example is a dihedral quandleRm:=Z/mZ
for any m∈Z≥0.
We define a binary operation ∗:Rm×Rm→Rm
by a∗b=2b−a for any a,b∈Rm.
Then Rm is a quandle.
Let (X,∗) be a quandle.
In this paper,
we write a1∗a2∗⋯∗an
for (⋯((a1∗a2)∗a3)∗⋯∗an) simply.
For any a∈X and n∈Z≥0,
San:X→X and Sa−n:X→X
are n-th functional powers of Sa and Sa−1 respectively.
For any a,b∈X and n∈Z,
we define a binary operation ∗n:X×X→X
by a∗nb=Sbn(a).
Then (X,∗n) is also a quandle.
We define the type of X
by the minimal number of n
satisfying a∗nb=a for any a,b∈X.
Let (X,∗X) and (Y,∗Y) be quandles.
A homomorphismϕ:X→Y is a map from X to Y
satisfying ϕ(x∗Xy)=ϕ(x)∗Yϕ(y) for any x,y∈X.
We call a bijective homomorphism an isomorphism.
X and Y are isomorphic,
denoted X≅Y,
if there exists an isomorphism from X to Y.
We call an isomorphism from X to X an automorphism of X.
For any a∈X and n∈Z,
the map San:X→X is an automorphism of X.
Let (X,∗) be a quandle.
A non-empty subset Y of X is called a subquandle of X
if Y itself is a quandle under ∗.
For any subset Y of X,
Y is a subquandle of X
if and only if
a∗b,a∗−1b∈Y for any a,b∈Y.
For any subset A of X,
the minimal subquandle of X including A,
denoted by ⟨A⟩,
is called the subquandle generated by A,
that is,
[TABLE]
Let X be a quandle.
All automorphisms of X form a group
under composition of morphisms: f⋅g:=g∘f.
This group is called the automorphism group of X
and denoted by Aut(X).
For a subset A of X,
we denote by Inn(A)
a subgroup of Aut(X) generated by {Sa∣a∈A}.
In particular, Inn(X) is called the inner automorphism group of X.
For any a∈X and g∈Inn(A),
we define an action of Inn(A) on X
by a⋅g=g(a).
We say that X is a connected quandle
when the action is transitive.
In general,
an orbit of X by the action is called
a connected component of X
or
an orbit of X simply,
and X=⨆i∈IXi is called
the connected component decomposition of X
when Xi is a connected component of X for any i∈I.
In general, a connected component of X is a subquandle of X.
We denote by OrbX(a) or Orb(a)
the orbit of X containing a.
Example 1**.**
For any group G,
a connected component of Conj(G)
coincides with one of conjugacy classes of G.
In the following,
we give a well-known fact with a proof.
Lemma 1**.**
Let M be an Alexander quandle.
Then any connected component of M
is isomorphic to (1−t)M.
Proof.
Since 0∗x=(1−t)x for any x∈M,
it follows that (1−t)M⊂Orb(0).
On the other hand,
for any z∈Orb(0),
there exist y1,…,yn∈M
such that z=0∗y1∗y2∗⋯∗yn=(1−t)y1∗y2∗⋯∗yn.
Since for any x,y∈M,
(1−t)x∗y=t(1−t)x+(1−t)y=(1−t)(tx+y),
we have z∈(1−t)M,
that is, (1−t)M⊃Orb(0).
Therefore (1−t)M=Orb(0).
Next, we define the map ϕa:Orb(0)→Orb(a)
by ϕa(x)=x+a for any a∈M.
For any (1−t)x∈Orb(0) and a∈M,
ϕa((1−t)x)=(1−t)x+a=ta+(1−t)(x+a)=a∗(x+a)∈Orb(a).
Hence ϕa is well-defined.
For any x,y∈Orb(0) and a∈M,
ϕa(x∗y)=(tx+(1−t)y)+a=t(x+a)+(1−t)(y+a)=ϕa(x)∗ϕa(y).
Hence ϕa is a homomorphism.
Similarly, the map ψa:Orb(a)→Orb(0)
defined by ψa(x)=x−a is a homomorphism
for any a∈M.
Since ϕa∘ψa=idOrb(a)
and ψa∘ϕa=idOrb(0),
ϕa is an isomorphism.
Therefore Orb(0) and Orb(a) are isomorphic for any a∈M.
∎
3. The connected component decomposition of an Alexander quandle
In this section, we show that the connected component decomposition of
the Alexander quandle Z[t±1]/(f1(t),f2(t),…,fk(t))
is ⨆i=0a−1Orb(i), where (f1(t),f2(t),…,fk(t))
is an ideal of Z[t±1]
generated by Laurent polynomials f1(t),f2(t),…,fk(t)∈Z[t±1],
and a=gcd(f1(1),f2(1),…,fk(1)).
Furthermore, we determine the form of all connected components of
Z[t±1]/(f1(t),f2(t),…,fk(t)).
For any α(t)∈Z[t±1],
we define Cα(t) by
[TABLE]
Then for any [α(t)]∈Z[t±1]/(f1(t),f2(t),…,fk(t)),
C[α(t)]:=Cα(t) is well-defined.
In this paper,
we often write α(t) for [α(t)]∈Z[t±1]/(f1(t),f2(t),…,fk(t)) simply.
For any D⊂Z[t±1],
we define D(1)
by D(1)={g(1)∣g(t)∈D}⊂Z.
It is easy to see that
[TABLE]
for any [α(t)]∈Z[t±1]/(f1(t),f2(t),…,fk(t)).
Lemma 2**.**
For any elements [α(t)] and [β(t)]
of the Alexander quandle Z[t±1]/(f1(t),f2(t),…,fk(t)),
it follows that
C[α(t)]∗[β(t)](1)=C[α(t)](1).
Proof.
Since [α(t)]∗[β(t)]=[tα(t)+(1−t)β(t)],
we have
[TABLE]
∎
Lemma 3**.**
For any elements [α(t)] and [β(t)]
of the Alexander quandle Z[t±1]/(f1(t),f2(t),…,fk(t)),
it follows that
C[α(t)](1)=C[β(t)](1) if and only if Orb([α(t)])=Orb([β(t)]).
Proof.
Suppose that C[α(t)](1)=C[β(t)](1).
Then we have
[TABLE]
Hence there exist l1,l2,…,lk∈Z such that
α(1)=β(1)+l1f1(1)+l2f2(1)+⋯+lkfk(1).
We put α(t) and β(t)
by α(t)=(1−t)α(t)+α(1)
and β(t)=(1−t)β(t)+β(1) respectively.
We also put fi(t)
by fi(t)=(1−t)fi(t)+fi(1) for any i=1,2,…,k
and γ(t):=β(t)+β(1)−tα(t)+∑i=1klitfi(t).
Since [∑i=1klitfi(t)]=[0]
in Z[t±1]/(f1(t),f2(t),…,fk(t)),
we have
[TABLE]
Hence [α(t)]∗[γ(t)]=[tα(t)+(1−t)γ(t)]=[β(t)],
which implies Orb([α(t)])=Orb([β(t)]).
Next, suppose that Orb([α(t)])=Orb([β(t)]).
There exist [γ1(t)],[γ2(t)],…,[γl(t)]∈Z[t±1]/(f1(t),f2(t),…,fk(t))
and ϵ1,ϵ2,…,ϵl∈Z such that
[α(t)]∗ϵ1[γ1(t)]∗ϵ2⋯∗ϵl[γl(t)]=[β(t)].
By Lemma 2, we have C[α(t)](1)=C[β(t)](1).
∎
Then we have the following lemma.
Lemma 4**.**
For any elements [α(t)] and [β(t)]
of the Alexander quandle Z[t±1]/(f1(t),f2(t),…,fk(t)),
it follows that
Orb([α(t)])=Orb([β(t)])
if and only if
α(1)≡β(1)moda,
where a=gcd(f1(1),f2(1),…,fk(1)).
Proof.
Suppose that Orb([α(t)])=Orb([β(t)]).
By Lemma 3,
C[α(t)](1)=C[β(t)](1).
Since f1(1)Z+f2(1)Z+⋯+fk(1)Z=aZ,
we have
[TABLE]
Hence we obtain α(1)≡β(1)moda.
On the other hand,
suppose that α(1)≡β(1)moda.
Since f1(1)Z+f2(1)Z+⋯+fk(1)Z=aZ,
we have
Let M be the Alexander quandle
Z[t±1]/(f1(t),f2(t),…,fk(t))
and let a=gcd(f1(1),f2(1),…,fk(1)).
Then the following hold.
(1)
The connected component decomposition of M is given by
[TABLE]
where
[TABLE]
2. (2)
For any j=0,1,…,a−1,
it follows that
[TABLE]
where we define fi(t)
by fi(t)=(1−t)fi(t)+fi(1)
for any i=1,2,…,k,
and
I={∑i=1kaifi(t)∣ai∈Z[t±1],∑i=1kaifi(1)=0}.
Proof.
(1)
By Lemma 4,
M=⨆i=0a−1Orb(i) is the connected component decomposition of M, and we have
Orb(i)={[g(t)]∣g(t)∈Z[t±1],g(1)≡imoda} immediately.
There exist g(t)∈Z[t±1] and j∈Z such that g(t)=g(1)+(1−t)g(t)=i+(1−t)g(t)+aj
if and only if g(1)≡imoda.
Hence we have
Orb(i)={[i+(1−t)g(t)+aj]∣g(t)∈Z[t±1],j∈Z}.
2. (2)
Let J=(f1(t),f2(t),…,fk(t)).
We define the Z[t±1]-homomorphism
ϕ:Z[t±1]→(1−t)M
by ϕ(x)=(1−t)x+J.
It is clear that J⊂ker(ϕ).
For any
∑i=1kaifi(t)∈I,
we have
[TABLE]
which implies that I⊂ker(ϕ).
Hence we obtain J+I⊂ker(ϕ).
On the other hand, let g(t)∈ker(ϕ).
Since ϕ(g(t))=(1−t)g(t)+J=J,
there exist h1(t),h2(t),…,hk(t)∈Z[t±1]
such that (1−t)g(t)=∑i=1khi(t)fi(t).
When we put t=1,
we have 0=∑i=1khi(1)fi(1).
For any i=1,2,…,k,
we define hi(t) by hi(t)=(1−t)hi(t)+hi(1).
Since ∑i=1khi(1)fi(1)=0,
we have
[TABLE]
Hence we have
g(t)=∑i=1khi(t)fi(t)+∑i=1khi(1)fi(t).
Since ∑i=1khi(1)fi(1)=0,
we have
∑i=1khi(1)fi(t)∈I,
that is, g(t)∈J+I.
Hence we obtain J+I⊃ker(ϕ).
Obviously, ϕ is a surjection.
By the homomorphism theorem,
ϕ:Z[t±1]/(J+I)→(1−t)M
is a Z[t±1]-isomorphism,
which is
an isomorphism as quandles.
By Lemma 1,
it follows that
Orb(j)≅Z[t±1]/((f1(t),f2(t),…,fk(t))+I)
for any j=0,1,…,a−1.
∎
By Theorem 1,
we obtain the following corollaries,
where we note that
the dihedral quandle Rm is isomorphic to
the Alexander quandle Z[t±1]/(m,t+1)
for any m∈Z≥0.
Corollary 1**.**
For any m∈Z>0,
Rm is a connected dihedral quandle
if and only if
m is an odd number.
Furthermore,
when m is an even number,
Rm=Orb(0)⊔Orb(1)={0,2,…,m−2}⊔{1,3,…,m−1} is
the connected component decomposition of Rm.
Corollary 2**.**
Let f1(t),f2(t),…,fk(t)∈Z[t±1].
Then the Alexander quandle
Z[t±1]/(f1(t),f2(t),…,fk(t))
is connected
if and only if
gcd(f1(1),f2(1),…,fk(1))=1.
For example,
the tetrahedral quandle Z[t±1]/(2,t2+t+1) is connected
by Corollary 2.
Corollary 3**.**
Let a,m∈Z and let n=m/gcd(m,1+a).
Then any connected component of the Alexander quandle Z[t±1]/(m,t+a)
is isomorphic to Z[t±1]/(n,t+a).
Proof.
By Theorem 1,
any connected component of Z[t±1]/(m,t+a)
is isomorphic to Z[t±1]/((m,t+a)+I),
where I={−a2∣a1,a2∈Z[t±1],a1m+a2(1+a)=0}.
For any −x2∈I,
there exists x1∈Z[t±1]
such that x1m+x2(1+a)=0.
Then we have x1n+x2(1+a)/gcd(m,1+a)=0.
Since n and (1+a)/gcd(m,1+a) are relatively prime, x2 is devisible by n.
Hence we obtain I⊂nZ[t±1].
On the other hand,
for any x2=ns∈nZ[t±1],
there exists x1=−s(1+a)/gcd(m,1+a)∈Z[t±1]
such that x1m+x2(1+a)=0.
Hence −x2∈I,
that is, I⊃nZ[t±1].
Therefore I=nZ[t±1].
Since m is divisible by n,
we have
Z[t±1]/((m,t+a)+I)=Z[t±1]/(m,n,t+a)=Z[t±1]/(n,t+a).
∎
Corollary 4**.**
If m is an even number,
then any connected component of Rm is isomorphic to Rm/2.
4. The maximal connected subquandle decomposition
In this section, we consider a decomposition of a quandle into
the disjoint union of maximal connected subquandles,
and
show that
it is uniquely obtained by iterating a connected component decomposition
when the quandle is finite.
We remark that
{(1,2,3),(1,3,2)} is a connected component of Conj(S3),
but not a connected subquandle of it,
where S3 is a symmetric group of degree 3.
Let X be a quandle and let A be a connected subquandle of X.
We say that A is a maximal connected subquandle of X
when any connected subquandle of X including A is only A.
We say that
X=⨆i∈IAi is
the maximal connected subquandle decomposition of X
when each Ai is a maximal connected subquandle of X.
Let X be a quandle and let A be a subset of X.
For any a,b∈X,
we write a∼Ab
when there exists f∈Inn(A) such that f(a)=b.
It is an equivalence relation on X.
It is easy to see that
a∼Ab if and only if
there exist a1,a2,…,an∈A and k1,k2,…,kn∈Z
such that a∗k1a1∗k2⋯∗knan=b.
Furthermore X is a connected quandle
if and only if a∼Xb for any a,b∈X.
Lemma 5**.**
Let X be a quandle
and let Ai be connected subquandles of X for any i∈I.
If ⋂i∈IAi=∅,
then ⟨⋃i∈IAi⟩ is a connected subquandle of X.
Proof.
Let A=⋃i∈IAi,
and suppose that ⋂i∈IAi=∅.
For any x,y∈⟨A⟩,
there exist a,b∈A
such that x∼Aa and y∼Ab.
For any c∈⋂i∈IAi,
we have a∼Ac and b∼Ac.
Hence we have
a∼Ab, which implies that x∼Ay.
Therefore
x∼⟨A⟩y, that is,
⟨A⟩ is a connected subquandle of X.
∎
Lemma 6**.**
Let X be a quandle
and let A1 and A2 be maximal connected subquandles of X.
If A1∩A2=∅,
then A1=A2.
Proof.
Suppose that A1∩A2=∅.
By Lemma 5,
⟨A1∪A2⟩ is a connected subquandle of X.
Since A1 and A2 are included in ⟨A1∪A2⟩
and maximal connected subquandles of X,
we obtain ⟨A1∪A2⟩=A1=A2.
∎
Theorem 2**.**
Any quandle has the unique maximal connected subquandle decomposition.
Proof.
Let X be a quandle.
For any a∈X,
we define [a]:=⋃a∈WW,
where W is a connected subquandle of X.
By Lemma 5,
⟨[a]⟩ is a connected subquandle of X.
Suppose that A is a connected subquandle of X
including ⟨[a]⟩.
Since A contains a,
we have A⊂[a], that is, A=[a]=⟨[a]⟩.
Hence [a] is a maximal connected subquandle of X.
For any a,b∈X,
we have [a]∩[b]=∅
or [a]=[b] by Lemma 6.
Therefore there exists a subset Y of X
such that X=⨆a∈Y[a].
It is the maximal connected subquandle decomposition of X.
Next, we show the uniqueness.
Let B be a maximal connected subquandle of X=⨆a∈Y[a].
Then there exists a′∈Y
such that B∩[a′]=∅.
By Lemma 6,
we have B=[a′].
Therefore X has the unique maximal connected subquandle decomposition.
∎
For a quandle X,
it is easy to see that
any connected subquandle of X
is included in some connected component of X.
Therefore
if a connected component of X is
a connected subquandle of X,
then it is a maximal connected subquandle of X.
Let X be a quandle
and let PQnd(X) be the set of all subquandles of X.
For any A⊂PQnd(X),
we define D(A):=⋃A∈A{OrbA(a)∣a∈A}.
It is easy to see that
⋃A∈AA=⋃A∈D(A)A.
We put D0(A):=A and
Dk+1(A):=D(Dk(A)) for any k∈Z≥0.
Theorem 3**.**
Let X be a quandle.
If there exists n∈Z≥0
such that Dn({X})=Dn+1({X}),
then X=⨆A∈Dn({X})A is
the maximal connected subquandle decomposition of X.
In particular,
if X is a finite quandle,
then there exists n∈Z≥0
such that X=⨆A∈Dn({X})A is
the maximal connected subquandle decomposition of X.
Proof.
Suppose that there exists n∈Z≥0
such that Dn({X})=Dn+1({X}).
For any A∈Dn({X}),
A has only one orbit A,
that is, A is a connected subquandle of X.
Let Y be a connected subquandle of X including A
and let X0=X.
Then
there exists an orbit of X0 including Y.
We denote by X1∈D1({X}) the orbit.
For any i∈Z≥0,
we denote by Xi+1∈Di+1({X})
an orbit of Xi including Y inductively.
Then we have A⊂Y⊂Xn.
Since A,Xn∈Dn({X}),
we have A=Y=Xn.
Therefore A is the maximal connected subquandle of X,
and X=⨆A∈Dn({X})A is
the maximal connected subquandle decomposition of X.
Next, let X be a finite quandle.
For any i∈Z≥0,
we have #Di({X})≤#Di+1({X})≤#X.
Since #X is finite,
there exists n∈Z≥0
such that #Dn({X})=#Dn+1({X}),
which implies that Dn({X})=Dn+1({X}).
Therefore X=⨆A∈Dn({X})A is
the maximal connected subquandle decomposition of X.
∎
By Lemma 1 and Theorem 3,
the following corollary holds immediately.
Corollary 5**.**
All maximal connected subquandles of
a finite Alexander quandle
are isomorphic.
For a quandle X,
we denote by 0pt(X) the minimal number of n
satisfying X=⨆A∈Dn({X})A is
the maximal connected subquandle decomposition of X.
It is called the subquandle depth of X in [9].
Obviously, X is a connected quandle
if and only if 0pt(X)=0.
5. Examples of the maximal connected subquandle decomposition
In this section,
we give examples
of the maximal connected subquandle decompositions of some quandles.
Let Sn be a symmetric group of degree n.
We consider connectivity of Conj(Sn).
By Example 1,
a connected component of Conj(Sn) coincides with one of conjugacy classes of Sn.
We denote by C(a) the conjugacy class of Sn containing a.
We note that
two elements of Sn are conjugate if and only if their cyclic types coincide.
Example 2**.**
(1)
We show that the maximal connected subquandle decomposition of S3 is
[TABLE]
S3=C((123))⊔C((12))⊔C(e)*
is the connected component decomposition of S3.
Furthermore,
C((12)) and C(e) are connected quandles,
and
C((123))={(123)}⊔{(132)}
is the connected component decomposition of C((123)).
Therefore*
[TABLE]
is the maximal connected subquandle decomposition of S3,
and we have 0pt(S3)=2.
2. (2)
We show that the maximal connected subquandle decomposition of S4 is
[TABLE]
S4=C((1234))⊔C((123))⊔C((12)(34))⊔C((12))⊔C(e)*
is the connected component decomposition of S4.
Furthermore, C((1234)), C((12)) and C(e) are connected quandles,
and C((123))={(123),(142),(134),(243)}⊔{(132),(124),(143),(234)}
and C((12)(34))={(12)(34)}⊔{(13)(24)}⊔{(14)(23)} are
the connected component decompositions of C((123)) and C((12)(34)) respectively.
Since any connected component of C((123)) and C((12)(34)) is connected,*
[TABLE]
*is the maximal connected subquandle decomposition of S4,
and we have 0pt(S4)=2.
*
Example 3**.**
We show that
the maximal connected subquandle decomposition of
the dihedral quandle R0 is
[TABLE]
We note that
R0 is isomorphic to
the Alexander quandle Z[t±1]/(t+1).
By Theorem 1,
the connected component decomposition of R0 is
[TABLE]
Since
each connected component is isomorphic to R0
by Corollary 4,
we have
Dn({R0})={{2nj+i∣j∈Z}∣i=0,1,…,2n−1}
for any n∈Z≥0
by iterating a connected component decomposition.
Hence for any a,b∈R0,
there exists l∈Z>0 such that
a and b are in distinct elements of Dl({R0}).
Since any connected subquandle is included in a connected component,
any connected subquandle of R0 is included in an element of Dl({R0}).
Therefore
a and b are in distinct maximal connected subquandles of R0,
which implies that
R0=⨆i∈Z{i}
is the maximal connected subquandle decomposition of R0,
and 0pt(R0)=∞.
Example 4**.**
We consider the maximal connected subquandle decomposition
of the Alexander quandle Z[t±1]/(6,t2+t+1).
Since gcd(6,12+1+1)=3,
Z[t±1]/(6,t2+t+1)=Orb(0)⊔Orb(1)⊔Orb(2)
is the connected component decomposition of Z[t±1]/(6,t2+t+1),
and
Next,
by Theorem 1,
for any i=0,1,2,
Orb(i) is isomorphic to Z[t±1]/((6,t2+t+1)+I),
where
[TABLE]
which implies that
Z[t±1]/((6,t2+t+1)+I)=Z[t±1]/(6,2(t+2),t2+t+1).
By Theorem 1,
we obtain that
[TABLE]
is the connected component decomposition of Z[t±1]/(6,2(t+2),t2+t+1).
By the proof of Theorem 1,
the map ϕ:Z[t±1]/(6,2(t+2),t2+t+1)→(1−t)(Z[t±1]/(6,t2+t+1))
defined by ϕ(x)=(1−t)x
is an isomorphism.
Hence, by the proof of Lemma 1,
[TABLE]
is the connected component decomposition of Orb(0).
Furthermore,
for any i=1,2,
the map ϕi:Orb(0)→Orb(i)
defined by ϕi(x)=x+i
is an isomorphism
by the proof of Lemma 1.
Therefore
[TABLE]
and
[TABLE]
are the connected component decompositions of
Orb(1) and Orb(2) respectively.
Finally,
by Theorem 1,
any connected component of Z[t±1]/(6,2(t+2),t2+t+1)
is isomorphic to Z[t±1]/((6,2(t+2),t2+t+1)+I′),
where
[TABLE]
which implies that
Z[t±1]/((6,2(t+2),t2+t+1)+I′)=Z[t±1]/(2,t2+t+1).
By Corollary 2,
Z[t±1]/(2,t2+t+1) is a connected quandle.
Therefore
[TABLE]
is the maximal connected subquandle decomposition of Z[t±1]/(6,t2+t+1),
and we obtain that 0pt(Z[t±1]/(6,t2+t+1))=2.
Proposition 1**.**
Let n0∈Z>0,
a∈Z
and put
ni+1:=ni/gcd(ni,1+a) for any i∈Z≥0.
Let l be the minimal number satisfying nl=nl+1.
Then
the Alexander quandle Z[t±1]/(n0,t+a) is decomposed into
N maximal connected subquandles,
where N=∏i=0l−1gcd(ni,1+a), and
any maximal connected subquandle of Z[t±1]/(n0,t+a)
is isomorphic to Z[t±1]/(nl,t+a).
Proof.
By Theorem 1,
for any i∈Zi≥0,
Z[t±1]/(ni,t+a) is decomposed into
gcd(ni,1+a) maximal connected subquandles,
and any maximal connected subquandle of Z[t±1]/(ni,t+a)
is isomorphic to Z[t±1]/(ni+1,t+a).
Hence for any i∈Z>0,
any element of Di({Z[t±1]/(n0,t+a)})
is isomorphic to Z[t±1]/(ni,t+a),
and we have
#Di({Z[t±1]/(n0,t+a)})=∏j=0i−1gcd(nj,1+a).
By Corollary 2,
nk=nk+1, that is, gcd(nk,1+a)=1
if and only if
Dk({Z[t±1]/(n0,t+a)})=Dk+1({Z[t±1]/(n0,t+a)}).
Hence l is the minimal number satisfying nl=nl+1
if and only if 0pt(Z[t±1]/(n0,t+a))=l.
By Theorem 3,
Z[t±1]/(n0,t+a)=⨆C∈Dl({Z[t±1]/(n0,t+a)})C is
the maximal connected subquandle decomposition of Z[t±1]/(n0,t+a).
Since N=∏i=0l−1gcd(ni,1+a)=#Dl({Z[t±1]/(n0,t+a)}),
Z[t±1]/(n0,t+a) is decomposed into
N maximal connected subquandles, and
any maximal connected subquandle of Z[t±1]/(n0,t+a)
is isomorphic to Z[t±1]/(nl,t+a).
∎
In Proposition 1,
if 1+a is a prime number,
Z[t±1]/(n0,t+a) is decomposed into
∣1+a∣l maximal connected subquandles, and
any maximal connected subquandle of Z[t±1]/(n0,t+a)
is isomorphic to Z[t±1]/(k,t+a),
where n0=k(1+a)l
such that k and 1+a are relatively prime integers.
For any m∈Z>0,
the dihedral quandle Rm is decomposed into 2l maximal connected subquandles,
and any maximal connected subquandle of Rm is
isomorphic to Rk, and 0pt(Rm)=l,
where k is an odd number, and l∈Z>0
such that m=2lk.
6. A multiple conjugation quandle and a G-family of quandles
We recall the definition of a multiple conjugation quandle [4].
Definition 1**.**
A multiple conjugation quandleX
is a disjoint union of groups Gλ(λ∈Λ)
with a binary operation ∗:X×X→X
satisfying the following axioms.
•
For any a,b∈Gλ,
a∗b=b−1ab.
•
For any x∈X and a,b∈Gλ,
x∗eλ=x and x∗(ab)=(x∗a)∗b,
where eλ is the identity of Gλ.
•
For any x,y,z∈X,
(x∗y)∗z=(x∗z)∗(y∗z).
•
For any x∈X and a,b∈Gλ,
(ab)∗x=(a∗x)(b∗x),
where a∗x,b∗x∈Gμ for some μ∈Λ.
Let X=⨆λ∈ΛGλ
be a multiple conjugation quandle.
In this paper,
we write a1∗a2∗⋯∗an for (⋯((a1∗a2∗)∗a3)∗⋯∗an) simply
and
denote by Ga the group Gλ containing a∈X.
we also denote by eλ the identity of Gλ.
Then the identity of Ga is denoted by ea for any a∈X.
For any a,b∈X,
we define a map Sa:X→X by Sa(x)=x∗a
and
a binary operation ∗−1:X×X→X by a∗−1b=Sb−1(a).
Let X=⨆λ∈ΛGλ,Y=⨆μ∈MGμ and
(X,∗X),(Y,∗Y) be multiple conjugation quandles.
A homomorphismϕ:X→Y is a map
from X to Y satisfying ϕ(x∗Xy)=ϕ(x)∗Yϕ(y) for any x,y∈X
and ϕ(ab)=ϕ(a)ϕ(b) for any λ∈Λ and a,b∈Gλ.
We call a bijective homomorphism an isomorphism.
X and Y are isomorphic,
denoted by X≅Y,
if there exists an isomorphism from X to Y.
We call an isomorphism from X to X an automorphism of X.
For any a∈X,
the map Sa is an automorphism of X.
Let (X,∗) be a multiple conjugation quandle.
A non-empty subset Y of X is called
a sub-multiple conjugation quandle of X
if Y itself is a multiple conjugation quandle
under ∗ and the group operations of X.
Proposition 2**.**
Let X=⨆λ∈ΛGλ be a multiple conjugation quandle
and let Y be a non-empty subset of X.
Then the following are equivalent.
(1)
Y* is a sub-multiple conjugation quandle of X.*
2. (2)
For any a,b∈Y, a∗b∈Y,
and Y∩Gλ is a subgroup of Gλ or empty set
for any λ∈Λ.
3. (3)
For any a,b∈Y, a∗b∈Y,
and there exists a subset Λ′⊂Λ such that
Y=⨆λ∈Λ′Hλ,
where Hλ is a subgroup of Gλ for any λ∈Λ′.
Proof.
First suppose that it satisfies (1).
Then a∗b∈Y for any a,b∈Y
and Y=⨆μ∈Λ′Hμ,
where Hμ is a group for any μ∈Λ′.
For any μ∈Λ′,
there uniquely exists λ∈Λ
such that Hμ is a subgroup of Gλ.
Then we again write Hλ for Hμ.
Since Hλ∩Hλ′=∅(λ=λ′)
for any λ,λ′∈Λ′,
we have Y∩Gλ=Hλ.
Hence Hλ is a subgroup of Gλ for any λ∈Λ′,
and we have Λ′⊂Λ.
Therefore it satisfies (3).
Second suppose that it satisfies (3).
Since Gλ∩Gλ′=∅
and Hμ∩Hμ′=∅
when λ=λ′ and μ=μ′
for any λ,λ′∈Λ and μ,μ′∈Λ′,
we have Y∩Gμ=Hμ for any μ∈Λ′
and Y∩Gλ=∅ for any λ∈Λ−Λ′.
Therefore it satisfies (2).
Finally suppose that it satisfies (2).
Let Λ′:={λ∈Λ∣Y∩Gλ=∅}.
Since Gλ∩Gλ′=∅
when λ=λ′
for any λ,λ′∈Λ,
we have Y=⨆λ∈Λ′(Y∩Gλ),
where Y∩Gλ is a subgroup of Gλ
for any λ∈Λ′.
Y clearly satisfies the axioms of a multiple conjugation quandle.
Therefore it satisfies (1).
∎
Let X=⨆λ∈ΛGλ be a multiple conjugation quandle
and let A be a subset of X.
Then the minimal sub-multiple conjugation qundle of X including A,
denote by ⟨A⟩MCQ,
is called the sub-multiple conjugation quandle generated by A.
We recall the definition of a G-family of quandles [3].
Definition 2**.**
Let G be a group with the identity element e.
A G-family of quandles is a non-empty set X
with a family of binary operations ∗g:X×X→X(g∈G)
satisfying the following axioms.
•
For any x∈X and g∈G,
x∗gx=x.
•
For any x,y∈X and g,h∈G,
x∗ghy=(x∗gy)∗hy and x∗ey=x.
•
For any x,y,z∈X and g,h∈G,
(x∗gy)∗hz=(x∗hz)∗h−1gh(y∗hz).
Let (X,∗) be a quandle and let m be the type of X.
Then (X,{∗i}i∈Zkm) (resp. (X,{∗i}i∈Z))
is a Zkm (resp. Z)-family of quandles
for any k∈Z>0.
Let (X,{∗g}g∈G) be a G-family of quandles.
Then ⨆x∈X{x}×G is a multiple conjugation quandle
with
[TABLE]
for any x,y∈X and g,h∈G.
We call it the associated multiple conjugation quandle
of (X,{∗g}g∈G).
7. The maximal connected sub-multiple conjugation quandle decomposition
In this section, we consider a decomposition of a multiple conjugation quandle into
the disjoint union of maximal connected sub-multiple conjugation quandles,
and
show that
it is uniquely obtained by iterating a connected component decomposition
when the multiple conjugation quandle is the finite disjoint union of groups.
Let X=⨆λ∈ΛGλ
which is a multiple conjugation quandle.
All automorphisms of X form a group
under composition of morphisms: f⋅g:=g∘f.
This group is called the automorphism group of X
and denoted by Aut(X).
For a subset A of X,
we denote by Inn(A)
a subgroup of Aut(X) generated by {Sa∣a∈A}.
In particular, Inn(X) is called the inner automorphism group of X.
For any λ∈Λ and g∈Inn(A),
we define an action of Inn(A) on Λ
by eλ⋅g=g(eλ).
We say that X is a connected multiple conjugation quandle
when the action is transitive.
In this paper,
we call an orbit of Λ by the action
an orbit of Λ simply
and Λ=⨆i∈IΛi
the orbit decomposition of Λ
when Λi is an orbit of Λ for any i∈I.
We denote by OrbΛ(λ) or Orb(λ)
the orbit of Λ containing λ.
In general, for any orbit Λ′ of Λ,
⨆λ∈Λ′Gλ is
a sub-multiple conjugation quandle of X
and called a connected component of X.
However ⨆λ∈Λ′Gλ is not
a connected sub-multiple conjugation quandle of X in general.
Proposition 4**.**
Let X be a quandle, Y be a subquandle of X, m be the type of X
and let ⨆x∈X{x}×Zm be
the associated multiple conjugation quandle
of a Zm-family of quandles (X,{∗i}i∈Zm).
Then Y is a connected component of X
if and only if
⨆x∈Y{x}×Zm is
a connected component of ⨆x∈X{x}×Zm.
Proof.
Suppose that
for any a,b∈Y,
there exists
f∈Inn(X)
such that f(a)=b.
Then
for any (a,0),(b,0)∈⨆x∈Y{x}×Zm,
there exists
f=Sxnkn∘⋯∘Sx2k2∘Sx1k1∈Inn(X)
such that f(a)=b.
Hence there exists
g=S(xn,kn)∘⋯∘S(x2,k2)∘S(x1,k1)∈Inn(⨆x∈X{x}×Zm)
such that g((a,0))=(b,0).
On the other hand,
suppose that
for any a,b∈Y,
there exists
g∈Inn(⨆x∈X{x}×Zm)
such that g((a,0))=(b,0).
Then
for any a,b∈Y,
there exists
g=S(xn,kn)in∘⋯∘S(x2,k2)i2∘S(x1,k1)i1∈Inn(⨆x∈X{x}×Zm)
such that g((a,0))=(b,0).
Hence there exists
f=Sxninkn∘⋯∘Sx2i2k2∘Sx1i1k1∈Inn(X)
such that f(a)=b.
Therefore Y is a connected component of X
if and only if
⨆x∈Y{x}×Zm is a connected component
of ⨆x∈X{x}×Zm.
∎
By Proposition 4,
we obtain the following corollary immediately.
Corollary 7**.**
Let X be a quandle, m be the type of X
and let ⨆x∈X{x}×Zm be
the associated multiple conjugation quandle
of a Zm-family of quandles (X,{∗i}i∈Zm).
Then X is a connected quandle
if and only if
⨆x∈X{x}×Zm is
a connected multiple conjugation quandle.
Let X
be a multiple conjugation quandle
and let A be a connected sub-multiple conjugation quandle of X.
We say that A is a maximal connected sub-multiple conjugation quandle of X
when any connected sub-multiple conjugation quandle of X
including A is only A.
We say that
X=⨆i∈IAi is
the maximal connected sub-multiple conjugation quandle decomposition of X
when each Ai is a maximal connected sub-multiple conjugation quandle of X.
By Corollary 7,
we obtain the following corollary.
Corollary 8**.**
Let X be a quandle, m be the type of X
and let ⨆x∈X{x}×Zm be
the associated multiple conjugation quandle
of a Zm-family of quandles (X,{∗i}i∈Zm).
Then the following hold.
(1)
A* is a maximal connected subquandle of X
if and only if
⨆x∈A{x}×Zm is
a maximal connected sub-multiple conjugation quandle of
⨆x∈X{x}×Zm.*
2. (2)
X=⨆i∈IAi* is
the maximal connected subquandle decomposition of X
if and only if
⨆x∈X{x}×Zm=⨆i∈I(⨆x∈Ai{x}×Zm) is
the maximal connected sub-multiple conjugation quandle decomposition
of ⨆x∈X{x}×Zm.*
Proof.
It is sufficient to prove (1)
since (2) follows from (1) immediately.
Suppose that A is a maximal connected subquandle of X.
Let Y be a connected sub-multiple conjugation quandle
including ⨆x∈A{x}×Zm.
Then there exists a connected subquandle B of X including A
such that Y=⨆x∈B{x}×Zm
by Corollary 7.
Hence we have A=B and Y=⨆x∈A{x}×Zm.
Therefore ⨆x∈A{x}×Zm is
a maximal connected sub-multiple conjugation quandle
of ⨆x∈X{x}×Zm.
On the other hand,
suppose that
⨆x∈A{x}×Zm is
a maximal connected sub-multiple conjugation quandle
of ⨆x∈X{x}×Zm.
Let B be a connected subquandle including A
and let Y=⨆x∈B{x}×Zm.
By Corollary 7,
Y is a connected sub-multiple conjugation quandle
of ⨆x∈X{x}×Zm.
Hence we have Y=⨆x∈A{x}×Zm and A=B.
Therefore A is
a maximal connected subquandle of X.
∎
Example 5**.**
Let m∈Z>0.
Since the dihedral quandle Rm is of type 2,
⨆x∈Rm{x}×Z2 is
the associated multiple conjugation quandle
of the Z2-family of quandles (Rm,{∗i}i∈Z2).
By Corollary 6,
Rm is decomposed into 2l maximal connected subquandles,
and any maximal connected subquandle of Rm is
isomorphic to Rk,
where k is an odd number, and l∈Z>0
such that m=2lk.
Therefore
⨆x∈Rm{x}×Z2
is decomposed into 2l maximal connected sub-multiple conjugation quandles,
and any maximal connected sub-multiple conjugation quandles of
⨆x∈Rm{x}×Z2
is isomorphic to ⨆x∈Rk{x}×Z2
by Corollary 8.
Let X be a multiple conjugation quandle
and let A be a subset of X.
For any a,b∈X,
we write a∼MCQAb
when there exists f∈Inn(A) such that f(ea)=eb.
It is an equivalence relation on X.
It is easy to see that
a∼MCQAb
if and only if
there exist a1,a2,…,an∈A
and k1,k2,…,kn∈Z
such that ea∗k1a1∗k2⋯∗knan=eb.
Furthermore X is a connected multiple conjugation quandle
if and only if
a∼MCQXb for any a,b∈X.
Lemma 7**.**
Let X be a multiple conjugation quandle
and let A be a subset of X.
Then for any x∈⟨A⟩MCQ,
there exists a∈A
such that x∼MCQAa.
Proof.
Let X=⨆λ∈ΛGλ,
Λ′={λ∈Λ∣⟨A⟩∩Gλ=∅},
where ⟨A⟩ is a subquandle of X generated by A,
and let Hλ be a subgroup of Gλ
generated by ⟨A⟩∩Gλ
for any λ∈Λ′.
For any x,y∈⨆λ∈Λ′Hλ,
there exist λ1,λ2∈Λ′
such that x∈Hλ1,y∈Hλ2, and
there exist w1,w2,…,wn∈⟨A⟩∩Gλ1,
v1,v2,…,vm∈⟨A⟩∩Gλ2 and
k1,k2,…,kn,l1,l2,…,lm∈Z
such that x=w1k1w2k2⋯wnkn and
y=v1l1v2l2⋯vmlm.
Then we have
x∗y=(w1k1w2k2⋯wnkn)∗(v1l1v2l2⋯vmlm)=(w1∗l1v1∗l2⋯∗lmvm)k1(w2∗l1v1∗l2⋯∗lmvm)k2⋯(wn∗l1v1∗l2⋯∗lmvm)kn.
Since ⟨A⟩ is a quandle,
wi∗l1v1∗l2⋯∗lmvm∈⟨A⟩
for any i=1,2,…,n,
and then there exists λ0∈Λ
such that wi∗l1v1∗l2⋯∗lmvm∈Gλ0
for any i=1,2,…,n.
Since ⟨A⟩∩Gλ0=∅,
we have λ0∈Λ′
and x∗y∈Hλ0⊂⨆λ∈Λ′Hλ.
Hence ⨆λ∈Λ′Hλ is a
sub-multiple conjugation quandle of X by Proposition 2.
Then we have ⟨A⟩MCQ⊂⨆λ∈Λ′Hλ
since A⊂⨆λ∈Λ′Hλ.
Hence for any x∈⟨A⟩MCQ,
there exists μ∈Λ′
such that x∈Hμ and ⟨A⟩∩Gμ=∅.
Consequently, there exist a,a1,a2,…,an∈A and k1,k2,…,kn∈Z
such that a∗k1a1∗k2⋯∗knan∈⟨A⟩∩Gμ.
Therefore we have
ex=(a∗k1a1∗k2⋯∗knan)(a∗k1a1∗k2⋯∗knan)−1=(aa−1)∗k1a1∗k2⋯∗knan=ea∗k1a1∗k2⋯∗knan,
which implies that
x∼MCQAa.
∎
Lemma 8**.**
Let X be a multiple conjugation quandle
and let Ai be connected sub-multiple conjugation quandles of X
for any i∈I.
If ⋂i∈IAi=∅,
then ⟨⋃i∈IAi⟩MCQ is
a connected sub-multiple conjugation quandle of X.
Proof.
Let A=⋃i∈IAi,
and suppose that ⋂i∈IAi=∅.
For any x,y∈⟨A⟩MCQ,
there exist a,b∈A
such that x∼MCQAa and y∼MCQAb
by Lemma 7.
For any c∈⋂i∈IAi,
we have a∼MCQAc and b∼MCQAc.
Hence we have
a∼MCQAb, which implies that x∼MCQAy.
Therefore
x∼MCQ⟨A⟩MCQy, that is,
⟨A⟩MCQ is a connected sub-multiple conjugation quandle of X.
∎
Lemma 9**.**
Let X be a multiple conjugation quandle
and let A1 and A2 be maximal connected sub-multiple conjugation quandles of X.
If A1∩A2=∅,
then A1=A2.
Proof.
Suppose that A1∩A2=∅.
By Lemma 8,
⟨A1∪A2⟩MCQ is
a connected sub-multiple conjugation quandle of X.
Since A1 and A2 are included in ⟨A1∪A2⟩MCQ
and maximal connected sub-multiple conjugation quandles of X,
we obtain ⟨A1∪A2⟩MCQ=A1=A2.
∎
Theorem 4**.**
Any multiple conjugation quandle has
the unique maximal connected sub-multiple conjugation quandle decomposition.
Proof.
Let X=⨆λ∈ΛGλ be a multiple conjugation quandle.
For any a∈X,
we define [a]:=⋃a∈WW,
where W is a connected sub-multiple conjugation quandle of X.
By Lemma 8,
⟨[a]⟩MCQ is a connected sub-multiple conugation quandle of X.
Suppose that A is a connected sub-multiple conjugation quandle of X
including ⟨[a]⟩MCQ.
Since A contains a,
we have A⊂[a],
which implies that A=[a]=⟨[a]⟩MCQ.
Hence [a] is a maximal connected sub-multiple conjugation quandle of X.
For any a,b∈X,
we have [a]∩[b]=∅ or [a]=[b]
by Lemma 9.
Therefore there exists a subset Y of X
such that X=⨆a∈Y[a].
It is the maximal connected sub-multiple conjugation quandle decomposition of X.
Next, we show the uniqueness.
Let B be a maximal connected sub-multiple conjugation quandle of X=⨆a∈Y[a].
Then there exists a′∈Y such that B∩[a′]=∅.
By Lemma 9,
we have B=[a′].
Therefore X has the unique maximal connected sub-multiple conjugation quandle decomposition.
∎
For a multiple conjugation quandle X,
it is easy to see that
any connected sub-multiple conjugation quandle of X
is included in some connected component of X.
Therefore
if a connected component of X is
a connected sub-multiple conjugation quandle of X,
then it is a maximal connected sub-multiple conjugation quandle of X.
Let X=⨆λ∈ΛGλ be
a multiple conjugation quandle
and let P(Λ) be the set
of all subsets of Λ.
For any A⊂P(Λ),
we define
D(A):=⋃Λ∈A{OrbΛ(μ)∣μ∈Λ}.
It is easy to see that
⋃Λ∈AΛ=⋃Λ∈D(A)Λ.
We put D0(A):=A and
Dk+1(A):=D(Dk(A)) for any k∈Z≥0.
Theorem 5**.**
Let X be a multiple conjugation quandle.
If there exists n∈Z≥0
such that Dn({Λ})=Dn+1({Λ}),
then X=⨆Λ′∈Dn({Λ})(⨆λ∈Λ′Gλ) is
the maximal connected sub-multiple conjugation quandle decomposition of X.
In particular,
if Λ is a finite set,
then there exists n∈Z≥0
such that X=⨆Λ′∈Dn({Λ})(⨆λ∈Λ′Gλ) is
the maximal connected sub-multiple conjugation quandle decomposition of X.
Proof.
Suppose that there exists n∈Z≥0
such that Dn({Λ})=Dn+1({Λ}).
For any Λ′∈Dn({Λ}),
Λ′ has only one orbit Λ′,
that is, ⨆λ∈Λ′Gλ is
a connected sub-multiple conjugation quandle of X.
Let Y=⨆λ∈MHλ be
a connected sub-multiple conjugation quandle of X
including ⨆λ∈Λ′Gλ,
where Hλ is a subgroup of Gλ
for any λ∈M,
and let Λ0=Λ.
Then
there exists an orbit of Λ0
by the action of Inn(⨆λ∈Λ0Gλ)
including M.
We denote by Λ1∈D1({Λ}) the orbit.
For any i∈Z≥0,
we denote by Λi+1∈Di+1({Λ})
an orbit of Λi
by the action of Inn(⨆λ∈ΛiGλ)
including M inductively.
Then we have Λ′⊂M⊂Λn.
Since Λ′,Λn∈Dn({Λ}),
we have Λ′=M=Λn
and Y=⨆λ∈Λ′Hλ.
Since Hλ is a subgroup of Gλ
for any λ∈Λ′,
we have Y=⨆λ∈Λ′Gλ.
Therefore ⨆λ∈Λ′Gλ is
a maximal connected sub-multiple conjugation quandle of X,
and X=⨆Λ′∈Dn({Λ})(⨆λ∈Λ′Gλ) is
the maximal connected sub-multiple conjugation quandle decomposition of X.
Next, let Λ be a finite set.
For any i∈Z≥0,
we have #Di({Λ})≤#Di+1({Λ})≤#Λ.
Since #Λ is finite,
there exists n∈Z≥0
such that #Dn({Λ})=#Dn+1({Λ}),
which implies that Dn({Λ})=Dn+1({Λ}).
Therefore
X=⨆Λ′∈Dn({Λ})(⨆λ∈Λ′Gλ) is
the maximal connected sub-multiple conjugation quandle decomposition of X.
∎
Acknowledgment
The authors would like to thank Atsushi Ishii
for his helpful comments and suggestions.
Bibliography9
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] G. Ehrman, A. Gurpinar, M. Thibault and D. N. Yetter, Toward a classification of finite quandles , J. Knot Theory Ramifications 17 (2008), 511–520.
2[2] M. Gra n ~ ~ n \tilde{\mathrm{n}} a, Indecomposable racks of order p 2 superscript 𝑝 2 p^{2} , Beitr a ¨ ¨ a \ddot{\mathrm{a}} ge Algebra Geom. 45 (2004), 665–767.
3[3] A. Ishii, M. Iwakiri, Y. Jang, and K. Oshiro, A G 𝐺 G -family of quandles and handlebody-knots , Ill. J. Math. 57 (2013), 817–838.
4[4] A. Ishii, A multiple conjugation quandle and handlebody-knots , Topology Appl. 196 (2015), 492–500.
5[5] D. Joyce, A classifying invariant of knots, the knot quandle , J. Pure Appl. Alg. 23 (1982), 37–65.
6[6] S. V. Matvee, Distributive groupoids in knot theory , Mt. Sb. (N.S.) 119(161) (1982), 78–88.
7[7] S. Nelson, Classification of finite Alexander quandles , Topology Proceedings 27 (2003), 245–258.
8[8] S. Nelson and G. Murillo, Alexander quandles of order 16 , J. Knot Theory Ramifications 17 (2008), 273–278.