Noether’s Problem for Some Semidirect Products
Ming-chang Kang*(1)* and Jian Zhou*(2)*
*(1)*Department of Mathematics, National Taiwan University, Taipei
E-mail: [email protected]
*(2)*School of Mathematical Sciences, Peking University, Beijing
E-mail: [email protected]
Abstract.
Let k be a field, G be a finite group, k(x(g):g∈G) be the rational function field with the variables x(g) where g∈G.
The group G acts on k(x(g):g∈G) by k-automorphisms where h⋅x(g)=x(hg) for all h,g∈G. Let k(G) be the fixed field defined by k(G):=k(x(g):g∈G)G={f∈k(x(g):g∈G):h⋅f=f for all h∈G}. Noether’s problem asks whether the fixed field k(G) is rational (= purely transcendental) over k.
Let m and n be positive integers and assume that there is an integer t such that t∈(\mathbbmZ/m\mathbbmZ)× is of order n. Define a group Gm,n:=⟨σ,τ:σm=τn=1,τ−1στ=σt⟩ ≃Cm⋊Cn. We will find a sufficient condition to guarantee that k(G) is rational over k. As a result, it is shown that, for any positive integer n, the set S:={p:p is a prime number such that \mathbbmC(Gp,n) is rational over \mathbbmC} is of positive Dirichlet density; in particular, S is an infinite set.
†† 2010 Mathematics Subject
Classification. 14E08, 12F10, 13A50, 11R29.†† Keywords and phrases. Noether’s problem, rationality problem, algebraic tori, class groups.
§1. Introduction
Let k be any field, G be a finite group and G→GL(V) be a faithful linear representation of G
where V is a finite-dimensional vector space over k. Then G acts naturally on the function field k(V) by k-automorphisms. Noether’s problem asks whether the fixed field k(V)G is rational (= purely transcendental) over k. In particular, when V=Vreg is the regular representation, we will write k(G):=k(Vreg)G. Explicitly, k(Vreg):=k(x(g):g∈G) is the rational function field in the variables x(g) (where g∈G), G acts on k(Vreg) by k-automorphisms defined by h⋅x(g)=x(hg) for any h,g∈G, and k(G)=k(Vreg)G={f∈k(Vreg):h⋅f=f for all h∈G}. Note that Noether’s problem is a special case of the famous Lüroth problem.
When the group G is abelian and the field k contains enough roots of unity, the following theorem of Fischer guarantees that k(G) is rational.
Theorem 1.1** **(Fischer [Sw2, Theorem 6.1])
Let G be a finite abelian group of exponent e, k be a field containing ζe, a primitive e-th root of unity.
For any finite-dimensional representation G→GL(V) over k,
the fixed field k(V)G is rational over k.
When G is abelian and k is any field (e.g. k=\mathbbmQ), the rationality problem of k(G) was investigated by Swan, Endo and Miyata, Voskresenskii, Lenstra, etc.. Swan’s survey paper [Sw2] gives an excellent account of Noether’s problem for abelian groups.
Now we turn to Noether’s problem for non-abelian groups. We define the group Gm,n first.
Definition 1.2
Let m and n be positive integers and assume that there is an integer t such that t∈(\mathbbmZ/m\mathbbmZ)× is of order n. Define a group Gm,n:=⟨σ,τ:σm=τn=1,τ−1στ=σt⟩ ≃Cm⋊Cn.
We remark that the integer t always exists provided that m is an odd prime power and n∣ϕ(m). Also note that the group Gm,n depends on the choice of t. However, for different choices of t, the rationality criterion we are concerned about (e.g. Theorem 4.8) is not affected, which may be justified by applying Lemma 3.3. Thus we will not emphasize the dependence of Gm,n on the choice of t.
We will study under what situation the fixed field \mathbbmC(Gm,n) will be rational. The following theorem is quite useful, provided that the ring \mathbbmZ[ζn] is a UFD (unique factorization domain).
Theorem 1.3** **([Ka2, Theorem 1.4])
Let k be a field and G be a finite group.
Assume that (i) G contains an abelian normal subgroup H so that G/H is cyclic of order n,
(ii) \mathbbmZ[ζn] is a UFD where ζn is a primitive n-th root of unity,
and (iii) ζe∈k where e:=lcm{ord(g):g∈G} is the exponent of G.
If G→GL(V) is any finite-dimensional linear representation of G over k,
then k(V)G is rational over k.
It is unknown for a long time whether \mathbbmC(Gp,q) is rational or not if p and q are distinct prime numbers and \mathbbmZ[ζq] is not a UFD. We note that the assumption that \mathbbmZ[ζn] is a UFD in Theorem 1.3 imposes a severe restriction to the integer n, because of the theorem of Masley and Montgomery.
Theorem 1.4** **(Masley and Montgomery [MM])
\mathbbmZ[ζn]* is a unique factorization domain if and if 1≤n≤22,
or n=24,25,26,27,28,30,32,33,34,35,36,38,40,42,44,45,48,50,54, 60,66,70,84,90.*
A recent work of Chu and Huang [CH] found a sufficient condition for the rationality of \mathbbmC(Gm,q) where q is a prime number.
Theorem 1.5** **(Chu and Huang [CH, Main Theorem])
Let m and q be positive integers where q is a prime number and assume that there is an integer t such that t∈(\mathbbmZ/m\mathbbmZ)× is of order q. Define m′=m/gcd{m,t−1}.
Assume that there exist integers a0,a1,…,aq−2,b such that gcd{a0,a1,…,aq−2,b}=1,
bm′=a0+a1t+⋯+aq−2tq−2 and N\mathbbmQ(ζq)/\mathbbmQ(α)=m′ where α:=a0+a1ζq+⋯+aq−2ζqq−2.
If k is a field with ζm,ζq∈k, then k(Gm,q) is rational over k.
In particular, for distinct prime numbers p and q with q∣ϕ(p), if there is an element α∈\mathbbmZ[ζq] such that N\mathbbmQ(ζq)/\mathbbmQ(α)=p and k is a field with ζp,ζq∈k, then k(Gp,q) is rational over k.
As an application, Chu and Huang show that \mathbbmC(Gp,q) is rational
when (p,q)=(5801,29), (6263,31), (32783,37), (101107,41);
for more examples, see Section 4 of [CH].
Note that \mathbbmZ[ζq] is not a UFD when q=29,31,37 or 41 by Theorem 1.4;
thus these examples escape the application of Theorem 1.3.
We remark that the proof of Theorem 1.5 given in [CH] is rather computational and lengthy. Moreover, the assumptions, e.g. the number m′, look abrupt at first sight.
The purpose of this paper is to provide a conceptual approach to the rationality of k(Gm,n) different from the computational verification in [CH]. Moreover, a generalized form of Theorem 1.5 can be found in Theorem 4.7 and Theorem 4.8. A clarification of the number m′ is given in Lemma 4.6; we will show that the “purpose” of the complicated assumptions in Theorem 1.5 is just to ensure that the ideal ⟨ζq−t,m′⟩ is a principal ideal of \mathbbmZ[ζq] (see Step 3 in the proof of Theorem 4.7). The examples constructed by computer computing in [CH, Section 4] turn out to be heralds of Theorem 4.9, which asserts that, for any positive integer n, there are infinitely many prime numbers p such that the fixed field \mathbbmC(Gp,n) is rational over \mathbbmC.
In this article we will study the rationality problem of k(Gm,n) where n is any positive integer; we don’t assume that n is a prime number as in [CH]. Here is a sample of our results.
Theorem 1.6
Let m and n be positive integers such that m is an odd integer. Assume that (i) there is an integer t satisfying that t∈(\mathbbmZ/m\mathbbmZ)× is of order n,
and (ii) for any e∣n, the ideal ⟨ζe−t,m⟩ in \mathbbmZ[ζe] is a principal ideal.
If k is a field with ζm,ζn∈k,
then k(Gm,n) is rational over k.
For other results, see Theorem 4.3 and Theorem 4.8.
The main idea in the proofs of Theorem 1.6 and its variants is to apply the methods developed by Endo, Miyata, Lenstra etc. in solving Noether’s problem for abelian groups [EM1, EM2, Le]. These methods were reformulated by Colliot-Thélène and Sansuc [CTS, Section 1] (see Section 2 for a brief summary). Armed with these tools, we will embark on the investigation of the rationality problem of k(Gm,n) in Section 4.
In Section 4, the reader will find that the rationality of \mathbbmC(Gm,n) is reduced to the rationality of \mathbbmC(M)π
where π≃Cn and M is a π-lattice
(see Section 2 for the definition of a π-lattice and the multiplicative invariant field \mathbbmC(M)π).
Such a rationality problem was studied by Saltman [Sa2], Beneish and Ramsey [BR]. One of the aims of Salman in [Sa2] is to find a group π and a π-lattice M such that \mathbbmC(M)π is not retract rational (and thus not stably rational); it is necessary that such a group π is not cyclic by [Ka3]. On the other hand, Beneish and Ramsey considered a cyclic group π and proposed a notion, the Property ∗ for π [BR, Definition 3.3]. Assuming the Property ∗, they were able to prove two significant results.
Theorem 1.7** **(Beneish and Ramsey [BR, Theorem 3.12 and Theorem 3.13])
Assume that the Property ∗ for a cyclic group of order n is valid.
(i) Let π≃Cn and M be any π-lattice. If k is a field with ζn∈k, then k(M)π is stably rational over k.
(ii) Let G:=A⋊Cn where A is a finite abelian group of exponent e. If k is a field with ζe,ζn∈k, then k(G) is stably rational over k.
In Theorem 5.1 we will prove that the Property ∗ for a cyclic group of order n is equivalent to the assertion that \mathbbmZ[ζn] is a UFD. As a result an alternative proof of Theorem 1.7 will be given in Section 5. In fact, similar results are valid, say, for the dihedral group, because such kind of theorems are consequences of Endo-Miyata’s Theorem [EM2, Theorem 3.3; EK, Theorem 1.4]; see Theorem 5.2 and Lemma 5.3.
Finally we remark that, besides the sufficient condition for the rationality of \mathbbmC(Gm,n),
the retract rationality, one of the necessary conditions, is already known before.
For a field extension L of k (where k is an infinite field),
the notion that L is retract rational over k is introduced by Saltman [Sa1].
It is known that “rational” ⇒ “stably rational” ⇒ “retract rational” ⇒ “unirational”.
The reader may consult Theorem 1.6, Theorem 1.7 and Theorem 1.8 of [Ka3]
for a quick review of the retract rationality of \mathbbmC(A⋊Cn) where A is a finite abelian group.
Standing notations.
Throughout this article, we consider only finite groups. The following notations are adopted:
Cn: the cyclic group of order n,
π: a finite group,
\mathbbmZπ: the integral group ring of π,
Φn(X): the n-th cyclotomic polynomial,
ϕ(n): the value of the Euler ϕ-function at n,
(\mathbbmZ/m\mathbbmZ)×: the group of units of the ring \mathbbmZ/m\mathbbmZ,
ordp(n): the exponent of p in n, i.e. if ordp(n)=e, then pe∣n but pe+1∤n,
ζn: a primitive n-th root of unity.
When we say that ζn∈k (k is a field), it is understood that either chark=0 or chark>0 with chark∤n.
Recall that a field extension L/k is rational if L is purely transcendental over k,
i.e. L≃k(x1,…,xn) over k where k(x1,…,xn) is the rational function field of n variables over k.
A field extension L/k is stably rational if L(y1,…,ym) is rational over k
where y1,…,ym are some elements algebraically independent over L. If π is a group and τ∈π, then ⟨τ⟩ denotes the subgroup generated by τ; similarly, if R is a commutative ring and α1,α2,⋯,αn∈R, then ⟨α1,α2,⋯,αn⟩ denotes the ideal generated by α1,α2,⋯,αn.
Let m and n be positive integers.
For the sake of simplicity, we will simply say that t∈(\mathbbmZ/m\mathbbmZ)× is of order n,
when we mean that t∈\mathbbmZ, gcd{t,m}=1 and the subgroup ⟨tˉ⟩≃Cn
where tˉ is the residue class of t in (\mathbbmZ/m\mathbbmZ)×.
Finally we remind the reader that the fixed field k(G) is defined at the beginning of this section.
Acknowledgments. The proof of Theorem 4.9 was suggested by Prof. Ching-Li Chai (Univ. of Pennsylvania), whose help is highly appreciated.
§2. Preliminaries
Let π be a finite group.
We recall the definition of π-lattices.
Definition 2.1
Let π be a finite group.
A finitely generated \mathbbmZ[π]-module M is called a π-lattice if M is a free abelian group when it is regarded as an abelian group.
If M is a π-lattice and L is a field with π-action,
we will associate a rational function field over L with π-action as follows.
Suppose that M=⨁1≤i≤m\mathbbmZ⋅ui.
Define L(M)=L(x1,…,xm), a rational function field of m variables over L.
For any σ∈π, if σ⋅ui=∑1≤j≤maijuj in M (where aij∈\mathbbmZ),
we define σ⋅xi=∏1≤j≤mxjaij in L(M) and,
for any α∈L, define σ⋅α by the prescribed π-action on L.
Note that, if π acts faithfully on L and K=Lπ (i.e. π≃Gal(L/K)),
then the fixed field L(M)π={f∈L(M):σ⋅f=f for all σ∈π} is the function field of an algebraic torus defined over K,
split by L and with character lattice M (see [Vo, Sw2, Section 12; Sa2]).
On the other hand, if π acts trivially on L (i.e. σ(α)=α for all σ∈π, for all α∈L),
the action of π on L(M) is called a purely monomial action in some literature. When we write k(M)π without emphasizing the action of π on k, it is understood that π acts trivially on k, i.e. the situation of purely monomial actions.
Definition 2.2
Let π be a finite group and M be a π-lattice.
M is called a permutation lattice if M has a \mathbbmZ-basis permuted by π.
A π-lattice M is called an invertible lattice if it is a direct summand of some permutation lattice.
A π-lattice M is called a flabby lattice if H−1(π′,M)=0 for all subgroup π′ of π;
it is called a coflabby lattice if H1(π′,M)=0 for all subgroups π′ of π.
For the basic properties of π-lattices, see [CTS, Sw2].
Definition 2.3
Let π be a finite group.
Denote by Lπ (resp. Fπ) the class of all the π-lattices (resp. all the flabby π-lattices).
We introduce a similarity relation on Lπ and Fπ:
two lattices M1 and M2 are similar,
denoted by M1∼M2, if M1⊕Q1≃M2⊕Q2 for some permutation π-lattices Q1 and Q2.
Let Lπ/∼ and Fπ/∼ be the sets of similarity classes of Lπ and Fπ respectively;
we define Fπ=Fπ/∼.
For each π-lattice M,
denote by [M] the similarity class containing M.
We define an addition on Lπ/∼ and Fπ as follows: [M1]+[M2]:=[M1⊕M2] for any π-lattices M1 and M2.
In this way, Lπ/∼ becomes an abelian monoid and Fπ is a submonoid of Lπ/∼.
Note that [M]=0 in Fπ if and only if M is stably permutation,
i.e. M⊕Q is isomorphic to a permutation π-lattice where Q is some permutation π-lattice.
See [Sw2] for details.
Definition 2.4
Let π be a finite group, M be a π-lattice.
The M have a flabby resolution,
i.e. there is an exact sequence of π-lattices:
0→M→Q→E→0 where Q is a permutation lattice and E is a flabby lattice [EM2, Lemma 1.1; CTS; Sw2].
Although the above flabby resolution is not unique, the class [E]∈Fπ is uniquely determined by M.
Thus we define the flabby class of M, denoted as [M]fl,
by [M]fl=[E]∈Fπ (see [Sw2]).
Sometimes we say that [M]fl is permutation or invertible if the class [E] contains a permutation lattice or an invertible lattice.
Theorem 2.5
Let L/K be a finite Galois extension with π=Gal(L/K),
and let M be a π-lattice.
The group π acts on the field L(M) as in Definition 2.1.
- (1)
([EM1, Theorem 1.6; Vo; Le, Theorem 1.7; CTS])*
The fixed field L(M)π is stably rational over K if and only if [M]fl=0 in Fπ.*
2. (2)
([Sa1, Theorem 3.14])*
Assume that K is an infinite field.
Then the fixed field L(M)π is retract rational over K if and only if [M]fl is invertible.*
Finally we recall a variant of the No-Name Lemma.
Theorem 2.6** **([HK, Theorem 1])
Let L be a field and G be a finite group acting on L(x1,…,xm),
the rational function field of m variables over L.
Assume that
- (i)
for any σ∈G, σ(L)⊂L,
2. (ii)
the restriction of the action of G to L is faithful, and
3. (iii)
for any σ∈G,
[TABLE]
where A(σ)∈GLm(L) and B(σ) is an m×1 matrix over L.
Then L(x1,…,xm)=L(z1,…,zm) for some elements z1,…,zm∈L(x1,…,xm)
such that σ(zi)=zi for all σ∈G, for all 1≤i≤m.
Consequently, L(x1,…,xm)G=LG(z1,…,zm).
§3. Some ideals of \mathbbmZ[ζn]
Let \mathbbmZ[ζn] be the ring of integers of the cyclotomic field \mathbbmQ(ζn).
Lemma 3.1
(1) ([Ar, Lemma 1; Le, Lemma 3.8])*
Let p≥3 be a prime number.
For simplicity, we write ord(m) for ordp(m).
Suppose that t∈(\mathbbmZ/p\mathbbmZ)× is of order n, then*
ord(Φn(t))=ord(tn−1)≥1;
ord(Φpdn(t))=1* if d≥1;*
ord(Φe(t))=0* if e∈\mathbbmN and e is not of the form pdn (where d≥0);*
ord(tl−1)=0* if l∈\mathbbmN and n∤l;*
ord(tl−1)=ord(tn−1)+ord(l)* if l∈\mathbbmN and n∣l.*
(2) ([EM1, page 15])*
Let p≥3 and ord(m) be the same as in (1).*
Let d≥1, n∣ϕ(pd) and n=pd0n0 where 0≤d0≤d−1 and p∤n0.
Let t∈(\mathbbmZ/pd\mathbbmZ)× be of order n.
Then
ord(Φn0(t))≥d* if d0=0, i.e. p∤n;*
ord(Φn0(t))=d−d0* if d0≥1;*
ord(Φpd′n0(t))=1* if d0≥1 and 1≤d′≤d0,*
ord(Φpd′n′(t))=0* if 0≤d′≤d0, n′∣n0 and n′<n0.*
(3) ([Ar, Lemma 1])*
ord2(Φ2d(t))=1 if d≥2 and t is an odd integer.*
Lemma 3.2
Let m1, m2 and n be positive integer such that gcd{m1,m2}=1.
If J is an ideal of \mathbbmZ[ζn],
then ⟨J,m1m2⟩=⟨J,m1⟩⋅⟨J,m2⟩=⟨J,m1⟩∩⟨J,m2⟩.
Proof..
Since m1 and m2 are relatively prime, the ideal ⟨J,m1⟩ and ⟨J,m2⟩ are comaximal. Thus ⟨J,m1⟩⋅⟨J,m2⟩=⟨J,m1⟩∩⟨J,m2⟩
It is clear that ⟨J,m1m2⟩⊂⟨J,m1⟩∩⟨J,m2⟩=⟨J,m1⟩⋅⟨J,m2⟩⊂⟨J,m1m2⟩.
Done.
∎
Recall that, if J is an ideal of \mathbbmZ[ζn],
then the (absolute) norm of J, denoted by N\mathbbmQ(ζn)/\mathbbmQ(J), is the index of J in \mathbbmZ[ζn];
in other words, N\mathbbmQ(ζn)/\mathbbmQ(J)=∣\mathbbmZ[ζn]/J∣
(see, for examples, [IR, pages 203–204]).
Consequently, if a∈\mathbbmZ[ζn]\{0},
then N\mathbbmQ(ζn)/\mathbbmQ (⟨a⟩)=∣Norm\mathbbmQ(ζn)/\mathbbmQ(a)∣.
Lemma 3.3
Let m=pd where p≥3 is a prime number and d≥1.
Let n be a positive integer with n∣ϕ(m).
Write n=pd0n0 where d0≥0 and p∤n0.
Suppose that t∈(\mathbbmZ/m\mathbbmZ)× is of order n.
(1)* If e∣n and e=pd′n′ with 0≤d′≤d0 and p∤n′, then*
[TABLE]
Moreover, for 1≤d′′≤d, ⟨ζe−t,pd′′⟩=⟨ζe−t,p⟩d′′.
(2)* Every prime ideal of \mathbbmZ[ζn] lying over p is of the form ⟨ζn−t′,p⟩
where t′ is an integer and t′∈(\mathbbmZ/m\mathbbmZ)× is of order n. All of these prime ideals are conjugate in \mathbbmZ[ζn]. In fact, if e∣n and 1≤d′′≤d, the ideals ⟨ζe−t,pd′′⟩ and ⟨ζe−t′,pd′′⟩ are conjugate in \mathbbmZ[ζe].*
(3)* The following assertions are equivalent:
The ideal ⟨ζn−t,p⟩ is a principal ideal
⇔ There is an element α∈\mathbbmZ[ζn] such that N\mathbbmQ(ζn)/\mathbbmQ(α)=±p
⇔ For any e∣n, the ideal ⟨ζe−t,p⟩ is a principal ideal.*
Proof..
(1) If e∣n with e=pd′n′ where n′=n0, we will show that ⟨ζe−t,p⟩⊊\mathbbmZ[ζe].
Otherwise, there are x,y∈\mathbbmZ[ζe] such that x(ζe−t)+py=1.
For any g∈Gal(\mathbbmQ(ζe)/\mathbbmQ), we have g(x)⋅(g(ζe)−t)+pg(y)=1.
Hence 1=∏g[g(x)(g(ζe)−t)+pg(y)]=α⋅Φe(t)+p⋅β for some α,β∈\mathbbmZ[ζe].
By Lemma 3.1 (2), we have p∣Φe(t).
Thus p∣αΦe(t)+pβ in \mathbbmZ[ζe].
A contradiction.
Now suppose that e∣n with n′<n0.
By Lemma 3.1 (2) again, we find that p∤Φe(t).
Thus we may find integers a and b with aΦe(t)+pb=1.
Since Φe(t)=∏i(t−ζei) where i runs over integers in (\mathbbmZ/e\mathbbmZ)×,
it follows that ⟨ζe−t,p⟩=\mathbbmZ[ζe].
We will prove that ⟨ζe−t,pd′′⟩=⟨ζe−t,p⟩d′′. If ⟨ζe−t,p⟩=\mathbbmZ[ζe], then α(ζe−t)+pβ=1 for some α,β∈\mathbbmZ[ζe]. Hence 1=(α(ζe−t)+pβ)d′′=γ(ζe−t)+pd′′βd′′∈⟨ζe−t,pd′′⟩ for some γ∈\mathbbmZ[ζe]. It remains to consider the case when ⟨ζe−t,p⟩ is a proper ideal of \mathbbmZ[ζe]. The ideals ⟨ζe−t,p⟩d′′ and ⟨ζe−t,pd′′⟩ are of the same norm pd′′. Since ⟨ζe−t,p⟩d′′⊂⟨ζe−t,pd′′⟩, thus they are equal.
(2) By (1), the ideal ⟨ζn−t,p⟩ is of norm p;
thus it is a prime ideal lying over p. By [IR, page 182, Proposition 12.3.3] all the prime ideals of \mathbbmZ[ζn] lying over p are conjugate to each other. Thus they are of the form ⟨ζnu−t,p⟩ where u is an integer, 1≤u≤n−1 and gcd{n,u}=1. For each u, choose an integer v with 1≤v≤n−1 and uv≡1(modn). We will show that ⟨ζnu−t,p⟩=⟨ζn−tv,p⟩. Since ζn−tv=ζnuv−tv is divisible by ζnu−t, we find that ⟨ζnu−t,p⟩⊃⟨ζn−tv,p⟩. These two ideals are of the same norm p by (1) (note that \mathbbmZ[ζn]=\mathbbmZ[ζnu]). Thus they are equal. We conclude that all the prime ideals over p are conjugate and are of the required form.
We will show that ⟨ζe−t,pd′′⟩ and ⟨ζe−t′,pd′′⟩ are conjugate. If ⟨ζe−t,p⟩=\mathbbmZ[ζe], then ⟨ζe−t′,p⟩=\mathbbmZ[ζe] because it depends only on the factorizations of n and e by (1). Using (1) again, we find that ⟨ζe−t,pd′′⟩=\mathbbmZ[ζe]=⟨ζe−t′,pd′′⟩. Now assume that both ⟨ζe−t,p⟩ and ⟨ζe−t′,p⟩ are proper ideal of \mathbbmZ[ζe]. Then they are prime ideals lying over p. Hence they are conjugate in \mathbbmZ[ζe]. By (1) we find that ⟨ζe−t,pd′′⟩ and ⟨ζe−t′,pd′′⟩ are also conjugate.
(3) If α∈\mathbbmZ[ζn] is of norm ±p, then ∣\mathbbmZ[ζn]/⟨α⟩∣=p. Thus ⟨α⟩ is a prime ideal and p∈⟨α⟩. Hence ⟨α⟩ is a prime ideal over p. It follows that ⟨α⟩=⟨ζn−t′,p⟩ for some t′∈(\mathbbmZ/m\mathbbmZ)× of order n. Since ⟨ζn−t,p⟩ and ⟨ζn−t′,p⟩ are conjugate by (2), we find that ⟨ζn−t,p⟩ is a principal ideal.
Now assume that ⟨ζn−t,p⟩ is a principal ideal.
For any e∣n, consider ⟨ζe−t,p⟩.
If ⟨ζe−t,p⟩=\mathbbmZ[ζe], there is nothing to prove.
Now assume that ⟨ζe−t,p⟩⊊\mathbbmZ[ζe].
Then ⟨ζe−t,p⟩ is a prime ideal lying over p.
Since there is an element α∈\mathbbmZ[ζn] with N\mathbbmQ(ζn)/\mathbbmQ(α)=±p,
define β=N\mathbbmQ(ζn)/\mathbbmQ(ζe)(α).
Then N\mathbbmQ(ζe)/\mathbbmQ(β)=±p.
It follows that ⟨β⟩ is a prime ideal of \mathbbmZ[ζe] over p.
But ⟨ζe−t,p⟩ is also a prime ideal over p.
Thus ⟨ζe−t,p⟩ is conjugate to ⟨β⟩.
Hence ⟨ζe−t,p⟩ is a principal ideal of \mathbbmZ[ζe].
∎
§4. The main results
Recall that, for positive integers m, n and the integer t∈(\mathbbmZ/m\mathbbmZ)× of order n, the group Gm,n is defined in Definition 1.2. In this section, We will find sufficient conditions to guarantee that \mathbbmC(Gm,n) is rational over \mathbbmC under various situations for m and n.
Theorem 4.1** **([EM1, Theorem 1.11; Vo; Le, Theorem 2.6])
Let K/k be a finite Galois extension with π=Gal(K/k).
Let M be a π-lattice.
Assume furthermore that π=⟨τ⟩≃Cn and M is a projective \mathbbmZπ-module.
Then the following three statements are equivalent:
- (i)
the field K(M)π is stably rational over k;
2. (ii)
the field K(M)π is rational over k;
3. (iii)
for any e∣n, the module M/Φe(τ)M is a free \mathbbmZ[ζe]-module.
(Note that M/Φe(τ)M is a module over \mathbbmZπ/Φe(τ)≃\mathbbmZ[ζe].)
Before stating Theorem 4.2, we explain some terminology.
We denote by C(\mathbbmZ[ζe]) the ideal class group of \mathbbmZ[ζe],
i.e. the quotient group of the group of non-zero fractional ideals of \mathbbmZ[ζe] by the subgroup of principal ideals. Thus, if M is a finitely generated torsion-free \mathbbmZ[ζe]-module and
M≃I1⊕I2⊕⋯⊕Il where each Ij is a non-zero ideal of \mathbbmZ[ζe],
then the class of M in C(\mathbbmZ[ζe]),
denoted by [M], is defined as [M]=[I1⋅I2⋯Il]∈C(\mathbbmZ[ζe]).
If M is a finitely generated \mathbbmZ[ζe]-module,
(M)0 denotes M/t(M) where t(M) is the torsion submodule of M.
Theorem 4.2** **([EM2, page 86; Sw3, Theorem 2.10; EK, Theorem 1.4])
Let π=⟨τ⟩≃Cn, Fπ be the flabby class monoid of Definition 2.3.
Then Fπ is a finite group and the group homomorphism c:Fπ→⨁e∣nC(\mathbbmZ[ζe])
defined by c([M])=(…,[(M/Φe(τ)M)0],…) is an isomorphism where M is a flabby π-lattice.
Theorem 4.3
Let m and n be positive integers.
Assume that (i) gcd{m,n}=1, there is an integer t such that t∈(\mathbbmZ/m\mathbbmZ)× is of order n, and (ii) for any e∣n, the ideal ⟨ζe−t,m⟩ in \mathbbmZ[ζe] is a principal ideal. If k is a field with ζm,ζn∈k, then k(Gm,n) is rational over k.
Proof..
The situation m=1 or n=1 is trivial.
Thus we may assume that m,n≥2. For simplicity, write G=Gm,n and G=⟨σ,τ:σm=τn=1,τ−1στ=σt⟩.
Step 1.
Let V:=Vreg=⨁g∈Gk⋅ug be the regular representation space of G such that h⋅ug=uhg for any g,h∈G.
Let {x(g):g∈G} be the dual basis of {ug:g∈G}.
Then the induced action of G acts on the dual space V∗=⨁g∈Gk⋅x(g) by h⋅x(g)=x(hg) for any g,h∈G. Since k[V] is the symmetric algebra of V∗, we find that k(G)=k(V)G=k(x(g):g∈G)G.
Define X=∑0≤i≤m−1ζm−ix(σi)∈V∗. Then σ⋅X=ζmX.
Define yj=τj⋅X∈V∗ for 0≤j≤n−1.
It is easy to verify that
[TABLE]
By Theorem 2.6, k(G)=k(yj:0≤j≤n−1)G(z1,…,zmn−n) where g⋅zi=zi for all 1≤i≤mn−n and for all g∈G.
Now k(yj:0≤j≤n−1)⟨σ⟩=k(y0m,yj/yj−1t:1≤j≤n−1).
Let π=⟨τ⟩ and ⟨yj:0≤j≤n−1⟩ be the multiplicative subgroup of k(yj:0≤j≤n−1)\{0}.
As a π-lattice, ⟨yj:0≤j≤n−1⟩≃\mathbbmZπ.
Define a π-sublattice M of \mathbbmZπ by
[TABLE]
Under the isomorphism ⟨yj:0≤j≤n−1⟩≃\mathbbmZπ, M corresponds to ⟨y0m,yj/yj−1t:1≤j≤n−1⟩.
In other words, k(y0m,yj/yj−1t:1≤j≤n−1)≃k(M) and
k(G)=k(yj:0≤j≤n−1)G(z1,…,zmn−n)≃k(M)⟨τ⟩(z1,…,zmn−n).
The π-lattice M is called the Masuda’s ideal in [EM1, page 14]. We will show that it is a projective ideal of \mathbbmZπ in Step 4, i.e. a left ideal of of \mathbbmZπ which is also a \mathbbmZπ-projective module.
Step 2.
Let M′=⨁0≤j≤n−1\mathbbmZ⋅vj be the π-lattice defined by
τ:v0↦v1↦⋯↦vn−1↦v0,
i.e. M′≃\mathbbmZπ.
Consider k(M⊕M′)⟨τ⟩.
Since π=⟨τ⟩ acts faithfully on k(M) and k(M⊕M′)=k(M)(vj:0≤j≤n−1),
it follows that k(M⊕M′)⟨τ⟩=k(M)⟨τ⟩(w1,…,wn)
where τ⋅wj=wj for all 1≤j≤n by Theorem 2.6.
It follows that k(G)≃k(M⊕M′)⟨τ⟩(z1′,z2′,…,zmn−2n′).
We will show that k(M⊕M′)⟨τ⟩ is rational over k.
Once this is finished, we find that k(G) is rational over k.
Step 3.
Regard k(M⊕M′)⟨τ⟩=k(M′)(M)⟨τ⟩.
Write K:=k(M′), k0=k(M′)⟨τ⟩.
Then K/k0 is a finite Galois extension with Gal(K/k0)=π.
Moreover, k0=k(M′)⟨τ⟩ is rational over k by Theorem 1.1
since ζn∈k and π=⟨τ⟩ is abelian.
If we show that K(M)⟨τ⟩=k(M′)(M)⟨τ⟩ is rational over k0,
then k(M⊕M′)⟨τ⟩ is rational over k.
Step 4.
From the definition of M, i.e. Formula (4.1), it is clear that [\mathbbmZπ:M]=m.
Since gcd{m,n}=1, it follows that M is a projective \mathbbmZπ-module by [Sw1, Proposition 7.1; Ka2, Theorem 3.9]. Hence we may apply Theorem 4.1 to M.
We remark that this is the only situation in which the assumption gcd{m,n}=1 is used.
Note that, since M is \mathbbmZπ-projective, it follows that M/Φe(τ)M=\mathbbmZπ/Φe(τ)⊗M is torsion-free,
i.e. M/Φe(τ)M=(M/Φe(τ)M)0 in the notation of Theorem 4.2.
Since M is a sublattice of \mathbbmZπ with \mathbbmZπ/M torsion,
we may use [Le, Proposition 2.2] to evaluate M/Φe(τ)M.
We find that, M/Φe(τ)M is the image of M=⟨τ−t,m⟩ in \mathbbmZπ/Φe(τ)⋅\mathbbmZπ≃\mathbbmZ[ζe].
We find that M/Φe(τ)M≃⟨ζe−t,m⟩.
By assumption, for all e∣n, ⟨ζe−t,m⟩ is a principal ideal,
i.e. the class of ⟨ζe−t,m⟩ in C(\mathbbmZ[ζe]) is the zero class.
By Theorem 4.2,
we obtain that c([M])=0 and thus [M]=0 in Fπ.
In conclusion, M is a projective ideal of \mathbbmZπ and [M]=0 in Fπ
(equivalently, there is permutation π-lattices Q1 and Q2 such that M⊕Q1≃Q2).
Step 5.
Since M is \mathbbmZπ-projective,
there is a projective \mathbbmZπ-module P such that M⊕P≃\mathbbmZπ(l) for some integer l.
It follows that 0→M→\mathbbmZπ(l)→P→0 is a flabby resolution.
Thus [M]fl=[P].
From M⊕P≃\mathbbmZπ(l) and M⊕Q1≃Q2,
we get Q2⊕P≃Q1⊕M⊕P≃Q1⊕\mathbbmZπ(l).
Hence [M]fl=[P]=0 in Fπ.
By Theorem 2.5, K(M)⟨τ⟩ is stably rational over k0 (remember that the definitions of K and k0 in Step 3).
Apply Theorem 4.1.
We obtain that K(M)⟨τ⟩ is rational over k0 because M is \mathbbmZπ-projective.
∎
Remark.
In the above theorem, the assumption ζm,ζn∈k may be replaced by ζm∈k and k(Cn) is rational over k, because we may apply Theorem 1.1.
Lemma 4.4
Let π be a cyclic group of order n and M be a π-lattice satisfying that [M]fl=0. If k is a field with ζn∈k, then k(M)π is stably rational over k.
Proof..
Step 1. Define π′={λ∈π:λ acts trivially on M}. Define π′′=π/π′. Then M is a faithful π′′-lattice. As a π-lattice, [M]fl=0. It follows that, as a π′′-lattice, we also have [M]fl=0 by [CTS, page 180, Lemma 2].
Step 2. We use the ideas of Step 2 and Step 3 in the proof of Theorem 4.3.
Define M′=\mathbbmZπ′′. Consider the fixed field k(M⊕M′)π(=k(M⊕M)π′′). Since M is a faithful π′′-lattice, we may apply Theorem 2.6. We get k(M⊕M′)π=k(M)π(w1,…,we) where e=∣π′′∣.
On the other hand, since [M]fl=0 as a π′′-lattice, we may apply Theorem 2.5. It follows that k(M⊕M′)π is stably rational over k(M′)π′′. Since ζn∈k, clearly ζe∈k (remember that e=∣π′′∣). Hence k(M′)π′′ is rational over k by Theorem 1.1. In conclusion, k(M⊕M′)π is stably rational over k. Thus we find that k(M)π is also stably rational over k.
∎
Remark.
In the above lemma, the condition [M]fl=0 is a mild restriction. In fact, it may happen that M may be a projective \mathbbmZπ-module which is not stably free and is not a permutation lattice, while [M]=0 (equivalently, [M]fl=0). Here is such an example taken from [EM1, page 18, line -17].
Let π=⟨τ⟩≃C12,
t be an integer such that t∈(\mathbbmZ/13\mathbbmZ)× is of order 12, i.e. a primitive root of (\mathbbmZ/13\mathbbmZ)×.
Then M=⟨τ−t,13⟩⊂\mathbbmZπ is a projective \mathbbmZπ-module by [EM1, Proposition 2.6]. M is a projective ideal of \mathbbmZπ.
Clearly M is not a free module, i.e. M is not a principal ideal of \mathbbmZπ. Obviously it is not a permutation π-lattice. We claim that M is not a stably free \mathbbmZπ-module. Otherwise, we have M⊕\mathbbmZπ(s)≃\mathbbmZπ(s+1) for some positive integer s. Taking the the determinant of both sides, we find that M is a free module, which is a contradiction.
However, the class [M]∈Fπ is the zero class because c([M])=0 by Theorem 4.2
(by Theorem 1.4 \mathbbmZ[ζe] is a UFD for all divisors e of 12).
It follows that M is stably permutation.
Lemma 4.5
Let m, n be positive integers.
Assume that (i) m=pd (p≥3 is a prime number, d≥1),
t is an integer such that t∈(\mathbbmZ/m\mathbbmZ)× is of order n,
and (ii) for any e∣n,
the ideal ⟨ζe−t,m⟩ in \mathbbmZ[ζe] is a principal ideal.
If k is a field with ζm,ζn∈k, then k(Gm,n) is rational over k.
Proof..
Write Gm,n=⟨σ,τ:σm=τn=1,τ−1στ=σt⟩.
All the assumptions and the conclusion in this lemma are the same as those in Theorem 4.3,
except that we don’t assume that gcd{m,n}=1 and replace it by m=pd.
The proof of Theorem 4.3 remains valid till Step 3.
We will also show that the ideal M=⟨τ−t,m⟩⊂\mathbbmZπ is a projective \mathbbmZπ-module.
The fact that M is \mathbbmZπ-projective follows from [EM1, Proposition 2.6]. In fact, it is the Masuda’s ideal mentioned in Step 1 of the proof of Theorem 4.3. The ideal M is denoted by MV (and also by Ik(plj)) in [EM1, page 14–15].
For the convenience of the reader, we explain briefly the main idea of the proof [EM1, Proposition 2.6]. Using our notation, consider the module \mathbbmZπ/M. By a direct verification, we show that \mathbbmZπ/M is cohomologically trivial [Ri, Theorem 4.12] (the verification is straightforward). Hence M is also cohomologically trivial. Then we may apply [Ri, Theorem 4.11] to conclude that M is projective.
Once we know that M is \mathbbmZπ-projective, the remaining proof of Theorem 4.3 works as before.
∎
Proof of Theorem 1.6.
——————–
Let G:=Gm,n=⟨σ,τ:σm=τn=1,τ−1στ=σt⟩.
Write m=∏1≤i≤rpidi where p1,…,pr are distinct prime number and di≥1.
Define mi:=m/pidi for 1≤i≤r;
and define σi=σmi, Hi=⟨σj:j=i⟩.
Then ⟨σ⟩=⟨σi⟩×Hi, and ⟨σ⟩=⟨σ1,…,σr⟩.
Let V∗=⨁g∈Gk⋅x(g) be the same as in Step 1 of the proof of Theorem 4.3.
For 1≤j≤r, define
[TABLE]
It is routine to check that
[TABLE]
By Theorem 2.6, k(G) is rational over k(yl(i):1≤i≤r,0≤l≤n−1)G.
Moreover, k(y_{l}^{(i)}:1\leq i\leq r,0\leq l\leq n-1)^{\langle\sigma\rangle}=k\big{(}(y_{0}^{(i)})^{p_{i}^{d_{i}}},y_{l}^{(i)}/(y_{l-1}^{(i)})^{t}:1\leq i\leq r,1\leq l\leq n-1\big{)}.
Write π=⟨τ⟩.
Define a π-lattice Mi of \mathbbmZπ by
[TABLE]
Since each pi is odd, it follows that Mi is \mathbbmZπ-projective by [EM1, Proposition 2.6] (see the proof of Lemma 4.5).
Note that k(yl(i):1≤i≤r,0≤l≤n−1)G=k(M1⊕⋯⊕Mr)⟨τ⟩.
For any e∣n, ⟨ζe−t,m⟩=∏1≤i≤r⟨ζe−t,pidi⟩=∏1≤i≤r[Mi/Φe(τ)Mi]
is the e-th component of c(M) where M=⨁1≤i≤rMi and c:Fπ→⨁e∣nC(\mathbbmZ[ζe])
is the isomorphism defined in Theorem 4.2.
By assumption ⟨ζe−t,m⟩ is a principal ideal.
Hence c(M)=0 and thus [M]=0 in Fπ by Theorem 4.2.
The remaining part of the proof is the same as in Theorem 4.3.
Done.
∎
In Theorem 4.7 we will give a generalization of Theorem 1.5 using the method of Theorem 4.3.
Recall the assumptions in Theorem 1.5: q is a prime number, t∈(\mathbbmZ/m\mathbbmZ)× is of order q,
Gm,n=⟨σ,τ:σm=τq=1,τ−1στ=σt⟩,
and m′=m/gcd{m,t−1}.
Write m=qd0∏1≤i≤spidi⋅∏1≤j≤s′qjej where d0=ordq(m)≥0, di,ej≥1,
q, pi, qj are distinct prime numbers such that pi∤t−1 for 1≤i≤s,
and qj∣t−1 for 1≤j≤s′.
Define m′′=∏1≤i≤spidi. Define m1 and m2 by the formula m=m1m2 and m2 is defined by
[TABLE]
Lemma 4.6
Let m′, m′′, m1 and m2 be defined as above.
Then
[TABLE]
In fact, q∣m′ if and only if ordq(t−1)=d0−1≥1 with ordq(m2)=d0.
Proof..
If q∤m, then q∤m′.
Thus we will consider the situation q∣m in the sequel.
We will show that, if 1≤ordq(t−1)<ordq(m), then ordq(t−1)=ordq(m)−1.
Since q∣m, it follows that tq≡1(modqd0) where d0=expq(m). From t≡tq(modq), we get q∣t−1.
If ordq(t−1)≥ordq(m), then q∤m′ and q∤m2.
It remains to consider the situation 1≤ordq(t−1)<ordq(m).
Write t=1+agd′ and m=bqd0 where 1≤d′<d0 and q∤ab.
From tq≡1(modqd0),
we find that tq−1=(1+aqd′)q−1=aqd′+1+cqd′+2 for some integer c.
Thus d′+1=d0 as we expected.
Clearly ordq(m′)=1 and ordq(m2)=d0.
Suppose that qj=q is a prime divisor of m with qj∣t−1.
Write t=1+aqjd′, m=bqjej where d′,ej≥1 and qj∤ab.
We claim that d′≥ej.
Otherwise, d′≤ej−1.
Then qjej will not divide tq−1=(1+aqjd′)q−1=aqqjd′+cqj2d′ where c is some integer.
We conclude that d′≥ej and qj∤m′.
∎
The following theorem is slightly different from Theorem 1.5. In fact, we don’t require that gcd{a0,a1,…,aq−2,b}=1 and the positivity condition of the norm in Theorem 1.5 is waived.
Theorem 4.7
Let m and q be positive integers where q is a prime number and assume that there is an integer t such that t∈(\mathbbmZ/m\mathbbmZ)× is of order q.
Define m′=m/gcd{m,t−1}.
Assume that there exist integers a0,a1,…,aq−2,b such that bm′=a0+a1t+⋯+aq−2tq−2 and
N\mathbbmQ(ζq)/\mathbbmQ(α)=±m′ where α:=a0+a1ζq+⋯+aq−2ζqq−2.
If k is a field with ζm,ζq∈k,
then k(Gm,n) is rational over k.
Proof..
Write G:=Gm,n=⟨σ,τ:σm=τq=1,τ−1στ=σt⟩.
Step 1.
If q=2, we may apply Theorem 1.3.
Thus we assume that q≥3 from now on.
The notations m′, m′′, m1, m2 and pi (1≤i≤s), qj (1≤j≤s′) in Lemma 4.6 remain in force throughout the proof.
Note that m′′ and m2 are odd integers.
Otherwise, pi=2 for some 1≤i≤s.
By definition, t∈(\mathbbmZ/pidi\mathbbmZ)× is of order q>1.
If pi=2, then (\mathbbmZ/pidi\mathbbmZ)× is a group of order 2di−1.
Since q is odd, we get a contradiction.
Step 2.
By Lemma 4.6 and the definitions of m1 and m2 in Equation (4.3), it is routine to verify that m1∣t−1 no matter whether q∣m′ or not.
Define λ=σm2, ρ=σm1. Then τ−1λτ=λ because m1∣t−1.
Define H:=⟨λ⟩≃Cm1 and G0:=⟨ρ,τ⟩≃Gm2,q.
Thus G=H×G0. If both k(H) and k(G0) are rational, then k(G) is also rational by [KP, Theorem 1.3]. Note that k(H) is rational by Theorem 1.1. It remains to show that k(G0) is rational over k.
To show that k(G0) is rational over k, we will apply Theorem 1.6 (remember that both m2 and q are odd by Step 1). Thus the goal is to show that ⟨ζq−t,m2⟩ is a principal ideal of \mathbbmZ[ζq].
Step 3.
From the assumption of Theorem 1.5 there exist integers a0,a1,…,aq−2,b such that bm′=a0+a1t+⋯+aq−2tq−2
and N\mathbbmQ(ζq)/\mathbbmQ(α)=±m′ where α:=a0+a1ζq+⋯+aq−2ζqq−2.
It follows that α−bm′=(ζq−t)⋅β for some β∈\mathbbmZ[ζq],
i.e. α∈⟨ζq−t,m′⟩.
We will show that N\mathbbmQ(ζq)/\mathbbmQ(⟨ζq−t,m′⟩)=m′.
If q∤m′, then m′=m′′=∏ipd and ⟨ζq−t,m′⟩=∏i⟨ζq−t,pidi⟩ by Lemma 3.2.
Since ⟨ζq−t,pidi⟩⊂⟨ζq−t,pi⟩ and t∈(\mathbbmZ/pidi\mathbbmZ)× is of order q,
it follows that ⟨ζq−t,pi⟩⊊\mathbbmZ[ζq] is of index pi by Lemma 3.3.
Hence N\mathbbmQ(ζq)/\mathbbmQ(⟨ζq−t,pi⟩)=pi and N\mathbbmQ(ζq)/\mathbbmQ(⟨ζq−t,pidi⟩)=pidi.
Thus N\mathbbmQ(ζq)/\mathbbmQ(⟨ζq−t,m′⟩)=m′.
For the other situation, if q∣m′, then m′=qm′′.
We have ⟨ζq−t,m′⟩=⟨ζq−t,q⟩⋅⟨ζq−t,m′′⟩.
Note that t−1=aqd0−1 where d0−1≥1 and q∤a by Lemma 4.6.
It follows that ζq−t=ζq−1−(t−1)=(ζq−1)⋅(1+(ζq−1)⋅β) for some β∈\mathbbmZ[ζq].
Thus ⟨ζq−t,q⟩=⟨ζq−1⟩ is of norm q.
We can show that N\mathbbmQ(ζq)/\mathbbmQ(⟨ζq−t,m′′⟩)=m′′ as the previous situation.
Hence we find N\mathbbmQ(ζq)/\mathbbmQ(⟨ζq−t,m′⟩)=m′.
Since ⟨α⟩⊂⟨ζq−t,m′⟩ and both ideals have the same norm m′,
it follows that ⟨α⟩=⟨ζq−t,m′⟩,
i.e. the ideal ⟨ζq−t,m′⟩ is a principal ideal.
Step 4.
We will show that the ideals ⟨ζq−t,m′′⟩ and ⟨ζq−t,m2⟩ are principal ideals.
This will finish the proof by Step 2.
If q∤m′, then m′=m′′=m2. Thus ⟨ζq−t,m2⟩=⟨ζq−t,m′′⟩=⟨ζq−t,m′⟩ is a principal ideal by Step 3.
It remains to consider the case q∣m′, i.e. m′=qm′′ and m2=qd0m′′.
From ⟨α⟩=⟨ζq−t,m′⟩=⟨ζq−t,q⟩⟨ζq−t,m′′⟩=⟨ζq−1⟩⋅⟨ζq−t,m′′⟩, we get α=(ζq−1)⋅β for some β∈⟨ζq−t,m′′⟩.
Hence ⟨ζq−t,m′′⟩=⟨β⟩ is a principal ideal.
Now ⟨ζq−t,m2⟩=⟨ζq−t,qd0⟩⋅⟨ζq−t,m′′⟩=⟨ζq−1⟩⋅⟨ζq−t,m′′⟩ is a principal ideal because so is the ideal ⟨ζq−t,m′′⟩.
∎
Theorem 4.8
Let p and n be positive integers where p is a prime number and assume that t is an integer such that t∈(\mathbbmZ/p\mathbbmZ)× is of order n.
Assume that there is some element α∈\mathbbmZ[ζn] satisfying that N\mathbbmQ(ζn)/\mathbbmQ(α)=±p.
If k is a field with ζp,ζn∈k, then k(Gp,n) is rational over k.
Proof..
The ideals ⟨α⟩ and ⟨ζn−t,p⟩ are of norm p.
Both of them are prime ideals of \mathbbmZ[ζn] lying over p.
Thus they are conjugate to each other.
In particular, the ideal ⟨ζn−t,p⟩ is a principal ideal.
For any e∣n, if e<n, then ⟨ζe−t,p⟩=\mathbbmZ[ζe] by Lemma 3.3.
Now apply Theorem 4.3.
∎
Theorem 4.9
Let n be a positive integer.
Define S:={p∈\mathbbmN:p is a prime number and p splits completely into the product of principal prime ideals of \mathbbmZ[ζn]}, and define S0={p∈\mathbbmN:p is a prime number such that \mathbbmC(Gp,n) is rational over \mathbbmC}. Then the Dirichlet densities of S and S0 are positive; in particular, S0 is an infinite set. Consequently, there are infinitely many prime numbers p satisfying that \mathbbmC(Gp,n) is rational over \mathbbmC.
Proof..
Step 1.
If p∈S, then p splits completely in \mathbbmZ[ζn]. Thus n∣ϕ(p) by considering the factorization of \Phi_{n}(X)$$\pmod{p}; alternatively, apply [Ne, page 103].
It follows that there is an integer t such that t∈(\mathbbmZ/p\mathbbmZ)× is of order n. Hence we may define the group Gp,n as in Definition 1.2.
Since p splits completely into the product of principal prime ideals of \mathbbmZ[ζn], there is some element α∈\mathbbmZ[ζn] such that ⟨α⟩ is a prime ideal lying over p with N\mathbbmQ(ζn)/\mathbbmQ(α)=±p by Lemma 3.3. It follows that \mathbbmC(Gp,n) is rational by Theorem 4.8. In summary, if p is a prime number and p∈S, then \mathbbmC(Gp,n) is rational, i.e. S⊂S0.
It remains to show that the Dirichlet density of S is positive. We denote by d(S) the Dirichlet density of S; the reader is referred to [Ne, page 130] for its definition.
Step 2.
Suppose that p∈S and P is a non-zero principal prime ideal of \mathbbmZ[ζn] lying over p,
then P is of degree one, i.e. natural map \mathbbmZ/p\mathbbmZ→\mathbbmZ[ζn]/P is an isomorphism.
Define T1={P:P is a non-zero principal prime ideal of degree one in \mathbbmZ[ζn]}, and T={P:P is a non-zero principal prime ideal of \mathbbmZ[ζn]}. We will show that d(T1)=d(T)=hn where hn is the class number of \mathbbmQ(ζn).
Step 3.
Let L be the Hilbert class field of \mathbbmQ(ζn); note that Gal(L/\mathbbmQ(ζn))≃C(\mathbbmZ[ζn]) the ideal class group of \mathbbmZ[ζn]. If P is a non-zero prime ideal of \mathbbmZ[ζn], denote by (P,L/\mathbbmQ(ζn)) the Artin symbol of P, if P is unramified in L (see [Ne, page 105]). If P is a non-zero prime ideals of \mathbbmZ[ζn], then P∈T if and only if P splits completely in L by [Ne, page 107, Corollary 8.5] (alternatively, this fact is one of the conditions in the definition of the Hilbert class field). On the other hand, P splits completely in L is equivalent to (P,L/\mathbbmQ(ζn))=1. It follows from the Tchebotarev density theorem that d(T)=1/hn [Ne, page 132, Theorem 6.4].
In summary, we have
[TABLE]
where N(P) is the abbreviation of N\mathbbmQ(ζn)/\mathbbmQ(P).
Step 4.
Note that ∑PN(P)s1∼logs−11 (see [Ne, page 130]).
Also note that ∑P∈TN(P)s1∼∑degP=1P∈TN(P)s1
because ∑degP≥2N(P)s1 is an analytic function at s=1 (see [Ne, page 130]).
We find that
[TABLE]
Step 5.
Define a function Ψ:T1→S by Ψ(P)=P∩\mathbbmZ (here we identify a prime number p with the prime ideal p\mathbbmZ in \mathbbmZ). Note that Ψ is well-defined. Also note that Ψ−1(p) is a set of ϕ(n) elements for any p∈S.
Thus
[TABLE]
We have also ∑pps1∼logs−11 as in Step 4.
From Formula (4.5), we obtain
[TABLE]
Example 4.10
We will supply examples of groups G≃A⋊Cn (where A is an abelian group)
such that \mathbbmC(G) is rational while we cannot apply Theorem 1.3 to assert the rationality (because \mathbbmZ[ζn] is not a UFD).
Let d1,…,ds, d be integers with 1≤d≤min{d1−1,d2−1,…,ds−1}.
Define n=3d, mi=3di for 1≤i≤s.
For each 1≤i≤s, find an integer ti such that ti∈(\mathbbmZ/mi\mathbbmZ)× is of order n.
Define G:=⟨σ1,…,σs,τ:σimi=τn=1,σiσj=σjσi,
τ−1σiτ=σiti for 1≤i≤s⟩≃(Cm1×Cm2×⋯×Cms)⋊Cn.
Note that G is a 3-group.
If ζ3e∈k (where e≥di for all 1≤i≤s),
we claim that k(G) is rational over k.
Note that, if d≥4, then \mathbbmZ[ζn] is not a UFD by Theorem 1.4.
Thus we cannot apply Theorem 1.3 to show that k(G) is rational if d≥4.
On the other hand, the method in Lemma 4.5 and in the proof of Theorem 1.6 may be adapted to show that k(G) is rational.
Write π=⟨τ⟩ and define π-lattices Mi as in Formula (4.2) by
[TABLE]
As before, it is easy to see that each Mi is a \mathbbmZπ-projective module and k(G) is rational over k(M1⊕⋯⊕Ms)⟨τ⟩.
By the same proof as [EM1, Corollary 3.3],
[Mi]fl=0 for all i (rigorously speaking, [Mi]fl=0 because of [EM1, Proposition 3.2] and its proof).
Thus [M1⊕M2⊕⋯⊕Ms]fl=0 and the same arguments in the proof of Theorem 1.6 work as well.
Done.
The same method can be applied to 2-groups.
Let d1,…,ds, d be integers with 1≤d≤min{d1−2,d2−2,…,ds−2}.
Define n=2d, mi=2di.
Find an integer ti such that ti∈(\mathbbmZ/mi\mathbbmZ)× is of order n
(this is possible because d≤di−2).
Define G:=⟨σ1,…,σs,τ:σimi=τn=1,σiσj=σjσi,τ−1σiτ=σiti for 1≤i≤s⟩.
If ζ2e∈k (where e≥di for all 1≤i≤s), we claim that k(G) is rational over k.
Note that, if d≥6, then \mathbbmZ[ζn] is not a UFD by Theorem 1.4.
The proof of the rationality is similar to the above situation of 3-groups, but some modification is necessary.
If d=1, we may apply Theorem 1.3.
Thus we assume that d≥2.
Since ⟨ti⟩≃Cn is a cyclic group of order ≥4,
it follows that −1∈/⟨ti⟩⊂(\mathbbmZ/mi\mathbbmZ)×.
By [EM1, Proposition 2.6], the π-lattice ⟨τ−ti,mi⟩⊂\mathbbmZπ is projective where π=⟨τ⟩.
Note that t−1 is an even integer.
If e∣n and e≥2, then ⟨ζe−ti,mi⟩=⟨ζe−1⟩.
Thus [M1⊕M2⊕⋯⊕Ms]fl=0.
Done.
We remark that, if G is a metacyclic p-group (a p-group which is an extension of a cyclic group by another cyclic group), then \mathbbmC(G) is always rational by [Ka1].
Example 4.11
Let p≥3 be a prime number, a1,a2,…,as be positive integers with p∤a1a2⋯as.
Define mi=aipdi, ti=1+aipdi−1 where di≥2 for 1≤i≤s.
Define G=⟨σ1,…,σs,τ:σimi=τp=1,σiσj=σjσi,τ−1σiτ=σiti
for 1≤i≤s⟩.
If ζe∈k (where e=lcm{mi:1≤i≤s}), we claim that k(G) is rational.
Note that the case when s=1 is proved in [CH, Corollary 18].
Define λi=σipdi, ρi=σiai,
H1=⟨λi:1≤i≤s⟩, H2=⟨ρi,τ:1≤i≤s⟩.
Then G=H1×H2.
Note that k(H1) is rational by Theorem 1.1.
We will prove that k(H2) is rational.
Then we may apply [KP, Theorem 1.3] to conclude that k(G) is rational.
Now we consider k(H2).
Define π=⟨τ⟩ and π-lattices Mi defined by Mi=⟨τ−ti, pdi⟩ as before.
Note that ζp−ti=ζp−1−(ti−1)=(ζp−1)(1+α(ζp−1)p−2) for some α∈\mathbbmZ[ζp].
Hence ⟨ζp−ti,pdi⟩=⟨ζp−1⟩ is a principal ideal.
Thus [M1⊕⋯⊕Ms]fl=0.
Done.
Example 4.12
We will give an application of Theorem 4.9.
Let k be an algebraic number field. Define P0={p:p is a prime numer, p≤43}∪{61,67,71} and Pk={p:p ramifies in k}. It is known that, if p is a prime number, then (1) \mathbbmQ(Cp) is rational over \mathbbmQ if and only if p∈P0 [Pl], and (2) if p∈/(P0∪Pk), then k(Cp) is not stably rational over k [Ka4]. If p∈P0, then k(Cp) is rational over k because \mathbbmQ(Cp) is rational over \mathbbmQ. However, it is not clear whether k(Cp) is rational over k if p∈Pk.
We will construct infinitely many pairs (p,k) where p is a prime number, k is an algebraic number field such that p ramifies in k and k(Cp) is rational over k.
Given a positive integer n, let S be the set defined in Theorem 4.9. For each p∈S, n∣ϕ(p) (see Step 1 in the proof of Theorem 4.9). Choose k to be the subfield of \mathbbmQ(ζp) such that [\mathbbmQ(ζp):k]=n. Note that the field k depends on the choice of p∈S. Also note that p ramifies in \mathbbmQ(ζp) (and also in k). Thus \mathbbmQ(ζp) and \mathbbmQ(ζn) are linearly disjoint over \mathbbmQ, because p splits completely in \mathbbmQ(ζn).
Since k(ζp)=\mathbbmQ(ζp) is of degree n over k and there is some element α∈\mathbbmZ[ζn] with N\mathbbmQ(ζn)/\mathbbmQ(α)=±p (see Step 1 in the proof of Theorem 4.9), we find that k(Cp) is rational over k by [Le, page 321, Corollary 7.1].
§5. The multiplicative invariant fields
Let π be the cyclic group of order n.
Beneish and Ramsey [BR] introduced a notion the Property ∗ for π in [BR, Definition 3.3] and proved Theorem 1.7.
Here is our interpretation of the Property ∗ for π.
Theorem 5.1
Let π be a cyclic group of order n.
Then the following are equivalent:
(i) the Property ∗ for π;
(ii) Fπ=0;
(iii) \mathbbmZ[ζn] is a UFD.
Proof..
(iii) ⇒ (i) by [BR, Corollary 3.9].
(i) ⇒ (ii). By [EK, Lemma 2.2] we have an isomorphism T(π)→Fπ where T(π) is defined in [EM2, page 86; EK, Definition 1.3].
In order to show that Fπ=0,
it is necessary and sufficient to show that T(π)=0.
By [EK, Theorem 1.4], we have an isomorphism C(\mathbbmZπ)/Cq(\mathbbmZπ)→T(π) where C(\mathbbmZπ) is the subgroup of K0(\mathbbmZπ),
the Grothendireck group of the category of finitely generated projective \mathbbmZπ-modules,
defined by C(\mathbbmZπ):={[A]−[\mathbbmZπ]∈K0(\mathbbmZπ):A is a projective ideal over \mathbbmZπ} (see [EK, Definition 2.11]).
The map φ is induced by the map ψ:C(\mathbbmZπ)→T(π) defined by sending [A]−[\mathbbmZπ]∈C(\mathbbmZπ) to [A]∈T(π);
note that Cq(\mathbbmZπ):={[A]−[\mathbbmZπ]∈C(\mathbbmZπ):[A]fl=0 in Fπ}
={[A]−[\mathbbmZπ]∈C(\mathbbmZπ):[A]=0 in T(π)} is the kernel of ψ (see [EK, Definition 2.12]).
By [BR, Theorem 3.11] every projective ideal A is stably permutation;
thus C(\mathbbmZπ)/Cq(\mathbbmZπ)=0 and so T(π)=0.
(ii) ⇒ (iii) by Theorem 4.2. Done.
We indicate a direct proof of (iii) ⇒ (ii). Suppose that \mathbbmZ[ζn] is a UFD.
For any e∣n.
\mathbbmZ[ζe] is also a UFD by [Wa, page 39, Proposition 4.11].
Hence ⨁e∣nC(\mathbbmZ[ζ])=0.
By Theorem 4.2 again we find Fπ=0.
∎
Proof of Theorem 1.7.
——————–
(i) By Theorem 5.1, Fπ=0. Thus [M]fl=0 for any π-lattice M. Apply Lemma 4.4.
(ii) By Theorem 5.1, \mathbbmZ[ζn] is a UFD. Apply Theorem 1.3. Note that we prove that k(G) is not only stably rational, but also rational.
∎
Theorem 5.2
Let π≃Dn the dihedral group of order 2n where n is an odd integer. Then Fπ=0 if and only if \mathbbmZ[ζn+ζn−1] is a UFD.
Proof..
As in the proof of Theorem 5.1, let T(π) be defined in [EM2, page 86; EK, Definition 1.3]. Then we have Fπ≃T(π)≃C(Ω\mathbbmZπ) where Ω\mathbbmZπ is a maximal \mathbbmZ-order in \mathbbmQπ containing \mathbbmZπ and C(Ω\mathbbmZπ) is the class group of Ω\mathbbmZπ [EM2, Theorem 3.3; EK, Theorem 1.4]. It can be shown that C(Ω\mathbbmZπ)≃⊕d∣nC(\mathbbmZ[ζd+ζd−1]) (see, for examples, [EK, Theorem 6.3]).
If Fπ=0, then C(\mathbbmZ[ζn+ζn−1])=0.
On the other hand, if C(\mathbbmZ[ζn+ζn−1])=0, then C(\mathbbmZ[ζd+ζd−1])=0 for all d∣n by [Wa, page 39, Proposition 4.11]. Thus Fπ=0.
∎
Lemma 5.3
Let π≃Dn the dihedral group of order 2n where n is an odd integer. Assume that \mathbbmZ[ζn+ζn−1] is a UFD.
(i) If M is any π-lattice and k is a field with ζn∈k, then k(M)π is stably rational over k.
(ii) Suppose that G:=A⋊Dn where A is a finite abelian group of exponent e and n is an odd integer. If k is a field with ζe,ζn∈k, then k(G) is stably rational over k.
Proof..
By Theorem 5.2, Fπ=0.
(i) Since Fπ=0, we find that [M]fl=0. The idea of showing that k(M)π is stably rational is almost the same as that of Lemma 4.4. It remains to prove that k(π′′) is rational where π′′ is some quotient group of π.
Since n is odd, the quotients groups of π≃Dn are isomorphic to Dm (m divides n), C2, or the trivial group.
Suppose that π′′ is a dihedral group. Write π′′=⟨σ0,τ:σ0m=τ2=1,τ−1σ0τ=σ0−1⟩ where m is some integer dividing n. Define π0:=⟨τ⟩≃C2. If char k=2, apply Theorem 1.3. Here is a proof for the general case.
Since ζn∈k, we may use the same arguments as in Step 1 of the proof of Theorem 4.3. We find that k(π′′) is rational over k(M)π0 where M is a projective ideal of \mathbbmZπ0. Since π0≃C2, any projective ideal of \mathbbmZπ0 is isomorphic to the free module \mathbbmZπ0 by Reiner’s Theorem [Re]. It follows that k(M)π0≃k(C2)=k(x,y)π0 where τ:x↦y↦x. Define X=y/x. Then k(x,y)π0=k(X,x)π0 is rational over k(X)π0 by Theorem 2.6. Note that k(X)π0=k(X/(1+X2)) is rational. Done.
If π′′≃C2, the rationality of k(C2) has been proved in the above paragraph.
(ii) By the same method as in the proof of Theorem 1.6 (given in Section 4), it can be shown that k(G) is rational over k(M)Dn where M is some Dn-lattice. Then apply the result of Part (i).
∎
Remark.
Let π=Dn, the dihedral group of order 2n. It is important that we assume that n is odd in Theorem 5.2 and Lemma 5.3. If 4∣n, by [Ba], there exist π-lattices M such that the unramified Brauer groups of \mathbbmC(M)π are not zero; thus \mathbbmC(M)π are not retract rational and hence are not stably rational. For a concrete construction of such lattices, see [HKY, Theorem 6.2]. If 2∣n and 4∤n, by [Ba] again, the unramified Brauer group of \mathbbmC(M)π is zero for any π-lattice M, but it is unknown whether \mathbbmC(M)π is always stably rational.