This paper proposes conjectures on the distribution of polynomial roots modulo primes, suggesting a new form of equi-distribution and relating to Dirichlet's theorem for roots in arithmetic progressions.
Contribution
It introduces new conjectures on the distribution patterns of polynomial roots modulo primes, supported by numerical data and connecting to classical number theory.
Findings
01
Numerical data supports the conjectured distribution patterns.
02
Proposes a new type of equi-distribution for roots modulo primes.
03
Links root distribution to Dirichlet's theorem in special cases.
Abstract
For a given monic integral polynomial f(x) of degree n, we define local roots ri of f(x) for a completely decomposable prime p by ri∈Z, f(ri)≡0modp and 0≤r1≤r2≤⋯≤rn<p. With numerical data, we propose a conjecture on the distribution of (r1/p,…,rn/p), which is a new kind of equi-distribution, and a conjecture of the distribution of (r1,…,rn) which satisfies ri≡RimodL for given natural numbers L,R1,…,Rn, which is nothing but Dirichlet's theorem on an arithmetic progression in the case n=1.
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
TopicsAnalytic Number Theory Research · Meromorphic and Entire Functions · Algebraic Geometry and Number Theory
Full text
Conjectures on the distribution of roots modulo a prime of a polynomial
In this monograph, a polynomial means always a monic one over the ring Z
of integers
and the letter p denotes a prime number, unless specified.
Let
[TABLE]
be a polynomial of degree n with complex roots α1,…,αn.
We fix the numbering of roots once and for all, and
define vector spaces LR,LR0 over the rational number field Q by
[TABLE]
which depend on the numbering of roots αi.
The mapping ι defined by
[TABLE]
is an isomorphism from LR0 on LR over
Q and more strongly from LR0∩Zn on LR∩Zn+1
over Z,
because numbers αi are algebraic integers.
Since there is a trivial linear relation ∑αi=−an−1,
the non-zero vector (1,…,1,−an−1) is always in LR,
hence we see clearly
[TABLE]
The condition t=n holds if and only if f(x) is a product of linear forms in Q[x].
The dimension dimQ⟨α1,…,αn,1⟩Q is n+1−t,
hence dimQ⟨α1,…,αn⟩Q=n+1−t or n−t.
The equality dimQ⟨α1,…,αn,1⟩Q=dimQ⟨α1,…,αn⟩Q is equivalent to
−an−1=ntr(∑iαi)=0 if the polynomial f(x) is irreducible.
We note that the vector (0,…,0,1,0,…,0)∈Zn is in LR0 if and only
if f(x) has a rational root,
and (0,…,0,1,0,…,0,−1,0,…,0)∈LR0 holds
if and only if αi−αj∈Q holds for i=j, that is f(x) is of the form
f(x)=g(x)g(x+r)F(x) for some
polynomials g(x),F(x)∈Q[x] and an integer r.
We say that a polynomial f(x) has a non-trivial linear relation among roots if t>1.
We know that if there is no non-trivial linear relation, then the polynomial f(x) is irreducible,
and that if f(x) is irreducible and degf(x)=n is prime, then there is no non-trivial linear relation
among roots (cf. §3).
We take and fix a Z-basis of LR0∩Zn
[TABLE]
and put
[TABLE]
It is clear that the vectors m^1,…,m^t are a basis of LR∩Zn+1
over Z.
If a vector (l1,…,ln)∈Zn satisfies ∑i=1nliαi∈Z,
then we see easily ∑i=1n(li/l)αi∈Z for l=gcd(l1,…,ln),
hence the matrix whose rows are m1,…,mt is primitive,
that is
elementary divisors of the (t,n)-matrix with rows mi are 1 only, hence
it is complemented to an integral (n,n)-matrix with determinant 1.
We introduce two groups associated with them:
[TABLE]
Here, ⟨z1,…,zk⟩Z:={a1z1+⋯+akzk∣a1,…,ak∈Z}
and we let, for x=(x1,…,xn)∈Rn,x∈R and a permutation σ∈Sn
[TABLE]
Groups G^,G are independent of the choice of bases m^i and
G^ is a subgroup of G.
If f(x) is irreducible, then they are identical.
However, they are not necessarily equal for a reducible polynomial,
because ∑iliαi,∑iliασ(i) may be different even if they are rational.
If f(x) has no non-trivial linear relation among roots,
then (1,…,1,−an−1) is a basis of LR∩Zn+1, hence G^=G=Sn.
We fix the basis m^j(j=1,…,t) together with roots αi once and for all.
Next, we put
[TABLE]
for a positive number X and Spl(f):=Spl∞(f).
We know that Spl(f) is an infinite set and that the density theorem due to Chebotarev holds,
that is
[TABLE]
where Q(f):=Q(α1,…,αn) is a finite Galois extension field of Q generated by all roots of f(x) ([Se]).
We note that except finitely many primes, three conditions (i) p∈Spl(f), (ii) a prime ideal (p) of
Q
splits completely in Q(f) and (iii) f(x) is a product of n linear forms over Qp are equivalent.
We require the following conditions on the local roots
r1,…,rn(∈Z)
of f(x)≡0modp for a prime p∈Spl(f) :
[TABLE]
The condition (4) is nothing but the definition of p∈Spl(f),
and (5) determines local roots ri uniquely.
Through this monograph, local roots ri are supposed to satisfy two conditions (4) and (5).
The global ordering (5) to local roots is a key.
We know that
for a sufficiently large prime p∈Spl(f), there is at least one permutation σ∈Sn
dependent on p
such that
[TABLE]
hence there are some permutation σ∈Sn and integers kj(j=1,…,t) dependent on the prime p satisfying equations
[TABLE]
The possibility of integers kj is finite
by the inequality ∣kj∣p≤∑∣mj,i∣p+∣mj∣.
Just to make sure, we give a proof of (6) here:
If a prime p∈Spl(f) is sufficiently large, then it is completely decomposable at Q(f),
hence there is a prime ideal p of degree 1 over p.
Therefore there are rational integers ri′ such that αi≡ri′modp, hence ∑imj,iri′≡mjmodp for j=1,…,t.
On the other hand, we see that f(x)=∏(x−αi)≡∏(x−ri′)modp
and f(x)≡∏(x−ri)modp imply that two sets {ri′modp} and
{rimodp} are equal.
Hence there is a permutation σ such that ri′≡rσ(i)modp(i=1,…,n).
We note that if there are infinitely many primes
p∈Spl(f) satisfying
[TABLE]
for an integer k with k≤0 or k≥n,
then the polynomial f(x) is a product of linear forms,
because the above equation implies
0≤r1≤⋯≤rn≤∑ri≤−an−1 if k≤0,
or 0>rn−p≥⋯≥r1−p≥∑(ri−p)≥−an−1
if k≥n,
hence f(x)≡∏(x−si)modp with some integers
si satisfying 0≤∣si∣≤∣an−1∣
for infinitely many primes p, which means that f(x) is
equal to ∏(x−si).
And let us give one more remark: Suppose that a polynomial f(x) is of the form
∏i=1k1(x−ai)ci∏j=1k2(x−bj)dj⋅g(x),
where all ai,bj are integers and a1<⋯<ak1<0≤b1<⋯<bk2 with all ci,dj being positive, and that the polynomial g(x)
of degree l has no integer root.
Then we see that for a prime p∈Spl(f)=Spl(g), local roots of f(x)
are, with finitely many exceptions p
[TABLE]
where r1,…,rl are local roots of g(x).
To state conjectures,
we introduce following notations corresponding to conditions (6), (7):
[TABLE]
where SplX(f,σ) does not depend on choice of the basis mi, but
SplX(f,σ,{kj}) does.
Furthermore, for integers L(>1),R1,…,Rn we put
[TABLE]
and we define densities by
[TABLE]
where for the last two, the denominators #SplX(f,σ),#SplX(f,σ,{kj})
of the right-hand sides are supposed to tend to the infinity,
and we suppose that all the limits exist.
The existence of the limits is supported by computer experiment (cf. §7).
If there is no non-trivial linear relation among roots,
then SplX(f,σ)=SplX(f), i.e. Pr(f,σ)=1
and SplX(f,σ,{kj}) is independent of the permutation σ.
Next, we introduce geometric objects
[TABLE]
where D(f,σ) does not depend on the choice of basis mi,
but D(f,σ,{kj}) does.
We note that D(f,σ,{kj})⊂D(f,σ)⊂D^n⊂Δ and
[TABLE]
hence D(f,σ) is disconnected in general.
In case that the set Spl(f,σ,{kj}) is an infinite set, any accumulation point
x=(x1,…,xn) of (r1/p,…,rn/p)∈[0,1)n with p∈Spl(f,σ,{kj})
satisfies x∈Δ,∑imj,ixσ(i)=kj(1≤∀j≤t), i.e. x∈D(f,σ,{kj}) by
∑imj,irσ(i)=mj+kjp.
The condition xn≤1 can not be replaced by xn<1.
The dimension of D^n is n−1 and that of D(f,σ) and
D(f,σ,{kj})
is less than or equal to n−t.
In the following, the volume vol of sets D(f,σ) and
D(f,σ,{kj})
means that as an (n−t)-dimensional set,
that is for a set S in v+R[v1,…,vn−t](⊂Rn) with orthonormal vectors
v1,…,vn−t∈Rn,
we identify v+∑yivi∈S with a point (y1,…,yn−t)∈Rn−t.
So, vol(D(f,σ))=0 holds if dimD(f,σ)<n−t.
In case that f(x) is a product of linear forms, which is equivalent to t=n,
dimD(f,σ)=0 holds,
hence the discussion about D(f,σ) is meaningless.
If there is no non-trivial linear relation among roots,
then
D(f,σ) is equal to D^n for every permutation σ,
and
D^n is equal to
[TABLE]
The first conjecture is
Conjecture 1**.**
For a permutation σ with Pr(f,σ)>0,
the ratio
[TABLE]
is independent of σ.
If G=G^ holds, then two conditions Pr(f,σ)>0 and vol(D(f,σ))>0 are equivalent.
If (i)
f(x) is not a product of linear forms, (ii) αi−αj∈Q if i=j,
and (iii)
vol(D(f,σ))=cPr(f,σ) holds for every σ∈Sn, then we have
(cf. Prop. 5.3)
[TABLE]
There is an example of a reducible polynomial f(x) such that Pr(f,σ)=0 but vol(D(f,σ))>0 for some permutation σ (cf. 7.4.2),
and so Expectation 1′′ in [K8], [K11] should be revised as above.
The author does not know the necessary and/or sufficient condition to that
two conditions Pr(f,σ)>0,
vol(D(f,σ))>0 are equivalent (cf. Proposition 4.5).
As above, they seem to be equivalent for an irreducible polynomial f(x) of degf>1.
Incidentally, it is likely that
f(x) is a product of linear forms if and only if
vol(D(f,σ))=0 holds for every permutation σ.
If f(x) has no non-trivial linear relation among roots, then Pr(f,σ) is equal
to 1 as above, and by the property D(f,σ)=D^n for all
σ∈Sn Conjecture 1 is true (cf. Proposition 4.6).
If f(x) is a product of linear forms, then (10) is true for c=0, but it is futile.
The second is
Conjecture 2**.**
Suppose that Pr(f,σ)>0 and vol(D(f,σ))>0 for a permutation σ; then
for a set D satisfying that D=D∘ and D∩D(f,σ) is
the closure of the intersection of D∘ and the interior of D(f,σ), we have
[TABLE]
About the condition on D above, except the measurability:
In case of m1=⋯=mt=0, every point (r1/p,…,rn/p) is on D(f,σ),
and so we may assume that the set D is in D(f,σ) from the beginning.
This is usual and there is no problem to generalize the Weyl criterion formally, although the proof is
another big problem.
Suppose not, i.e. mi=0 for some i; then any point
(r1/p,…,rn/p) is not on D(f,σ),
hence for example, for D=[0,1)n∖D(f,σ) the left-hand side of (11)
is 1, but the right-hand side is [math].
So we must put some restriction on D (cf. §6.2).
Although (11) matches numerical data for the set D={x∣xi≤a},
it seems to be too restrictive.
The closed set whose boundaries are given by linear forms except
∑imj,σ−1(i)xi∈Z may also be a candidate.
It is rather complicated to see whether vol(D∩D(f,σ))>0 or not.
Let us give an example when f(x) has no non-trivial linear relation among roots:
Let integers k,J satisfy 1≤k≤n−1,1≤J≤n−k and
[TABLE]
Then defining x by
[TABLE]
we see that ∑xj=k and x∈D is an inner point of Δ if N,NM are sufficiently large, hence vol(D∩D(f,σ,k))>0.
and vice versa.
Conjecture 2 is a kind of the equi-distribution (cf. §5).
In fact, in case that there is no non-trivial linear relation among roots,
(11) implies, for 1≤∀i≤n, 0≤∀a<1
[TABLE]
where the binomial coefficient (BA) is supposed to vanish unless 0≤B≤A,
and M(x):=max(x,0),
from which follows
the one-dimensional equi-distribution
[TABLE]
In case that a polynomial f(x) is quadratic and irreducible in particular,
it is true by [DFI], [T].
In case that a polynomial f(x) has a non-trivial linear relation among roots,
see §5.3.
If f(x) has no non-trivial linear relation among roots, then (12) implies with Proposition 4.6 that for 1≤k≤n−1,
[TABLE]
where En(k) is the volume of
[TABLE]
and it is equal to A(n−1,k)/(n−1)! where Eulerian numbers A(n,k)(1≤k≤n) are defined
recursively by
[TABLE]
and ⌈x⌉ is the integer satisfying x≤⌈x⌉<x+1.
Next, to state the conjecture on Pr(f,σ,{kj},L,{Ri}) for integers L(>1),
Ri(i=1,…,n) as above,
we introduce the following condition (C1), which is a necessary condition to
#Spl∞(f,σ,{kj},L,{Ri})=∞:
(C1) :
(kj,L)=(∑imj,iRσ(i)−mj,L)(=dj, say) for ∀j=1,…,t
and there is an integer q
which satisfies (i) q is independent of j, (ii) q is relatively prime to L,
(iii) ∑imj,iRσ(i)−mj≡kj⋅qmodL(∀j)
and (iv) [[q]]=[[1]] on Q(f)∩Q(ζL/dj)(∀j).
Here, ζl is a primitive lth root of unity, and
for a subfield F in Q(ζl) and an integer q
relatively prime to l,
[[q]] denotes the automorphism of F induced by
ζl→ζlq.
The condition [[q]]=[[1]] on Q(f)∩Q(ζL/dj) is trivially
satisfied if Q(f)∩Q(ζL/dj)=Q.
We put
[TABLE]
The last conjecture is
Conjecture 4**.**
Under the assumption #Spl∞(f,σ,{kj})=∞,
[TABLE]
If the polynomial f(x) has no non-trivial linear relation among roots in particular,
then we see that t=1 and ∑imj,iRσ(i)−mj=∑iRi+an−1, hence
[TABLE]
Let us see the case of degree 1, i.e. f(x)=x+a :
Then we see that the permutation σ is the identity, t=1, m^1=(1,−a),
and
the local root r1 is equal to −a+k1p for k1=0,1 according to a≤0, a>0 if p>∣a∣.
Then the condition (C1) is R1+a≡0modL, and (R1+a,L)=1 according to a≤0,
and a>0, respectively.
Thus we have only to consider the case k1=0,a≤0 or k1=1,a>0,
and neglect a finite number of primes p less than or equal to ∣a∣;
then we see that
[TABLE]
hence Pr(f,id)=Pr(f,id,k1)=1 and
[TABLE]
by Dirichlet’s theorem, and
[TABLE]
Thus the conjecture (17) is nothing but Dirichlet’s theorem.
In case that f(x)=x2+ax+b is an irreducible quadratic polynomial,
we have t=1, and if #Spl(f,σ,k)=∞, then k=1 holds, hence
[TABLE]
where D is the discriminant of the quadratic field Q(f).
Suppose that L=2 moreover;
then #R(f,σ,1,2)=2, and the equation r1+r2=−a+p for a large prime p
implies R1+R2≡−a+1mod2, i.e. either {R1,R2}={0,1} in the case of
a≡0mod2
or R1=R2(=0 or 1) in the case of a≡1mod2.
So, the conjecture says that the density of primes p∈Spl(f) with r1 being odd is equal to that with r1 being even.
In case of m1=⋯=mt=0, the point (r1/p,…,rn/p) is on D(f,σ,{kj}) for every p∈Spl(f,σ,{kj}), hence the situation may be a bit simplified, although it does not mean “easy” at all:
Put βi:=[Q(f):Q]⋅\linebreak[3]αi−tr(αi)(i=1,…,n) and
g(x):=∏(x−βi)(∈Z[x]).
Here tr denotes the trace from Q(f) to Q.
Since a linear relation among roots ∑iliαi=ln+1(li∈Q)
is equivalent to ∑iliβi=0,
the vector space LR0 is the same for polynomials f(x),g(x) by tr(βi)=0,
and the constants mi for the polynomial g(x) are [math].
Take a prime ideal p of degree 1 of Q(f)=Q(g) and
let their local roots be ri,Ri: Equations αi≡rσ(i)modp,βi≡Rμ(i)modp for some permutations σ,μ imply
[Q(f):Q]rσ(i)−tr(αi)≡Rμ(i)modp.
The relation between σ,μ is irregular.
Even if f(x) has no multiple roots, g(x) may have multiple roots.
Can one reduce the proof of conjectures for f(x) to that of g(x) nevertheless?
It may be interesting to consider another criterial numbering instead of the numbering
(5).
As an example, we give the order 0≤{qx1}≤⋯≤{qxn}<1(x∈[0,1)n) for a non-zero
integer q, where {x} means the decimal part of x, i.e. 0≤{x}<1,x−{x}∈Z.
This gives the numbering of roots {r∣f(r)≡0modp,0≤r<p} if p does not divide q.
The order (5) corresponds to q=1.
There is no reason to consider that the similar conjectures do not exit.
We explain the above in detail after the next section.
Let us brief about subsequent sections.
In §2, we
give a remark on the purely periodic decimal expansion of rational numbers:
Let p(>5) be a prime number
and let the purely periodic decimal expansion of
1/p be
[TABLE]
where e is the minimal length of periods, i.e.
e= the order of 10 in (Z/pZ)×.
Suppose e=ln for natural numbers n(>1),l;
we divide the period to n parts of equal length l, and add them.
Then we have
[TABLE]
for some integer k with 1≤k≤n−1.
Here we see that kp is the sum of all roots ri of xn−1≡0modp with 0≤ri<p.
If we restrict the factor n to a fixed prime number, the density of prime numbers p corresponding to the integer k is closely related to that given by (16).
This is our starting observation.
In §3, we discuss linear relations among roots.
If the degree of an irreducible polynomial is prime, then there is no non-trivial linear relation.
In case that (i) the degree of an irreducible polynomial is 4, (ii)
the degree is 6 and the polynomial is Galois, or (iv) the polynomial is abelian,
we see how the structure of linear relations is with the help of representation theory of a finite group.
In §4, we see how D(f,σ) and Pr(f,σ) depend on
σ involving the groups G^,G.
We introduce an assistant subset
[TABLE]
where p denotes a prime ideal of Q(f).
In §5, we show that the conjecture (11) implies the one-dimensional equi-distribution of
ri/p(i=1,…,n) for p∈Spl(f) as a corollary of evaluation of limX→∞#{p∈SplX(f)∣ri/p<a}/#SplX(f)
in the case that (i) f(x) has no non-trivial linear relation among roots, and
(ii) f(x) is an irreducible polynomial of degree 4.
Without invoking forcible calculation, we show that Conjectures 1,2 imply the equi-distribution of
ri/p for local roots ri of a more general polynomial in §5.3.
We discuss the Weyl criterion in §6,
give numerical data in §7,
and in §8
conjectures on M(f,μ) and as a question derived from it
the density of the set
[TABLE]
in Spl(f),
where g1(x),g2(x) are not necessarily monic polynomials over Z
and ri runs over local roots of f(x) at p and {a} is the decimal part of a,
and lastly in §9 other directions.
2 Decimal expansion of a rational number
Let us begin with the example 1/7=0.1˙42857˙=0.142857142857…: We see
[TABLE]
The question is what numbers 1,1,3 are.
One answer is
Theorem 2.1**.**
Let a,b be natural numbers satisfying (10a,b)=1 and a<b,
and let the purely periodic decimal expansion of
a/b be
[TABLE]
where e is the minimal length of periods, i.e.
e= the order of 10modb.
Suppose e=ln for natural numbers n(>1),l, and define natural numbers B,L
by L=(10l−1,b),b=BL.
We divide the period to n parts of equal length l , and add them;
then we have
[TABLE]
where k:=∑i=0n−1si/B is an integer with the natural number si satisfying si≡10liamodb and 0≤si<b.
In case of a=1,n=2, k is uniquely determined by
[TABLE]
Before the proof, let us give remarks.
Suppose L=1; then B=b and
[TABLE]
In case of a=1,n=2 moreover, k=1 holds, which is classical.
Next, consider the case that a=1 and b is a prime number p; then integers si give
all roots of xn−1≡0modp and ∑si=kp.
Hence the sum of local roots ri(0≤ri<p) of xn−1+xn−2+⋯+1≡0modp is −1+kp
(cf. (7)).
Next suppose L>1;
letting E be the order of 10modL, we decompose l as KE by 10l≡1modL.
Then the equation
[TABLE]
means that (10l−1)/L is the K times iteration of the minimal period
(10E−1)/L of 1/L.
We were concerned with the case that a=1 and b is prime.
The equation 10lia≡simodb implies 10lia/b=⌊10lia/b⌋+si/b,
where ⌊x⌋ is the integer satisfying x−1<⌊x⌋≤x.
We see
[TABLE]
hence
[TABLE]
noting sn=s0.
On the other hand,
by the definition of e,n,l, we have
[TABLE]
and then (10l−1,b)=L implies
[TABLE]
Hence we have ∑i=0n−1si≡(∑i=0n−110li)a≡0modB,
that is k is an integer.
Suppose that a=1,n=2;
then we find s0+s1=Bk and s0=1, and moreover s1≡10lmodb implies
s1≡1modL, hence Bk≡2modL.
They imply Bk=1+s1≤1+(b−1)=BL, i.e. 1≤k≤L. ∎
Let us apply Theorem 2.1 to a=1,b=p for a prime number p(>5),
and let e,l,n,B,L,k,si be those in the theorem.
Then the condition n>1 implies B=b=p, and si satisfies sin≡1modp with s0=1.
For the polynomial f(x):=(xn−1)/(x−1)=xn−1+⋯+1, si(i=1,…,n−1) are all roots of
f(x)≡0modp, that is p∈Spl(f) and
the set {s1,…,sn−1} is equal to the set of local roots of
f(x)modp.
And the integer k in the theorem is equal to (∑i=0n−1si+1)/p,
which is given as s(p) in [HKKN].
Let us start conversely from a natural number n and the polynomial f(x) above.
By supposing that n is a prime number, f(x) has no non-trivial linear relation among roots.
Under Conjecture 2,
we have
[TABLE]
In [HKKN], we took as a population, instead of SplX(f), the set of primes p(≤X) such that the order of 10 in (Z/pZ)× is
divisible by n, which is a subset of SplX(f), and we got the similar numerical data.
So, two events ⌈(r1+⋯+rn−1)/p⌉=k and the order of 10 in (Z/pZ)× being divisible by n seem to be independent in Spl(f).
A typical example of a polynomial which has a non-trivial linear relation among roots is a reducible polynomial and a decomposable one.
Let f(x)=g(x)h(x)(g(x),h(x)∈Z[x]) be a reducible polynomial;
then the sum of roots of g(x) is an integer, which is a non-trivial linear relation.
Let f(x)=g(h(x)) be a decomposable polynomial, that is 1<degg(x),degh(x)<degf(x) with g(x),h(x)∈Q[x], and let g(x)=∏(x−βi).
Then the sum of roots of h(x)−β1=0 is rational, hence we get a non-trivial linear relation among roots.
Let us see how to get the linear relations when we know the generator w of Q(f).
Since {1,w,…,wd−1}(d=dimQQ(f)) is a basis of Q(f)
over Q, we define a rational matrix A(n,d)=(a1,…,ad) by
[TABLE]
Then, for (l1,…,ln)∈Qn, the condition ∑iliαi∈Q holds if and only if
(l1,…,ln)A=(∗,0,…,0) holds.
So, we see that
[TABLE]
The condition LR0={l∈Qn∣lA=0} holds
if and only if a1 is contained in Q[a2,…,ad].
This is useful when we consider examples, but theoretically seems to be useless.
3.1 Non-trivial linear relation
Let us give a sufficient condition for a polynomial to have no non-trivial linear relation among roots.
Proposition 3.1**.**
Let f(x) be an irreducible polynomial of degree n.
If n is a prime number p,
or if the Galois group Gal(Q(f)/Q) is isomorphic to Sn or An(n≥4) as a permutation group of roots of f(x),
then f(x) has no non-trivial linear relation among roots.
Proof.
First, suppose that the degree of a polynomial f(x) is a prime p,
and let α1,…,αp be roots of f(x), and suppose a linear relation
[TABLE]
Adding a trivial relation ∑αi=tr(f) to it if necessary,
we may assume that ∑mi=0.
The Galois group Gal(Q(f)/Q)
acts faithfully on the set of all roots and contains an element σ of order p,
since p=[Q(α1):Q] divides [Q(f):Q],
hence we may assume that (σ(α1),…,σ(αp))=(α2,…,αp,α1) by renumbering roots.
Then from the assumption (18) follows
[TABLE]
Since αi’s are not rational,
the determinant of the coefficient matrix of entries mi vanishes,
hence we have
∏i=0p−1(m1+ζim2+ζ2im3+⋯+ζ(p−1)imp)=0
for a primitive pth root ζ:=ζp of unity, using a formula for cyclic determinant.
By the assumption ∑mi=0,
we have m1+ζim2+ζ2im3+⋯+ζ(p−1)imp=0
for some i(0<i<p),
which implies m1=⋯=mp,
that is (18) is trivial,
since ζi is still a primitive pth root of unity.
Next, suppose that the Galois group Gal(Q(f)/Q) is isomorphic to the symmetric group Sn.
For any 1≤i<j≤n, there is an automorphism σ which induces a transposition of
αi and αj.
Hence we have
[TABLE]
which implies mi(αi−αj)=mj(αi−αj).
By αi=αj, we have mi=mj,
thus (18) is trivial.
Finally, suppose that Gal(Q(f)/Q) is the alternative group An
and that (18) is non-trivial.
Let us show that coefficients m1,…,mn are mutually distinct, first.
Suppose that m1=m2 ; acting an even permutation α1→α2→α3→α1(=(2,3)(1,3)) on (18),
we have
[TABLE]
which imply (m1−m3)(α1−α3)=0, hence m2=m1=m3.
Considering other αi(i>3) instead of α3, we get m1=m2=⋯=mn,
which contradicts the non-triviality of (18).
Thus coefficients mi are mutually distinct.
Next, considering even permutations {α1↔α2,α3↔α4},{α1↔α3,α2↔α4},{α1↔α4,α2↔α3},
we get
[TABLE]
which imply
[TABLE]
hence (α1−α2)2=(α3−α4)2.
Similarly we have (α1−α3)2=(α2−α4)2,
hence taking the difference between them, we have (2α1−α2−α3)(−α2+α3)=(α2+α3−2α4)(α3−α2), i.e.
α1+α4=α2+α3.
Similarly we find α1+α3=α2+α4, hence a contradiction α3=α4.
∎
3.2 Polynomial of deg=4
In case that the degree of a polynomial is 4, we can determine polynomials with non-trivial linear relation
among roots.
Proposition 3.2**.**
Let f=x4+a3x3+a2x2+a1x+a0 be an irreducible polynomial.
If there is a non-trivial linear relation among roots of f(x),
then f(x) is decomposable, that is f(x)=g(h(x)) for quadratic polynomials g(x),h(x).
Proof.
Let α1,…,α4 be the roots of f(x).
Let G:=Gal(Q(f)/Q) be the
Galois group; then it operates faithfully on a set
{α1,…,α4} and there is a subgroup H of order 4 in G,
because 4=[Q(α1):Q] divides ∣G∣.
Noting that for permutations σ,μ,
[TABLE]
we see that (i) H is cyclic, (ii) H is generated by (1,2)(3,4),(1,3)(2,4) or (iii) (1,2),(3,4)
up to conjugate.
Renumbering roots, we have
(i)
G is generated by the cyclic permutation σ :
[TABLE]
(ii)
G is generated by permutations σ1,σ2 :
[TABLE]
(iii)
G is generated by transpositions σ1,σ2 :
σ1(α1)=α2 and σ2(α3)=α4.
Suppose that ∑i=14miαi=m is non-trivial, that is ∃mi=∃mj,
and if the coefficient a3 of the polynomial vanishes, then considering f(x−1) instead of f(x),
we may assume that a3=0 and furthermore ∑mi=0,
adding a trivial relation.
First, let us consider
case (i):
By linear equations ∑imiσj(αi)=m(j=0,1,2,3),
we have
[TABLE]
Since αi’s are irrational, the determinant of coefficient matrix on mi vanishes,
i.e.
∏i=03(m1+ζim2+ζ2im3+ζ3im4)=0 for a primitive fourth root ζ:=ζ4 of unity.
By the assumption ∑mi=0,
we have
[TABLE]
hence
(i.1)
m1−m3=m2−m4=0 in the case of i=1,3
or
(i.2)
m1−m2+m3−m4=0 in the case of i=2.
Case of (i.1),
i.e. m1=m3,m2=m4 :
The difference of the first row and the second row gives
[TABLE]
If m1=m2 holds, we have a contradiction m1=⋯=m4.
Hence we find α1+α3=α2+α4=−a3/2, hence f(x)=(x2+a3x/2+α1α3)(x2+a3x/2+α2α4) is a polynomial in x2+a3x/2, that is f(x) is decomposable.
Case of (i.2),
hence m1+m3=m2+m4 :
It is easy to see that
[TABLE]
By non-triviality (m1−m2,…,m4−m1)=(0,…,0),
the cyclic determinant of coefficients matrix vanishes,
i.e.
[TABLE]
(i.2.1) Suppose α1+ζα2−α3−ζα4=0,
i.e.
α1−α3=−ζ(α2−α4).
By equations
∑miαi=m and by acting σ2 on it, m1α3+m2α4+m3α1+m4α2=m,
we have
(m1−m3)(α1−α3)+(m2−m4)(α2−α4)=0,
hence
((m1−m3)(−ζ)+m2−m4)(α2−α4)=0.
Therefore we get
m1=m3,m2=m4
and so a contradiction
m1=m2=m3=m4 by the assumption m1+m3=m2+m4.
(i.2.2) Suppose that α1−α2+α3−α4=0; it implies α1+α3=α2+α4,
which implies that f(x) is decomposable as above.
(i.2.3) The case of α1−ζα2−α3+ζα4=0 is similar to (i.2.1).
Thus we have shown that in the case of (i), f(x) is decomposable.
hence if m1+m2=m3+m4 holds, then α1+α2=α3+α4 follows, i.e.
f(x) is decomposable.
Hence we may assume that m1+m2=m3+m4.
Similarly, using (19), (22) (resp. (20), (21)) , we may suppose m1+m4=m2+m3,
and m1+m3=m2+m4, using (19), (21) (resp. (20), (22)).
These give a contradiction m1=m2=m3=m4.
Case (iii).
Acting σ1,σ2 on ∑miαi=m,
we have
[TABLE]
which imply
[TABLE]
Since
αi’s are distinct,
we have
[TABLE]
Hence, the equations
[TABLE]
imply
[TABLE]
by m1=m3.
Therefore
[TABLE]
is equal to
[TABLE]
which implies
[TABLE]
If b1=b2 holds, then solving them, we have α1α2,α3α4∈Q,
which implies that f(x) is reducible.
Thus we have b1=b2 and then f(x) is a polynomial in x2−b1x,
that is decomposable.
∎
Proposition 3.3**.**
Let a polynomial f(x)=(x2+ax)2+b(x2+ax)+c(a,b,c∈Z) be irreducible, and
put
[TABLE]
Then equations αi,1+αi,2=−a(i=1,2) give a Z-basis of LR∩Z5.
Proof.
We have only to show that they are a basis of LR.
Let
[TABLE]
be a linear relation.
Using αi,1+αi,2=−a, we may suppose
[TABLE]
We have only to show m2,2=0, which implies m1,2=m=0,
hence we complete the proof.
Suppose that m2,2=0, and dividing m2,2, we may assume
[TABLE]
Hence α1,2 is a root of both g(x):=x2+ax−β1 and h(x):=(m1x+m2)2+\linebreaka(m1x+m2)−β2=(m1x+m2)2+a(m1x+m2)+b+β1,
which are polynomials over a quadratic field Q(β1).
Since g(x) is irreducible in Q(β1)[x],
we have h(x)=m12g(x), hence comparing constant terms
m22+am2+b+β1=−m12β1.
Thus we find a contradiction that β1 is rational.
∎
In the case of n=6, the polynomial f(x)=x6+2x5+4x4+x3+2x2−3x+1
is not decomposable but has a non-trivial linear relation : For a root α, we find
[TABLE]
and the sum of first three roots is −1.
In case that n=6 and Q(α1) is a
Galois extension of the rational number field Q, we can see how linear relations among roots are in subsequent subsections.
To explain it, we study the problem group-theoretically.
3.3 Abelian polynomial
In this subsection, we assume that f(x) is a monic irreducible polynomial of any degree over the rational number field Q with a complex root α, and
Q(α)/Q is a Galois extension with Galois group
G:=Gal(Q(α)/Q).
With the help of the representation theory, we can see how the linear relations among roots
are in the case that every absolutely irreducible representation of degree >1
is defined over Q.
We consider the group algebra C[G] and generalize the action of G on the root α
to C[G] as M[α]:=∑g∈Gmgg(α)∈C
for M=∑g∈Gmgg∈C[G].
In case of M∈G, M[α] is the ordinary action of the element M∈G on α,
and if M∈Q[G], then M[α]∈Q(α) is obvious.
We define the vector space GLR of linear relations among roots by
[TABLE]
For the numbering G={g1,…,gn} and αi=gi(α), two conditions ∑iligi∈GLR
and (l1,…,ln)∈LR0 are equivalent.
It is known ([L]) that by making G act on C[G] from the left,
C[G] contains the trivial representation with multiplicity 1 and every irreducible representation of G, that is
by putting
[TABLE]
the G-stable subspace V spanned by g−δ(g∈G) contains all non-trivial irreducible representations and does not contain the trivial representation.
The equations δ2=δ, gδ=δg=δ(∀g∈G), 1−δ=−∑g=1(g−δ), and δV=Vδ=0
are clear where 1 is the unit of the group G.
It is also obvious that C[G]=Cδ⊕V by
the decomposition ∑gmgg=(∑gmg)δ+∑gmg(g−δ),
which implies with δ∈GLR
[TABLE]
We say that an element M∈C[G] is trivial if and only if M∈Cδ.
It is obvious that
there is a non-trivial linear relation among roots if and only if dimQGLR>1.
Proposition 3.4**.**
For M∈C[G], M is trivial
if and only if M annihilates V.
Proof.
The “only if”-part follows from δV=0.
Conversely, we suppose that MV=0 with M=∑mgg, in particular M(1−δ)=0 for the unit 1∈G; then
[TABLE]
Thus we have mg=m1 for every g∈G, since the set of g−δ(g=1) is a basis of V.
Therefore M∈Cδ follows.
∎
Let us note the following fundamental equation for M∈Q[G]
[TABLE]
where g(M[α]) is the action of g∈G=Gal(Q(α)/Q) on
M[α]∈Q(α) and the right-hand side is the product in the group ring
C[G].
Because, putting M=∑h∈Gmhh with mh∈Q,
we see
[TABLE]
Proposition 3.5**.**
Let M∈Q[G]; then
M∈GLR holds if and only if
[TABLE]
Proof.
The equation (25) is equivalent to (∑g∈Gg(M[α])g−1)V=0 by (24).
Suppose that M∈GLR; then we have m:=M[α]∈Q by the definition and
it is easy to see ∑g∈Gg(M[α])g−1\linebreak[3]=∑g∈Gg(m)g−1=m∣G∣δ,
and it annihilates V.
Conversely, suppose that (25); then Proposition 3.4 implies that
∑g∈Gg(M[α])g−1 is trivial, that is M[α]∈Q(α) is
fixed by G=Gal(Q(α)/Q), i.e. M[α] is a rational number,
hence M∈GLR.
∎
Let χ be an irreducible character of G and
denote the central idempotent in C[G] to χ by
[TABLE]
They satisfy
[TABLE]
where δi,j is Kronecker’s delta function.
If χ is the trivial character, then cχ=δ.
The subspace V is the direct sum of C[G]cχ with non-trivial irreducible characters χ.
If A is a matrix representation corresponding to χ, then C[G]cχ is a direct sum of minimal ideals giving the representation A.
If χ is an irreducible character, then the mapping g↦σ(χ(g)) is also an irreducible character for every σ∈Gal(C/Q).
We denote it by σ(χ),
and let Ψ be a minimal set of irreducible characters such that every irreducible character is of the form
σ(χ) for ∃σ∈Gal(C/Q),∃χ∈Ψ.
For an irreducible character χ, we put
[TABLE]
which is an abelian extension over Q,
and denote the Galois group Gal(Q(χ)/Q) by Gal(χ).
Let K be a splitting field of G such that it is a Galois extension of Q
and contains Q(χ).
For example, the field Q(ζe) with exponent e of G is such a field.
It is easy to see that σ∈Gal(χ) is the identity if and only if σ(χ)=χ.
We put
[TABLE]
which is a central idempotent satisfying ∑χ∈ΨC(χ)=1.
We note that C(1)=δ, hence ∑χ(=1)∈ΨC(χ)=1−δ,
and (25) is equivalent to
[TABLE]
for every χ(=1)∈Ψ.
For an irreducible character χ, we put
[TABLE]
For the trivial character 1, we have
[TABLE]
We note that
for M∈Q[G] with MC(χ)=M,
the condition M(∑gg(α)g−1)\linebreak[3]=0 is equivalent to
[TABLE]
Proposition 3.6**.**
For an irreducible non-trivial character χ, we have
[TABLE]
and we have a linear relation
[TABLE]
Proof.
Let M∈LR(χ); then M=MC(χ) holds by definition and
the fundamental equation (24) implies ∑gg(M[α])g−1=0,
that is g(M[α])=0 for every g∈G,
hence we have
M[α]=0, i.e. (28) and hence M∈GLR, i.e.
M=MC(χ)∈GLR⋅C(χ).
Conversely, let M∈GLR; then MC(χ)∈Q[G]
and (MC(χ))C(χ)=MC(χ) are obvious.
Proposition 3.5 implies M(∑g(α)g−1)V\linebreak[3]=0,
which, with the condition C(χ)δ=0 implies MC(χ)(∑g(α)g−1)=0, i.e. MC(χ)∈LR(χ).
∎
Corollary 3.1**.**
We see that (i)
[TABLE]
(ii)*
LR0 is spanned by (1,…,1),c(M)(M∈V∩GLR),
where c(M) denotes the vector (…,mg,…) for M=∑g∈Gmgg,*
(iii)* M[α]=0 holds for M∈V∩GLR.*
Proof.
First, let us show (29).
Let M∈V∩GLR;
then we see that Mδ=0 implies M=M(1−δ)=∑χ(=1)∈ΨMC(χ).
Proposition 3.6 implies MC(χ)∈LR(χ).
Hence the left-hand side is contained in the right-hand side of (29).
Conversely, suppose that M∈LR(χ)(χ=1); then we see that M=MC(χ)∈V and (28) implies M∈GLR.
Thus the right-hand side of (29) is contained in the left-hand side.
Let ∑gmgg(α)=m(mg,m∈Q) be a linear relation.
Putting M:=∑mgg,
we have M∈GLR.
Decompose as M=∑mgg=(∑mg)δ+M′ with M′:=∑mg(g−δ).
Then M′∈V∩GLR is clear.
Hence there are elements Mχ∈LR(χ) for χ(=1)∈Ψ such that
M′=∑Mχ by Corollary 3.1.
Hence we have the decomposition
[TABLE]
where m=∑gmgg(α)=(∑mg)∣G∣−1∑g(α) with Mχ[α]=0.
∎
In case that degχ=1 or χ is defined over Q, the structure of LR(χ) is
rather easy to find as we see from now on.
Theorem 3.1**.**
Suppose that degχ=1 and let l be the order of χ;
then LR(χ)={0} holds if and only if ∑g∈Gχ(g)dg(α)=0 for every integer d relatively prime to l, i.e.
cσ(χ)[α]=0 for ∀σ∈Gal(χ), and then
we have
[TABLE]
with dimQLR(χ)=[Q(ζl):Q].
Proof.
We note that Q(χ)=Q(ζl) and the equation
hcχ=χ(h)cχ holds for each element h∈G,
hence for an element M=MC(χ)∈Q[G], there is an element
m∈Q(χ) such that Mcχ=mcχ.
Under this remark, let us see that the mapping M↦m from the set {M=MC(χ)∈Q[G]}
to Q(χ) is isomorphic.
Suppose that m=0, i.e. Mcχ=0; then Mcσ(χ)=0 holds, acting σ on coefficients all together,
hence M=MC(χ)=M∑cσ(χ)=0.
Next, let m∈Q(χ); then there is an element M′cχ=mcχ
with M′∈Q[G].
It is easy to see that M:=∑σM′cσ(χ)=M′C(χ) satisfies M=MC(χ)∈Q[G] and Mcχ=M′cχ=mcχ.
Therefore, the mapping M↦m is isomorphic,
hence M=0 and m=0 are equivalent.
Note that Mcχ=mcχ implies Mcσ(χ)=σ(m)cσ(χ).
Take an element M=MC(χ)∈Q[G].
Using the above notation,
we see the following two equations
[TABLE]
and
[TABLE]
The condition M=MC(χ)∈LR(χ) holds if and only if
M(∑g(α)g−1)\linebreak[3]=MC(χ)(∑g(α)g−1)=0,
which means Mcσ(χ)(∑g(α)g−1)=0 for every σ∈Gal(χ).
By the second equation above, it is equivalent to
[TABLE]
for every σ∈Gal(χ),
which means either m=0 or ∑gσ(χ(g))g−1(α)=0.
Thus we have ∑gσ(χ(g))g−1(α)=0
for every σ∈Gal(χ) if LR(χ)=0.
If, conversely ∑gσ(χ(g))g−1(α)=0 holds
for every σ∈Gal(χ),
then M∑g(α)g−1=0, i.e. M∈LR(χ) follows for every
M=MC(χ)∈Q[G].
Thus the first statement of the theorem has been proven.
Suppose LR(χ)=0; then the above argument implies LR(χ)={MC(χ)∣M∈Q[G]}={∑gtrQ(ζl)/Q(mχ(g))g∣m∈Q(ζl)} by the first equation.
Since ∑gtrQ(ζl)/Q(mχ(g))g=0 if and only if m=0, we find dimQLR(χ)=[Q(ζl):Q].
∎
By this theorem, Corollary 3.1 and (30), we can understand the structure
of linear relations among roots if
Q(α) is an abelian extension of Q.
Example 3.1
Let us consider a polynomial f(x) of degree 6 with a root α
such that Q(α) is an abelian
extension of Q.
Let G be the Galois group Gal(Q(α)/Q) with a generator
g0, and let ω be a third root of unity, i.e. ω2+ω+1=0.
We number roots by αi=g0i(α).
Let χ be a non-trivial irreducible character of order l satisfying LR(χ)=0.
Then the relations corresponding to LR(χ) are ∑gtrQ(χ(g0))/Q(mχ(g))g(α)=0 for every m∈Q(χ(g0)).
Case of l=2: We have χ(g0)=−1.
Relations are α1+α3+α5=α2+α4+α6.
Case of l=3: We may assume χ(g0)=ω.
Then relations of LR(χ) are α1+α2+α4+α5=2α3+2α6
for m=1,
α2+α3+α5+α6=2α1+2α4 for m=ω,
i.e. α1+α4=α2+α5=α3+α6.
Case of l=6: We assume χ(g0)=−ω.
Equations ∑gtrQ(ω)/Q(mχ(g))g(α)\linebreak[3]=0 for m=1,ω imply α1+α5+2α6=α2+2α3+α4 and
2α1+α2+α6=α3+2α4+α5, respectively,
hence the basis of LR(χ) is α1−α4=−α2+α5=α3−α6.
The case of l=6 is compatible with neither the case of l=2 nor l=3.
The following polynomials define the same field Q(ζ7) and
let g0:ζ7↦ζ73. We simply write ζ=ζ7.
f(x)=x6+x5+⋯+1 has only a trivial linear relation ∑αi=−1.
As stated, G=S6, det((mi,mj))=6 and Pr(f,σ)=1 for every σ∈S6.
2. 2.
(l=2)
f(x)=x6−4x5+9x4−15x3+18x2−16x+8 has roots
[α1,…,α6]=[ζ5+ζ4+1,ζ5+ζ+1,ζ3+ζ+1,ζ3+ζ2+1,−ζ5−ζ4−ζ3−ζ,−ζ5−ζ3−ζ2−ζ],
and the basis of linear relations is α1+α3+α5=α2+α4+α6=2.
#G=72, det((mi,mj))=9 and calculation by computer suggests that Pr(f,σ)>0 holds if and only if σ∈G.
3. 3.
(l=3)
f(x)=x6−3x5+9x4−13x3+11x2−5x+1 has roots
[α1,…,α6]=[−ζ3−ζ2−ζ,ζ5+ζ4+ζ+1,ζ5+ζ3+ζ+1,ζ3+ζ2+ζ+1,−ζ5−ζ4−ζ,−ζ5−ζ3−ζ],
and the basis of linear relations is ∑αi=3, α1+α4=α2+α5=α3+α6(=1), i.e. α1+α4=α2+α5=α3+α6=1.
#G=48, det((mi,mj))=8, and Pr(f,σ)>0 holds if and only if σ∈(4,6)G,
and then Pr(f,σ)=1.
4. 4.
(l=2,3)
f(x)=x6+14x4+49x2+7 has roots
[α1,…,α6]=[−ζ5−2ζ3−ζ2−2ζ−1,ζ5+ζ4−ζ3−ζ2,2ζ5+ζ4+ζ3+2ζ+1,ζ5+2ζ3+ζ2+2ζ+1,−ζ5−ζ4+ζ3+ζ2,−2ζ5−ζ4−ζ3−2ζ−1]
and the basis of linear relations is ∑αi=0, α1+α3+α5=α2+α4+α6(=0),
α1+α4=α2+α5=α3+α6(=0), i.e.
α4=−α1,α5=−α2,α6=−α3,α1+α3+α5=0.
#G=12, det((mi,mj))=12
and Pr(f,σ)>0 holds if and only if σ∈(1,3,6)G∪(2,5)(4,6)G.
Pr(f,(1,3,6))=3/4,Pr(f,(2,5)(4,6))=1/4.
It is easy to see that
[TABLE]
where C=(0,0,0,1,1,1) and orthnormal vectors δ1,δ2 are given by 2δ1=(1,0,1,−1,0,−1),
23δ2=(−1,2,1,−1,−2,1) and the volume is 3/8,
and
[TABLE]
where C=(0,0,1,0,1,1) and orthnormal vectors δ1,δ2 are given by 2δ1=(1,0,−1,1,0,−1), 23δ2=(−1,2,−1,1,−2,1) and the volume is 3/24,
hence the ratio D(f,σ)/Pr(f,σ)=3/6=∣det((mi,mj))∣/#G is independent of σ.
5. 5.
(l=6)
f(x)=x6−x5+x4−x3+15x2−x+29 has roots
[α1,…,α6]=[ζ3−ζ2−ζ,ζ5+ζ4+2ζ2+ζ+1,−ζ5−2ζ4−ζ3−2ζ2−ζ−1,2ζ4+ζ3+ζ2+ζ+1,ζ5−ζ4−ζ,−ζ5−ζ3+ζ]
and the basis of linear relations is ∑αi=1
and α1−α4=−α2+α5=α3−α6.
#G=12, det((mi,mj))=72 and Pr(f,σ)>0 holds if and only if σ is in one of 18 cosets of G represented
by id,(2,3),(2,5),(3,4),(3,6),(4,5),(5,6),(2,3)(4,5),(2,3)(5,6),(2,4)(3,5),(2,5)(3,4),(3,4)(5,6),(3,5)(4,6),(4,5)(3,6),(3,5,4,6),(3,6,4,5),\linebreak(2,4,3,5),(2,5,3,4).
3.4 S3
To see the case of S3-extension, we need more,
and from now on, we assume that the absolutely irreducible character χ is associated with a rational matrix representation A,
hence there is a minimal ideal m of a simple algebra Q[G]cχ(⊂Q[G]) with
a basis {w1,…,wχ(1)} of m over Q such that
[TABLE]
The correspondence g↦A(g) is extended to an isomorphism from
C[G]cχ to the matrix ring Mχ(1)(C) with
A(Q[G]cχ)=Mχ(1)(Q)
because of Q being a splitting field for the representation A.
Through this correspondence, take vi,j∈Q[G]cχ satisfying
[TABLE]
where Ej,i is the matrix whose (j,i)-entry is 1, otherwise [math].
Therefore the set {vi,j∣1≤i,j≤χ(1)} is a basis of Q[G]cχ over Q.
The identity C(χ)=cχ is obvious by the assumption that χ is associated with a rational matrix representation A.
Lemma 3.1**.**
We have
[TABLE]
Proof.
Write gvi,j=∑1≤k,l≤χ(1)ck,lvk,l with ck,l∈Q;
then we see that gvi,jwm is ∑k,lck,lvk,lwm=∑k,lck,lδk,mwl=∑1≤l≤χ(1)cm,lwl=∑1≤k≤χ(1)cm,kwk.
On the other hand, we find that gvi,jwm\linebreak[3]=gδi,mwj=δi,m∑1≤k≤χ(1)wkA(g)k,j,
where A(g)k,j is the (k,j)-entry of A(g).
Comparing the coefficients of wk of two equations, we have cm,k=δi,mA(g)k,j,
i.e. ck,l=δi,kA(g)l,j.
Hence we have
Each column of the matrix B:=∑g∈Gg−1(α)A(g)
is equal to a linear combination of the first column of h(B)(h∈G) over Q.
Proof.
Taking elements cj,g∈Q such that wj=∑h∈Gcj,hhw1,
we have gwj=∑h∈Gcj,hghw1, hence
[TABLE]
therefore
[TABLE]
Thus the j-th column of B is
[TABLE]
∎
Theorem 3.2**.**
For M=Mcχ∈Q[G], write
[TABLE]
Then M∈LR(χ) holds if and only if
[TABLE]
Moreover it is equivalent to
[TABLE]
Proof.
For M=Mcχ∈Q[G], the condition M∈LR(χ) is, by definition
equivalent to M(∑gg−1(α)g)=0, which is (mi,j)(∑gg−1(α)A(g))=0(χ(1)),
i.e. (34) by Lemma 3.2.
Then (34) follows from Proposition 3.7.
∎
Now let us take an irreducible polynomial f(x) of degree 6 with root α
such that Q(α) is a Galois extension of Q with Galois group
isomorphic to S3.
Denote the Galois group Gal(Q(α)/Q) by G, and
let G=⟨σ,μ⟩ with σ3=μ2=1,μσμ=σ2.
The characters of G are
the trivial character χ1 with cχ1=61∑gg,
2. 2.
the character χ2 of degree 1 defined by χ(σ)=1,χ(μ)=−1
with cχ2=61(∑i=02σi−∑i=02σiμ),
3. 3.
the character of degree 2 corresponding to the representation
[TABLE]
with cχ3=31(2−σ−σ2)∈Q[G]
and Q[G]cχ3=⟨1−σ,σ−σ2,μ−σμ,σμ−σ2μ⟩Q.
For simplicity, we number roots of f(x) as follows:
[TABLE]
and abbreviate as
[TABLE]
In case of χ2, Theorem 3.1 implies that if LR(χ2)=0, then
[TABLE]
Let us consider the case χ:=χ3.
Put
[TABLE]
then it is easy to see that
for i=1,2
[TABLE]
and
[TABLE]
Thus v1,1:=v1,v1,2:=σv1,v2,1:=v2,v2,2:=σv2 satisfy (31)
and (32), and vi,j are in Q[G] for i,j=1,2.
These imply, for M=c1v1+c2σv1+c3v2+c4σv2
[TABLE]
Moreover we see, for i=1,2
[TABLE]
hence the condition M∈LR(χ) is equivalent to CA=0.
The second column of A is the image of the first column by σ,
hence CA=0 is certainly equivalent to C×(the first column of A)=0.
Let us see (A1,1,A2,1)=(0,0).
If A1,1=A2,1=0 holds,
then we get A1,1+σ(A2,1)=2α1−α2−α3=0
and 2α2−α3−α1=0, acting σ. Their difference is 3(α1−α2)=0, which is a contradiction.
Let us see LR(χ) explicitly.
Proposition 3.8**.**
Continue the above and suppose that LR(χ)={0};
then there are rational numbers a,b with (a,b)=(0,0) such that
[TABLE]
and the basis of LR(χ) is given by av1+bv2,σ(av1+bv2),
and corresponding linear relations are spanned by
a(α1−α2−α5+α6)+b(−α2+α3+α4−α5)=0
and a(α2−α3+α4−α6)+b(α1−α3+α5−α6)=0.
Proof.
Suppose LR(χ)=0 and take a non-zero element M=c1v1+c2σv1+c3v2+c4σv2∈Q[G]C(χ).
Then at least one of ci is not zero,
hence there are rational numbers a,b with (a,b)=(0,0) satisfying aA1,1+bA2,1=0,
i.e. (37).
The we have \left|\begin{array}[]{rr}{\bf{A}}_{1,1}&b\\
-{\bf{A}}_{2,1}&a\end{array}\right|=\left|\begin{array}[]{rr}{\bf{A}}_{1,1}&c_{3}\\
-{\bf{A}}_{2,1}&c_{1}\end{array}\right|=\left|\begin{array}[]{rr}{\bf{A}}_{1,1}&c_{4}\\
-{\bf{A}}_{2,1}&c_{2}\end{array}\right|=0
by CA=0.
Therefore, there are rational numbers κ1,κ2
such that (c3,c1)=κ1(b,a),(c4,c2)=κ2(b,a), thus we have
M=κ1(av1+bv2)+κ2(aσv1+bσv2).
∎
Example 3.2
Let f0(x):=x6+3 with a root ζ.
For a primitive third root ω of unity, define the automorphisms σ, μ by σ(ζ)=ωζ and μ(ζ)=−ζ.
Roots are [α1,…,α6]=[ζ,−ζ4/2−ζ/2,ζ4/2−ζ/2,−ζ,ζ4/2+ζ/2,−ζ4/2+ζ/2],
which satisfy α1+α2+α3=α4+α5+α6, and
α1−α2−α5+α6=α2−α3−α4+α5 and
α2−α3+α4−α6=−α1+α3−α5+α6,
that is LR(χ2)=0,LR(χ3)=0.
The following three polynomials give the same field Q(ζ) as f0(x).
A polynomial f1(x):=x6+6x5+24x4+14x3+15x2−12x+16 with roots
−ζ3−ζ2−ζ−1,−ζ5/2+ζ4/2−ζ3+ζ2/2+ζ/2−1,ζ5/2−ζ4/2−ζ3+ζ2/2+ζ/2−1,ζ3−ζ2+ζ−1,−ζ5/2−ζ4/2+ζ3+ζ2/2−ζ/2−1,ζ5/2+ζ4/2+ζ3+ζ2/2−ζ/2−1
has no non-trivial linear relation.
A polynomial f2(x):=x6+6x5+15x4+14x3+24x2+24x+16 with roots
−ζ2−ζ−1,−ζ5/2+ζ4/2+ζ2/2+ζ/2−1,ζ5/2−ζ4/2+ζ2/2+ζ/2−1,−ζ2+ζ−1,−ζ5/2−ζ4/2+ζ2/2−ζ/2−1,ζ5/2+ζ4/2+ζ2/2−ζ/2−1 has linear relations ∑αi=−6 and α1+α2+α3−α4−α5−α6=0
corresponding to χ2 only.
A polynomial f3(x):=x6+6x5+24x4+56x3+114x2+132x+67 with roots
−ζ3−ζ−1,ζ4/2−ζ3+ζ/2−1,−ζ4/2−ζ3+ζ/2−1,ζ3+ζ−1,−ζ4/2+ζ3−ζ/2−1,ζ4/2+ζ3−ζ/2−1
has the linear relation ∑αi=−6 and the one corresponding to χ3 with a=b=1 at (37) only.
The author does not know what the set of values a/b is.
Numbers 2/7,37/17,\linebreak[3]… are such examples.
**Remark **
Let g1(x) be a polynomial with roots α1,…,αn and g2(x) a polynomial
with roots β1,…,βm and f(x):=g1(x)g2(x).
Suppose that Q(g1)∩Q(g2)=Q;
then a linear relation ∑liαi+∑miβi∈Q with all
li,mj∈Q implies obviously
∑liαi,∑miβi∈Q.
However, in case of Q(g1)∩Q(g2)=Q
a linear relation among root of f(x) is not necessarily reduced to those of g1(x),g2(x) (cf. 7.4).
4 Dependency of Pr(f,σ),D(f,σ) on σ
It is easy to see that for ν∈Sn, the condition ν∈G^ is equivalent to that
there is a unimodular matrix Aν of degree t such that
[TABLE]
and ν∈G is equivalent to that
there is a unimodular matrix Aν′ of degree t such that
[TABLE]
and (38) implies (39) for Aν′=Aν,
hence G^ is a subgroup of G.
Here the unimodularity of matrices Aν,Aν′ is replaced by the integrality,
since the elementary divisors of the matrix whose rows are mi are 1.
Proposition 4.1**.**
We have
[TABLE]
Proof.
Let σ∈Sn.
Suppose the condition ∑imj,iασ(i)=mj, which is clearly equivalent to
∑imj,σ−1(i)αi=mj, hence there are integers ai,j such that
[TABLE]
which means σ∈G^.
If, conversely σ is in G^, then there are integers ai,j such that
σ(mj^)=∑kaj,km^k, i.e.
[TABLE]
Hence, we see ∑imj,iασ(i)=∑imj,σ−1(i)αi=∑i,kaj,kmk,iαi=∑kaj,kmk=mj.
Thus we have shown the first equality.
The second equality follows from that (mj,1,…,mj,n,mn)(j=1,…,t) are a basis of
LR∩Zn+1 over Z.
The statement for G is proved similarly,
noting that the vectors m1,…,mt are a basis of
LR0∩Zn={(l1,…,ln)∈Zn∣∑liαi∈Z}.
∎
Corollary 4.1**.**
If the polynomial f(x) is irreducible, then G^=G holds.
Proof.
Let a permutation σ be in G.
Take (l1,…,ln+1)∈LR; then we have only to show that
l:=∑i=1nliασ(i)∈Q is equal to ln+1.
Denoting the trace from Q(f) to Q by tr, we have
tr(α1)=⋯=tr(αn) and
[Q(f):Q]l=∑ilitr(ασ(i))=∑ilitr(αi)=tr(∑iliαi)=tr(ln+1)=[Q(f):Q]ln+1, hence l=ln+1.
∎
We remark that
the corollary is not necessarily true for a reducible polynomial (cf. 6.4.1, 6.4.2),
that is l=ln+1 fails in the above proof.
4.1 Pr(f,σ)
To prove the next aim, we introduce more notations:
[TABLE]
where p denotes a prime ideal of Q(f) over p,
and then the prime ideal p is unique if p is relatively prime to
∏αi=αj(αi−αj), that is p does not divide the integer
∏αi=αj(αi−αj)2.
G0 is a subgroup of G^ and is isomorphic to Gal(Q(f)/Q)
if f(x) has no multiple root.
It is clear that Spl(f)=∪μ∈SnM(f,μ), and the condition Gal(Q(f)/Q)=Sn implies M(f,μ)=Spl(f).
The notion M(f,μ) here is better than Mμ in [K11].
The set M(f,μ) depends on the numbering of roots αi’s.
Let Q(f)=Q(α) for an algebraic integer α with monic minimal
polynomial F(x) and write αi=gi(α)(i=1,…,n) for polynomials
gi(x)∈Q[x].
Then we see that except finitely many primes p
[TABLE]
where {x} means the decimal part of x, i.e. 0≤{x}<1 and x−{x}∈Z.
We note that p=(α−r,p) is a prime ideal except finitely many primes p
and the ideal p and rmodp above are unique if the prime p
is sufficiently large.
For an integer r satisfying F(r)≡0modp define a prime ideal p by
(α−r,p); then the equation αi=gi(α)≡gi(r)modp implies
that there is a permutation η∈Sn such that gi(r)≡rη(i)modp(i=1,…,n),
and it is easy to see that the coset ηG0 is independent of the choice of the root r.
If an integer r′ has the same properties, then for the prime ideal (α−r′,p)=p′=σ(p) with some σ∈Gal(Q(f)/Q),
we have αi=gi(α)≡gi(r′)≡rη(i)modp′,
hence σ−1(αi)≡rη(i)≡αimodp.
Thus σ is the identity on Q(f)=Q(α1,…,αn),
hence we have p=p′, i.e. r≡r′modp.
Problem
Let f(x) be an irreducible polynomial and let gl(x),hl(x)
and Gl(x1,…,xm),Hl(x1,…,xm) be polynomials in
Q[x],Q[x1,…,xm](l=1,…,\linebreak[3]m), respectively. What is the density of the following set in Spl(f) ?
[TABLE]
2. 2.
[TABLE]
Here the numbers gl(r),hl(r),Gl(r1,…,rn) and Hl(r1,…,rn) are supposed to be integers which correspond to elements in Z/pZ for primes p not
dividing denominators of gl(x),hl(x),Gl(x1,…,xn) and Hl(x1,…,xn), respectively.
The computer experiment suggests that in case of degf=3 the second density above depends on f(x) if it is Galois, but does not depend otherwise.
Suppose #M(f,σ)=∞;
then for η∈Sn
the following three conditions are equivalent : (i) M(f,η)=M(f,σ),
(ii) σ−1η∈G0, and
(iii) #(M(f,η)∩M(f,σ))=∞.
Proof.
Suppose the condition (iii), i.e. αi≡rη(i)modp and
αi≡rσ(i)modμ~(p) for some μ~∈Gal(Q(f)/Q) for a sufficiently large p∈Spl(f).
They imply μ~(αi)≡μ~(rη(i))≡rη(i)modμ~(p)
and ασ−1η(i)≡rη(i)modμ~(p), hence μ~(αi)≡ασ−1η(i)modμ~(p), which imply μ~(αi)=ασ−1η(i).
Thus the definition implies σ−1η∈G0, hence (ii).
Suppose (ii); then σ=ημ−1 for some μ∈G0 with μ~(αi)=αμ(i) for some μ~∈Gal(Q(f)/Q).
For a prime p∈Spl(f), we see that p∈M(f,σ)↔αi≡rσ(i)modp↔αi≡rημ−1(i)modp↔αμ(i)≡rη(i)modp↔μ~(αi)≡rη(i)modp↔αi≡rη(i)modμ~−1(p)↔p∈M(f,η), hence we get (i).
The condition (i) implies obviously (iii).
∎
The following is fundamental.
Proposition 4.2**.**
We have
[TABLE]
where μ runs over the set of permutations satisfying
μ∈σG^ with #M(f,μ)=∞,
and Tσ is a finite set.
Suppose #Spl(f,σ)=∞; then for ν∈Sn we see that
Spl(f,σ)∩Spl(f,ν) is an infinite set if and only if
σG^=νG^, and then the difference
between Spl(f,σ) and Spl(f,ν) is a finite set.
Proof.
By the identity Spl(f,σ)=∪μ∈Sn(Spl(f,σ)∩M(f,μ)),
we have only to show that #(Spl(f,σ)∩M(f,μ))=∞ holds if and only if both
μG^=σG^ and #M(f,μ)=∞ hold, and then M(f,μ)⊂Spl(f,σ).
Suppose that #(Spl(f,σ)∩M(f,μ))=∞.
The property #M(f,μ)=∞ is clear.
For p∈Spl(f,σ)∩M(f,μ), we have
[TABLE]
which implies ∑imj,iαμ−1σ(i)≡mjmodp for infinitely many primes in p∈Spl(f,σ)∩M(f,μ),
which implies ∑imj,iαμ−1σ(i)=mj,
hence we have μ−1σ∈G^, i.e. μG^=σG^.
Conversely, suppose that μG^=σG^ and #M(f,μ)=∞ hold;
then we have the equation ∑imj,iαμ−1σ(i)\linebreak[3]=mj.
Hence, for p∈M(f,μ), we see ∑imj,irσ(i)≡mjmodp,
that is p∈Spl(f,σ) and so M(f,μ)⊂Spl(f,σ),
thus #(Spl(f,σ)∩M(f,μ))=∞.
Hence the condition #(Spl(f,σ)∩M(f,μ))=∞ is equivalent to
#M(f,μ)=∞
and μG^=σG^.
And then, we have M(f,μ)⊂Spl(f,σ) as above.
Therefore (40) has been proved.
If Spl(f,σ)∩Spl(f,ν) is an infinite set, then there are permutations μ,μ′ such that
σG^=μG^,νG^=μ′G^ and #(M(f,μ)∩M(f,μ′))=∞, hence μG0=μ′G0
by Lemma 4.1 and then σG^=νG^.
Hence the difference between Spl(f,σ) and Spl(f,ν) is that between Tσ and Tν.
If, conversely σG^=νG^, then from (40) follows that
the difference between Spl(f,σ) and Spl(f,ν) is finite.
This completes the proof.
∎
It is likely that the density of M(f,μ) in Spl(f,σ)(=Spl(f,μ)) at (40) equal to 1/[G^:G0].
Corollary 4.2**.**
If a prime p∈Spl(f) is sufficiently large, then there are exactly #G^ permutations σ
satisfying p∈Spl(f,σ), i.e. (6).
Proof.
Let p∈Spl(f) be large so that p∈Tσ and p∈M(f,σ)∩M(f,μ) if #(M(f,σ)∩M(f,μ))<∞ for σ,μ∈Sn.
If p∈Spl(f) is contained in Spl(f,σ), then p∈Spl(f,σν)(∀ν∈G^)
is clear by Proposition 4.2.
If p∈Spl(f) is contained in Spl(f,σ)∩Spl(f,μ), hence
in M(f,σ′)∩M(f,μ′) for ∃σ′∈σG^,∃μ′∈μG^,
then M(f,σ′)∩M(f,μ′) is an infinite set,
hence we see σ′−1μ′∈G0 and then σ−1μ∈G^.
Therefore p∈Spl(f,σ) holds for a permutation σ in the only one coset by
G^.
∎
Let σ∈Sn.
If a sufficiently large prime p∈Spl(f) satisfies ∑imj,iασ(i)≡mjmodp(j=1,…,t) for some prime ideal p of Q(f) lying over p,
then ∑imj,iασ(i)=mj(j=1,…,t) holds.
Proof.
Take a permutation κ∈Sn such that ασ(i)≡rκ(i)modp(i=1,…,n).
Then we see ∑imj,irκ(i)≡mjmodp(j=1,…,t), i.e. p∈Spl(f,κ),
hence p∈M(f,κη) for some η∈G^ with #M(f,κη)=∞.
Therefore we have αi≡rκη(i)modp′(i=1,…,n) for some prime ideal p′ lying over p.
For an automorphism ι∈Gal(Q(f)/Q) satisfying ι(p′)=p,
we have ι(αi)≡rκη(i)modp, hence ι(αη−1(i))≡rκ(i)≡ασ(i)modp, hence ι(αη−1(i))=ασ(i).
Since G^ is a group, we see η−1∈G^, hence ∑imj,iαη−1(i)=mj(j=1,…,t), which implies ∑imj,iασ(i)=mj(j=1,…,t).
∎
By keeping notations in the proof above, the proof shows : Starting from ∑imj,irκ(i)≡mjmodp and taking σ∈Sn satisfying
rκ(i)≡ασ(i)modp, we have
∑imj,iασ(i)=mj.
Incidentally the completion Q(f)p is isomorphic to Qp and
let r^i be roots of f(x)=0 in Qp satisfying
r^i≡rimodpZp.
Making use of the isomorphism from
Q(f) into Q(f)p≅Qp and αi≡rκσ−1(i)modp,
we see that the root αi in Q(f) is mapped to the root
r^κσ−1(i).
Thus, we see that for l1,…,ln+1∈Q, the identity
∑i=1nliαi=ln+1 is
equivalent to ∑i=1nlir^κσ−1(i)=ln+1,
and combining the above, ∑imj,irκ(i)≡mjmodp implies
∑imj,σ−1(i)r^κσ−1(i)=mj, i.e.
∑imj,ir^κ(i)=mj in Qp .
Proposition 4.3**.**
Let σ,ν be permutations, and suppose that ν∈G^.
Then we have, neglecting a finite set of primes
[TABLE]
where t(k1′,…,kt′):=Aν⋅t(k1,…,kt) for the integral matrix Aν=(aij)∈GLt(Z) given at (38).
In particular,
we have
[TABLE]
Proof.
The first equation follows from Proposition 4.2.
Let p be a prime in Spl(f,σ,{kj}); then we see
∑imj,irσ(i)=mj+kjp and so ∑jal,j∑imj,irσ(i)\linebreak[3]=∑jal,jmj+∑jal,jkjp, that is ∑iml,ν−1(i)rσ(i)\linebreak[3]=ml+kl′p,
which implies p∈Spl(f,σν,{kj′}), that is Spl(f,σ,{kj}) is included in
Spl(f,σν,{kj′}).
Since Aν−1 is also integral, we have the converse inclusion
Spl(f,σν,{kj′})⊂Spl(f,σ,{kj})
similarly, hence (42), (43).
∎
4.2 D(f,σ)
By definition, we see
[TABLE]
Another aim in this section is
Proposition 4.4**.**
Suppose that vol(D(f,σ))>0;
then
we have following equivalences.
[TABLE]
In particular, D(f,σ)=D(f,σν) holds if
and only if ν∈G.
Proof.
For an integral vector k=(k1,…,kt)∈Zt, we take a vector xk∈Rn
such that (mj,xk)=kj(j=1,…,t).
For x∈Rn, the condition (mj,σ−1(x))\linebreak=kj(j=1,…,t) is equivalent to
σ−1(x)−xk∈⟨m1,…,mt⟩R⊥.
Therefore we have
[TABLE]
Suppose that vol(D(f,σ))>0;
if the property vol(D(f,σ)∩D(f,μ))>0 holds,
then (47) implies ⟨σ(m1),…,σ(mt)⟩R⊥=⟨μ(m1),…,μ(mt)⟩R⊥, i.e.
[TABLE]
Since the matrix whose jth row is mj is integral with every elementary divisor being 1,
the above is equivalent to
[TABLE]
hence μ−1σ∈G holds
and the above identity implies x∈D(f,σ)⟺x∈D(f,μ)
by (46), hence D(f,σ)=D(f,μ).
∎
Corollary 4.5**.**
We have
[TABLE]
Proof.
Put
[TABLE]
Then we have
[TABLE]
∎
In Proposition 5.2, we show that (48) is equal to det((mi,mj))
under some conditions.
Lemma 4.2**.**
Suppose that f(x) has no rational root and αi−αj∈/Q for any distinct i,j and #Spl(f,σ,{kj})=∞.
For a prime p∈Spl(f,σ,{kj}) with finite exceptions,
we have
[TABLE]
and
[TABLE]
where tr denotes the trace from Q(f) to Q, and d:=[Q(f):Q].
Proof.
Since the set
[TABLE]
is an infinite set,
the original equation ∑imj,iαi=mj imply ∑imj,itr(αi)=dmj,
hence for every p∈Spl(f,σ,{kj}), we have
[TABLE]
which is the first statement.
Next, let us show the second, i.e.
[TABLE]
To prove it, it is enough to show that for X:=∑i∣tr(αi)∣/d,
all of conditions r1>X,p−rn>X,ri+1−ri>X(i=1,…,n−1) hold for a sufficiently large prime p
in Spl(f,σ,{kj}).
If the inequality (0≤)r1≤X occurs for infinitely many primes, then there is an integer r∈[0,X] such that f(r)≡0modp for infinitely many p, which means f(r)=0.
If the inequality (0<)p−rn≤X occurs for infinitely many primes,
then there is an integer r such that
r=p−rn≤X, hence f(−r)≡0modp for infinitely many p, which means f(−r)=0.
If ri+1−ri≤X occurs for infinitely many primes, then the equality ri+1−ri=r(≤X) occurs
for some integer r for infinitely many primes p,
that is polynomials f(x),f(x+r)modp have a common root ri for infinitely many primes,
which implies that f(x),f(x+r) are not relatively prime, and they are divisible by some irreducible polynomial h(x),
hence f(x) is divisible by h(x),h(x−r), so for a root α of h(x), α,α+r are roots of
f(x).
This contradicts the assumption.
∎
Proposition 4.5**.**
Suppose that f(x) has no rational root and αi−αj∈/Q for any distinct i,j.
Then we see that the condition #Spl(f,σ,{kj})=∞ implies vol(D(f,σ,{kj}))>0.
Proof.
We note that
D(f,σ,{kj}) is the intersection of (n−t)-dimensional set {x∈Rn∣∑imj,ixσ(i)=kj(∀j)} and {x∣0≤x1≤⋯≤xn≤1}.
And its
(n−t)-dimensional open subset {x∈Rn∣∑imj,ixσ(i)=kj(∀j)}∩{x∣0<x1<⋯<xn<1} is not empty,
since it contains
[TABLE]
by Lemma 4.2.
Therefore we have vol(D(f,σ,{kj}))>0.
∎
Lastly, let us give the following
Proposition 4.6**.**
We see that
[TABLE]
and, for an integer k(1≤k≤n−1),
[TABLE]
Proof.
We note that vol is the (n−1)-dimensional volume here.
Let θ be the angle between two hyperplanes defined by xn=0 and ∑xi=0,
that is the angle between vectors (0,…,0,1) and (1,…,1), hence cosθ=1/n.
Since a permutation acts on Rn and on the set {x∈Rn∣∑xi=k}
as an orthogonal transformation and
the dimension of the set defined by ∑xi∈Z and xi=xi+1 is n−2,
vol(D^n) is equal to the volume of the set
[TABLE]
hence
we see that
[TABLE]
and the projection (x1,…,xn)↦(x1,…,xn−1) from
{(x1,…,xn)∈[0,1)n∣∑xi∈Z} to
[0,1)n−1 is bijective by x1+⋯+xn−1+xn=⌈x1+⋯+xn−1⌉,
we have n!vol(D^n)cosθ=vol([0,1)n−1)=1.
Next, we have
[TABLE]
∎
**Remark **
The set D^n is in a union of parallel transformations of the subspace
S:={x∈Rn∣∑i=1nxi=0}.
Write e=(1,…,1),f=(0,…,0,n) and let τ be the symmetry defined by
x↦x−(e−f,e−f)2(e−f,x)(e−f); then by S=e⊥=τ(f)⊥,
we see that
τ(ei)=ei−n−n1(e−f)(i=1,…,n−1) are
orthnormal basis of S, where e1=(1,0,…,0),e2=(0,1,0,…,0) and so on.
Another basis of S is ui:=(n−i)(n−i+1)1(0,…,0,n−i,−1,…,−1),
where the number n−i is on the ith entry.
Let us give a geometric remark here.
For linearly independent vectors u1,…,\linebreak[3]uT∈Rn(1≤T<n),
write
[TABLE]
and we add vectors uT+1,…,un so that the matrix U=\left(\begin{array}[]{cc}U_{1}^{(T)}&U_{2}\\
U_{3}&U_{4}\end{array}\right) with ith row being ui
is regular.
Moreover, let vectors fi∈Rn(i=1,…,T) be orthonormal basis of S and define the matrix C=(cij)
by ui=∑j=1Tcijfj.
Defining the projection pr from Rn to V:={(x1,…,xT,0,…,0)∣xi∈R}
by
[TABLE]
let us show that there is a constant c1 such that
vol(pr(Y))=c1vol(Y) for any measurable set Y on S under the condition detU1=0.
First, let us find the condition to pr(S)=V.
Suppose that y=(y1,…,yn)∈Rn and
x=(x1,…,xT)∈RT satisfy the relation y=∑i=1Txiui,
which is equivalent to
[TABLE]
by y=(y1,…,yn)=(x1,…,xT,0,…,0)U.
Hence the conditions pr(S)=V and detU1=0 are equivalent, and then the mapping pr is
the isomorphism from S to V and
we see
[TABLE]
Write Y:={∑i=1Txiui∣(x1,…,xT)∈X} for a measurable set X in RT.
Then it is easy to see
[TABLE]
hence vol(Y)=vol({(x1,…,xT)C∣(x1,…,xT)∈X} by our definition and it is equal to
∣detC∣vol(X).
Therefore we see
[TABLE]
Thus the constant c1=∣detU1∣∣detC∣−1 which is independent of Y
satisfies vol(pr(Y))=c1vol(Y).
In case of Y={∑i=1Txiui∣0≤xi≤1(i=1,…,T)}, we see vol(Y)=det((ui,uj))=∣detC∣ and vol(pr(Y))=∣detU1∣.
In case of Y={∑i=1Txifi∣0≤xi≤1(i=1,…,T)}, we see
vol(Y)=1 and vol(pr(Y))= the absolute value of the determinant of the left (T,T)-submatrix of \left(\begin{array}[]{c}\bm{f}_{1}\\
\vdots\\
\bm{f}_{T}\end{array}\right).
As an example, let us see the subspaces S={x∈Rn∣∑i=1nxi=0},
and V={x∈Rn∣xn=0}.
For S, we take the orthonormal basis ui=fi:=(n−i)(n−i+1)1(0,…,0,n−i,−1,…,−1)(i=1,…,n−1) given in the remark after Proposition 4.6.
Then, writing the (i,j)-entry of the matrix U1 by ui,j, we see that ui,j=0 if i>j and
ui,i=n−i+1n−i, hence c1=detU1=n1.
5 One-dimensional distribution
In this section, we discuss the one-dimensional
equi-distribution of ri/p(1≤i≤n,p∈Spl(f)) for local roots ri,
that is whether, for 0≤a<1
[TABLE]
is true or not.
We note that if f(x) has no rational integral root, then the number of primes p∈Spl(f) satisfying r1<X or
rn>p−X is finite for any number X, and
if f(x) has a rational integral root r0, then r=r0 or r=p+r0 is a local root according to
r0≥0 or r0<0 if p∈Spl(f) is large, hence r/p tends to [math] or 1
and the one-dimensional equi-distribution is false.
So, we exclude such polynomials.
In 5.1, we treat the case that a polynomial f(x)
has no non-trivial linear relation among roots, and in 5.2 the case of a decomposable and
irreducible polynomial of degree 4.
In 5.3, for a more general polynomial, e.g. an irreducible polynomial of degree larger than 1,
we show that Conjectures 1, 2 imply the one-dimensional equi-distribution of roots ri/p not based on hard calculation.
Supposing f(0)=0, we see easily that for a rational number a, there are only finitely many primes
p∈Spl(f) such that a−r/p=O(ph(p)1) where r is a local root and h(x) is any function satisfying h(x)→∞(x→∞).
5.1 Case without non-trivial linear relation among roots
The aim in this subsection is to prove the following two theorems.
Theorem 5.1**.**
Let f(x) be a polynomial of degree n(>1),
which has no non-trivial linear relation among roots.
Then the conjecture (11) implies for 1≤i≤n, 0≤a<1
[TABLE]
where the binomial coefficient (BA) is supposed to vanish unless 0≤B≤A,
and M(x):=max(x,0).
When i=1, a simpler formula is given in Proposition 5.1.
Example
Denoting limX→∞#SplX(f)#{p∈SplX(f)∣ri/p<a} by D(a,i;n),
we see
[TABLE]
Using Theorem 5.1, we show the one-dimensional equi-distribution of ri/p.
Theorem 5.2**.**
Let f(x) be a polynomial of degree n(>1) which has no non-trivial linear relation among roots;
then (11) implies
[TABLE]
for a real number a∈[0,1).
In case of n=2, the equation (49) is proved by [DFI] and [T].
The rest of this subsection is devoted to their proof and
let us start from the following easy lemma.
Lemma 5.1**.**
For t,a∈R, we have
[TABLE]
Proof.
The left-hand side is equal to
[TABLE]
∎
For the sake of convenience, we recall the proof of the following [Fe].
Lemma 5.2**.**
For a natural number k, the volume Uk(x)(x∈R) of a subset of the unit cube [0,1)k defined by
{(x1,…,xk)∈[0,1)k∣x1+⋯+xk≤x} is given by
[TABLE]
Proof.
In case of k=1, U1(x)=M(x)−M(x−1) is easy, hence the lemma is true.
Suppose that the lemma is true for k≥1;
then we see that
[TABLE]
which completes the induction.
∎
Corollary 5.1**.**
Let n(≥1) be an integer.
Then we have,
for a polynomial P(x)=cnxn+⋯+c0,
we have
[TABLE]
Proof.
The case of n=1 is obvious.
The equation (51) means
[TABLE]
The equation (50) implies that
(Un(x)=)n!1∑k=0n(−1)k(kn)M(x−k)n=1 if x>n,
hence we have the identity ∑k=0n(−1)k(kn)(x−k)n=n!.
We find that the coefficient of xn−j of the identity
is ∑k=0n(−1)k(kn)(jn)(−k)j.
If, hence j<n, then we have ∑k=0n(−1)k(kn)kj=0,
i.e. (51) for a polynomial P with degP<n.
If j=n, then ∑k=0n(−1)k(kn)(−k)n=n!
which implies (51) for P(x)=xn.
∎
Corollary 5.2**.**
For natural numbers k,n with 1≤k≤n we have
[TABLE]
where A(n,k) denotes the Eulerian number in the introduction.
Proof.
The first equality follows from
[TABLE]
Putting
B(n,k):=n!(Un(k)−Un(k−1)), we have only to confirm
[TABLE]
The equation B(1,1)=1 is clear, and we see that
[TABLE]
∎
Let f(x) be a polynomial of degree n(>1) without non-trivial linear relation among roots.
Given number a∈[0,1],
putting
we have only to prove T(l,h)=(n−1)!C1(l,h).
It is obviously true if h≥l+1,
since the partial sum on q is empty.
In case of h=0,
we see that T(l,0) is equal to
[TABLE]
by Lemma 5.9.
Lastly assume that 1≤h≤l.
The sum T(l,h)+(−1)h+n(hn) is equal to
[TABLE]
which implies T(l,h)=0.
∎
The proposition gives Theorem 5.1 by (63),
and we see that (54) is the sum of C(l,h)M(l−ha)n−1 over integers l,h satisfying
[TABLE]
where
[TABLE]
using Corollary 5.1 with P(x)=x and n>1.
To prove (54) being to equal to a,
we will show
[TABLE]
Under the equations (66), (54) being a, i.e. Theorem 5.1 is proved as follows:
The expression (54) is equal to
Unless q−1≤k and n−q≤n−k, binomial coefficients vanish,
hence we may assume that q=k or q=k+1, and we see
[TABLE]
Finally, assume that h≥2; hence 1≤l≤n−1,2≤h≤n are supposed.
By (65), we have
[TABLE]
since
[TABLE]
using Corollary 5.1 to P(x)=q−x with h≥2.
Thus we have completed the proof of Theorem 5.2.
5.2 Case of degree 4 with non-trivial linear relation among roots
Even if an irreducible polynomial has non-trivial linear relations among roots, the one-dimensional equi-distribution of ri/p for a local root is likely.
The following is an example.
Theorem 5.3**.**
For an irreducible polynomial f(x) of degree 4 with non-trivial linear relation among roots,
Conjecture 2 implies the equi-distribution of ri/p(1≤i≤4,p∈Spl(f)).
Proof.
Let an irreducible polynomial f(x) of degree 4 with non-trivial linear relation among roots be
f(x)=(x2+ax)2+b(x2+ax)+c by Proposition 3.2;
then by defining numbers βi,αi,j by
[TABLE]
as Proposition 3.3, a basis of linear relations among roots is αi,1+αi,2=−a(i=1,2). Letting α1:=α1,1,α2:=α2,1,α3:=α2,2,α4:=α1,2, we have α1+α4=α2+α3=−a,
hence t=2 and m^1=(1,0,0,1,−a),m^2=(0,1,1,0,−a).
For local solutions ri for a large prime p∈Spl(f), induced linear relations in (7) are
r1+r4=r2+r3=−a+p, i.e. k1=k2=1, and SplX(f,σ)=∅ if and only if
{σ(1),σ(4)}={1,4} or {2,3}.
Thus, we see #G^=8,[Q(f):Q]=4,8.
For such σ,kj, we have SplX(f)=SplX(f,σ) with possibly finitely many exceptional
primes.
Only for such permutations, vol(D(f,σ))>0 and D(f,σ)=D(f,id) are easy,
hence we have, by (11)
[TABLE]
Hence we have only to show
[TABLE]
by putting Di:={(x1,…,x4)∣xi≤A}∩D(f,id).
By D(f,id)={(x1,…,x4)∣0≤x1≤⋯≤x4<1,x1+x4=1,x2+x3=1}
we have
[TABLE]
and projecting them on the (x1,x2)-plane, we see
In this subsection, assume Conjectures 1, 2 and that
f(x) has no rational root and αi−αj∈Q if i=j, and
the conditions Pr(f,σ)>0,vol(D(f,σ))>0
are equivalent.
Using Corollary 4.2, we have a similar expression to (54)
with the definition (53) of Di,a for
a more general polynomial f(x):
[TABLE]
We note that the dimension of the set
[TABLE]
is less than n−t,
since the condition xi=0 is independent of conditions ∑k=1nmj,kxσ(k)∈Z(∀j) by the assumption that f(x) has no rational root.
Therefore the above is equal to [math] at a=0, and to 1 at a=1 by
[TABLE]
Hence,
once we have shown that it is a linear form in a, it is equal to a on [0,1), that is the distribution of ri/p is uniform under the above conditions.
Till here, we do not use the assumption that vol(D(f,σ))>0 implies
Pr(f,σ)>0 and the difference between the sum restricted on Sn′ above and the full sum
[TABLE]
is
[TABLE]
From now on, the aim is to show that (69)
is a linear form in a,
which means that the distribution of ri/p is
uniform.
If, moreover
(67)
is also a linear form in a, then the distribution of ri/p is
uniform
without the assumption that vol(Di,a∩D(f,σ))>0 implies Pr(f,σ)>0.
(cf. 6.4.2).
Now we assume that a polynomial f(x) has no rational roots, and
put
[TABLE]
Recall that vectors m1,…,mt are a basis of LR0∩Zn,
hence Df is G-stable.
Lemma 5.10**.**
Suppose that αi−αj∈Q for any distinct i,j, moreover.
We have
[TABLE]
in particular,
[TABLE]
Proof.
The equations
[TABLE]
imply
[TABLE]
Here, we note that Df is defined by t linearly independent vectors
mj and the volume vol is (n−t)-dimensional one, hence it is not necessary to care
an additional equation xi=xj for i=j by the assumption that the vector space LR0 spanned by
mj does not contain vectors (0,…,0,1,0,…,0,−1,0,…,0).
Let us define a mapping ϕ from
[TABLE]
to the union of
[TABLE]
by ϕ((x,i))=(x,σ,k), where σ,k are defined by
[TABLE]
hence ϕ(X(i))=∪σ,k:σ(k)=iY(σ,k).
The mapping is clearly bijective,
and if (y,σ,k)∈Y(σ,k) and (y,σ′,k′)∈Y(σ′,k′) with σ(k)=σ′(k′) occur, then σ=σ′,k=k′ hold,
hence, defining pr by pr(y,σ,k)=y, we have
pr(Y(σ,k))∩pr(Y(σ′,k′))=∅ if σ(k)=σ′(k′) and either σ=σ′ or k=k′, and so
[TABLE]
∎
We note that
[TABLE]
and putting
[TABLE]
it is easy to see that the mapping ϕ from the disjoint union ⊔σD(f,σ)∘
to (0,1)n∩Df∘ defined by ϕ(x)=(xσ(1),…,xσ(n))
for x∈D(f,σ)∘ is bijective. (cf. Proposition 4.4)
To show the equi-distribution, we have only to see that each factor
vol({x∈[0,1)n∣xi≤a}∩Df) is a linear form in a.
Lemma 5.11**.**
Suppose that β1,…,βr are linearly independent over Q and
[TABLE]
Then we have
r=n−t,
[TABLE]
and
[TABLE]
Proof.
By
[TABLE]
we see
[TABLE]
hence t=dimLR0=n−r.
On the other hand, the definition of T implies
[TABLE]
hence row vectors of the matrix (tT,−1n−r) span LR0 by rank(tT,−1n−r)=dimLR0
and so
there is a matrix S∈GLn−r(Q) such that
[TABLE]
∎
Lemma 5.12**.**
Supposing the assumption on βi in Lemma 5.11,
we have
[TABLE]
For (x1,…,xr)∈[0,1)r, there are exactly ∣det(S)∣ vectors (xr+1,…,xn)∈[0,1)n−r such that (x1,…,xn)∈Df.
Proof.
We see that
[TABLE]
Since S∈GLn−r(Q) is an integral regular matrix,
the inclusion Zn−rtS−1⊃Zn−r is clear.
Hence, for (x1,…,xr)∈Rr, there is a vector (xr+1,…,xn):=(x1,…,xr)T+ktS−1∈[0,1)n−r for some integral vector k.
The number of such integral vectors is ∣det(S)∣ since S is integral.
∎
Therefore we see that, assuming that β1,…,βr is linearly independent over Q and 1≤i≤r as above
[TABLE]
which is included in the union of sets parallel to the subspace
[TABLE]
and the projection to {x∈[0,1)r∣xi≤a} is ∣det(S)∣-fold on
by the lemma above.
Hence the volume of {x∈[0,1)n∣xi≤a}∩Df as an r(=n−t)-dimensional set is proportional to a.
In general, for given i, we have only to take a subset j1,…,jr such that
βj1,…,βjr are linearly independent over Q and jk=i for some k.
Thus,
we have proved
Theorem 5.4**.**
If a polynomial f(x) has no rational root,
αi−αj∈Q holds for any distinct i,j,
and the conditions Pr(f,σ)>0 and vol(D(f,σ))>0 are equivalent,
then
Conjectures 1, 2 imply the equi-distribution of ri/p for local roots ri of the polynomial.
So, the equi-distribution of ri/p for local roots ri is likely for an irreducible polynomial f(x)
of degf>1.
Although the polynomial f(x)=(x2−2)((x−1)2−2) does not satisfy the assumption of the theorem, the equi-distribution of local roots ri/p is true (cf. 6.4.2).
Put, for an algebraic number field F containing Q(f)
[TABLE]
If a subsequence of ri/p for local roots ri of f on p∈Spl(f,F) distributes uniformly for every
irreducible polynomial f of degf>1 and every number field F, then the one-dimensional distribution
of ri/p for any reducible polynomial without rational root is true.
Let us give more remarks.
Proposition 5.2**.**
Suppose that
f(x) is not a product of linear forms and
αi−αj∈Q for any distinct i,j;
then we have
[TABLE]
Proof.
The first two equalities are nothing but (48) and (72).
The matrix whose rows are m1,…,mt is primitive,
hence there are integral vectors mt+1,…,mn such that
the matrix M with the ith row being mi is unimodular, that is M is an integral matrix with determinant 1.
Denote the i-th row of the matrix tM−1 by mi′, hence (mi′,mj)=δi,j.
We see x+m∈Df for
x∈Df and m∈Zn, hence Zn acts on Df
as a volume-preserving discontinuous group.
The set [0,1)n∩Df is a fundamental domain
( = a realization of Df/Zn).
Another is {∑i=t+1nximi′∣∀xi∈[0,1)},
since for a vector x=∑ximi′ in
[TABLE]
the condition x∈Zn holds if and only if xt+1,…,xn∈Z holds.
Hence we have vol([0,1)n∩Df)=vol({∑i=t+1nyimi′∣0≤∀yi<1})=det((m,′mj′))t<i,j≤n.
Decompose the matrix MtM as
[TABLE]
which implies detA⋅det(C−tBA−1B)=1.
Here we note that MtM is positive definite, and
A=((mi,mj))1≤i,j≤t.
Similarly, the right lower (n−t)-square matrix of tM−1t(tM−1)=(MtM)−1
is ((mi′,mj′))t+1≤i,j≤n.
By the above decomposition, we see that (MtM)−1 is
[TABLE]
hence we see that det((mi′,mj′))t+1≤i,j≤n=det(C−tBA−1B)−1=detA=det((mi,mj))1≤i,j≤t,
which completes the proof.
∎
The equation above is a little bit curious, because vol is, by definition
the (n−t)-dimensional volume and
det((mi,mj)) is the volume of the t-dimensional paralleltope spanned by m1,…,mt.
Proposition 5.3**.**
Suppose that
f(x) is not a product of linear forms,
αi−αj∈Q for any distinct i,j
and
vol(D(f,σ))=cPr(f,σ) for every σ∈Sn
;
then we have
[TABLE]
Proof.
We see easily
[TABLE]
hence we have
[TABLE]
∎
**Example **
The case that the polynomial f(x) has no non-trivial linear relation
among roots :
It is easy to see Pr(f,σ)=1 and vol(D(f,σ))=vol(D^n)=n!n by Proposition 4.6, hence c=n!n.
On the other hand, the base of LR0∩Zn is (1,…,1) and G^=Sn
is clear, hence the identity in Proposition 5.3 is checked.
The case that the irreducible polynomial f(x) is of degree 4 and has non-trivial linear relations
among roots :
Suppose that f(x), roots αi, the basis mi(i=1,2) are those in the proof of Theorem 5.3;
then, only for permutations σ satisfying {σ(1),σ(4)}={1,4} or {2,3},
Pr(f,σ)>0,vol(D(f,σ))>0 hold, and then Pr(f,σ)=1 holds and
D(f,σ) is equal to
[TABLE]
hence vol(D(f,σ))=1/4.
On the other hand, it is easy to see det((mi,mj))=4,#G^=8,
hence the identity on c is checked.
6 The Weyl criterion
The equation (13) in Conjecture 3 is equivalent to
[TABLE]
where F=χD is the characteristic function of the set D there.
Here we remark that for a prime p∈SplX(f,σ,{kj}), the point (pr1,…,prn) is not on D(f,σ,{kj}) unless m1=⋯=mt=0 by the condition
∑imj,irσ(i)=mj+kjp,
hence the domain of the definition of the function F should be paid attention to.
As the original case, we want to approximate the characteristic function by manageable functions,
more explicitly trigonometric ones to prove (73).
Let us recall the original Weyl criterion for a uniformly distributed sequence modulo 1
(see [K-N]):
The Weyl criterion states that a sequence {xn}, xn∈[0,1), n=1,2,… is uniformly distributed modulo 1 if and only if the
following equation
[TABLE]
holds for F(x)=exp(2πihx)(∀h∈Z).
Usually, the right-hand side is replaced by “[math] for h=0”,
omitting the trivial case h=0.
The proof proceeds as follows:
The sequence {xn}, xn∈[0,1), n=1,2,… is uniformly distributed modulo 1 if and only if the
equation (W) holds for the characteristic function of every interval in [0,1],
compactifing the interval [0,1) to [0,1] with the identification of endpoints 0,1.
2. 2.
Approximating a continuous function F(x)(F(0)=F(1)) on [0,1] by step functions from above and below
by the supremum norm,
one proves that the equation (W) is true for step functions if and only if it is true for
continuous functions .
3. 3.
Approximating a continuous function F(x)(F(0)=F(1)) on [0,1] by trigonometric functions
exp(2πihx)(h∈Z), one shows that (W) is true for continuous functions F(x)
if and only if (W) is true for trigonometric functions exp(2πihx)(∀h∈Z).
We want to use the Stone-Weierstrass theorem instead of the approximation by Fourier series
to apply the idea to our case.
6.1 The Stone-Weierstrass theorem
The Stone-Weierstrass theorem is the following.
Theorem 6.1**.**
Let T be a compact set and let C(T)
be the algebra of R-valued continuous functions on T.
Suppose that A is a subalgebra of C(T) such that
(i) A contains every constant function,
(ii) for distinct points x,y∈T, there is a function g∈A such that g(x)=g(y).
Then a continuous function f on T is
approximated by functions in A by the supremum norm ∣∣f∣∣:=supx∈T∣f(x)∣.
The proof in [BD] is simple.
Just to make sure, we give the following variation.
Corollary 6.1**.**
Let T be a compact set and let Eγ(γ∈Γ) be mutually disjoint
subsets of T, and let C(T)
be the algebra of R-valued continuous functions on T.
Suppose that A is a subalgebra of C(T) such that
(i) A
contains every constant function,
(ii) every function in A takes the same value on each Eγ,
and (iii) for distinct points x,y∈T,
there is a function g∈A such that g(x)=g(y)
if there is no γ∈Γ such that x,y∈Eγ.
Then a continuous function f on T such that f(x) takes the same value on each Eγ is
approximated by functions in A by the supremum norm ∣∣f∣∣:=supx∈T∣f(x)∣.
The proof is easy. We have only to apply the Stone-Weierstrass theorem to the quotient space
of T by the equivalence shrinking Eγ to one point for each γ∈Γ.
6.2 The Weyl criterion
Hereafter we suppose that the polynomial f(x) has no rational root and is not of the form
g(x)g(x−c)h(x)(g(x),h(x)∈Z[x],c∈Z), and
write
[TABLE]
In view of the Stone-Weierstrass theorem, we want to find a good system of continuous functions
to approximate the characteristic function χD at (73).
So, we want a system of manageable functions F which satisfies (73)
in the case of #Spl(f,σ,{kj})=∞,
which implies dimD=n−t by Proposition 4.5.
Let us take as manageable functions trigonometric ones, and
let us evaluate the integral of the right-hand side at (73) for them.
First, let us give another description of D.
Since we see, via
[TABLE]
[TABLE]
with w1:=(1,…,1),w2:=(0,1,…,1),…,wn:=(0,…,0,1),
the set Δ
is the convex hull with vertexes the origin O
and w1,…,wn, i.e. a simplex.
We supplement the bases m1,…,mt of linear relations among roots by
integral vectors mt+1,…,mn so that the (n,n)-matrix M=(mi,j)
with the i-th row mi is in SLn(Z)
and σ(M):=(mi,σ−1(j)),
that is its i-th row is σ(mi).
Then, writing
[TABLE]
we have
[TABLE]
and
via the transformation x↦y:=xt(σ(M)) we see that,
noting (σ(mj),x)=(σ(mj)σ(M)−1,xt(σ(M)))=yj
[TABLE]
which is the parallel translation of the
(n−t)-dimensional subspace {(0,…,0,\linebreak[3]yt+1,…,yn)∣yi∈R} by the vector (k1,…,kt,0,…,0).
The dimension of the set D is at most n−t, which is the dimension of the
supporting space S.
Since the set Δ is the convex hull of points O
and w1,…,wn,
we see that D(=D(f,σ,{kj})) is also a convex hull.
It is clear that vertexes of D are in Qn and
the congruence x≡x′modZn
for x=x′ of D(⊂Δ⊂[0,1]n) implies
that x,x′ are vertexes of Δ.
The vertex wl is in
D if and only if ∑i=lnmj,σ−1(i)=kj(1≤∀j≤t) holds.
Denote the i-th row of the matrix t(σ(M))−1 by mi′,
that is (σ(mj),mi′)=σ(mj)tmi′=δi,j,
and put
[TABLE]
Lemma 6.1**.**
Write r:=(r1,…,rn) for local roots ri for p∈Spl(f,σ,{kj});
then we have
[TABLE]
and
[TABLE]
holds except a finite number of primes under the assumption at the beginning of this subsection
on the polynomial f.
Proof.
The first and second identities are obvious, and the third follows from
(σ(mj),r/p)=kj+mj/p(j=1,…,t) by definition.
To see the last inclusion, we have only to show that
the number of primes p satisfying (r−c)/p∈Δ
is finite.
If (r−c)/p∈Δ happens for infinitely many primes, then one of conditions
0≤r1<c1, 0≤ri+1−ri<ci+1−ci or 0<p−rn<−cn occurs for infinitely many primes,
hence one of r1=c, ri+1−ri=c or rn−p=c for some constant c
occurs for infinitely many primes.
This means f(c)≡0modp, f(ri)≡f(ri+c)modp, f(c)≡0modp, respectively.
The first or the third condition implies easily that the polynomial f(x) has a rational root c.
The second implies that the polynomial f is of the form g(x)g(x−c)h(x).
Because, if the identity ri+1−ri=c holds for infinitely many primes, then f(ri+c)≡f(ri)≡0modp holds for infinitely many primes, which implies (f(x),f(x+c))=1
(resp. (f(x),f′(x))=1) for c=0 (resp. c=0),
Hence, in the case of c=0, there is a decomposition f(x)=g(x)h(x),f(x+c)=g(x)k(x)
for an irreducible polynomial g(x),
i.e. f(x) is divisible by g(x)g(x−c). If c=0, then f(x) is of the form g(x)2h(x).
∎
Let D be a subset of Rn satisfying conditions
[TABLE]
Take a point x in D∘∩Δ∘∩S and
suppose that a subsequence r/p∈D(p∈Spl(f,σ,{kj})) converges to x.
If p is sufficiently large, then the point (r−c)/p(∈S) is
close to x, hence is in
D∘∩Δ∘∩S(⊂D∩D)
if p>nx for some number nx depending on x.
Neglecting the boundary, suppose the following equality
[TABLE]
which implies
[TABLE]
Now, under the assumption (74) the equation (13) in Conjecture 3 is equivalent to
[TABLE]
and the equation for the Weyl criterion is
[TABLE]
for a continuous function F on D.
Last, let us discuss the estimate (74), i.e.
whether the conjecture
[TABLE]
is true or not.
May we expect the stronger estimate O(1) than the o-estimate in the above?
Let us show this in the special case.
Proposition 6.1**.**
Let the set D be of the form D={x∣∑j=1ndi,jxj≤di(i=1,…,l)}
with all di,j,di being rational.
If ∑j=1ndi,σ(j)αj∈Q
holds for 1≤∀i≤l and any permutation σ,
then the equation (74) is true for the set D.
Proof.
Let d be a positive integer such that all ddi,j,ddi are integers.
Let us show the contradiction under the supposition that there are infinitely many primes p∈Spl(f) such that r/p∈D and (r−c)/p∈D; then we have ∑jdi,jrj≤pdi for all i and ∑jdk,j(rj−cj)>pdk for some k, hence
∑jddk,jcj<∑jddk,jrj−pddk≤0,
where ∑jddk,jcj is a constant independent of p and ∑jddk,jrj−pddk is an integer.
Therefore there are infinitely many primes p∈Spl(f) such that ∑jddk,jrj−pddk=κ for some integer κ
satisfying ∑jddk,jcj<κ≤0.
Taking a prime ideal p of Q(f) over p, we see that
there are infinitely many prime ideals p and a permutation σ
such that ∑jddk,jσ(αj)≡κmodp, which implies
∑jddk,jσ(αj)=κ, i.e. ∑jddk,σ−1(j)αj=κ, which implies the contradiction (dk,σ−1(1),…,dk,σ−1(n))∈LR0.
The case of r/p∈D and (r−c)/p∈D is similarly proved.
∎
Corollary 6.2**.**
Suppose that the polynomial f(x) has no rational root.
Then (74) is true for the set of the form D={x∣ai≤xi≤bi(∀i)}
with all ai,bi being rational.
Proof.
Vectors (di,1,…,di,n) in Proposition 6.1 are (0,…,0,±1,0,…,0). Such a vector is in LR0 if and only if f(x) has a rational root.
∎
How about the case of di,j being irrational or more general boundaries?
6.3 Calculation of the integral
Let us recall
[TABLE]
and let us consider trigonometric functions on S as the function F at (75).
For y=xt(σ(M)) and a=(0,…,0,at+1,…,an), we have
[TABLE]
hence the trigonometric function
[TABLE]
is basic on
S, and
parameterizing St(σ(M)) by yt+1,…,yn
[TABLE]
where the projection pr means
[TABLE]
Thus, we must ask whether the following is true or not :
[TABLE]
Here we assume #Spl(f,σ,{kj})=∞, of course.
We note that the condition pr(xt(σ(M)))≡pr(yt(σ(M)))modZn−t for distinct points x,y∈D=Δ∩S
implies x−y∈Zn and x,y∈Δ, i.e. x,y are vertexes of Δ.
By T(x,a)=e(∑i=t+1naiyi), functions T(x,a)(at+1,…,an∈Z) separate two distinct points in D except vertexes,
hence under the assumption (74), the equation (77) holds for all integers at+1,…,an\linebreak[3]∈Z if and only if (73)
holds for every continuous function whose values are the same at non-separated vertexes.
A question is: Whether are all integral vectors (0,…,0,at+1,…,an)
really necessary to separate two distinct points in D except vertexes or not?
Let us see that if D is an (n−t)-dimensional simplex,
that is the convex hull of n−t+1 vertexes v1,…,vn−t+1 such that
v1−vn−t+1,…,vn−t−vn−t+1 are linearly independent,
then vectors a=(0,…,0,at+1,…,an)
satisfying (a,vi)∈Z(i=1,…,n−t+1) are enough (cf. the remark at the end of this subsection).
For the convex hull D(⊂Rn) of points
v1,…,vm, i.e.
[TABLE]
it is clear
[TABLE]
A point pr(vi) is not necessarily a vertex of pr(D)
even if vi is a vertex of D.
To evaluate the integral (77), we divide pr(Dt(σ(M))) to the union of simplexes and then apply Lemma 6.2
and Proposition 6.2 below.
How can one divide and how can one write down the sum of integrals easily to see?
Let
[TABLE]
be an m-dimensional simplex,
where m+1 vectors v1,…,vm+1 are in Rm and m vectors
v1−vm+1,…,vm−vm+1 are linearly independent.
Then, putting
[TABLE]
and V=\left(\begin{array}[]{c}\bm{v}_{1}-\bm{v}_{m+1}\\
\vdots\\
\bm{v}_{m}-\bm{v}_{m+1}\end{array}\right),
we have
[TABLE]
because
putting (y1,…,ym)=(x1,…,xm)V+vm+1, we see that the integral is
equal to
[TABLE]
and
[TABLE]
Here, we write a:=(a1,…,am)
and the second equality holds under the assumption that
all (vi−vm+1,a)(i=1,…,m+1) are mutually distinct (cf. Lemma 6.2 below).
It is clear that
[TABLE]
Lemma 6.2**.**
Let m be a positive integer.
For real numbers A1,…,Am with ∏i=j(Ai(Ai−Aj))=0, we have
[TABLE]
which is equal, letting Ai=αi−αm+1 to
[TABLE]
and the integral vanishes if all Ai are integers.
Moreover, we have
[TABLE]
i.e.
[TABLE]
and for a polynomial g(x)=cm−1xm−1+cm−2xm−2+…
[TABLE]
Proof.
Denote the integral by S(A1,…,Am).
We use the induction on m.
It is easy to see that S(A1)=2πiA1e(A1)−1
and S(A1,…,Am) is equal to
[TABLE]
The assumption of the induction completes easily the proof of the first equality.
W.r.t. the transform to αi, we have only to use the Vandermonde determinant:
[TABLE]
For the second identities, replace Ai by ϵAi;
then we have
[TABLE]
which implies the second identities.
∎
Proposition 6.2**.**
Let α1,…αm+1∈R and let a1,…,au be their distinct numbers,
i.e. {αi∣1≤i≤m+1}={ai∣1≤i≤u}
and CJ:={j∣αj=aJ(1≤j≤m+1)}.
Then we have
[TABLE]
where the indexes l,d run over {1,…,m+1}∖CJ.
Proof.
Let δi be mutually distinct numbers and put βi:=αi+ϵδi;
then we see that βi−βj=αi−αj+(δi−δj)ϵ is not [math]
if i=j and the non-zero number ϵ is sufficiently close to [math].
By Lemma 6.2, we have
[TABLE]
where
[TABLE]
and
[TABLE]
Hereafter the notations ∑˙k,l,∏˙k,l mean the sum, the product on k,l under the condition 1≤k<l≤m+1.
First, we see that
[TABLE]
where κ:=#{(k,l)∣1≤k<l≤m+1,αk=αl} and
O(ϵκ+1) means a power series whose coefficient of ϵq is
[math] if q<κ+1.
Next, we see that
[TABLE]
where κj:=#{(k,l)∣1≤k<l≤m+1,k,l=j,αk=αl}.
Here we note that κj depends only on CJ containing j by the equation
κ−κj=#{(k,l)∣1≤k<l≤m+1,αk=αl,k or l=j}=#CJ−1.
By
[TABLE]
we have
[TABLE]
Here, by the equality
[TABLE]
the product k,l=j,αk=αl∏˙(1+αk−αlδk−δlϵ) is equal to
[TABLE]
hence
[TABLE]
The partial sum on j∈CJ is
[TABLE]
applying (78) to the sum on j∈CJ with δj−δm+1 for Ai there,
which is equal to
[TABLE]
Thus we have
[TABLE]
which completes the proof.
∎
Let us give a remark.
Suppose that vertexes v1,…,vm+1 are in Qm such that
v1−vm+1,…,vm−vm+1 are linearly independent.
Denote by V the regular matrix whose ith row is vi−vm+1 as before,
and put
[TABLE]
For vectors a∈A0, the condition ∏i=jAi(Ai−Aj)=0 just before Lemma 6.2 is satisfied.
Let the vector aj be the jth row of the matrix tV−1, i.e. (vi−vm+1,aj)=δi,j, hence aj∈A is
clear.
Since the module A is spanned by vectors aj,
the module U is the the dual of A,
hence we see the equivalence
[TABLE]
Let us see that the module A is spanned by A0.
Take a vector a and write b:=a+∑l=1mklal(ki∈Z).
The conditions (b,vi−vj)=0 and (∑l=1mklal,vi−vj)=0 are equivalent to
(a,vi−vj)+∑kl(δi,l−δj,l)=0 and
∑kl(δi,l−δj,l)=0, that is (a,vi−vj)+ki−kj=0 and ki−kj=0.
The existence of such integers kl is easily proved by the induction on m.
Therefore the equation a=b−∑l=1mklal implies that
A is spanned by A0
Assume that x,y∈D satisfies e((x,a))=e((y,a)), i.e, (x−y,a)∈Z for all a∈A0, hence for all
a∈A as above;
then we have x−y∈U.
Writing x=∑i=1mxi(vi−vm+1)+vm+1,y=∑i=1myi(vi−vm+1)+vm+1(0≤∀xi,∀yi,∑j=1mxj,∑j=1myj≤1),
we have x−y=∑i=1m(xi−yi)(vi−vm+1)∈U.
Suppose xj−yj=1 for some j; then we have xj=1, i.e. x=vj and
x−y=(1−yj)(vj−vm+1)+∑i=j(−yi)(vi−vm+1)∈U,
and so ∀yi=0,1, hence y=vk for some k.
Thus we see that x,y are vertexes or x=y if x,y∈D satisfies e((x,a))=e((y,a)) for all a∈A0.
In other words, the functions e((x,a))(a∈A0) can separate distinct points in D except vertexes.
6.4 Example
First, we note that
for an integer k(1≤k≤n−1), vertexes of
[TABLE]
are following k(n−k)+1 vectors:
[TABLE]
with non-negative integers p,q,r satisfying p+q+r=n and
[TABLE]
Because, if x∈Δk satisfies three strict inequalities xi<xi+1=⋯=xi+a<xi+a+1=⋯=xi+a+b<xi+a+b+1, then for any η sufficiently close to [math],
the vector x(η), replacing xi+1=⋯=xi+a,xi+a+1=⋯=xi+a+b by xi+a+η/a,xi+a+1−η/b, respectively is still in
Δk,
that is a short segment containing x is in Δk.
For 1≤k≤n−1, the point P(0,n,0)=(nk,…,nk) is the
vertex, but points P(n,0,0),P(0,0,n) are not vertexes by virtue of
∑xi=0,n, respectively. The case q=1 does not occur, and for 2≤q≤n, r=min(k−1,n−q),p=n−q−r gives a vertex.
Example
Vertexes of Δ1 are
(n−q0,…,0,qq1,…,q1)(1≤q≤n).
Vertexes of Δn−1 are (0,1,…,1) and
(qqq−1,…,qq−1,n−q1,…,1)(2≤q≤n).
In general, a point x∈D(f,σ,{kj}) is not a vertex, that is there is a
non-zero
vector v=(v1,…,vn)
such that x+ηv∈D(f,σ,{kj}) holds
for any η in a short open interval containing [math]
if and only if
there is a non-zero vector v satisfying that
•
∑imj,σ−1(i)vi=0 for ∀j=1,…,t, and
•
vi=0,vi=vi+1,vi=0 hold according to xi=0,xi=xi+1,xi=1, respectively.
(1)
Let a polynomial f(x) have no non-trivial linear relation;
then we can take vectors
m1,…,mn in the previous subsection as
[TABLE]
which are rows of the unimodular matrix M as before.
By D=D(f,σ,k)=Δk,
pr(DtM)(⊂Rn−1) is the convex hull of vectors
whose i-th entry (i=1,…,n−1) is the (i+1)-th one of P(p,q,r).
•
In the case of k=1 : Vertexes of pr(DtM)(⊂Rn−1) are
[TABLE]
where the number n−i+11 begins from (i−1)-th entry,
and the (n−1,n−1)-matrix V with the ith row vi−vn(i=1,…,n−1) is
[TABLE]
and
[TABLE]
hence the dual module A of the module spanned by rows of vi−vn
is spanned by rows of tV−1, i.e.
[TABLE]
The index [Zn−1:A] is equal to n! by det(V−1)=(−1)n−1n!.
In this case, pr(DtM) is a simplex.
•
In the case of k=n−1 : Vertexes of pr(DtM)(⊂Rn−1) are
v1:=(1,…,1),vq:=(q−1qq−1,…,qq−1,n−q1,…,1)(q=2,…,n), hence the inclusion
[TABLE]
is clear.
•
In the case of (n,k)=(4,2) : Vertexes of pr(DtM)
are
[TABLE]
and
writing Ci:=vi+1−v1(i=1,2,3,4), i.e.
[TABLE]
we see that the linear relation C3+C4=34C1+32C2
and {C1,C2,C3} and {C1,C2,C4} are linearly independent, respectively.
By the equation
[TABLE]
the domain pr(DtM) is a union of two 3-dimensional simplexes as
[TABLE]
Let V_{1}=\left(\begin{array}[]{c}C_{1}\\
C_{2}\\
C_{3}\end{array}\right),V_{2}=\left(\begin{array}[]{c}C_{1}\\
C_{2}\\
C_{4}\end{array}\right);
then we see
[TABLE]
Hence the dual module A of the module spanned by the rows of Vi is spanned by columns of
Vi−1, hence A⊂Z3.
It is easy to see that ∣V1∣=12−1,∣V2∣=121,
hence their absolute values are equal.
Thus we see that
[TABLE]
where ui:=(vi,(a1,a2,a3)), ei:=e(ui) and all ui are supposed to be distinct.
There are relations u4=34u2−32u3, u5=34u3 by v4=34v2−32v3, v5=34v3,
and Z[v1,…,v5]=Z[v1,3v2−2v4−v5,v3−v5] with 3v2−2v4−v5=31v2,v3−v5=3−1v3.
We get the same division to the union of the simplexes for the base vertex v2
instead of v1,
but for other vertex vi with i=1,2 one of the corresponding dual modules is not integral,
for example
pr(DtM) is a union of two simplexes as
[TABLE]
where simplexes correspond to x2≥2x3, x2≤2x3 in order,
and for U_{1}:=\left(\begin{array}[]{c}\bm{v}_{1}-\bm{v}_{5}\\
\bm{v}_{4}-\bm{v}_{5}\\
\bm{v}_{2}-\bm{v}_{5}\end{array}\right),U_{2}:=\left(\begin{array}[]{c}\bm{v}_{1}-\bm{v}_{5}\\
\bm{v}_{4}-\bm{v}_{5}\\
\bm{v}_{3}-\bm{v}_{5}\end{array}\right)
we see
[TABLE]
The determinants of U1,U2 are 181,9−1, respectively,
hence their absolute values are distinct.
•
In the case of 1≤k≤n−1 :
Vertexes of Δk are P(p,q,r) defined above :
If r=k, then
[TABLE]
If 0≤r≤k−1,(k−r)+1≤q≤(k−r)+(n−k)=n−r, then
[TABLE]
Therefore we see :
If r=k, then
[TABLE]
If 0≤r≤k−1,q=n−r, then
[TABLE]
If 0≤r≤k−1,(k−r)+1≤q<n−r, then
[TABLE]
What is the concrete division of pr(DtM) to simplexes and
what is the integral of e(∑i=1n−1aiyi) on it ?
(2) Next, let us consider the case of the polynomial f(x) of degree 4 which has a non-trivial linear relation
among roots. By Proposition 3.3, we may assume that their basis are α1+α4,α2+α3∈Z, hence
[TABLE]
and m1=(1,0,0,1),m2=(0,1,1,0),m3=(0,0,1,0),m4=(0,0,0,1).
Hence we see
[TABLE]
for which vertexes of the simplex pr(DtM)
are (21,21),(21,1),(1,1),
and for V=\left(\begin{array}[]{cc}\frac{-1}{2}&\frac{-1}{2}\\
\frac{-1}{2}&0\end{array}\right),
V^{-1}=\left(\begin{array}[]{cc}0&-2\\
-2&2\end{array}\right) is integral.
7 Numerical data
In this section, the integer Xm=Xm(f) denotes the smallest prime number p∈Spl(f) with p>10m.
7.1 Case without non-trivial linear relation among roots
Let f(x) be a polynomial of degree n without non-trivial linear relation among roots.
First we check (14), i.e. (11) for a special domain Di={(x1,…,xn)∈[0,1)n∣xi≤a}
at a=k/(10n).
“diff” in the table means the maximum of the absolute value of the difference between 1
and the left-hand side divided by the right-hand side in (14) at
a=k/(10n)(k=1,…,10n), i=1,…,n and X=Xm for m=5,…,11.
“Diff” means the maximum of the absolute value of the difference
[TABLE]
for {Ri}∈R(f,σ,k,L).
(1) f(x)=x2+1
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
(2) f(x)=x3+2
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hereafter, we give cases (1≤k≤degf−1,2≤L≤8) when Diff>0.1 at m=9.
Comparing with #R(f,σ,k,L)(≥Ln−1), m=9 seems to be small.
(3) f(x)=x4+x3+x2+x+1
[TABLE]
[TABLE]
[TABLE]
[TABLE]
(4) f(x)=x5+2
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
For the following, m=9 is too small to get Diff<0.1.
(5) f(x)=x6+x5+x4+x3+x2+x+1
[TABLE]
(6) f(x)=x7+2
[TABLE]
7.2 Case of degree 6 with non-trivial linear relation among roots
Let f(x)=x6+14x4+49x2+7, which is the fourth polynomial in Example 3.1.
Then taking roots there, we see that t=4 and the basis of linear relations
[TABLE]
Let us determine permutations σ satisfying dimD(f,σ)=2.
To do it, suppose that 0<y1<⋯<y6<1,y1+y6=y2+y5=y3+y4=1 and
the corresponding equation to m4^
[TABLE]
Then possible combinations above are y1+y2+y3=1 or y1+y2+y4=1.
Identifying a permutation σ∈S6 with the image [σ(1),…,σ(6)],
the set of representatives of cosets of σ with dimD(f,σ)=2
by the group G^ is σ1=[1,2,4,6,5,3],σ2=[1,2,3,6,5,4],
supposing that σ(1)=1,σ(4)=6,σ(2)=2,σ(5)=5,{σ(3),σ(6)}={3,4}
by {{σ(1),σ(4)}, {σ(2),σ(5)}, {σ(3),σ(6)}}={{1,6},
{2,5}, \{3,4\}$$\}.
[TABLE]
Since the length of ui,vi(i=1,2) is 2 and the angle of u1,u2
(resp. v1,v2) is π/3 and
the volumes of their projection to (x1,x2)-space are 1/16,1/48,
we see vol(D(f,σ1))=3vol(D(f,σ2)).
Therefore Conjecture 1 is numerically confirmed as follows :
In the following,
“diff1” (resp. “diff2”) means the difference #SplXm(f,σ1)/#SplXm(f)−3/4
(resp. #SplXm(f,σ2)/#SplXm(f)−1/4).
[TABLE]
Let us check Conjecture 4.
We assume that σ=σ1 or σ2 above and k1=⋯=k4=1
because of #Spl∞(f,σ,{kj})<∞ otherwise.
Denoting #R(f,σ,{kj},L) by R, and by “er” the maximum
of
[TABLE]
with {Ri}∈R(f,σ,{kj},L),
we see
σ=σ1,L=2,(R=4)
[TABLE]
σ=σ1,L=3,(R=144)
[TABLE]
σ=σ1,L=4,(R=256)
[TABLE]
σ=σ1,L=5,(R=6400)
[TABLE]
σ=σ1,L=6,(R=576)
[TABLE]
σ=σ1,L=7,(R=63504)
[TABLE]
σ=σ2,L=2,(R=4)
[TABLE]
σ=σ2,L=3,(R=144)
[TABLE]
σ=σ2,L=4,(R=256)
[TABLE]
σ=σ2,L=5,(R=6400)
[TABLE]
σ=σ2,L=6,(R=576)
[TABLE]
σ=σ2,L=7,(R=63504)
[TABLE]
7.3 Case of degree 4 with non-trivial linear relation among roots
Let us consider the polynomial f(x)=x4+1 in this subsection.
First we check (11) numerically for Di={(x1,…,x4)∣xi≤A}.
To do it, as in the subsection 4.2 we have only to check
[TABLE]
and the right-hand side is given by 8vol(pr(Di∩D(f,id)) as in that subsection.
“diff” in the table means the maximum of the absolute value of the difference between 1
and the left-hand side divided by the right-hand side at
A=k/40(k=1,…,40), i=1,…,4 and X=Xm for m=5,…,11.
[TABLE]
Next, let us check Conjecture 4.
As in the subsection 4.2 again, we have only to consider the case of {σ(1),σ(4)}={1,4}
or {2,3} and k1=k2=1.
Then
[TABLE]
Therefore, we see
[TABLE]
The following are tables of the maximum of
[TABLE]
at {Ri}∈R(f,σ,{kj},L) for m=5,…,10 and L=2,…,10.
L=2
[TABLE]
L=3
[TABLE]
L=4
[TABLE]
L=5
[TABLE]
L=6
[TABLE]
L=7
[TABLE]
L=8
[TABLE]
L=9
[TABLE]
L=10
[TABLE]
7.4 Reducible polynomial
7.4.1
Let us consider the polynomial f(x)=(x2+x+1)(x2+2x+2) with roots αi such that
αi2+αi+1=0 for i=2,3 and αi2+2αi+2=0 for i=1,4.
The field Q(f) is Q(−3,−1).
Vectors m^i be
[TABLE]
Then we see that
[TABLE]
and
[TABLE]
hence dimD(f,σ)=2(=n−t) if and only if σ∈G.
For X=108, we find
[TABLE]
Three conditions σ∈G, Pr(f,σ)>0 and vol(D(f,σ))>0 are equivalent.
For the one-dimensional uniformity, we see that, with X=108
[TABLE]
With respect to Conjecture 2, let D be {(x1,x2,x3,x4)∣x1<1/3}.
The absolute value of the difference between
[TABLE]
for X=108 and σ∈G
is 0.0003.
With respect to Conjecture 4, we see k1=k2=1 and G/G^={[1,2,3,4],[2,1,4,3]}.
In the following table, the maximum of errors
[TABLE]
over {Ri}∈R(f,σ,{kj},L)
is given for σ∈G/G^, and #R is
#R(f,σ,{kj},L),
which is independent of σ.
[TABLE]
7.4.2
Let us consider the polynomial f(x)=(x2−2)((x−1)2−2) with roots α1=2,α2=1+2,α3=−2,α4=1−2.
Then the matrix (mj,i) and mi(t=3) are
[TABLE]
and G={[1,2,3,4],[1,2,4,3],[2,1,3,4],[2,1,4,3],[3,4,1,2],[3,4,2,1],[4,3,1,2],
[4,3,2,1]}
and G^={[1,2,3,4],[3,4,1,2]},
where a permutation σ is identified with the vector [σ(1),…,σ(4)] of images.
Then we see that
[TABLE]
so two conditions dimD(f,σ)=1(=n−t) and σ∈G are equivalent.
We find
[TABLE]
since p∈Spl(f,σ) means rσ(1)+rσ(4)=p+1,rσ(1)−rσ(2)=−1,rσ(1)+rσ(3)=p for a sufficiently large p, which implies σ∈G^.
This is an example such that Pr(f,σ)=0 but vol(D(f,σ))>0 for σ∈G∖G^
by #G=8,#G^=2, and this supports Conjecture 1.
We see easily that for σ∈G
[TABLE]
For the one-dimensional uniformity, we see that, with X=108
[TABLE]
The one-dimensional uniformity follows surely from [DFI], since f(x) is a product of
quadratic polynomials which define the same quadratic field Q(2).
With respect to Conjecture 2, let D be {(x1,x2,x3,x4)∣x1<1/3}.
The absolute value of the difference between
[TABLE]
for X=108 and σ=id
is 0.00032.
To check Conjecture 4, we see that k1=1,k2=0,k3=1, σ∈G^ hold if Pr(f,σ,{kj},L,{Ri})>0, and for them the maximum er of errors
[TABLE]
over {Ri}∈R(f,σ,{kj},L)
is as follows :
[TABLE]
7.4.3
Let us consider the polynomial f(x)=(x2+1)(x2−2)(x4−2x2+9), whose roots are
±2,±−1,±2±−1 and we number them as
α1=−1, α2=2−−1, α3=2,
α4=−2−−1, α5=2+−1,
α6=−2, α7=−2+−1, α8=−−1.
The rows of the following matrix M gives mj(j=1,…,6) with m1=⋯=m6=0, i.e.
M⋅t(α1,α2,α3,α4,α5,α6,α7,α8)=0(t=6):
where a permutation σ is identified with the vector [σ(1),…,σ(8)]
of its images.
The set of σ satisfying (6) for some p less than 108 consists of σiG
for
[TABLE]
The corresponding domain D(f,σi)={x=C+x1v1+x2v2∣S}
are given by the following:
Vectors C,vi are
[TABLE]
and for i=7,
[TABLE]
The inequalities S on x1,x2 are
[TABLE]
The volumes [vol(D(f,σ1)),…,vol(D(f,σ7))]
are [1/4,3/40,1/20,3/40,1/8,\linebreak1/20,1/8] with 1/4+⋯+1/8=3/4.
Let us give a brief proof on σ1.
Since (v1,v1)=12,(v1,v2)=6,(v2,v2)=6,
we define the orthonormal vectors ui by v1=23u1,v2=3(u1+u2).
Writing x1v1+x2v2=y1u1+y2u2, we see y1=23x1+3,y2=3x2 with Jacobian 6.
The volume of the set of (x1,x2) defined by
the condition S, i.e. 0≤x1≤x2≤1,4x1+2x2≤1 is 1/24, hence vol(D(f,σ1))=6⋅1/24=1/4.
For X=108, the following is a table of #SplX(f,σi)/#SplX(f) on the first line and
vol(D(f,σi))/∑ivol(D(f,σi)) on the second
in the order of i=1,…,7, respectively
[TABLE]
Exact values on the second line are
[1/3,1/10,1/15,1/10,1/6,1/15,1/6] which are equal to (3/4)−1[1/4,3/40,1/20,3/40,1/8,1/20,1/8].
This supports Conjecture 1.
For p≤108, integers kj in (7) are k1=⋯=k4=1,k5=k6=0 for all σi,
and for such integers kj, D:={(x1,…,x8)∣∣∑imj,ixσ(i)−kj∣<ϵ(1≤∀j≤6)}(ϵ>0) contains D(f,σ) for σ=σ1,…,σ7, hence Conjectures 2 is true for such domains.
For the one-dimensional uniformity, we see that, with X=108
[TABLE]
For L=2 and {kj} above, R(f,σi,{kj},2) with #R(f,σi,{kj},2)=4(i=1,…,7) is in order
[TABLE]
where {Ri} is written as [R1,…,R8].
For X=108, #SplX(f,σi,{kj},2,{Ri})/#SplX(f,σi,{kj}) is,
corresponding to the above table
[TABLE]
The top left value 0.25030 corresponds to i=1 and {Ri}=[R1,…,R8]=[0,0,0,0,1,1,1,1],
and so on.
All values are almost 1/4=0.25 and this matches Conjecture 4.
8 M(f,μ) and the decimal part {pg(r)} again
Let us give observations on M(f,μ) defined in the subsection 4.1 and
problems derived from them.
Let us recall definitions and properties
[TABLE]
where A≒B means that sets A∖B,B∖A
are finite.
We note that in case of Gal(Q(f)/Q)≅Sn,
G^=G0=Sn follows , hence the set M(f,μ) is equal to Spl(f).
∙
Let us give an example of M(f,μ)(=Spl(f)).
Let f(x)=x3−3x+1 which is abelian, and let roots be α1=α,α2=−α2−α+2,α3=α2−2. Then we see that
G^=S3 and G0={[1,2,3],[3,1,2],[2,3,1]} where a permutation
σ is identified with [σ(1),σ(2),σ(3)].
Thus we see that Spl(f)=Spl(f,σ)=∪M(f,σ)=M(f,id)∪M(f,(2,3)) for
the transposition (2,3)∈G0.
Since for a prime p∈M(f,id), we have r2≡α2=−α2−α+2≡−r12−r1+2modp,
primes p∈Spl(f) are separated as follows:
For μ=id., M(f,μ)={p∈Spl(f)∣r2≡−r12−r1+2modp}={37,73,89,181,233,251,269,397,449,467,521,541,557,593,613,631,683,809,\linebreak811,919,…}.
For μ=(2,3), M(f,μ)={p∈Spl(f)∣r2≡r12−2modp}={17,19,53,71,\linebreak107,109,127,163,179,197,199,271,307,359,379,431,433,487,503,523,577,\linebreak647,701,719,739,757,773,827,829,863,881,883,…}.
Their densities in Spl(f) seem to be 1/2=1/[G^:G0].
The density of M(f,μ)
in Spl(f,μ) is conjectured to be #G^[Q(f):Q] for every permutation μ satisfying #M(f,μ)=∞ just before Corollary 4.2.
∙ We introduce the equivalence relation ∼ among polynomials as follows :
For monic integral polynomials f(x),g(x) of degree n,
f(x)∼g(x) if and only if g(x)=δnf(δx+m)
with δ=±1 and m∈Z holds.
Denote the roots of f(x) by αi(i=1,…,n) and assume that
any root αi is not a rational integer.
Then βi:=δ(αi−m) are roots of g(x), and for local roots ri of f(x) at
p∈Spl(f)=Spl(g)ri′:=δ(ri−m) are roots of g(x)≡0modp,
and 0<r1−m≤⋯≤rn−m<p if p is sufficiently large.
Hence writing Ri:=ri′ in the case of δ=1, otherwise Ri:=rn−i+1′,
we see that Ri(i=1,…,n) are local roots of
g(x) if p is sufficiently large.
Then we see that neglecting small primes
[TABLE]
where μ′(i):=n+1−μ(i).
Thus the set of M(f,μ)(μ∈Sn) depends on the equivalence class of polynomials.
In case of f(x)=x3−3x+1,x4+2x3+3x2−3x+1,x4+3x2−2x+2,x4−x3+2x2+x+1,x4+x3+x2+x+1,(x2)2+x2−1,(x2)2+1,x4+4x3+2x2−4x−1=(x2+2x)2−2(x2+2x)−1 which exhaust all types (with respect to Gal(Q(f)/Q) and the existence of
non-trivial linear relations among roots) of
polynomials of degree 3,4 with [G^:G0]>1,
it is likely that sets M(f,μ)(μ∈Sn) with #M(f,μ)=∞ characterize the above
equivalence class among polynomials g(x) under assumptions that Q(g)=Q(f),
degg=degf and f,g have the same linear relations among roots.
When does the set of M(f,μ)(μ∈Sn) characterize the equivalence class of polynomials above ?
∙ About the computer experiment on the question before Lemma 4.1 :
In this paragraph, set f(x)=x4+1 whose
roots are α1=21+−1,α2=21−−1=−α13,α3=−21−−1=α13,α4=−21+−1=−α1,
where linear relations among roots over rationals are spanned by α1+α4=α2+α3=0.
It is easy to see that #G^=8,#G0=4 and the transposition (3,4) is in G^∖G0,
and D(f,σ)={(x1,…,x4)∣0≤x1≤⋯≤x4≤1,x1+x4=x2+x3=1}
except finite points for σ∈G^,
which is identified to {(x1,x2)∣0≤x1≤x2≤21} and {(x3,x4)∣21≤x3≤x4≤1} by projections (x1,…,x4)↦(x1,x2),(x3,x4), respectively.
For at most quadratic polynomials g1(x),g2(x)∈Z[x], let us consider
[TABLE]
where ri’s are local roots of the polynomial f(x) for the prime p
and {a} denotes the decimal part of a, and write M(X):=(M1(X),…,M4(X))
and #M(X):=(#M1(X),…,#M4(X)) simply.
For non-zero integers m,n, the set Im,n of x∈(0,1) satisfying {mx}<{nx} is a union of intervals.
Hence, for linear polynomials g1(x)=mx,g2(x)=nx we see
[TABLE]
and the density limX→∞#SplX(f)#Mi(X) is described by the domain of
{x∈(0,1)4∣xi∈Im,n} by Conjecture.
For example, for polynomials g1(x)=nx,g2(x)=2nx(n=0,n∈Z), the computer experiment suggests
[TABLE]
which is equal to
[TABLE]
where
[TABLE]
and the denominator 81 is the volume of the whole spaces {(x1,x2)∣0≤x1≤x2≤21}, {(x3,x4)∣21≤x3≤x4≤1},
which are identified with {(x1,…,x4)∣0≤x1≤⋯≤x4≤1,x1+x4=x2+x3=1} as above.
These match the experiment above quite well and Conjecture 2.
Other cases, i.e. cases of deg(g1(x)) or deg(g2(x))=2 are under the assumption that deg(g1(x))≤2,deg(g2(x))≤2,g1(0)\linebreak[3]=g2(0)=0,
(i) deg(g1(x))=2 and g2(x)=nx(n=0),
(ii) deg(g1(x))=deg(g2(x))=2 and g1(x)−g2(x)=nx,(n=0), or
(iii) deg(g1(x))=deg(g2(x))\linebreak[3]=deg(g1(x)−g2(x))=2,
and in case of (i),(ii) the density looks like
[TABLE]
and in case of (iii) it looks like (21,21,21,21).
The author does not know how to elucidate this, in particular even the reason of
[TABLE]
How about the case of polynomials of degree 3 ?
Since we have r3≡r13modp for p∈M(f,id) as in Example 2 below,
the inequality {pg1(r1)}<{pg2(r1)} is equivalent to
{pr3}<{pr12} for g1(x)=x3,g2(x)=x2, for example.
The density of such primes in M(f,id.) looks like 31.
It may be appropriate to start by Spl(f,σ) or M(f,σ) instead of Spl(f) for a general polynomial.
∙ (cf. Problem on p.4.1)
Let us consider the density of primes p∈Spl(f) satisfying
[TABLE]
In case of degg1=degg2=1, it seems to be independent of the polynomial f(x) with t=1 (cf. Subsection 8.1).
But for polynomials g1(x)=x2,g2(x)=−2x (resp. g1(x)=x2,g2(x)=2x),
the density seems 87,87−161,87+161 (resp. 87,87+161,87 ) according as f(x)=x3−2,x3+x2−2x−1,x3+3x2−1,
where the latter two polynomials are abelian.
How does the density depend on the polynomial f ?
∙ Let f(x) be an irreducible polynomial of degree n with root α, and suppose that Q(α) is a Galois extension over Q with Galois group
{σ1,…,σn}.
Write
[TABLE]
Lemma 8.1**.**
Let a prime p∈Spl(f) be sufficiently large and r a root of f(x)≡0modp.
Then all roots of f(x)≡0modp are given by
ci(r)modp(i=1,…,n).
Proof.
Let p=(α−r,p) be a prime ideal of Q(α) over p and
let ι be the canonical homomorphism from the
ring o of integers of Q(α) on o/p≅Z/pZ.
Then ι(σi(α))(i=1,…,n)
are all roots of f(x)≡0modp, and so rmodp=ι(σt(α)) for some t.
Hence we see that {ι(σj(α))∣j=1,…,n}={ι(σt(σi(α)))∣i=1,…,n}={ι(ci(σt(α))∣i=1,…,n}={ci(r)∣i=1,…,n}.
∎
Let us consider the density of the complement set, that is
the problem that for not necessarily monic polynomials g1(x),g2(x) over Z what the density of primes p∈Spl(f) satisfying
[TABLE]
is.
By Lemma 8.1 the above inequality is equivalent to
[TABLE]
for some root r of f(x)≡0modp except finitely many primes.
Defining rational numbers gl,i,k by
[TABLE]
we expect that the density of primes p∈Spl(f) satisfying
[TABLE]
is equal to the volume of the set
[TABLE]
Here the reason why the term for k=0 is omitted is due to Proposition 8.1
below.
The computer experiment supports the above in the case
that f(x)=x3−3x+1 and g1,g2 are polynomials such that degrees are less than or equal to 2 and the absolute values of their coefficients are less than 4.
In case that the polynomial f(x) is not Galois,
the author has no perspective.
For example, in case of f(x)=x3−2,x3+x+1, the density seems to be 87
independently of g1(x),g2(x). How do we elucidate it?
∙ The above expectation suggests that the sequence of vectors
[TABLE]
is uniformly distributed in [0,1)n−1 where r runs n roots of f(x)modp with p∈Spl(f).
Applying it to the domain {x∈[0,1)n−1∣a≤xk≤b},
it implies the uniform distribution of the sequence {prk}(p∈Spl(f))
where r runs n distinct roots of f(x)≡0modp and k is a fixed integer
with 1≤k≤n−1.
We can not replace Spl(f) by M(f,σ).
∙ Next, let us consider polynomials in many variables :
Write
[TABLE]
Let g(x),h(x)∈Z[x1,…,xn].
For a permutation μ,
what is the density
[TABLE]
Since an element in Q(f) is a polynomial in α1,…,αn,
there is a polynomial g1(x)∈Q(f)[x] such that g(α1,…,αn)=g1(α1,…,αn).
Thus, we see that g(rμ(1),…,rμ(n))≡g1(rμ(1),…,rμ(n))modp for a prime p∈M(f,μ).
In general, g(r1,…,rn)≡g1(r1,…,rn)modp(∀p∈Spl(f))
is not necessarily true.
If g1(x) and similarly h1(x) are linear with integer coefficients,
then we have only to refer to Conjecture 2 if Spl(f,μ)=M(f,μ).
A sufficient condition to g1(x) being linear is that Q(f)/Q is a Galois extension and t=1, because they imply that
[Q(f):Q]=n and dimQ[α1,…,αn,1]=n,
that is Q(f)=Q[α1,…,αn,1].
Otherwise, what happens? Is the density the volume of some figure?
We give below two examples f(x)=x3+2, which is non-Galois, and f(x)=x4+1 in the case of t=2>1.
Example 1
Let f(x)=x3+a2x2+a1x+a0∈Q[x] be an irreducible polynomial with
roots α1,α2,α3 and suppose that the extension Q(α1)/Q is not a Galois extension.
Then for a polynomial g(x)∈Q[x1,x2,x3], there are rational numbers ci such that g(α1,α2,α3)=c0+c1α1+c2α12+c3α2+c4α1α2+c5α12α2.
Note that α1α2 may be replaced by α22 by the
equation α1α2=−a1−a2(α1+α2)−α12−α22.
Let us give computer experiments with respect to the above density Df(g,h)\linebreak[3]=Df(g,h;id) for f(x)=x3+2.
Polynomials g(x),h(x) are restricted to be of the following special type without the term x12x2 for simplicity
[TABLE]
with rational integer coefficients gi without constant term by Proposition 8.1.
Denote its homogeneous part of degree i by gi(x).
For polynomials g(x),h(x) with g(x)=0,h(x)=0,g(x)=h(x) as above, let us give observations.
If both of g,h are linear, i.e.
g(x)=g1(x),h(x)=h1(x),
then we have only to refer to Conjecture 2, and so
we suppose that g(x) or h(x) is not linear.
The case of g(x)=g2(x) and h(x)=h2(x).
The density Df(g,h) is always 21.
4. 4.
The case of g(x)=g2(x), h1(x)=0 and h2(x)=0.
The density Df(g,h) is
[TABLE]
5. 5.
The case of g2(x)=0,g1(x)=0,h2(x)=0,h1(x)=0.
The density Df(g,h) is, writing ki:=gi−hi
[TABLE]
These seem to be true for other non-Galois irreducible polynomials of degree 3.
Example 2 Set f(x)=x4+1 and let
roots be α1:=21+−1,α2:=21−−1=−α13,α3:=−21−−1=α13,α4:=−21+−1=−α1 as before, and then the basis mj of LR0∩Z4
are (1,0,0,1),(0,1,1,0).
Noting that Q(f)=Q[1,α1,α12,α2],
we see that for a polynomial g(x) in Q[x1,…,x4], there are rational numbers
ci so that g(α1,…,α4)=c0+c1α1+c2α12+c3α2.
So, we may assume that g(x)=c0+c1x1+c2x12+c3x2.
For a permutation μ, let us determine M(f,μ).
Since the condition p∈M(f,μ) is equivalent to αi≡rμ(i)modp, for σ∈Gal(Q(f)/Q) satisfying σ(αμ−1(1))=α1, it is equivalent to σ(αi)≡rμ(i)modσ(p), i.e. σ(αμ−1(i))≡rimodσ(p),
hence we have M(f,μ)=M(f,μ′) with μ′(1)=1 for μ′ defined by αμ′(i)=σ(αμ−1(i)).
Hence we assume μ(1)=1. For a prime p∈M(f,μ), the conditions
α1+α4=0,r1+r4=p imply μ(4)=4, hence μ(3)=2 or 3.
By α3=α13≡r13modp, we have rμ(3)≡r13modp.
Thus we have, supposing μ(1)=1μ=id. or the transposition (2,3)
and
[TABLE]
Note that Spl(f)=Spl(f,id.)=M(f,id.)∪M(f,(2,3)).
Under the assumptions
the densities of M(f,id.) and M(f,(2,3)) in Spl(f) are equal to 21,
2. 2.
the densities Df(g,h;id.),Df(g,h;(2,3)) are equal,
we see that Df(g,h;μ)=21(Df(g,h;id.)+Df(g,h;(2,3))) is equal to
[TABLE]
Thus, in case that g(x),h(x) are linear, the density is given by Conjecture 2.
For example, let g1(x)=2x1−x2,g2(x)=x2; then the computer experiment suggests
Df(g1,g2;μ)=21,
which match vol({(x1,x2)∣0<x1<x2<21,{2x1−x2}<{x2}})=vol({(x1,x2)∣0<x1<x2<21,x1<x2<2xx})=161 and vol({(x1,x2)∣0<x1<x2<21})=81.
Let us give other observations : Write
[TABLE]
and suppose that g(x)=0,h(x)=0,g(x)=h(x).
Then the observation is that, independently of μDf(g,h):=Df(g,h;μ)(μ=id. or (2,3)) is
[TABLE]
2. 2.
The case of g(x)=g2x12,h(x)=h2x12.
[TABLE]
3. 3.
The case of g(x)=g2x12,h(x)=h1x1+h3x2.
[TABLE]
4. 4.
The case of g(x)=g2x12,h(x)=h1x1+h2x12+h3x2 with h2=0, and h1=0 or h3=0.
Then Df(g,h) is
[TABLE]
5. 5.
The case of g(x)=g1x1+g3x2,h(x)=h1x1+h2x12+h3x2 with
h2=0, and h1=0 or h3=0.
Then Df(g,h) is
[TABLE]
6. 6.
The case of g(x)=g1x1+g2x12+g3x2,h(x)=h1x1+h2x12+h3x2 with
g2h2=0, and g1=0 or g3=0, and h1=0 or h3=0.
Then Df(g,h) is, writing ki:=gi−hi
[TABLE]
∙ In this paragraph, for integers m,p, we denote the integer a satisfying a≡mmodp and 0≤a<p by [m]p, and let the polynomial f(x) be irreducible and of degree n(>1) with roots αi as usual.
Lemma 8.2**.**
Let a be a positive integer.
(i)*
For a polynomial g(x)∈Z[x], there are only finitely many primes p satisfies [g(r)]p=a (resp. [g(r)]p=p−a) in the case of g(x)−a ( resp. g(x)+a)
being not divisible by f(x) in the ring Q[x].*
(ii)*
For a polynomial g(x)∈Z[x1,…,xn],
there are only finitely many primes p∈Spl(f) such that [g(r)]p=a
(resp. [g(r)]p=p−a) if g(ασ(1),…,ασ(n))=a (resp. g(ασ(1),…,ασ(n))=−a) for any permutation σ.
Here r=(r1,…,rn)
is the vector of local roots for p∈Spl(f).*
Proof.
(i)
Suppose that there are infinitely many primes p satisfying [g(r)]p=a.
Writing g0(x)=g(x)−a, we see that there are infinitely many primes p such that
there is an integer r satisfying f(r)≡g0(r)≡0modp.
Since the polynomial f(x) is irreducible and g0(x) is not divisible by f(x),
there are integral polynomials h1(x),h2(x) and a non-zero integer h such that h1(x)f(x)+h2(x)g0(x)=h.
So h is divisible by infinitely many primes as above, which is the contradiction.
In the other case, we have only to put g0(x)=g(x)+a.
(ii) Suppose that there are infinitely many primes p∈Spl(f) such that [g(r)]p=a.
Then there is a permutation σ such that ασ(i)≡rimodp for infinitely many primes p∈Spl(f), where p is a
prime ideal over p in Q(f), which implies g(ασ(1),…,ασ(n))≡amodp, that is g(ασ(1),…,ασ(n))=a.
It is the contradiction.
The proof of the other case is similar.
∎
Lemma 8.3**.**
Let a be a positive integer.
(i) Let gi(x)(i=1,2) be
integral polynomials for which g2(x)−g1(x)−a is not divisible by f(x).
Then there are only finitely many primes p∈Spl(f) such that
[TABLE]
(ii)* Let gi(x)(i=1,2) be polynomials in Z[x1,…,xn] and a a positive integer.
Suppose that g2(ασ(1),…,ασ(n))−g1(ασ(1),…,ασ(n))=a for every permutation σ.
Then there are only finitely many primes p∈Spl(f) such that*
[TABLE]
Proof.
(i) Suppose that there are infinitely many primes p∈Spl(f), which satisfies the equality in question.
By writing g(x):=g2(x)−g1(x), the supposition means that there are infinitely many primes p such that [g(r)]p≡[g2(r)]p−[g1(r)]p=amodp,
hence [g(r)]p=a.
The previous lemma completes the proof.
(ii) Assume that there are infinitely many primes p satisfying [g2(r)]p−[g1(r)]p=a.
Writing g(x):=g2(x)−g1(x), we see that [g(r)]p≡[g2(r)]p−[g1(r)]p≡amodp,
hence [g(r)]p=a. The previous lemma completes the proof.
∎
Proposition 8.1**.**
Let a,b be integers.
(i)*
Let gi(x)(i=1,2) be
polynomials over Z such that none of g1(x),g2(x), g2(x)−g1(x) are congruent to a constant modulo f(x).
Then for a prime p with an integer r satisfying f(r)≡0modp,
the inequalities {pg1(r)+a}<{pg2(r)+b} and {pg1(r)}<{pg2(r)} are equivalent except a finitely many primes.*
(ii)*
Let gi(x)(i=1,2) be
polynomials in Z[x1,…,xn] such that none of g1(x),g2(x), g2(x)−g1(x) are rational integers
at x=(ασ(1),…,ασ(n)) for every permutation σ.
Then for a prime p∈Spl(f),
the inequalities {pg1(r)+a}<{pg2(r)+b} and
{pg1(r)}<{pg2(r)} are equivalent except a finitely many primes.*
Proof.
(i)
For simplicity, the notation A⇔fB means that statements
A and B are equivalent except finitely many primes p in this proof.
We see that
[TABLE]
which is equivalent to [g1(r)]p<[g2(r)]p, i.e. {pg1(r)}<{pg2(r)} in the case of b−a≥0.
Suppose b−a<0; then the above inequality is
[g1(r)]p<[g2(r)]p+b−a.
Lemma 8.3 says that there are only finitely many
primes p satisfying [g2(r)]p+b−a≤[g1(r)]p≤[g2(r)]p,
hence we have [g1(r)]p<min([g2(r)]p,[g2(r)]p+b−a)⇔f[g1(r)]p<[g2(r)]p.
Thus,
we have {pg1(r)+a}<{pg2(r)+b}⇔f[g1(r)]p<[g2(r)]p(⇔{pg1(r)}<{pg2(r)}).
The other case is similar.
∎
8.1 Polynomial without non-trivial linear relations among roots
In this subsection, assume that the polynomial f(x) is of degree n~(>1) and has no non-trivial linear relations among roots, i.e. t:=dimLR=1, and for linear forms g1(x)=mx,g2(x)=nx with distinct non-zero integers m,n,
we study the density
[TABLE]
where {pgi(r)} denotes the decimal part of pgi(r)
as usual.
The condition t=1 implies G^=Sn, and so Spl(f,∀σ)=Spl(f).
We see that
[TABLE]
hence
[TABLE]
since the number of the prime p satisfying {pnr}={pmr} is finite
and we write
[TABLE]
Let us evaluate the ratio of volumes.
Note that the dimension dimIn,mn~∩D^n~ is less than or equal to n~−1 and the volume is considered as the (n~−1)-dimensional set under the assumption dimLR=1.
We know vol(D^n~)=n~!n~.
On the other hand, we see that
[TABLE]
and the permutation induces the orthogonal transformation on Rn~, and the dimension of the intersection of the subsets corresponding to distinct permutation is less than n~−1,
hence we see
[TABLE]
and
[TABLE]
In the rest of this subsection we will show the following :
Theorem 8.1**.**
For integers M,N satisfying 0<N<M and (M,N)=1, we have
[TABLE]
where Bn~(x) is the Bernoulli polynomial.
The above matches computer experiment of dM,N.
We note that
(i)
the ratio of volumes is independent of M,N for odd n~>1,
since Bn~(0)=0 for odd n~>1.
(ii)
Let f(x) be quadratic; then the above shows vol(D^2)vol(IN,M2∩D^2)=0.
As a matter of fact, we show, more strongly in Proposition 8.4 that
IN,M2∩D^2 is a finite set.
The set {p∈SplX(f)∣{pnr}<{pmr} for ∀r s.t. f(r)≡0modp}
is also a finite one as in Proposition 8.6.
8.1.1 Bernoulli polynomial
In this subsection, let us recall several facts on Bernoulli polynomials.
For non-negative integer m, we write
[TABLE]
for example
[TABLE]
We define
Bernoulli polynomials Bn(t) by
[TABLE]
that is
[TABLE]
In this paper, the notation Bn denotes the Bernoulli polynomial, and so we use the notation Bn(0)
for the Bernoulli number.
We see that, for a real number a and a non-negative integer m
[TABLE]
hence for integers n,m≥0,
[TABLE]
Therefore, for a positive real number a and a positive integer n>1, we see that
It is convenient to introduce the notation ≒ :
For sets S,T, we write S≒T if and only if
#(S∖T)+#(T∖S)<∞.
Proposition 8.2**.**
Let n,m be non-zero distinct integers, and write n=dN, m=dM for d:=(n,m).
Then we see that
[TABLE]
and under the assumptions M>N>0 and (M,N)=1
[TABLE]
where the integer L is defined by
[TABLE]
Proof.
The condition x∈In,m means {nx}<{mx}, i.e. {dNx}<{dMx}, hence
{dx}∈IN,M. We have only to write dx=k+{dx} for an integer k for the proof of (81).
Let us show the equation (82).
Take a number x∈IN,M, which implies Mx∈Z and write x=MK−ϵ(1≤K≤M,K∈Z,0<ϵ<1).
We note that the condition K=M is equivalent to L=M by the definition of L and the assumption M>N,(M,N)=1.
Then it is easy to see that {Mx}=1−ϵ and {Nx}={MNK−Nϵ}={ML−Nϵ}.
The inequalities 0<L−Nϵ<2M show that {Nx}=ML−Nϵ or ML−Nϵ−1 according to L−Nϵ<M or L−Nϵ≥M.
Let us note that
(i) NL−M<M−N2M−L which
follows from the assumption L<M+N,
(ii) ML−Nϵ−1<1−ϵ⇔ϵ<M−N2M−L,
and
(iii) ML−Nϵ<1−ϵ⇔ϵ<M−NM−L.
First, suppose L<M : By 0<L−Nϵ<M, we have {Nx}=ML−Nϵ,
hence {Nx}<{Mx}⇔ML−Nϵ<1−ϵ⇔0<ϵ<M−NM−L by (iii).
Next, suppose L≥M:
Under the supposition {Nx}<{Mx}, the condition L−Nϵ<M implies
{Mx}=1−ϵ>{Nx}=ML−Nϵ,
which is equivalent to (0<)ϵ<M−NM−L, which contradicts the assumption L≥M.
Hence the condition {Nx}<{Mx} implies L−Nϵ≥M, i.e. ϵ≤NL−M.
Conversely, suppose ϵ≤NL−M, which is equivalent to L−Nϵ≥M
and implies ϵ<M−N2M−L by (i) ,
hence {Nx}=ML−Nϵ−1,
and the property (ii) imply {Nx}<{Mx}.
If K=M happens, then we have L=M and the contradiction {Nx}={MM−Nϵ}=1−MNϵ>1−ϵ={Mx}.
∎
Hereafter, we assume that integers M,N satisfy M>N>0 and (M,N)=1 as in Theorem 8.1.
We write, for an integer K
[TABLE]
where L is the integer defined by L≡NKmodM, and N≤L≤M+N−1.
It is easy to see τ(0)=0,τ(1)=1
By Proposition 8.2,
we have
[TABLE]
Proposition 8.3**.**
The mapping τ is the bijection from {1,2,…,M−1} to Σ:=Σ1∪Σ2,
where Σ1:={N1,…,NN−1},
Σ2:={M−N1,…,M−NM−N}
and τ(K)=K holds in the ring Z/MZ.
The set Σ1 is empty if N=1.
Moreover, we have
[TABLE]
and K−τ(K)(K=1,…,M−1) are distinct.
Proof.
It is clear that the value τ(K) is in the set Σ and #Σ=M−1.
Since (M,M−N)=(M,N)=1, we see that τ(K)=NL=K in Z/MZ,
which implies the injectivity of τ.
Write NK=L+aM(a∈Z).
Suppose that L>M; it implies K−τ(K)=NM(a+1), and from inequalities N≤L≤M+N−1
follows MN(K−1)−1+M1≤a≤MK−1N, hence −1<a<N.
If a=N−1 occurs, then L=NK−(N−1)M holds and then the assumption L>M implies NK>NM,
which contradicts K≤M−1.
Next, suppose that L<M; then we see K−τ(K)=M−NM(K−1−a) and inequalities N≤L≤M+N−1
imply K−MN(K−1)−1≤K−1−a≤(1−MN)K+MN−1,
hence 0≤K−1−a≤(1−MN)(M−1)+MN−1<M−N−1+2MN−M1<M−N+1.
If K−1−a=M−N occurs, then the assumption L<M implies NK−aM<M, hence K−M+N=a+1>MNK,
i.e. (M−N)K>(M−N)M, which is the contradiction.
Next, assume that K1−τ(K1)=K2−τ(K2) for 1≤K1<K2≤M−1; it implies the contradiction
1≤K2−K1=τ(K2)−τ(K1)<1.
∎
When we change the domain of the mapping τ from {1,…,M−1} to {0,1,…,M−1},
the set {0,1,…,M−1} corresponds , through K→K−τ(K) to
Σ′:=Σ1′⊔Σ2′ for
[TABLE]
where K=0,1 are supposed to correspond to 0∈Σ1′,0∈Σ2′, respectively.
Now we see that
[TABLE]
Before the evaluation of the volume of the above,
let us show the special case of n~=2.
Proposition 8.4**.**
IN,M2∩D^2* is a finite set.*
Proof.
By (83), we have only to sow that (∪K=1M−1Sτ(K))∩D^2 is empty.
Suppose that it is not empty and for xi=MKi−τ(Ki)+ϵi with 0<ϵi<τ(Ki),1≤Ki≤M−1(i=1,2), assume that x1+x2∈Z.
The equalities 0≤∑i=12MKi−τ(Ki)<x1+x2<∑i=12MKi<2 imply x1+x2=1,
hence K1+K2=M+τ(K1)−ϵ1+τ(K2)−ϵ2.
It implies M<K1+K2<M+τ(K1)+τ(K2)≤M+2, that is K1+K2=M+1,
hence
[TABLE]
Let Li(i=1,2) be integers defining τ(Ki), that is Li≡NKimodM,N≤Li≤M+N−1;
then we have L1+L2≡N(K1+K2)≡N(M+1)≡NmodM.
Writing L1+L2=N+kM(k∈Z), we see N≤L2=N+kM−L1≤M+N−1 and L1≤kM≤L1+M−1≤2M+N−2, which implies k=1,2.
First, suppose k=1; then L1+L2=N+M and 0≤L1−N=M−L2, hence τ(K1)=M−NM−L1 by definition of τ, similarly τ(K2)=M−NM−L2, which imply τ(K1)+τ(K2)=1 and so the contradiction ϵ1+ϵ2=0 by (87).
Next, suppose k=2; we see that L1=(N+M−L2)+M>M and τ(K1)=NL1−M, and similarly
τ(K2)=NL2−M.
They also imply the contradiction τ(K1)+τ(K2)=1.
∎
Proposition 8.5**.**
Let f(x) be a monic integral polynomial without rational roots, and let n be a non-zero integer, and A a positive number.
If a prime p is sufficiently large, then for any integer r satisfying f(r)≡0modp, {pnr}≥pA holds.
Proof.
Suppose that for a prime p and an integer r, f(r)≡0modp and {pnr}<pA hold.
We may assume that 0≤r<p, and
writing
[TABLE]
we see that ∣k∣p<(∣n∣+1)p, and 0≤R<A by the assumption {pnr}<pA, hence
the possibility of k,R is finite.
Assume that there are infinitely many such primes p; then for some k0,R0 there are infinitely many primes p such that nr=k0p+R0 with f(r)≡0modp.
Then, for the integral polynomial g(x):=ndegff(nx), we see that g(R0)≡g(nr)≡ndegff(r)≡0modp, that is g(R0)=0, which is the contradiction.
∎
Proposition 8.6**.**
Let f(x)=x2−ax+b be an integral irreducible polynomial, and let m,n be non-zero distinct integers.
Then there are only finitely many primes p such that f(x)≡0modp has two roots r1,r2∈Z such that r1≡r2modp
[TABLE]
Proof.
Suppose that the inequalities (2) for a sufficiently large prime p; then by r1+r2≡amodp we have
{pnr2}<{pmr2}⇔\left\{\frac{n(a-r_{1})}{p}\right\}<\left\{\frac{m(a-r_{1})}{p}\right\}$$\Leftrightarrow\left\{\frac{na}{p}-\left\{\frac{nr_{1}}{p}\right\}\right\}<\left\{\frac{ma}{p}-\left\{\frac{mr_{1}}{p}\right\}\right\}\Leftrightarrow{pnr1}−pna>{pmr1}\linebreak[3]−pma
by Proposition 8.5.
Suppose that there are infinitely many primes satisfying (88).
Then, writing nr1=kp+R,mr1=k′p+R′(k,k′∈Z,0≤R,R′<p), the above inequality and the assumption (2) imply R−na>R′−ma,
i.e. (n−m)a<R−R′=p({pnr1}−{pmr1})<0.
Therefore there is an integer r0 with (n−m)a<r0<0 such
that (n−m)r1≡R−R′≡r0modp for infinitely many primes p.
Writing g(x)=(n−m)degff(n−mx)∈Z, we have g(r0)≡(n−m)degff(r1)≡0modp
for infinitely many primes p, which contradicts the irreducibility of the polynomial f(x).
∎
Let us begin the evaluation of the volume.
Write M~(x):=max(0,x) for simplicity.
Lemma 8.4**.**
Let a,b,m be real numbers and suppose a≤b and m=−1.
Then we have
[TABLE]
Proof.
By writing t−w=W, the left hand is equal to
[TABLE]
∎
Here we introduce the notation, for x,τ1,…,τn∈R
[TABLE]
where S runs over all 2n subsets of {1,…,n} and ∣S∣=#S.
It is obvious that
Example
It is easy to check, by drawing the figure
[TABLE]
We note that the proposition implies the following equation :
[TABLE]
where τ1,…,τn and c are variables and S runs over all 2n subsets of {1,…,n}.
Proposition 8.8**.**
For positive numbers τ1,…,τn, the n−1-dimensional volume of
the set
[TABLE]
is
[TABLE]
Proof.
Using orthnormal basis
[TABLE]
and the transformation (y1,…,yn)=(x1,…,xn)(tf1,…,tfn),
that is nyn=x1+⋯+xn,
we see, denoting Sn(x;τ1,…,τn) by Sn(x) simply
[TABLE]
hence Un′(x)=n−1vol(Sn(x)), i.e. vol(Sn(x))=nUn′(x).
∎
Example
The length of S2(x;τ1,τ2)
is easily checked to be
[TABLE]
We note that the volume of Sn(x;τ1,…,τn) is positive if and only if 0<x<∑τi holds,
and that vol(Sn(x;τ1,…,τn))=vol(Sn(x;τσ(1),…,τσ(n))) for every permutation
σ∈Sn, since a permutation induces the orthogonal transformation.
In particular, for positive numbers τ1,…,τn and a real number x,
Wn−1(x;τ1,…,τn)>0 if and only if 0<x<∑τi holds.
where we replaced (−1)n~ by 1 by virtue of Bn(0)=0 for odd n>1.
These complete the proof of Theorem 8.1.
9 Other direction
We know that for a prime p, the condition p∈Spl(f) and the condition that f(x) has n(=degf(x)) roots
in the local field Qp are equivalent except finitely many primes.
So, it may be natural to ask, for a natural number s how the distribution of roots of f(x)≡0modps is,
how the distribution of the coefficient of ps of
the standard p-adic expansion of roots in Qp is,
and relations among them of several s’s.
With respect to the distribution of roots with a congruence condition, we may consider the distribution of roots ri,s for a positive integer s such that
[TABLE]
with
[TABLE]
This problem is somewhat easy compared with the previous one, judging from the case of degree 1.
We fixed the integer s in the above, but contrary to it, we may ask the density of s (s→∞)
such that there exist integers ri,s satisfying above equations for a fixed prime p∈Spl(f),
L,Ri
(cf. 3.2 in [K6]).
To make data in this case by computer, it takes much time.
One may ask about the equi-distribution similar to Conjecture 2 with congruence conditions.
Bibliography22
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BD] B.Brosowski, and F. Deutsch, An elementary proof of Stone-Weierstrass theorem, Proc. Amer. Math. Soc. 81 (1981), 89-92.
2[DFI] W. Duke, J.B. Friedlander, and H. Iwaniec, Equidistribution of roots of a quadratic congruence to prime moduli, Ann. of Math. 141 (1995), 423-441.
3[Fe] W. Feller, An introduction to probability theory and its applications Vol. 2 , J. Wiley, New York, 1966.
4[Fo] T. Foo, The Bouniakowsky conjecture and the density of polynomial roots to prime moduli, Acta Arith. 144 (2010), 1-4.
5[HKKN] T. Hadano, Y. Kitaoka, T. Kubota and M. Nozaki, Densities of sets of primes related to decimal expansion of rational numbers, Number Theory, Tradition and Modernization, edited by W. Zhang and Y. Tanigawa, Vol 15 Developments in Mathematics, 2006, Springer Science+Business Media, Inc.
6[K 1] Y. Kitaoka, A statistical relation of roots of a polynomial in different local fields , Math. of Comp. 78 (2009), 523-536.
7[K 2] Y. Kitaoka, A statistical relation of roots of a polynomial in different local fields II , Number Theory : Dreaming in Dreams (Series on Number Theory and Its Application Vol. 6), 106-126, World Scientific, 2010.
8[K 3] Y. Kitaoka, A statistical relation of roots of a polynomial in different local fields III , Osaka J. Math. 49 (2012), 393-420.