Indecomposable decompositions of
torsion–free abelian groups
Adolf Mader
Department of Mathematics
University of Hawaii at Manoa
2565 McCarthy Mall, Honolulu, HI 96922, USA
[email protected]
and
Phill Schultz
School of Mathematics and Statistics
The University of Western Australia
Nedlands
Australia, 6009
[email protected]
Abstract.
An indecomposable decomposition of a torsion-free
abelian group G of rank n is a decomposition G=A1⊕⋯⊕At where each Ai is indecomposable of rank
ri, so that ∑iri=n is a partition of n. The group G
may have indecomposable decompositions that result in different
partitions of n. We address the problem of characterizing those
sets of partitions of n which can arise from indecomposable
decompositions of a torsion-free abelian group.
Key words and phrases:
torsion-free abelian group, finite rank, almost completely
decomposable, cyclic regulator quotient, block–rigid,
indecomposable decomposition, realization of partitions
2010 Mathematics Subject Classification:
20K15, 20K25
1. Introduction
All the groups considered in this paper belong to the class G of
finite rank torsion–free abelian groups; we shall refer to them
simply as ‘groups’. Any group G∈G is viewed as an
additive subgroup of a finite dimensional Q–vector space and its
rank, rk(G), is the dimension of the subspace QG that G
generates. If a group G of rank n has an indecomposable
decomposition G=A1⊕⋯⊕At where Ai is
indecomposable of rank ri, then ∑iri=n so P=(r1,…,rt) is an unordered partition of n into t parts, and we say that G
realizes P.
A group G may realize several different partitions and we denote by
P(G) the set of all partitions that are realized by G.
Determining P(G) for a given group G and characterizing
realizable sets of partitions have received a great deal of attention
in the literature. For example, [7, Section 90] displays groups
realizing (1,3) and (2,2), groups realizing partitions into 2
and t parts for each 2≤t<n, and groups realizing every
partition of n into t parts (Corner’s Theorem 2.1 below).
On the other hand, there are classes of groups, such as completely
decomposable groups, direct sums of indecomposable fully invariant
subgroups, and almost completely decomposable groups with primary
regulating index (see [6, Theorem 3.5]) that realize a unique
partition. Furthermore, some sets of partitions are incompatible, in
the sense that no group can realize them. For example, we showed in
[11, Theorem 3.5] (Theorem 2.3) that no group
can realize both (k,1n−k) and (m,1n−m) if k=m, where
(i,1j) stands for the partition (i,1,…,1) with j copies
of 1.
In this paper, we consider three problems:
- (1)
Characterize families of partitions that can be realized by some
group.
2. (2)
For a given family P of partitions of n that can be
realized, determine the groups G that realize P.
3. (3)
For a given class A of groups, determine the families
P(G) of partitions realized by G∈A.
For the most part, we adopt the notation of [7]. The
definitions and properties of almost completely decomposable, rigid
and block–rigid cyclic regulator quotient groups can be found in
[10]. The properties we need are described in Section
2.
This paper contains the following results. By B we denote
the class of all block–rigid almost completely decomposable groups
with cyclic regulator quotient.
- (1)
The “Hook condition” is shown to be necessary for the sets of
partitions P(X) of groups X∈B (Proposition 3.1(1)).
2. (2)
A useful “standard” description of B–groups is established
(Lemma 5.12).
3. (3)
The workhorse Lemma 6.7 describes the
direct sum of two B–groups given in standard description.
4. (4)
General obstructions to realization are established
(Lemma 4.2, Lemma 4.3,
Lemma 6.1).
5. (5)
The maximal sets of partitions of n that satisfy the Hook
condition are described and denoted by S(n,k) (Proposition 3.3). The (few) S(n,k) that can be realized by groups in
B and the (many) that cannot so realized are determined
(Theorem 7.2).
2. Background
The decomposition properties of torsion–free groups of finite rank in
general are extremely complex (see [4] and [7]). For
example, A. L. S. Corner [5] proved an intriguing theorem on
‘pathological’ decompositions:
Theorem 2.1**.**
(Corner’s Theorem)* Given integers
n≥k≥1, there exists a group G that realizes every
partition of n into k parts.*
Specializations and simplifications are needed in order to have
any hope for results.
Our essential specialization consists in passing to the subclass of
almost completely decomposable groups, first defined and
systematically investigated by Lady ([8]), and further to the
much more special but still interesting and rich subclass B of
block rigid groups with cyclic regulator quotient. To our knowledge
all published examples of groups with “pathological” decompositions
are almost completely decomposable groups. The essential
simplification occurs by passing from isomorphism to Lady’s
near–isomorphism ([9], [10, Chapter 9]). A theorem by
David Arnold ([2, Corollary 12.9],
[10, Theorem 10.2.5]) says that passing from isomorphism to the
coarser equivalence relation of Lady does not mean a loss of
generality for our line of questioning: if G and G′ are nearly
isomorphic groups, then P(G)=P(G′).
A completely decomposable group A is the direct sum of
rank–1 groups. We always use its ‘homogeneous decomposition’ A=⨁ρ∈Tcr(A)Aρ where Aρ is a
non–zero direct sum of rank–1 groups all of type ρ.
If so, the index set Tcr(A) is the critical typeset of
A. An almost completely decomposable group is a group
containing a completely decomposable subgroup of finite index. Let X
be an almost completely decomposable group. Then X contains
completely decomposable subgroups of least index in X, and these are
Lady’s regulating subgroups. The intersection of all regulating
subgroups is a fully invariant completely decomposable subgroup of
X, Burkhardt’s regulator R(X) of X. Let R(X)=⨁ρ∈Tcr(R(X))Rρ be the homogeneous decomposition
of R. An almost completely decomposable group X is block–rigid if Tcr(R(X)) is an antichain and rigid if
Tcr(X) is an antichain and for all ρ∈Tcr(X), rkRρ=1. We denote by B the class of all block–rigid groups for
which X/R(X) is cyclic.
Let G and H be groups. We say that G is nearly
isomorphic to H, denoted G≅nrH, if there is a group K
such that G⊕K≅H⊕K. The properties of near
isomorphism are described in [2, Section 12] and in
[10, Chapter 10]. In our context, the most important such
property is [2, Corollary 12.9], [10, Theorem 10.2.5]:
for any groups G and H, if G≅nrH and G=G1⊕⋯⊕Gt, then H=H1⊕⋯⊕Ht with Hi≅nrGi, in particular P(G)=P(H).
E. Blagoveshchenskaya proved an interesting obstruction to realization
([4], [10, Chapter 13]) which we quote as Theorem
2.2.
Theorem 2.2**.**
([4]) Let (r1,…,rs) and (r1′,…,rt′) be two partitions of n. Then
there exists a block–rigid crq–group realizing (r1,…,rs) and (r1′,…,rt′) if and only if ri≤n−t+1 for
all i=1,…,s and rj′≤n−s+1 for all j=1,…,t.
Another obstruction to realization is implicit in the “Main Decomposition
Theorem” below. A group is clipped if it does not have a
rank–one summand. Clearly any group in G has a completely
decomposable direct summand of maximal rank (that may be [math]) and the
complementary summand is necessarily clipped.
Theorem 2.3**.**
([11, Theorem 2.5])*
Let G∈G and let G=Gcd⊕Gcl be a
decomposition of G with completely decomposable summand Gcd
and clipped summand Gcl. Then Gcd is unique up to
isomorphism and Gcl is unique up to near–isomorphism, i.e., if
also G=Gcd′⊕Gcl′ is such that Gcd′ is
completely decomposable and Gcl′ is clipped, then Gcd≅Gcd′ and Gcl≅nrGcl′.*
Corollary 2.4**.**
If G realizes (r,1n−r) and (r′,1n−r′), then r=r′.
3. Hooked Partitions
Recall that P(G) denotes the set of all partitions P=(r1,…,rt) of rk(G) for which there is an indecomposable
decomposition G=G1⊕⋯⊕Gt such that for all i∈{1,…,t}, ri=rk(Gi). There are two extreme values
of evident interest: Let rG be the largest rank of an
indecomposable summand of G, and let tG be the largest number of
summands in an indecomposable decomposition of G. Intuitively, if
rG is large, then tG should be small and conversely. For
example, if rG=rk(G), then tG=1, G is indecomposable and
P(G)={(rk(G))}; if tG=rk(G), then rG=1, G is
completely decomposable and P(G)={(1,…,1)}. Thus if
G is indecomposable or completely decomposable, then rG+tG=rk(G)+1.
In view of Corner’s Theorem denote by C(n,k) the set
of all partitions of n into k parts.
The following proposition describes restrictions on realizable
partitions.
Proposition 3.1**.**
- (1)
For any G∈B, it is true that rG+tG≤rk(G)+1.
2. (2)
For any G∈G with P(G)=C(n,k) it is true
that rG+tG=n+1.
Proof.
(1) Let G be a B–group of rank n and suppose
that G=C⊕D=B1⊕⋯⊕Bt are
decompositions of G with C indecomposable, rG=rkC and all
Bi indecomposable with t=tG. According to Theorem 2.2
rG≤n−tG+1 or rG+tG≤n+1.
(2) For a group G with P(G)=C(n,k) we have tG=k
and as (n−k+1,1k−1)∈C(n,k) we have rG=n−k+1, hence
rG+tG=n+1.
∎
Let P(n) be the set of all partitions of n and let P⊆P(n), so P is a family of partitions of n. A
hook in P(n) is a partition (k,1n−k) where k∈{1,…,n}. Let rP be the largest entry of any partition
in P and let tP be the length of the longest partition in
P. We say that P** satisfies the Hook Condition** or
simply that P** is hooked** if rP+tP≤n+1.
By Proposition 3.1 the family P(G) is hooked if G∈B or if P(G)=C(n,k) for some k.
Question 3.2**.**
Is P(G) hooked for every G∈G?
We conjecture, but so far have no proof that the Hook Condition is
indeed necessary for P(G).
On the other hand, we show below that the Hook Condition is far from
sufficient to characterize P(G).
Let P∈P(n), so P=(r1,r2,⋯,rt), ri≥1,
∑ri=n. Then P denotes the largest term of the partition
and ∣P∣=t is its length.
For n≥1 and 1≤k≤n we define
[TABLE]
The sets
S(n,k) are well known in Partition Theory under the name of
‘restricted partitions’. They are studied, enumerated and
tabulated for example in [1, Section 14.7].
Proposition 3.3**.**
- (1)
The family of partitions S(n,k) is hooked, contains a
unique hook (k,1n−k) and is maximal with respect to inclusion
among the hooked families of partitions of n.
2. (2)
If a group G realizes S(n,k) and P(G) is hooked,
then P(G)=S(n,k).
3. (3)
If a group G realizes C(n,k) and P(G) is hooked,
then P(G)=C(n,k).
Proof.
(1) [1, Section 14.7].
(2) By hypothesis S(n,k)⊆P(G). As
P(G) is hooked and S(n,k) is a maximal hooked family of
partitions we must have equality.
(3) Suppose that C(n,k)⊆P(G) and P(G) is
hooked. Then tG≥k and as (n−k+1,1k−1)∈C(n,k)⊆P(G), further rG≥n−k+1. Now P(G) being
hooked we get n+1≥rG+tG≥(n−k+1)+k=n+1 and
therefore rG+tG=n+1. Furthermore rG=n−k+1 and tG=k because either rG>n−k+1 or tG>k contradicts the Hook
condition.
∎
Question 3.4**.**
Suppose G∈G realizes (k,1n−k); then is
rG=k and/or tG=n−k+1?
The answer is yes for a group G with P(G)=C(n,k) and any
group realizing some S(n,k).
On the other hand, it is not known if there are groups realizing, for example,
both (6,1,1) and (2,2,2,2).
4. Fully invariant direct summands
Recall that P(X) denotes that set of partitions of rk(X) that
can be realized by indecomposable decompositions of X. Recall that
S(n,k)={P∈P(n)∣P≤k and k+∣P∣≤n+1}. For an indecomposable decomposition X=⨁ρXρ let ptn(⨁ρXρ)=(…,rk(Xρ),…)∈P(rkX).
Proposition 4.1**.**
Suppose
that X=Y⊕Z and that both X and Y are fully invariant
in X. Then the following statements are true.
- (1)
Suppose that X=⨁ω∈ΩXω is an
indecomposable decomposition of X. Then there is a disjoint union
Ω=ΩY∪ΩZ such that Y=⨁ω∈ΩYXω and Z=⨁ω∈ΩZXω.
2. (2)
P(X)=P(Y)×P(Z).
Proof.
(1) As Y and Z are fully invariant in X it follows
that Y=⨁ω(Y∩Xω) and Z=⨁ω(Z∩Xω). It is easily checked that
Xω=Y∩Xω⊕Z∩Xω. As Xω
is indecomposable it follows that either Y∩Xω=0 and Z∩Xω=Xω or Y∩Xω=Xω and Z∩Xω=0. Let ΩY={ω∈Ω∣Y∩Xω=Xω} and ΩZ={ω∈Ω∣Z∩Xω=Xω}. Then Y=⨁ω∈ΩYXω and Z=⨁ω∈ΩZXω as claimed.
(2) It follows from (1) that ptn(⨁ω∈ΩXω)=ptn(⨁ω∈ΩYXω)×ptn(⨁ω∈ΩZXω), so P(X)⊆P(Y)×P(Z). Conversely, if Y=⨁ω∈ΩYYω and Z=⨁ω∈ΩZZω are indecomposable decompositions of Y and
Z, then X=(⨁ω∈ΩYYω)⊕(⨁ω∈ΩZZω) is an indecomposable
decomposition of X and
ptn((⨁ωYω)⊕(⨁ωZω))=ptn(⨁ωYω)×ptn(⨁ωZω), so P(Y)×P(Z)⊆P(X).
∎
Lemma 4.2 and Lemma 4.3 exhibit
obstructions to realization. Assuming that certain decompositions are
present, they say that certain other decompositions and certain
critical typesets are impossible (see Lemma 6.2).
Lemma 4.2**.**
Let G∈G and suppose that H is a non–zero indecomposable fully
invariant summand of G. Then H appears as a summand in any
indecomposable decomposition of G.
Proof.
Let G=G1⊕⋯⊕Gt be an
indecomposable decomposition of G. As H is fully invariant in
G we have H=H∩G1⊕⋯⊕H∩Gt. As H
is indecomposable, without loss of generality H=H∩G1, and
moreover G1=H⊕H′. But G1 is also indecomposable and
so it follows that G1=H.
∎
Lemma 4.3**.**
Let G∈G and suppose that H is a
non–zero completely decomposable τ–homogeneous fully
invariant summand of G. Then every indecomposable decomposition of
G contains a rank–1 summand of type τ.
Proof.
Let G=G1⊕⋯⊕Gt be an
indecomposable decomposition of G. As H is fully invariant in
G we have H=H∩G1⊕⋯⊕H∩Gt.
Without loss of generality H∩G1=0, and moreover G1=(H∩G1)⊕H′. But G1 is indecomposable and so it
follows that G1=H∩G1. This means that G1⊆H
and furthermore G1 is a direct summand of the τ–homogeneous
completely decomposable group H, hence is itself
τ–homogeneous completely decomposable. Being indecomposable,
G1 has rank 1 and type τ.
∎
5. B–groups
This section lists essential details on block–rigid groups X with
cyclic regulator quotient, i.e., groups in B, also referred to
as ‘B–groups ’or ‘block–rigid crq–groups’.
We will use greatest common divisors gcdA(e,a) where e is a
positive integer and a is an element of the torsion-free group
A. Greatest common divisors are explained in
[10, Section 11.2] in great generality and they have the
usual properties. In our special case gcdA(e,a)=d when m=ord(a+eA) and e=md.
A B–group X has a representation
[TABLE]
with the following properties
[TABLE]
[TABLE]
There is a more practical version of the Regulator Criterion
(5.3).
Lemma 5.4**.**
(Regulator Criterion)*
Assume that gcdA(e,a)=1 in (5.1).
Then A=R(X) if and only if for all τ∈Tcr(A), gcdA(e,∑ρ=τaρ)=1.*
Proof.
Set B:=Aτ, C=⨁ρ=τAρ and c=∑ρ=τaρ. Then A=B⊕C. By the Purification Lemma ([10, 3.1.2,11.4.1]), B∗X=B+Zeτ−1aτ where eτ=gcdA(e,c).
So eτ∣e and c=eτc′ for some c′∈A. Suppose that A=R(X). Then B=X(τ) is pure in X, hence eτ−1aτ∈Aτ⊆A and eτ(eτ−1aτ+c′)=aτ+c=a. By assumption gcdA(e,a)=1, so eτ=1.
Conversely, if ∀τ∈Tcr(A):eτ=1, then
∀τ∈Tcr(A):Aτ=(Aτ)∗X=X(τ) and A=R(X).
∎
We next restate well–known invariants and the classification of
B–groups.
Definition 5.5**.**
[10, Definition 12.6.2]* Let
X be as in (5.1). Let e be any
positive integer such that eX⊂A. Let nA→A/eA=A be the natural epimorphism. For any type τ, set*
[TABLE]
The values μτ(X), do not depend on the choices of a and e
involved in their definition ([10, Lemma 12.6.3]).
The classification theorem for block–rigid crq–groups is easy to
state.
Theorem 5.6**.**
[10, Theorem 12.6.5] (Near–Classification)*
Let X and Y be block–rigid crq–groups. Then X≅nrY if
and only if R(X)≅R(Y) and μτ(X)=μτ(Y)
for all types τ.
∎*
Theorem 5.7 says in particular that direct summands of
B–groups are again B–groups and relates the invariants
of group and summands.
Theorem 5.7**.**
[10, Theorem 13.1.1]
(Product Formula)*
Let X be a block–rigid crq–group with regulator R. Suppose X=X1⊕X2 is a direct decomposition of X. Then each Xi
is a block–rigid crq–group with regulator Ri=Xi∩R, and*
[TABLE]
is a decomposition of the cyclic group X/R. The groups
Xi/Ri are cyclic and have relatively prime orders.
Furthermore,
[TABLE]
∎
Lemma 5.8 deals with direct sums in B and their
regulators. This lemma justifies the direct sums that we use in
the later sections.
Lemma 5.8**.**
Let X1,X2∈B with
regulators R1,R2 respectively. Assume that Tcr(X1)∪Tcr(X2) is an antichain and gcd([X1:R1],[X2:R2])=1. Then X=X1⊕X2∈B and R(X)=R1⊕R2.
Proof.
Set R=R1⊕R2. Then RX≅R1X1⊕R2X2 is a finite cyclic group of
order [X1:R1][X2:R2] and Tcr(X)=Tcr(R)=Tcr(R1)∪Tcr(R2)=Tcr(X1)∪Tcr(X2) is an antichain. For any τ∈Tcr(X), we have R(τ)=R1(τ)⊕R2(τ)=X1(τ)⊕X2(τ)=X(τ), so R(X)=R by
(5.3). So X∈B.
∎
A criterion for the absence of rank–one direct summands is needed.
Proposition 5.9**.**
[10, 13.1.5]* A
block–rigid crq–group X is clipped if and only if X is rigid
and μτ(X)>1 for all τ∈Tcr(X).
∎*
The indecomposability of a B–group is easily recognized by
associating a certain graph with the group.
Definition 5.10**.**
(Blagoveshchenskaya)* Let X be a rigid B–group. The
frame of X is a graph whose vertices are the elements of
Tcr(X) and two vertices σ and τ are joined by an edge
if and only if gcd(μσ(X),μτ(X))>1.*
Proposition 5.11**.**
[10, Corollary 13.1.10]* A B–group is
indecomposable if and only if it is rigid and its frame is
connected.
∎*
Recall that any completely decomposable group A
of rank r can be written in the form A=⨁1≤i≤rAi=⨁1≤i≤rτivi where the Ai are
rank 1 summands of A, 0=vi∈Ai and τi={x∈Q∣xvi∈Ai}. The τi are rational groups,
i.e. additive subgroups of Q containing 1. We identify a rational
group τ with its type, and so speak of the rational group τ
of type τ. The set {v1,…,vr} is called a decomposition basis of A.
The following Lemma 5.12 is restricted to rigid
groups because this simplifies the notation considerably and is all
that is used later.
Lemma 5.12**.**
Let X be a rigid
B–group and let R:=R(X)=⨁ρ∈Tcr(X)Rρ. Then X has a description X=R+eZ∑ρ∈Tcr(X)αρvρ where
- (1)
{vρ∣ρ∈Tcr(R)}* is a decomposition basis of
R, so R=⨁ρ∈Tcr(X)ρvρ,*
2. (2)
∀τ∈Tcr(X):gcdR(e,∑ρ=ταρvρ)=1,
3. (3)
e=[X:R],
4. (4)
αρ* an integral factor of e, and*
5. (5)
∀τ∈Tcr(X):μτ(X)=ατe.
If rk(X)=2, R=R(X)=τ1v1⊕τ2v2 and [X:R]=e, then we may assume the representation X=A+Ze−1(v1+v2) with gcdR(e,vi)=1.
Proof.
Certainly, X=R+Ze1∑ρ∈Tcr(X)uρ, where uρ∈Rρ and (Regulator
Criterion) for all τ∈Tcr(X), gcdR(e,∑ρ=τuρ)=1. Let ρ∈Tcr(X) and αρ=gcdR(e,uρ). Then
[TABLE]
Let ρ={x∈Q∣xvρ∈Rρ}. Then ρ is a
rational group of type ρ and Rρ=ρvρ.
It remains to show that μ:=μτ(X)=ord(ατvτ+eR)=ατe. Clearly
ατe(ατvτ+eR)=0, so μ∣ατe. On the other hand μ=ord(ατvτ+eR)=ord(ατvτ+ατβτR)=ord(vτ+βτRτ)=ord(vτ+βττvτ). Hence μvτ=βτbavτ where
ba is a reduced fraction in the rational group τ. It
follows that bμ=aβτ and hence βτ=bb′. Furthermore as bavτ∈τvτ=Rτ we
also have b1vτ∈Rτ and vτ=b(b1vτ). Thus b is a common factor of
βτ and vτ. But gcdR(βτ,vτ)=1, so
b=1 and ατe=βτ∣μτ. Together with the previous observation that μ∣αβe we have the desired equality.
Consider X=R+Ze−1(α1v1+α2v2) where R=R(X)=τ1v1⊕τ2v2 and αi∣e. The
Regulator Criterion requires that gcdR(e,αivi)=1 this
forces αi=1. But then gcdR(e,vi)=1.
∎
Given a rigid B–group we can assume without loss of generality
that it is in the “standard form” described in Lemma 5.12. On the other hand, in constructing rigid
B–groups, in particular indecomposable B–groups, we must
make judicious choices in order to achieve the standard form and the
easy way of computing invariants.
Let e be a positive integer. A type τ is e–free if
for all prime divisors p of e, pτ=τ. It is easily
seen that a rank–1 group A of e–free type τ has a
representation A=τv such that gcdA(e,v)=1. Consequently,
a rigid completely decomposable group A all of whose critical types
are e–free has a description A=⨁ρ∈Tcr(A)ρvρ with gcdA(e,vρ)=1. In this case {vρ:ρ∈Tcr(A)} is called an e–basis of A.
It is easy to construct indecomposable B–groups with evident
invariants.
Lemma 5.13**.**
Let e be a positive integer,
and let τ1,…τr be pairwise incomparable types such
that \forall\,i:\tau_{i}\text{ is e--free}. Let A=⨁1≤i≤rτivi such that ∀i:gcdA(e,vi)=1. Then
[TABLE]
with αi integral factors of e is an indecomposable
B–group with A=R(X), [X:A]=e and μτi(X)=e/αi provided that the αi are so chosen that
- (1)
∀i:gcdA(e,∑j=iαjvj)=1,
2. (2)
the frame of X is connected.
Proof.
Evident by Lemma 5.4 and
Proposition 5.11.
∎
For example, for e=32⋅5⋅73 and τi e–free,
the group
[TABLE]
is an indecomposable B–group with invariants
μ1(X)=5⋅73,μ2(X)=32⋅5⋅72,μ3(X)=3⋅5⋅73,μ4(X)=32⋅73,μ5(X)=32⋅5⋅73.
The indecomposable decompositions of rigid B–groups are
unique. Hence different indecomposable decompositions can only occur
in properly block–rigid groups.
Theorem 5.14**.**
The endomorphism ring of a rigid
B–group is commutative. Consequently, rigid B–groups
have a unique indecomposable decomposition.
Proof.
Let X be a rigid B–group. The restriction map
imbeds End(X) in End(R(X)) and we will see shortly that
End(R(X)) is commutative. Let R:=R(X)=⨁ρ∈Tcr(X)R(ρ) where rk(R(ρ))=1 and let φ∈End(R). Then φ restricts to an endomorphism φρ
of R(ρ) and hence is multiplication by a rational number. Hence
φ=(…,φρ,…) and such maps commute
with one another.
In a group with commutative endomorphism ring every endomorphic
image is a fully invariant subgroup. In particular, any direct
summand is fully invariant. Let X=⨁iXi=⨁jYj be indecomposable decompositions.
Let τ∈Tcr(X1). Then there is j such that τ∈Tcr(Yj). Without loss of generality j=1 and for convenience
write X=Y1⊕Y1′. As X1 is fully invariant, X1=(X1∩Y1)⊕(X1∩Y1′). As X1 is indecomposable and
0=X(τ)=R(τ)⊂X1∩Y1 it follows that X1⊂Y1 and X1∩Y1′=0. Then X1 is a summand of
Y1 and since Y1 is indecomposable, so X1=Y1. The claim
follows by induction on the number of summands Xi.
∎
Corollary 5.15**.**
If X is a
clipped B–group, then X has a unique indecomposable
decomposition.
Proof.
Let X be a clipped B–group. By
Proposition 5.9 X is rigid and by Theorem 5.14 X
has a unique indecomposable decomposition.
∎
6. Tools and Obstructions
We start with a consequence of realization.
Lemma 6.1**.**
Let X∈B. Let
R=R(X)=⨁ρ∈Tcr(X)Rρ. Suppose that X=X1⊕⋯⊕Xs is an indecomposable decomposition of
X. Then ∀τ∈Tcr(X):rk(Rτ)≤s. In
particular, if X realizes (r1,r2), then ∀τ∈Tcr(X):rk(Rτ)≤2.
Proof.
Indecomposable B–groups are rigid. Let τ∈Tcr(X). Then Rτ=X(τ)=X1(τ)⊕⋯⊕Xs(τ) with rkXi(τ)≤1 (5.3). Hence rkRτ=rkX(τ)≤s.
∎
We use the following convenient shorthand that displays essential
features of indecomposable B–groups but not the whole story.
**Notation. ** The expression [τ1τ2…τr]
denotes an indecomposable B–group X with critical types
τ1,…,τr and rank r. It is tacitly assumed that X
is given in the form X=R+eZa where R=R(X)=⨁ρ∈Tcr(X)ρvρ, a∈R, and [X:R]=e.
On occasion the regulator index e is relevant to the discussion and
we encode the groups X=R+eZa by [τ1τ2…τr;e]. In a direct sum [τ1τ2…;e1]⊕[σ1,σ2,…;e2] it is tacitly assumed that the poset of types
{τi,σj} is an antichain, and the regulator indices
e1,e2 are relatively prime so that the direct sum is a group in
B (Lemma 5.8).
Of course, when the invariants μτ(X) are needed, the explicit
representations (5.1) must be used.
If a group realizes particular partitions, then there are consequences
for the critical typeset of the group.
Lemma 6.2**.**
Suppose that X
realizes (k,1n−k) and (r1,r2) where r1,r2≥2.
Then Tcr(X)={τ1,…,τk} and X=[τ1⋯τk]⊕[σ1]⊕⋯[σn−k]
where {σ1,…,σn−k}⊆{τ1,…,τk}.
Proof.
Let R(X)=⨁ρ∈Tcr(X)Rρ. As X
realizes (r1,r2), by Lemma 6.1, ∀ρ∈Tcr(X):rk(Rρ)≤2. As r1,r2≥2 the group X
has no fully invariant summand of rank 1 (Lemma 4.3). As X realizes
(k,1n−k), we have X=[τ1⋯τk]⊕[σ1]⊕⋯⊕[σn−k]. If σi∈/{τ1,…,τk}, then [σi]⊕⋯ is a
fully invariant direct summand of X and hence any indecomposable
decomposition of X contains a summand [σi]
(Lemma 4.3), contradicting our earlier observation.
∎
We now consider Corner’s groups although as a consequence of
Lemma 6.1 Corner’s groups are of no help in trying to
realize S(n,n−k+1). In particular, we show that Corner groups
are block–rigid crq–groups. Theorem 6.4(2) is not new ([5], [7, Exercise 3, p.139]) but
it is easily derived from our results.
Definition 6.3**.**
Given
- (1)
integers k,n with 1≤k≤n,
2. (2)
pairwise relatively prime integers >1, q1,…,qn−k,
3. (3)
e–free pairwise incomparable types τ,τ1,…,τn−k,
a Corner group X has base group
[TABLE]
and is defined to be
[TABLE]
Hence rk(Rτ)=k and for all i∈[n−k], rk(Rτi)=1.
Theorem 6.4**.**
Let X be a
Corner group as in Definition 6.3. Then the following hold.
- (1)
Setting e:=q1q2⋯qn−k, and ei:=e/qi, R0:=τu2⊕⋯⊕τuk and R1:=τu1⊕τ1v1⊕⋯⊕τn−kvn−k,
[TABLE]
realizing (n−k+1,1k−1)∈P(n).
2. (2)
P(X)=C(n,k).
Proof.
(1) q11(u1+v1)+q21(u1+v2)+⋯+qn−k1(u1+vn−k)=e1((e1+⋯+en−k)u1+e2v2+⋯+en−kvn−k). Hence X contains (τu2⊕⋯⊕τuk)⊕
((τu1⊕τ1v1⊕⋯⊕τn−kvn−k)+eZ((e1+⋯+en−k)u1+e2v2+⋯+en−kvn−k)). Equality follows from Lemma 6.5.
(2) By (1) a Corner group X is a B–group hence P(X)
is hooked. The claim follows from Proposition 3.3(3).
∎
Lemma 6.7 is basic. In its proof Lemma 6.5 will be used.
Lemma 6.5**.**
Let R be a torsion-free group,
a,b∈R, e1,e2 relatively prime integers, and 1=u1e1+u2e2. Then, in QR,
- (1)
e11a+e21b=e1e21(e2a+e1b), but also
2. (2)
u1e1(e1e21(e2a+e1b))=e21b+u1a−u2b, and
3. (3)
u2e2(e1e21(e2a+e1b))=e11a−u1a+u2b**
Hence R+e1e21(e2a+e1b)=R+e11a+e21b.
Proof.
Easy computation.
∎
Corollary 6.6**.**
For i=1,2, let Xi=Ri+eiZai∈B where Tcr(X1)∪Tcr(X2)
is an antichain, e1,e2 are relatively prime integers, Ri=R(Xi), and ai∈Ri. Then X1⊕X2∈B,
[TABLE]
Proof.
Lemma 6.5 says that X1⊕X2=(R1⊕R2)+e1e2Z(e2a1+e1a2). By
hypothesis R(Xi)=Ri, and, by Lemma 5.8, R(X1⊕X2)=R1⊕R2.
∎
We now can freely add two B–groups by adding generators, the
description of the sum and its regulator being clear. We clarify in
all generality what the direct sum of two rigid B–groups looks
like. Note that the essential feature is the overlap in critical types
of the two groups that are added.
Lemma 6.7**.**
Let τ1,…,τd,τd+1,…,τr,τr+1,…τs be
pairwise incomparable types,
d≥1, r≥d, s≥r
[TABLE]
and
[TABLE]
[TABLE]
where αi,βj∈Z, αi divides e1,
βj divides e2, Ai=R(Xi) and e1,e2 are
relatively prime integers. For i=1,…,d, let fi=gcd(e2αi,e1βi). Then there exists a decomposition
basis {v1′,w1′,…,vd′,wd′,vd+1,…,vr,vr+1,…vs} of A1⊕A2=R(X1⊕X2) such
that with
[TABLE]
we have
[TABLE]
Furthermore, if X1 and X2 are both indecomposable, then so is
Y. All generator coefficients of Y are divisors of e1e2. In
passing from the decomposition X1⊕X2 to Y⊕τ1w1′⊕⋯⊕τdwd′ the number of summands does not
decrease.
In Lemma 6.7 we assume that the coefficients
αi are factors of e1 and the coefficients βi are
factors of e2. By Lemma 5.12 this can be done
without loss of generality, also, in examples, this will always be the
case.
Proof.
By Corollary 6.6
[TABLE]
and A1⊕A2=R(X1⊕X2).
For i=1,…,d, we defined fi=gcd(e2αi,e1βi). Then fi=αiβi and setting e2αi=fiαi′, e1βi=fiβi′, there exist integers
ai,bi such that aiαi′+biβi′=1 and hence we
have that τivi⊕τiwi=τi(αi′vi+βi′wi)⊕τi(−bivi+aiwi). Setting vi′=αi′vi+βi′wi and wi′=−bivi+aiwi, we
have the new decomposition basis {v1′,w1′,…,vd′,wd′,vd+1,…,vr,vr+1,…vs} of A1⊕A2=R(X1⊕X2). Let Y be as stated. Then X1⊕X2=Y⊕τ1w1′⊕⋯⊕τdwd′ and by
Theorem 5.7 A=R(Y).
For clarity note that Tcr(Y)=Tcr(X1)∪Tcr(X2) and
Tcr(X1)∩Tcr(X2)={τ1,…,τd}=∅
which makes it possible to merge the generators of X1 and X2.
Suppose now that X1 and X2 are indecomposable. By
Proposition 5.11 the frames of X1 and X2 are
connected. We will show that the frame of Y is connected. To do so
recall that μτ(Y)=μτ(X1)μτ(X2). So for any
τ∈Tcr(X1), we have that μτ(X1) and
μτ(X2) divide μτ(Y). This shows that any edge
between types of either the frame of X1 or X2 is also an edge
in the frame of Y. As the frames of X1 and X2 are connected
and Tcr(X1)∩Tcr(X2)=∅ it follows that the frame
of Y is connected and Y is indecomposable.
∎
We use our previous shorthand to display the content of
Lemma 6.7. The formula
[TABLE]
correctly reflects the content of Lemma 6.7. We frequently use this formula without explicit reference.
Example 6.8 explicitly describes [τ1τ2]⊕[τ1τ2]=[τ1τ2]⊕[τ1]⊕[τ2].
Example 6.8**.**
There are groups realizing
S(4,2)={(2,2),(2,1,1)}.
In fact, let p1,p2 be relatively prime integers ≥2, let
τ1,τ2 be incomparable p1p2–free types, and let
[TABLE]
Then R(X1)=τ1v1⊕τ2v2 and R(X2)=τ1w1⊕τ2w2 and X1 and X2 are indecomposable.
With u1p1+u2p2=1,
[TABLE]
so X realizes (1,1,2) in addition to (2,2).
Proof.
The summands X1 and X2 are indecomposable by
Proposition 5.11 and the completely decomposable
base groups are the regulators in each case (Theorem 5.7. Now p11(v1+v2)+p21(w1+w2)=p1p21((p2v1+p1w1)+(p2v2+p1w2)). Set v1′=p2v1+p1w1, v2′=p2v2+p1w2, w1′=−u1v1+u2w1, and w2′=−u1v2+u2w2. Then (change of basis) τ1v1⊕τ1w1=τ1v1′⊕τ1w1′ and τ2v2⊕τ2w2=τ2v2′⊕τ2w2′. Hence X=(τ1w1′⊕τ2w2′)⊕((τ1v1′⊕τ2v2′)+Zp1p21(v1′+v2′)).
∎
A Corner group is of the form X=[τ1⋯τℓ]⊕[τ1]⊕⋯⊕[τ1]. Proposition 6.9 shows that certain Corner families of partitions may be
realized by groups that are not Corner groups.
Proposition 6.9**.**
The group X2n:=[τ1 τ2]⊕[τ2 τ3]⊕⋯⊕[τn τn+1] realizes C(2n,n).
Proof.
Let (r1,r2,…,rn)∈C(2n,n) where
∀i≤m:ri≥2 and ∀i>m:ri=1.
Note that r1+⋯+rm+(n−m)=2n, so r1+⋯+rm=n+m and (r1−1)+⋯+(rm−1)=n. The group X2n has
n summands of rank 2. We partition the n summands of X2n
into groups of r1−1,r2−1,…,rm−1 summands. A typical
summand is of the form [σ1 σ2]⊕[σ2 σ3]⊕⋯⊕[σr−1 σr]=[σ1 σ2⋯σr]⊕[σ2]⊕⋯⊕[σr−1] where [σ1 σ2⋯σr] is a
summand of rank r. Note that in combining these summands the total
number of summands has not changed. Doing this for each summand of
the partition we get summands of rank r1,r2,…,rm and
n−m summands of rank 1, a total of n summands. The partition
(r1,r2,…,rn)∈C(2n,n) has been realized by our
particular decomposition of X2n.
∎
7. Realizing families S(n,k)
The following proposition illustrates why some groups cannot realize
S(n,k).
Proposition 7.1**.**
Suppose that G=Y⊕Z is a
decomposition with fully invariant summands neither of which is
completely decomposable. Let nG=rk(G), nY=rk(Y), and
nZ=rk(Z). If Y realizes S(nY,kY), and Z realizes
S(nZ,kZ). then P(G)=S(nY,kY)×S(nZ,kZ)⫋S(nG,kZ), so G does not realize
S(nG,kZ).
Proof.
By Proposition 3.3(2) we have that
P(Y)=S(nY,kY) and P(Z)=S(nZ,kZ) and by
Proposition 4.1(2) P(X)=P(Y)×P(Z)=S(nY,kY)×S(nZ,kZ).
Without loss of generality, suppose kZ≥kY. By way of
contradiction assume that S(nY,kY)×S(nZ,kZ)=S(nX,kZ). Then X realizes S(nX,kZ) and, in
particular, (kZ,1nX−kZ)∈S(nX,kZ). It follows that
(1nY)∈P(Y) and Y is completely decomposable, or else
(1nZ)∈P(Z) and Z is completely decomposable, either
way a contradiction.
∎
Our main result Theorem 7.2 determines completely which
families S(n,k) can be realized in B and which cannot.
Theorem 7.2**.**
- (1)
The families S(n,n),S(n,1),S(n,2),S(n,n−1)
are realizable in B.
2. (2)
The special families S(5,3),S(6,4),S(4,2) can be
realized in B.
3. (3)
All other hooked families S(n,k) are not realizable in
B. Specifically, the families
S(n,k) for k≥3,n≥2k,
S(n,6) for n≥10,
S(7,4),
S(7,5), S(8,5), S(9,5),
S(8,6), S(9,6),
S(9,7) cannot be realized in B.
Proof.
Details of the proof are contained in the following
lemmas, corollaries and examples:
(1) Lemma 7.3.
(2) Example 7.5, Example 7.6, Example 6.8.
(3) Corollary 7.12, Example 7.13,
Corollary 7.14, Example 7.15, Example 7.16,
Example 7.17, Example 7.18.
∎
Lemma 7.3**.**
- (1)
S(n,1)={(1,…,1)}* is realized by any completely
decomposable group of rank n.*
2. (2)
S(n,n)={(n)}* is realized by any indecomposable
B–group of rank n.*
3. (3)
The set of partitions S(n,2) can be realized.
4. (4)
S(n,n−1)* can be realized by suitable Corner groups.*
Proof.
(3) First note that P∈S(n,2) means that P=(2,…,2,1,…,1)=(2i,1n−2i). So, for n even,
S(n,2)={(2n/2),…,(2,1n−2)}. Using
Lemma 6.7 repeatedly we have for n even,
n[τ1,τ2]=[τ1]⊕[τ2]⊕(n−1)[τ1,τ2]=⋯=[τ1,τ2]⊕(n/2−1)[τ1]+(n/2−1)[τ2]. For odd n we have an obvious
variant.
(4) S(n,n−1)={(n−1,1),(n−2,2),…} can
be realized by Corner’s Theorem.
∎
Remark 7.4**.**
In all examples that follow we assume that the groups
are given in the form of Lemma 5.12 so that we
have a handy formula for the invariants. The naming of the elements
of the decomposition bases are irrelevant as only the associated
types matter, i.e., in two decompositions of a group the v1 in
one decomposition and the v1 in the other decomposition need not
be the same.
Example 7.5**.**
Let p1,p2,p3 be pairwise relatively
prime integers ≥2, let τ1,τ2,τ3 be pairwise
incomparable p1p2p3–free types, and let
- (1)
R=τ1v1⊕τ2v2⊕τ3v3⊕τ1w1⊕τ2w2,
2. (2)
X1=(τ1v1⊕τ2v2)+Zp2p31(v1+v2),
3. (3)
X2=(τ1w1⊕τ3v3)+Zp11(w1+v3), and
4. (4)
X3=τ2w2.
Then X=X1⊕X2⊕X3 realizes S(5,3)={(3,1,1),(3,2),(2,2,1)}.
Proof.
By Lemma 6.7
X1⊕X2=[τ1 τ2]⊕[τ1 τ3]⊕[τ2]=[τ1 τ2 τ3]⊕[τ1]⊕[τ2]
Thus X=X1⊕X2⊕X3 realizes (2,2,1) and
(3,1,1).
Let
- (1)
Y1=(τ1v1⊕τ2v2⊕τ3v3)+Zp1p21(v1+p1v2+p2v3),
2. (2)
Y2=(τ1w1⊕τ2w2)+Zp31(w1+w2).
Then
Y1⊕Y2=[(τ1v1′′⊕τ2v2′′⊕τ3v3)+p1p2p3Z(v1′′+p1v2′′+p2p3v3)]⊕τ1w1′′⊕τ2w2′′ where τ1v1⊕τ1w1=τ1v1′′⊕τ1w1′′, and τ2v2⊕τ2w2=τ2v2′′⊕τ2w2′′.
Then Y=Y1⊕Y2 realizes (3,2) by definition.
So far X=X1⊕X2⊕X3 and Y=Y1⊕Y2 are
independently constructed groups although R=R(X)=R(Y) and
they are both contained in QR, the divisible hull of R. We will
show that they are nearly isomorphic and therefore they share their
decomposition properties.
Using the Product Formula (Theorem 5.7) we immediately
see that
[TABLE]
and
[TABLE]
Hence X≅nrY, and we are done.
∎
Example 7.6**.**
The B–group X=X1⊕X2⊕X3 where
- (1)
X1=(τ1v1⊕τ2v2)+Z5⋅111(v1+v2),
where R(X1)=τ1v1⊕τ2v2 and {v1,v2} is a 5⋅11–basis of R(X1),
2. (2)
X2=(τ1w1⊕τ3v3)+Z71(w1+v3),
where R(X2)=τ1w1⊕τ3v3 and {w1,v3} is a 7–basis of R(X2),
3. (3)
X3=(τ2w2⊕τ4v4)+Z31(w2+v4),
where R(X3)=τ2w2⊕τ4v4 and {w2,v4} is a 3–basis of R(X3).
realizes S(6,4).
Proof.
For easy reference note that
[TABLE]
It is assumed that all
critical types τi are 3⋅5⋅7⋅11–free. By
definition X:=[τ1τ2]⊕[τ1τ3]⊕[τ2τ4]=[τ1τ2τ3]⊕[τ1]⊕[τ2τ4]=[τ1τ2τ3τ4]⊕[τ1]⊕[τ2] showing that any such X will
indeed realize (4,1,1),(3,2,1) and (2,2,2). We record the
invariants of X.
[TABLE]
Next let Y=Y1⊕Y2 where
- (1)
Y1=(τ1v1⊕τ2v2⊕τ3v3⊕τ4v4)+Z7⋅31(3v1+7v2+3v3+7v4),
2. (2)
Y2=(τ1w1⊕τ2w2)+Z5⋅111(w1+w2).
It is easily checked that R(Y1)=τ1v1⊕τ2v2⊕τ3v3⊕τ4v4, R(Y2)=τ1w1⊕τ2w2 and Y1,Y2 are indecomposable. The invariants of Y
are as follows.
[TABLE]
We see that X and Y have the same regulator and the same
invariants, hence X≅nrY and X realizes (4,2).
Finally, let Z=Z1⊕Z2 where
- (1)
Z1=(τ1v1⊕τ2v2⊕τ3v3)+Z7⋅51(v1+7v2+5v3),
2. (2)
Z2=(τ1w1⊕τ2w2⊕τ4v4)+Z3⋅111(3w1+w2+11v4).
It is routine to verify that R(Z1)=τ1v1⊕τ2v2⊕τ3v3 and R(Z2)=τ1w1⊕τ2w2⊕τ4v4, hence R(Z)=R(X).
We now compute invariants.
[TABLE]
Hence Z1,Z2 are indecomposable, Z≅nrX and X realizes
(3,3).
∎
It is intuitively clear that “larger” sets of partitions cannot be
realized if “smaller” ones cannot.
Proposition 7.7**.**
Let n′>n≥k. If S(n′,k) can be realized, then so can
S(n,k). Equivalently, if S(n,k) cannot be realized, then
neither can S(n′,k).
Proof.
Let (r1,…,rt)∈S(n,k) and n′=n+1.
Then k+t≤n+1. Consider P=(r1,…,rt,1)∈P(n′). Then k+(t+1)≤n+1+1=n′+1, so P∈S(n′,k). Suppose S(n′,k) can be realized. Then there is
a group X and a decomposition X=Y1⊕⋯⊕Yt⊕Y such that rkYi=ri, the Yi are indecomposable
and rk(Y)=1. Then X/Y realizes (r1,…,rt). Repeat
for arbitrary n′>n until S(n,k) is reached.
∎
Proposition 7.8**.**
There is no B–group
realizing S(2m,m) provided m≥3.
Proof.
Suppose X∈B realizes S(2m,m) for m≥3. Note that S(2m,m) contains the partitions (m,1m) and
(m,m). Then X cannot have completely decomposable fully
invariant summands (Lemma 4.3) and cannot be the direct sum of fully
invariant subgroups (Lemma 7.1). Lemma 6.2 implies that Tcr(X)={τ1,…,τm},
X=[τ1⋯τm]⊕[τ1]⊕⋯[τm], and by Lemma 6.1 ∀τ∈Tcr(X):rk(X(τ))≤2. The group X also realizes (2m).
We claim that, without loss of generality,
[TABLE]
where
[TABLE]
In fact, the first rank–2 summand of X may be assumed to be
[τ1 τ2;p1]. The second rank–1 summand of R(X) of
type τ2 appears in a summand [τ2 τ;p2]. The type
τ cannot be τ1 because this would create a decomposition
with fully invariant summands. So without loss of generality τ=τ3. Continuing in this fashion we obtain the claimed
decomposition (7.9). The summands may be
written in the form (7) by Lemma 5.12. Thus we have the following invariants μi=μi(X).
[TABLE]
The group X also realizes (2m−1,1,1) and hence may be assumed
to be of the form
[TABLE]
where without loss of generality i<j. Again assume the
presentation of Lemma 5.12 and obtain the invariants
[TABLE]
We obtain in particular that
[TABLE]
Suppose that σ1=τk, so k=i. Assume first that k≥2. Then μk=pkpk−1=e1e2=pipi−1e2. So
pi divides pkpk−1 and it follows that pi=pk−1, so
i=k−1. Hence pkpk−1=pk−1pk−2e2, and pk−2∣pk, a contradiction. This leaves the case k=1. In this case
μ1=p1pm=e1e2=pipi−1e2. So pi divides
p1pm and it follows that pi=pm and pi−1=p1, so
i=2. Hence p1pm=p2p1e2, and p2∣pm,
again a contradiction as m≥3.
∎
Corollary 7.12**.**
There is no B–group
realizing S(n,m) for m≥3 and n≥2m.
Proof.
Proposition 7.8 and Proposition 7.7.
∎
Example 7.13**.**
The hooked family S(10,6) cannot be
realized by B–groups.
Proof.
For easy reference
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Suppose that X realizes (6,1,1,1,1) and (6,4). Then Tcr(X)={τ1,τ2,τ3,τ4,τ5,τ6} and X=[τ1τ2τ3τ4τ5τ6]⊕[τ1]⊕[τ2]⊕[τ3]⊕[τ4] by
Lemma 6.2. Note that the types τ1,…,τ4 are interchangeable, and τ5,τ6 are
interchangeable. Assume further that X realizes (2,2,2,2,2). We
claim that after renaming types if necessary we may assume that X=[τ1τ2]⊕[τ2τ3]⊕[τ3τ4]⊕[τ4τ5]⊕[τ1τ6]. In
fact, τ5 and τ6 cannot belong to the same summand and
must be paired with different types to avoid fully invariant
summands, so without loss of generality X=[τ4τ5]⊕[τ1τ6]⊕⋯. The remaining three
summands must contain τ1 and τ4 once each and τ2,τ3 twice each. With proper labeling we get X=[τ1τ2]⊕[τ2τ3]⊕[τ3τ4]⊕[τ4τ5]⊕[τ1τ6]. In order to compute
invariants we need the explicit description of X. By
Lemma 5.12 we may assume that
[TABLE]
where τ1,τ2 are p1–free, τ2,τ3 are
p2–free, τ3,τ4 are p3–free, τ4,τ5 are
p4–free, τ1,τ6 are p5–free, and the pi are
pairwise relatively prime integers.
The invariants μi=μi(X) are easily read off.
[TABLE]
The partition (4,4,1,1) cannot be realized by X. By way of
contradiction suppose X realizes (4,4,1,1). The exceptional
types τ5 and τ6 cannot be the types of the rank–1
summands because they would be fully invariant. So τ5,τ6
appear together in one of the rank–4 summands or they are
distributed over the rank–4 summands. We have to consider two
cases.
Case I. X=[τ1τ2τ3τ4]⊕[τ1τ2τ5τ6]⊕[τ3]⊕[τ4]
In this case X=X1⊕X2⊕[τ3]⊕[τ4]
where
[TABLE]
and
[TABLE]
We now see that μ4=p3p4=α4e1 and
μ5=p4=β3e2. This means that p4 is a
factor both of e1 and e2 contradicting gcd(e1,e2)=1.
Case II. X=[τ1τ2τ3τ5]⊕[τ1τ2τ4τ6]⊕[τ3]⊕[τ4]
In this case X=X1⊕X2⊕[τ3]⊕[τ4]
where
[TABLE]
and
[TABLE]
We now see that μ3=p2p3=α3e1 and
μ4=p3p4=β4e1. This means that
p3 is a factor both of e1 and e2, a contradiction.
∎
Corollary 7.14**.**
S(n,6)* cannot be realized in
B for n≥10.*
Example 7.15**.**
The hooked family S(7,4) cannot be
realized in B.
Proof.
For easy reference
[TABLE]
Suppose that X∈B realizes S(7,4). Then X=[τ1τ2τ3τ4]⊕[τ1]⊕[τ2]⊕[τ3] (Lemma 6.2). So there is
the exceptional critical type τ4 that appears only once in
decompositions. By assumption X realizes (2,2,2,1). The
rank–1 summand cannot have type τ4 because, if so, it would
be a fully invariant summand. Hence without loss of generality X=[τ4τ1]⊕[τ1τ2]⊕[τ2τ3]⊕[τ3]. Explicitly we have
[TABLE]
and τ1 is p1p2–free, τ2 is p2p3–free,
τ3 is p3–free, and τ4 is p1–free. We can now
compute the invariants μi=μτi(X).
[TABLE]
Our group X also realizes (3,2,2). There are two cases depending
on whether the exceptional type τ4 belongs to the summand of
rank 3 or not.
Case I. X=[τ4τ1τ2]⊕[τ2τ3]⊕[τ3τ1] and, explicitly,
[TABLE]
where τ2 is e2–free, τ3 is e2e3–free, and
τ1 is e3–free. By way of invariants we obtain that
[TABLE]
It follows that α2p2e2e3=α2p2p3=e1e2 and hence e3∣e1, a contradiction.
Case II. X=[τ1τ2τ3]⊕[τ3τ4]⊕[τ1τ2] and, explicitly,
[TABLE]
where τ1,τ4 are e2–free, and τ1,τ2 are
e3–free. By way of invariants we obtain that
[TABLE]
Hence e2p2=α1e1e3, an immediate
contradiction as e1,e2,e3 are pairwise relatively prime.
∎
Example 7.16**.**
The hooked family S(7,5) cannot be
realized in B. Consequently, neither can S(8,5) and
S(9,5).
Proof.
For easy reference
[TABLE]
Suppose that X∈B realizes S(7,5). Then X=[τ1τ2τ3τ4τ5]⊕[τ1]⊕[τ2] (Lemma 6.2). So there are the
exceptional critical types τ3,τ4,τ5 that appear only
once in decompositions. By assumption X realizes (3,2,2). Each
rank–2 summand must contain exactly one of τ1 and τ2
in order to avoid a fully invariant summand. Hence without loss of
generality X=[τ1τ2τ3]⊕[τ1τ4]⊕[τ2τ5]. Explicitly we have
[TABLE]
where τ1,τ4 are p2–free, and τ2,τ5 are
p3–free. We can now compute the invariants μi=μτi(X).
[TABLE]
It is easily seen that, in addition to (3,2,2), our X also
realizes (4,2,1) and (5,1,1), but it does not realize (3,3,1)
as we shall see, so not all of C(7,3) is realized. Suppose
that X realizes (3,3,1). So X=Y1⊕Y2⊕Y3 with
Y3=σw having rank 1. Then σ cannot be one of the
exceptional type τ3,τ4,τ5 to avoid a fully invariant
summand of rank 1. So without loss of generality X=[τ1τ2τ3]⊕[τ2τ4τ5]⊕τ1w1. Explicitly, we have
[TABLE]
By way of invariants we obtain that
[TABLE]
From the last two statements show that p2∣q2 and p3∣q2, and hence q2=p2p3p1′ for some p1′. Using that
[X:R(X)]=p1p2p3=q1q2 it follows that p1=q1p1′.
From the equation for μ1, it now follows that β1q1p1′p2=α1q1, so β1p1′p2=α1. We arrive at the
contradiction p2∣α1∣p1.
∎
Example 7.17**.**
The hooked families S(8,6) and
S(9,6) cannot be realized in B.
Proof.
For easy reference
[TABLE]
Suppose that X∈B realizes S(8,6). Then X=[τ1τ2τ3τ4τ5τ6]⊕[τ1]⊕[τ2]. The critical types τ3,…,τ6
appear only once in decompositions.
By assumption X realizes (4,2,2). It then also realizes
(6,1,1),(5,2,1),(4,3,1) Either one of τ1,τ2 appears
in the rank-4 summand, or both do. We have two cases:
- (1)
Case I. X=[τ1τ3τ4τ5]⊕[τ1τ2]⊕[τ2τ6] and
2. (2)
Case II. X=[τ1τ2τ3τ4]⊕[τ1τ5]⊕[τ2τ6].
Case I. Explicitly we have
[TABLE]
τ1,τ2 are p2–free, and τ2,τ6 are p3–free.
We can now compute the invariants μi=μτi(X).
[TABLE]
Case II. Explicitly we have
[TABLE]
and τ1,τ5 are p2–free, τ2,τ6 are p3–free.
We can now compute the invariants μi=μτi(X).
[TABLE]
Our group X also realizes (3,3,2). There are two cases depending
on whether the types τ1,τ2 belongs to different summands
of rank 3 or not.
- (1)
Case A. X=[τ1τ3τ4]⊕[τ2τ5τ6]⊕[τ1τ2]
2. (2)
Case B. X=[τ1τ2τ3]⊕[τ2τ4τ5]⊕[τ1τ6]
Case A. Explicitly,
[TABLE]
where τ1,τ2 are q3–free. The invariants are
[TABLE]
Case B. Explicitly,
[TABLE]
where τ6,τ1 are q2–free. The invariants are
[TABLE]
Case I.A. The relevant invariants are
[TABLE]
The equation for μ6 implies q2=p3γ6. Together with
the equation for μ5 we get α5p1=γ5p3γ6, further α5p1γ5=p3γ6, so γ6=α5p1γ6′ for some
γ6′. Next we get q2=p3α5p1γ6′. Using the equation for μ2 we conclude that
γ2p2=α5p1γ6′q