On a bounded remainder set for (t,s) sequences I
Mordechay B. Levin
Abstract
Let x0,x1,... be a sequence of points in [0,1)s.
A subset S of [0,1)s is called a bounded remainder set if there exist two real numbers a and C such that, for every integer N,
[TABLE]
Let (xn)n≥0 be an s−dimensional Halton-type sequence obtained from a global function field, b≥2,
γ=(γ1,...,γs),
γi∈[0,1), with b-adic expansion γi=γi,1b−1+γi,2b−2+..., i=1,...,s.
In this paper, we prove that [0,γ1)×...×[0,γs) is the bounded remainder set with respect to the
sequence (xn)n≥0 if and only if
[TABLE]
We also obtain the similar results for a generalized Niederreiter sequences, Xing-Niederreiter sequences and Niederreiter-Xing sequences.
Dedicated to the 100th anniversary of Professor N.M. Korobov
Key words: bounded remainder set, (t,s) sequence, Halton type sequences.
2010 Mathematics Subject Classification. Primary 11K38.
1 Introduction
1.1. Bounded remainder sets. Let x0,x1,... be a sequence of points in [0,1)s, S⊆[0,1)s,
[TABLE]
where \mathds1S(x)=1,ifx∈S,
and \mathds1S(x)=0, if x∈/S. Here λ(S) denotes the s-dimensional Lebesgue-measure of S.
We define the star discrepancy of an
N-point set (xn)n=0N−1 as
[TABLE]
where [0,y)=[0,y1)×⋯×[0,ys).
The sequence (xn)n≥0 is said to be
uniformly distributed in [0,1)s
if DN→0.
In 1954, Roth proved that
limsupN→∞N(lnN)−2sD∗((xn)n=0N−1)>0.
According to the well-known conjecture (see, e.g., [BeCh, p.283]), this estimate can be improved
to
[TABLE]
See [Bi] and [Le1] for results on this conjecture.
A sequence (xn(s))n≥0 is of low discrepancy (abbreviated l.d.s.) if D((xn(s))n=0N−1)=O(N−1(lnN)s) for N→∞.
A sequence of point sets ((xn,N(s))n=0N−1)N=1∞ is of
low discrepancy (abbreviated
l.d.p.s.) if D((xn,N(s))n=0N−1)=O(N−1(lnN)s−1), for N→∞.
For examples of such a sequences, see, e.g., [BeCh], [DiPi], and [Ni].
Definition 1. *Let x0,x1,... be a sequence of points in [0,1)s.
A subset S of [0,1)s is called a bounded remainder set for (xn)n≥0
if the discrepancy function Δ(S,(xn)n=0N−1) is bounded in N.
Let α be an irrational number, let I be an interval in [0,1) with length ∣I∣, let {nα} be the fractional part of nα, n=1,2,... .
Hecke, Ostrowski and Kesten proved that Δ(S,({nα})n=1N) is bounded if and only if ∣I∣={kα} for some integer k (see references in [GrLe]).
The sets of bounded remainder for the classical s-dimensional Kronecker sequence studied
by Lev and Grepstad [GrLe]. The case of Halton’s sequence was studied by Hellekalek [He].
Let b be a prime power, γ=(γ1,...,γs),
γi∈(0,1) with b-adic expansion γi=γi,1b−1+γi,2b−2+..., i=1,...,s, and let (xn)n≥0 be a uniformly distributed digital Kronecker sequence.
In [Le1], we proved the following theorem:
Theorem A. The set [0,γ1)×...×[0,γs) is of bounded remainder with respect to (xn)n≥0 if and only if
[TABLE]
In this paper, we prove similar results for digital sequences described in [DiPi, Sec. 8].
Note that according to
Larcher’s conjecture [La2, p.215], the assertion of Theorem A is true for all digital (t,s)-sequences in base b.
2 Definitions and auxiliary results.
2.1 (T,s) sequences.
A subinterval E of [0,1)s of the form
[TABLE]
with ai,di∈Z,di≥0,0≤ai<bdi, for 1≤i≤s is called an
elementary interval in base b≥2.
Definition 2. Let 0≤t≤m be integers. A (t,m,s)-net in base b* is a point set
x0,...,xbm−1 in [0,1)s such that #{n∈[0,bm−1]∣xn∈E}=bt for every elementary interval E in base b with
vol(E)=bt−m.
Definition 3. Let t≥0 be an integer. A sequence x0,x1,... of points in [0,1)s is a
(t,s)-sequence in base b if, for all integers k≥0 and m≥t, the point set
consisting of xn with kbm≤n<(k+1)bm is a (t,m,s)-net in base b.*
By [Ni, p. 56,60], (t,m,s) nets and (t,s) sequences are of low discrepancy.
See reviews
on (t,m,s) nets and (t,s) sequences in [DiPi] and [Ni].
Definition 4. ([DiPi, Definition 4.30]) *For a given dimension s≥1, an integer base b≥2, and a
function T:N0→N0 with T(m)≤m for all m∈N0, a sequence (x0,x1,...)
of points in [0,1)s is called a (T,s)-sequence in base b if for all integers m≥0
and k≥0, the point set consisting of the points xkbm,...,xkbm+bm−1 forms
a (T(m),m,s)-net in base b.
*Definition 5. ([DiPi, Definition 4.47]) Let m,s≥1 be integers. Let C(1,m),...,C(s,m) be m×m matrices over Fb.
Now we construct bm points in [0,1)s.
For n=0,1,...,bm−1, let n=∑j=0m−1aj(n)bj
be the b-adic expansion of n.
Choose a bijection
ϕ:Zb:={0,1,....,b−1}↦Fb with
ϕ(0)=0ˉ, the neutral element of addition in Fb.
We identify n with the row vector
[TABLE]
We map the vectors
[TABLE]
to the real numbers
[TABLE]
to obtain the point
[TABLE]
The point set {x0,...,xbm−1} is called a digital net (over Fb) (with generating matrices (C(1,m),...,C(s,m))).
*For m=∞, we obtain a sequence x0,x1,... of points in [0,1)s which is called a digital sequence (over Fb) (with generating matrices (C(1,∞),...,C(s,∞))).
*We abbreviate C(i,m) as C(i) for m∈N and for m=∞.
2.2 Duality theory (see [DiPi, Section 7]).
Let N be
an arbitrary Fb-linear subspace of Fbsm. Let H be a matrix over Fb consisting
of sm columns such that the row-space of H is equal to N. Then we define
the dual space N⊥⊆Fbsm
of N to be the null space of H (see [DiPi, p. 244]). In other words,
N⊥
is the orthogonal complement of N relative to the standard inner product
in Fbsm,
[TABLE]
Let C(1),...,C(s)∈Fb∞×∞ be
generating matrices of a digital sequence (xn(C))n≥0 over Fb.
For any m∈N,
we denote the m×m left-upper sub-matrix of
C(i) by [C(i)]m.
The matrices [C(1)]m,...,[C(s)]m
are then the generating matrices
of a digital net. We define the overall generating matrix of
this digital net by
[TABLE]
for any m∈N.
Let Cm denote the row space of
the matrix [C]m i.e.,
[TABLE]
The dual space is then given by
[TABLE]
Lemma A. ([DiPi, Theorem 4.86]) *Let b be a prime power. A strict digital
(T,s)-sequence over Fb is
uniformly distributed modulo one, if and only if liminfm→∞(m−T(m))=∞.
*2.3 Admissible sequences.
For x=∑j≥1xjb−j, and y=∑j≥1yjb−j
where xj,yj∈Zb:={0,1,....,b−1}, we define the (b-adic) digital shifted point v by
v=x⊕y:=∑j≥1vjb−j,
where vj≡xj+yj(modb) and vj∈Zb. Let x=(x(1),...,x(s))∈[0,1)s, y=(y(1),...,y(s))∈[0,1)s.
We define the (b-adic) digital shifted point v by
v=x⊕y=(x(1)⊕y(1),...,x(s)⊕y(s)).
For n1,n2∈[0,bm), we define
n1⊕n2:=(n1/bm⊕n2)bm)bm.
For x=∑j≥1xib−i,
where xi∈Zb, xi=0 (i=1,...,k) and xk+1=0, we define the
absolute valuation ∥.∥b of x by ∥x∥b=b−k−1.
Let ∥n∥b=bk for n∈[bk,bk+1).
Definition 6. A point set (xn)0≤n<bm
in [0,1)s is d−admissible in
base b if
[TABLE]
*A sequence (xn)n≥0
in [0,1)s is d−admissible in
base b if * infn>k≥0∥n⊖k∥b×∥xn⊖xk∥b≥b−d.
By [Le2], generalized Niederreiter’s sequences, Xing-Niederreiter’s sequences and Halton-type (t,s)
sequences have d−admissible properties.
In [Le2], we proved for all d−admissible digital (t,s) sequences (xn)n≥0
[TABLE]
with some w and K>0. This result supports conjecture (1.1).
Definition 7. A sequence (xn)n≥0
in [0,1)s is weakly admissible in
base b if
[TABLE]
Let m≥1, τm=[logq(κm)]+m, w=(w(1),...,w(s)), w(i)=(w1(i),...,wτm(i)),
[TABLE]
Theorem B. (see [Le3, Proposition]) *Let (xn)n≥0 be a uniformly distributed weakly admissible digital (T,s)-sequence in base b, satisfying (2.6) for all m≥m0.
Then the set [0,γ1)×...×[0,γs) is of bounded remainder with respect to (xn)n≥0 if and only if
(1.2) is true.
2.4 Notation and terminology for algebraic function fields. For
the theory of algebraic function fields, we follow the notation and
terminology in the books [St] and [Sa].
Let b be an arbitrary prime power, Fb a finite field with b elements,
Fb(x) the rational function field over Fb, and Fb[x]
the polynomial ring over Fb.
For α=f/g,f,g∈Fb[x], let
[TABLE]
be the degree valuation of Fb(x). We define the field of Laurent series as
[TABLE]
A finite extension field F of Fb(x) is called
an algebraic function field over Fb. Let Fb be algebraically
closed in F. We express
this fact by simply saying that F/Fb is an algebraic function field. The genus
of F/Fb is denoted by g.
A place P of F is, by definition, the maximal ideal of some valuation
ring of F. We denote by OP the valuation ring corresponding to P and we
denote by PF the set of places of F.
For a place P of F, we write νP for the normalized discrete valuation of F
corresponding to P, and any element t∈F with νP(t)=1 is called a local parameter (prime element) at P.
The field FP:=OP/P is called the residue field of F with respect to P.
The degree of a place
P is defined as
deg(P)=[FP:Fb].
We denote by
Div(F) the set of divisors of F/Fb.
The completion of F with respect to νP will be
denoted by F(P). Let t be a local parameter of P.
Then F(P) is isomorphic to FP((t)) (see [Sa, Theorem 2.5.20]), and
an arbitrary element α∈F(P) can be uniquely
expanded as (see [Sa, p. 293])
[TABLE]
The derivative dtdα, or differentiation with respect to t, is defined by (see [Sa, Definition 9.3.1])
[TABLE]
For an algebraic function field F/Fb, we define its set of differentials (or Hasse differentials, H-differentials) as
[TABLE]
(see [St, Definition 4.1.7]).
Lemma B. ([St, Proposition 4.1.8] or [Sa, Theorem 9.3.13]) Let z∈F be separating. Then
every differential γ∈ΔF
can be written uniquely as γ=ydz for some y∈F.
We define the order of αdβ at P by
[TABLE]
where t is any local parameter for P (see [Sa, Definition 9.3.8]).
Let ΩF be the set of all Weil differentials of F/Fb. There exists an F−linear
isomorphism of the differential module ΔF onto ΩF (see [St, Theorem 4.3.2] or [Sa, Theorem 9.3.15]).
For 0=ω∈ΩF, there exists a uniquely
determined divisor div(ω)∈Div(F). Such a divisor div(ω) is called a canonical
divisor of F/Fb. (see [St, Definition 1.5.11]). For a canonical divisor W˙, we have (see [St, Corollary 1.5.16])
[TABLE]
Let αdβ be a nonzero H-differential in F and let ω be the corresponding
Weil differential. Then (see [Sa, Theorem 9.3.17], [St, ref. 4.35])
[TABLE]
Let αdβ be an H-differential, t a local parameter of P, and
[TABLE]
Then the residue of αdβ (see [Sa, Definition 9.3.10) is defined by
[TABLE]
Let
[TABLE]
For a divisor D of F/Fb, let L(D) denote the Riemann-Roch space
[TABLE]
Then L(D) is a finite-dimensional vector space over F, and we denote its
dimension by ℓ(D). By [St, Corollary 1.4.12],
[TABLE]
Theorem C (Riemann-Roch Theorem). [St, Theorem 1.5.15, and St, Theorem 1.5.17 ] *Let W be a canonical divisor
of F/Fb. Then for each divisor A∈div(F), ℓ(A)=deg(A)+1−g+ℓ(W−A), and *
[TABLE]
3 Statements of results.
3.1 Generalized Niederreiter sequence.
In this subsection, we introduce a generalization of the Niederreiter sequence
due to Tezuka (see [DiPi, Section 8.1.2]).
By [DiPi, Section 8.1], the Sobol’s sequence, the Faure’s sequence and the original Niederreiter sequence
are particular cases of a generalized Niederreiter sequence.
Let b be a prime power and let p1,...,ps∈Fb[x] be pairwise coprime polynomials
over Fb. Let ei=deg(pi)≥1 for 1≤i≤s.
For each j≥1 and 1≤i≤s, the set of polynomials
{yi,j,k(x):0≤k<ei} needs to be linearly independent (modpi(x)) over
Fb.
For integers
1≤i≤s, j≥1 and 0≤k<ei, consider the expansions
[TABLE]
over the field of formal Laurent series Fb((x−1)). Then we define the matrix
C(i)=(cj,r(i))j≥1,r≥0 by
[TABLE]
where j−1=Qei+k with integers Q=Q(i,j) and k=k(i,j) satisfying
0≤k<ei.
A digital sequence (xn)n≥0 over Fb generated by the matrices C(1),...,C(s) is called a
generalized Niederreiter sequence (see [DiPi, p.266]).
Theorem D. (see [DiPi, p.266] and [Le1, Theorem 1]) The generalized Niederreiter sequence (xn)n≥0 with generating matrices, defined
as above, is a digital d−admissible (t, s)-sequence over Fb with
d=e0, t=e0−s and e0=e1+...+es.
In this paper, we will consider the case where (x,pi)=1 for 1≤i≤s. We will consider the general case in [Le4].
Theorem 1. With the notations as above,
the set [0,γ1)×...×[0,γs) is of bounded remainder with respect to (xn)n≥0 if and only if (1.2) is true.
3.2 Xing-Niederreiter sequence (see [DiPi, Section 8.4 ]).
Let F/Fb be an algebraic function field with full constant field Fb and
genus g.
Assume that F/Fb has at least one
rational place P∞, and let G be a positive divisor of F/Fb with
deg(G)=2g and P∞∈/supp(G). Let P1,...,Ps be s distinct places of F/Fb with Pi=P∞
for 1≤i≤s. Put ei=deg(Pi) for 1≤i≤s.
By [DiPi, p.279 ], we have that there exists a basis w0,w1,...,wg of L(G) over Fb such that
[TABLE]
where 0=n0<n1<....<ng≤2g.
For each 1≤i≤s, we consider the chain
[TABLE]
of vector spaces over Fb. By starting from the basis w0,w1,...,wg of L(G)
and successively adding basis vectors at each step of the chain, we obtain
for each n∈N a basis
[TABLE]
of L(G+nPi). We note that we then have
[TABLE]
Lemma C. ([DiPi, Lemma 8.10]) *The system {w0,w1,...,wg}∪{kj(i)}1≤i≤s,j≥1 of elements of F is linearly independent over Fb. *
Let z be an arbitrary local parameter at P∞.
For r∈N0=N∪{0}, we put
[TABLE]
Note that in this case νP∞(zr)=r for all r∈N0. For 1≤i≤s and j∈N,
we have kj(i)∈L(G+nPi) for some n∈N and also
P∞∈/supp(G+nPi),
hence νP∞(kj(i))≥0.
Thus we have the local expansions
[TABLE]
where all coefficients aj,r(i)∈Fb.
Let H1=N0∖H2={h(0),h(1),...}, H2={n0,n1,...,ng}.
For 1≤i≤s and j∈N, we now define the
sequences
[TABLE]
[TABLE]
where the hat indicates that the corresponding term is deleted. We define
the matrices C(1),...,C(s)∈FbN×N by
[TABLE]
i.e., the vector cj(i)
is the jth row vector of C(i) for 1≤i≤s.
Theorem E (see [DiPi, Theorem 8.11] and [Le1, Theorem 1]). *With the above notations, we have that the matrices C(1),...,C(s)
given by (3.5) are generating matrices of the Xing-Niederreiter d−admissible digital (t,s)-sequ-
ence (xn)n≥0 with d=e1+...+es,
t=g+e1+...+es−s.*
In order to obtain the bounded remainder set property, we will take a specific local parameter z.
Let P0∈PF, P0⊂{P1,...,Ps,P∞}, P0∈/supp(G) and deg(P0)=e0.
By the Riemann-Roch theorem, there exists a local parameter z at P∞, with
[TABLE]
Theorem 2. With the notations as above,
the set [0,γ1)×...×[0,γs) is of bounded remainder with respect to (xn)n≥0 if and only if (1.2) is true.
3.3 Generalized Halton-type sequences from global function fields.
Let q≥2 be an integer
[TABLE]
Van der Corput proved that (φq(n))n≥0 is a 1−dimensional l.d.s. Let
[TABLE]
where q^1,…,q^s≥2 are pairwise coprime integers.
Halton proved that (H^s(n))n≥0 is an s−dimensional l.d.s. (see [Ni]).
Let Q=(q1,q2,....) and Qj=q1q2....qj, where qj≥2 (j=1,2,…) is a sequence of integers.
Every nonnegative integer n then has a unique Q-adic representation of the form
[TABLE]
where nj∈{0,1,...,qj−1}. We call this the Cantor expansion of n with respect to the base Q.
Consider Cantor’s expansion of x∈[0,1):
[TABLE]
The Q−adic representation of x is then unique.
We define the radical inverse function
[TABLE]
Let pi,j≥2 be integers (s≥i≥1,j≥1), g.c.d.(pi,k,pj,l)=1 for i=j, P~i,0=1,P~i,j=∏1≤k≤jpi,k,i∈[1,s],j≥1,
Pi=(pi,1,pi,2,...), P=(P1,...,Ps).
In [He], Hellecaleq proposed the following generalisation of the Halton sequence:
[TABLE]
In [Te], Tezuka introduced a polynomial arithmetic analogue of the Halton sequence :
Let p(x) be an arbitrary nonconstant polynomial over Fb, e=deg(p), n=a0(n)+a1(n)b+⋯+am(n)bm. We fix
a bijection ϕ:Zb→Fb with ϕ(0)=0ˉ.
Denote vn(x)=aˉ0(n)+aˉ1(n)x+⋯+aˉm(n)xm, where aˉr(n)=ϕ(ar(n)), r=0,1,...,m.
Then vn(x) can be represented in terms of p(x) in the following way:
[TABLE]
We define the radical inverse function φp(x):Fb[x]→Fb(x) as follows
[TABLE]
Let p1(x),...,ps(x) be pairwise coprime. Then Tezuka’s sequence is defined as follows
[TABLE]
where each σi is a mapping from F to the real field defined by
σi(∑j≥wa˙jx−j)=∑j≥wϕ−1(a˙j)b−j.
By [Te], (xn)n≥0 is a (t,s) sequence in base b.
In 2010, Levin [Le1] and in 2013, Niederreiter and Yeo [NiYe] generalized Tezuka’s construction to the case of arbitrary algebraic function fields F.
The construction of [NiYe] is follows:
Let F/Fb be an algebraic function field with full constant field Fb and
genus g.
We assume that F/Fb has at least one rational place, that is, a place of degree 1. Given a dimension s≥1, we choose s+1 distinct places P1,…,Ps, P∞ of F with deg(P∞)=1. The
degrees of the places P1,…,Ps are arbitrary and we put ei=deg(Pi) for
1≤i≤s. Denote
by OF the holomorphy ring given by
OF=⋂P=P∞OP,
where the intersection is extended over all places P=P∞ of F, and OP is the valuation ring of P.
We arrange the elements of OF into a sequence by using the fact that OF=⋃m≥0L(mP∞).
The terms of this sequence are denoted by f0,f1,... and they are obtained as follows. Consider the chain L(0)⊆L(P∞)⊆L(2P∞)⊆⋯
of vector spaces over Fb. At each step of this chain, the dimension either remains the same
or increases by 1. From a certain point on, the dimension always increases by 1 according to
the Riemann-Roch theorem. Thus we can construct a sequence v0,v1,... of elements of OF
such that
{v0,v1,...,vℓ(mPs+1)−1}
is a Fb-basis of L(mPs+1). We fix
a bijection ϕ:Zb→Fb with ϕ(0)=0ˉ. Then we define
[TABLE]
Note that the sum above is finite since for each n∈N. We have ar(n)=0 for all sufficiently
large r.
By the Riemann-Roch theorem, we have
[TABLE]
For each i=1,...,s, let ℘i be the maximal ideal of OF corresponding to Pi. Then the
residue class field FPi:=OF/℘i has order bei (see [St, Proposition 3.2.9]). We fix a bijection
σPi:FPi→Zbei.
For each
i=1,...,s, we can obtain a local parameter ti∈OF at ℘i, by applying the Riemann-Roch
theorem and choosing
ti∈L(kP∞−Pi)∖L(kP∞−2Pi)
for a suitably large integer k. We have a local expansion of
fn at ℘i of the form
[TABLE]
We define the map ξ:OF→[0,1]s by
[TABLE]
Now we define the sequence x0,x1,... of points in [0,1]s by
xn=ξ(fn)for
n=0,1,... .
From [NiYe, Theorem 1], we get the following theorem :
Theorem F. *With the notation as above, we have that (xn)n≥0
is a (t,s)-sequence over Fb with
t=g+e1+...+es−s.
The construction of Levin [Le1] is similar, but more complicated than in [NiYe].
However in [Le1], we can use arbitrary pairwise coprime divisors D1,...,Ds instead of places P1,...,Ps.
In this paper, we introduce the Hellecalek-like generalisation (3.7) of the above construction:
Let PF:={P∣PbeaplaceofF/Fb}, P0,P∞∈PF, deg(P∞)=1, deg(P0)=e0, P0=P∞,
Pi,j∈PF for 1≤j,1≤i≤s, Pi1,j1=Pi2,j2 for i1=i2,
Pi,j=P0, Pi,j=P∞ for all i,j, n˙i,j=deg(Pi,j),
ni,j=deg(Pi,j),P0,j=P0j,
[TABLE]
Let i∈[0,s]. We will construct a basis (wj(i))j≥0 of OF in the following way. Let
[TABLE]
Using the Riemann-Roch theorem, we obtain
[TABLE]
Let (uj,μ(i))μ=1g be a Fb linear basis of Li,j.
By (3.9) and (3.10), we get that the basis (uj,μ(i))μ=1g can be extended to a basis
(vj,1(i),⋯,vj,n˙i,j(i),uj,1(i),⋯,uj,g(i))
of Li,j.
Bearing in mind that (uj,μ(i))μ=1g is a Fb linear basis of Li,j, we obtain that vj,μ(i)∈/Li,j for μ∈[1,n˙i,j].
So
[TABLE]
Let
[TABLE]
We claim that vectors from Vi,j are Fb linear independent. Suppose the opposite. Assume that there exists bk,μ(i)∈Fb such that
[TABLE]
Let wl=0 for some l∈[1,j] and let wk=0 for all k∈[1,l).
Using (3.9) - (3.11), we get
[TABLE]
Applying definition (2.11) of the Riemann-Roch space, we obtain
[TABLE]
But from (3.13), (3.8) and (3.11), we have
[TABLE]
We have a contradiction. Hence vectors from Vi,j are Fb linear independent.
By (3.9) - (3.12), we have Vi,j⊂Li,j and
[TABLE]
Hence vectors from Vi,j are the Fb linear basis of Li,j.
Now we will find a basis of Li,j−2g. We claim that uj,μ(i)∈/Li,j−2g
for μ∈[1,g]. Suppose the opposite. By (3.9) and (3.10), we get
[TABLE]
By (3.8), deg(T)=ni,j−2g+2g−1−ni,j<0. Hence L(T)={0}. We have a contradiction.
Bearing in mind that Vi,j is Fb linear basis of Li,j, we obtain that a basis of Li,j−2g can be chosen from the set (v1,1(i),...,v1,n˙i,1(i),...,vj,1(i),...,vj,n˙i,j(i))
=Vi,j∖{uj,μ(i)∣μ=1,...,g}.
From (3.9) - (3.11), we get
[TABLE]
Hence vectors
[TABLE]
1≤μ≤g, for some ρ∈[1,n˙i,k] and k∈(j−2g,j] are an Fb linear basis of Li,j−2g (0≤i≤s).
Therefore (vk,μ(i))1≤μ≤n˙i,k,k≥1 is the Fb linear basis of OF=∪j≥1Li,j.
We put in order the basis (vk,μ(i))1≤μ≤n˙i,k,k≥1 as follows
[TABLE]
So we proved the following lemma :
Lemma 1. For all i∈[0,s] there exists a sequence (wj(i))j≥0 such that
(wj(i))j≥0 is a Fb linear basis of OF and for all j≥1
a Fb linear basis of Li,j can be chosen from the set {w0(i),...,wni,j+2g−1(i)}.
Bearing in mind that (wj(i))j≥0 is the Fb linear basis of OF, we obtain for all i∈[1,s] and r≥0
that there exists cj,r(i)∈Fb and integers lr(i)
such that
[TABLE]
Let n=∑r≥0ar(n)br. We fix
a bijection ϕ:Zb→Fb with ϕ(0)=0ˉ. Then we define
[TABLE]
By (3.15), we have for i∈[0,s]
[TABLE]
where yn,j(i)=∑r≥0aˉr(n)cj,r(i)∈Fb, yn,j(0)=aˉj−1(n).
We map the vectors
[TABLE]
to the real numbers
[TABLE]
to obtain the point
[TABLE]
Theorem 3. With the notations as above,
the set [0,γ1)×...×[0,γs) is of bounded remainder with respect to (xn)n≥0 if and only if (1.2) is true.
Remark. It is easy to verify that Hellekalek’s sequence and our generalized Halton-type sequence (xn)n≥0 are l.d.s if
[TABLE]
3.4 Niederreiter-Xing sequence (see [DiPi, Section 8.3 ]).
Let F/Fb be an algebraic function field with full constant field Fb and
genus g.
Assume that F/Fb has at least s+1 rational places. Let P1,...,Ps+1 be s+1
distinct rational places of F. Let Gm=m(P1+...+Ps)−(m−g+1)Ps+1, and
let ti be a local parameter at Pi, 1≤i≤s+1.
For any f∈L(Gm) we have νPi(f)≥−m, and so the local
expansion of f at Pi has the form
[TABLE]
For 1≤i≤s, we define the Fb-linear map ψm,i:L(Gm)→Fbm
by
[TABLE]
Let
[TABLE]
Let C(1),...,C(s)∈Fb∞×∞ be the
generating matrices of a digital sequence xn(C)n≥0, and let (Cm)m≥1 be the associated sequence of
row spaces of overall
generating matrices [C]m, m=1,2,... (see (2.5)).
Theorem G. (see [DiPi, Theorem 7.26 and Theorem 8.9]) There exist matrices C(1),...,C(s)
such that (xn(C))n≥0 is a digital (t,s)-sequence with t=g and Cm⊥=Mm(P1,...,Ps;Gm) for m≥g+1, s≥2.
In [Le2, p.24], we proposed the following way to get xn(C)n≥0 :
We consider the H-differential dts+1. Let ω be the corresponding
Weil differential, div(ω) the divisor of ω, and W:=div(dts+1)=div(ω).
By (2.7)-(2.9), we have deg(W)=2g−2.
We consider a sequence v˙0,v˙1,... of elements of F such that {v˙0,v˙1,...,v˙ℓ((m−g+1)Ps+1+W)−1}
is an Fb linear basis of Lm:=L((m−g+1)Ps+1+W) and
[TABLE]
for 2≤j<r+2−g, where
[TABLE]
According to Lemma B, we have that there exists τi∈F
(1≤i≤s) such that dts+1=τidti,for1≤i≤s.
Bearing in mind (2.8), (2.10) and (3.20), we get
[TABLE]
We consider the following local expansions
[TABLE]
Now let C˙(i)=(c˙j,r(i))j−1,r≥0, 1≤i≤s,
and let (C˙m⊥)m≥1 be the associated sequence of
row spaces of overall
generating matrices [C˙]m, m=1,2,... (see (2.5)).
Theorem H (see [Le2, Theorem 5]). With the above notations,
(xn(C˙))n≥0 is a digital d−admissible (t,s) sequence
with d=g+s,
t=g, and
C˙m⊥=Mm(P1,...,Ps;Gm) for all m≥g+1.
We note that condition (3.20) is required in the proof of Theorem H only in order to get the discrepancy lower bound. While the equality C˙m⊥=Mm(P1,...,Ps;Gm) is true for arbitrary sequence v˙0,v˙1,... of elements of Fb such that
for all m≥1
[TABLE]
In order to obtain the bounded remainder property, in this paper, we will construct from (v˙n)n≥0 a special basis (v¨n)n≥0 as follows :
Let P0∈PF, P0=Pi (i=1,...,s+1), and let t0 be a local parameter of P0. For simplicity, we suppose that deg(P0)=1.
Let
[TABLE]
It is easy to verify that
[TABLE]
Using the Riemann-Roch theorem, we have that there exists
[TABLE]
According to Lemma B, we have that there exists τ0∈F,
such that dts+1=τ0dt0.
Let u∈Lm=L((m−g+1)Ps+1+W) with m≥0.
Bearing in mind (2.8), (2.10), (3.23)-(3.25) and the Riemann-Roch theorem, we get
[TABLE]
and
[TABLE]
We consider the sequence (v˙j)j≥0 (3.20).
By (3.22), (v˙j)j=0m−1 is an Fb linear basis of Lm.
Let
[TABLE]
It is easy to verify that α(j)=α(j) for i=j.
We construct a sequence (v¨j)j≥0 as follows :
[TABLE]
It is easy to see that (v¨j)j≥0 satisfy the condition (3.22).
Bearing in mind (3.26)-(3.28) and that v¨j∈Lm for j<m, we get
[TABLE]
Hence, for all f∈Lm, we have
[TABLE]
Taking into account (3.27) and (3.30), we obtain
[TABLE]
Suppose that α(j)>j+g. By (3.22) - (3.24), v¨j∈Lj+1=L((j−g+2)Ps+1+W). Hence v¨j∈L(X), with X=(j−g+2)Ps+1+W−(j+g+1)P0.
Bearing in mind that deg(P0)=deg(Ps+1)=1 and deg(W)=2g−2, we get deg(X)=−1. Therefore L(X)={0} and we have a contradiction.
Hence
[TABLE]
By (3.31), we have that for every integer k≥0 there exists r≥0 with α(r)=k. Therefore the map α:N0→N0 is an isomorphism.
Hence there exist integers β(k)≥0 such that
[TABLE]
From (3.32), we get for j=β(k)
[TABLE]
Let
[TABLE]
Taking r=β(k), we get α(r)=k and
[TABLE]
Suppose j∈/Bj+g+1 for some j, then j=β(j+g+l)
for some l≥1.
Using (3.34) with k=j+g+l, we obtain
[TABLE]
We have a contradiction. Hence
[TABLE]
We consider the local expansion (3.21), applied to i=0 :
[TABLE]
Let (xn(0)(C˙(0)))n≥0 be the digital sequence generated by the matrix C˙(0).
Now we consider the matrix C~(i)=(c˙j,r(i))j−1,r≥0, obtained from
equation (3.21) and (3.37), where we take v¨r instead of v˙r (i=0,1,...,s).
Using Theorem H, we obtain that (xn(0)(C~(0)),xn(C~))n≥0 is the digital (t,s+1)-sequence with t=g.
Therefore we have proved the following lemma :
Lemma 2. *There exists a sequence (v¨j)j≥0 such that
(xn(0)(C~(0)),xn(C~))n≥0 is the digital (t,s+1)-sequence with t=g and {0,1,...,m−1}⊂Bm+g.
*In §4.4, we will prove
Theorem 4. With the notations as above,
the set [0,γ1)×...×[0,γs) is of bounded remainder with respect to (xn(C~))n≥0 if and only if (1.2) is true.
4 Proof
Consider the following condition
[TABLE]
We will prove (4.1) for the generalized Halton sequence in §4.3. For other considered sequences,
assertion (4.1) follows from Theorem D, Theorem E and Theorem H.
The sufficient part of all considered theorems follows from Definition 2 and (4.1).
Therefore we need only consider the case of necessity.
4.1 Generalized Niederreiter sequence. Proof of Theorem 1.
From Theorem D, we have that (xn)n≥0 is the uniformly distributed digital
weakly admissible (t,s)-sequence in base b. By Theorem B, in order to prove Theorem 1, we need only to check condition (2.6). By ( Le2, p.26, ref 4.6 ), we get
[TABLE]
[TABLE]
We take y˙i,j,k(x)=xmyi,j,k(x) instead of yi,j,k(x).
Now using Theorem D, we obtain from (4.2), (2.2) - (2.4) that (x˙n)0≤n<bm˙ is a (t,m˙,s) net for m˙=sτm+t with x˙n,j(i)=ϕ−1(y˙n,j(i))=xbmn,j(i).
Bearing in mind that x˙n=xbmn, we obtain (2.6).
Hence Theorem 1 is proved.
4.2 Xing-Niederreiter sequence. Proof of Theorem 2.
By Theorem B and Theorem E, in order to prove Theorem 2, we need only to check condition (2.6).
From (2.1) - (2.4), we get that in order to obtain (2.6), it suffices to prove that
[TABLE]
m0=2g+2+e1+⋯+es, for all uj(i)∈Fb.
Let
[TABLE]
Let kj+1(0)=zh(j)=zh(j) for j∈H1 with
H1=N0∖H2={h(0),h(1),...}, H2={n0,n1,...,ng}.
From (3.3), we have
[TABLE]
Let cj,r(0):=aj,h(r)(0). By (2.2), (2.3) and (3.6), we get
[TABLE]
So, we obtain a digital s+1-dimensional sequence (xn(0),xn)n≥0.
Let n=∑r=0M−1ar(n)br and let
[TABLE]
By (2.2), (3.4) and (4.4), we get
[TABLE]
We fix n~∈U¨. Let
[TABLE]
It is easy to verify that statement (4.3) follows from the next assertion
[TABLE]
Taking into account that yn,j(i)=yn˙,j(i)+yn¨,j(i), we get
[TABLE]
where u˙j(i)=u˙j(i)−yn~,j(i).
According to (2.2), (3.4) and (4.4),
in order to prove (4.6) , it suffices to show that the vectors
[TABLE]
di=τm, 1≤i≤s and d0=m, are linearly independent over Fb.
To prove this statement, we closely follow [DiPi, p.282].
Suppose that we have
[TABLE]
for some fj(i)∈Fb with ∑j=1m∣ϕ−1(fj(0))∣+∑i=1s∑j=1τm∣ϕ−1(fj(i))∣>0.
We put fr(0)=0 for r>m. Hence
[TABLE]
By (3.4) and (4.4), we obtain cj,r(i)=aj,h(r)(i) for 1≤i≤s and cj,r(0)=δ(j−1=h(r)). Therefore
[TABLE]
forr∈[0,M).
Now consider the element α∈Fb given by α=α1+α2, where
[TABLE]
Using (3.3), we get
[TABLE]
From (3.4), (4.8) and (4.9), we obtain
[TABLE]
Hence
[TABLE]
Furthermore, (3.1), (3.2), (3.6), (4.4) and (4.9) yield
[TABLE]
Combining (4.10) and (4.11), we obtain
[TABLE]
But from (4.3), we have
[TABLE]
Hence
[TABLE]
by (2.12) and therefore we have α=0.
By (3.1), we have νP0(kj(i))≥0 and νP0(wu)≥0 for all i,j,u.
According to (4.9), we get νP0(α2)≥0.
Suppose that α1=0.
Taking into account that z0=zn0=w0=zh(r) for r≥0, we obtain from (4.9) that νP0(α1)<0. We have a contradiction. Hence α1=0 and α2=0. From Lemma C, we conclude that fj(i)=0 for all
i,j.
Hence the system (4.7) is linearly independent over Fb.
Thus (4.3) is true and (xn)n≥0 satisfies the condition (2.6).
By Theorem E, (xn)n≥0
is the d−admissible uniformly distributed digital (t,s)-sequence in base b.
Applying Theorem B, we get the assertion of Theorem 2.
**4.3 Generalized Halton-type sequence. Proof of Theorem 3.
Lemma 3.** *The sequence (xn)n≥0 is uniformly distributed in [0,1)s .
*Proof. By Lemma A, in order to prove Lemma 3, it suffices to show that m−T(m)→∞ for
m→∞.
Let Rk=max1≤i≤sni,k, k=1,2,... . We define ji,k from the following condition
ni,ji,k≥Rk>ni,ji,k−1.
Let R~k=∑i=1sni,ji,k.
We consider the definition of (t,m,s) net.
Suppose that for all
[TABLE]
1≤i≤s,d1+⋯+ds=Rk, we have
[TABLE]
j∈[1,di],i∈[1,s].
By Definition 2, we get that (xn)n≥0 is a (T,s)-sequence in base b with m−R(k)≥T(m) for m≥R~k+(3g+3)e0.
Bearing in mind that R(k)→∞ for k→∞, we obtain the assertion of Lemma 4.
Taking into account that di≤Rk≤ni,ji,k for 1≤i≤s, we get that in order to prove (4.12), it suffices to verify that
[TABLE]
for all uj(i)∈Fb, with j∈[1,ni,ji,k],i∈[1,s].
Let M=(m0e0+2g−1)P∞ with m0=[m/e0]−2g−1.
By Lemma 1, we obtain that there exist sets H1 and H2 such that H1∪H2={0,1,...,m−1}, H1∩H2=∅, (wr(0))r∈H1 is the Fb linear basis of L(M) and #H2=m−m0e0−g=:g1, with g1−e0(2g+1)−g∈[0,e0).
Let n=∑r=0m−1ar(n)br and let
[TABLE]
So
[TABLE]
We fix n~∈U¨. Let
[TABLE]
It is easy to see that statement (4.13) follows from the next assertion
[TABLE]
Taking into account that yn,j(i)=yn˙,j(i)+yn¨,j(i), we get
[TABLE]
where u˙j(i)=u˙j(i)−yn~,j(i).
Let
[TABLE]
We consider the map ψ˘:L(M)→FbR~k
defined by
[TABLE]
Note that ψ˘ is a linear transformation between vector spaces over Fb.
It is clear that in order to prove (4.14), it suffices to verify that ψ˘ is
surjective.
To prove this, it is enough to show that
[TABLE]
Using (3.9), (3.11) and (3.14), we get that wl(i)≡0(modPi,ji,k) for
l≥ni,ji,k.
By (3.9), (3.11), (3.14), and (3.17), we derive that yn,j(i)=0 for all j∈[1,ni,ji,k] if and only if f˙=fn≡0(modPi,ji,k) for i∈[1,s].
From the definition of ψ˘ it is clear that
[TABLE]
Using Riemann-Roch’s theorem, we obtain that dim(M)=m0e0+g=m−g1, where
deg(M)=m0e0+2g−1 and
[TABLE]
Hence dim(ker(ψ))=m−R~k−g1≥(3g+3)e0−g1≥(3g+3)e0−(2g+2)e0−g≥1, dim(M)=m−g1 and (4.15) follows.
So ψ˘ is indeed surjective. Therefore (4.14) and Lemma 3 are proved.
Lemma 4. *The sequence (xn)n≥0 satisfies condition (2.6).
*Proof. Let
[TABLE]
for i∈[1,s], n0,j0,m=([m/e0]+1)e0 j0,m=[m/e0]+1.
Bearing in mind that yn,j(0)=aˉj−1(n), (j=1,2,...),
we get from (3.18) - (3.19), that in order to obtain (2.6), it suffices to prove that
[TABLE]
for all uj(i)∈Fb.
Let M=(([M1/e0]+1)e0+2g−1)P∞. By (3.8), deg(P∞)=1. Hence deg(M)=([M1/e0]+1)e0+2g−1. Using Riemann-Roch’s theorem, we obtain that
[TABLE]
By Lemma 1, we get that an Fb linear basis of L(M) can be chosen from the set {w0(0),...,wM−1(0)} with M=([M1/e0]+3g+1)e0=n0,[M1/e0]+3g+1.
Let n=∑r=0M−1ar(n)br and let fn=∑r=0M−1aˉr(n)wr(0).
We get that for all f˙∈L(M) there exists n∈[0,bM) such that f˙=fn.
From (3.17), we have
[TABLE]
Let
[TABLE]
Consider the map ψ˙:L(M)→FbM1
defined by
[TABLE]
We see that in order to obtain (4.17), it suffices to verify that ψ˙ is
surjective.
To prove this, it suffices to show that
[TABLE]
Using (3.9), (3.11) and (3.14), we get that wk(i)≡0(modPi,ji,m) for k>ni,m.
From (4.19), (3.9), (3.11) and (3.14), we derive that yn,j(i)=0 for all j∈[1,ni,ji,m] if and
only if fn≡0(modPi,ji,m) for i∈[0,s].
From the definition of ψ˙ it is clear that
[TABLE]
Using (4.16), (4.18), (3.8) and Riemann-Roch’s theorem, we obtain that
[TABLE]
and dim(ker(ψ))=g1+g. By (4.18), dim(M)=M1+g1+g. Hence
\dim\big{(}\mathcal{L}(\mathcal{M})/{\rm ker}(\dot{\psi})\big{)}=M_{1}. Therefore (4.21) is true.
So ψ is indeed surjective and (4.17) follows. Therefore Lemma 4 is proved.
Lemma 5. The sequence (xn)n≥0 is weakly admissible.
Proof. Suppose that xn(i)=xk(i) for some i,n,k. From (4.20) and
(3.18)-(3.19), we get that
yn,j(i)=yk,j(i) for j≥1.
Using (4.19), we have
[TABLE]
Hence fn=fk. Taking into account that (wr(0))r≥0 is an Fb linear basis of OF, we obtain from (3.16), that n=k. By Definition 7, Lemma 5 is proved.
Applying Theorem B, we get the assertion of Theorem 3.
4.4 Niederreiter-Xing sequence. Proof of Theorem 4.
Similarly to the proof of Lemma 5, we get that (xn)n≥0 is weakly admissible.
By Lemma 2, (xn)n≥0 is the digital uniformly distributed sequence.
According to (2.2), (2.3), (2.6) and Theorem B, in order to prove Theorem 4,
it is enough to verify that
[TABLE]
for all uj(i)∈Fb, where M=sτm+m+2g+2.
Bearing in mind that by Lemma 2 (xn(0),xn)n≥0 is a (g,s+1) sequence, we obtain
[TABLE]
for all uj(i)∈Fb.
Therefore, in order to prove (4.22), it suffices to verify that
[TABLE]
Now we will prove (4.23) :
From (3.21) and (3.29), we have
v¨rτ˙0=∑j≥1c˙j,r(0)t0j−1 with
νP0(v¨rτ0)=α(r). Hence
c˙j,r(0)=0 for j≤α(r) and c˙j,r(0)=0 for j=α(r)+1.
Using (2.2), (3.33) and (3.35) we obtain c˙j,β(j−1)(0)=0 and
[TABLE]
We apply induction and consider the case j=1.
By (3.36), we see that aˉβ(0)(n)=0 if yn,1(0)=0. Suppose that
aˉβ(0)(n)=⋯=aˉβ(l−1)(n)=0
if yn,1(0)=⋯=yn,l(0)=0 for some l≥1 .Now let yn,1(0)=⋯=yn,l(0)=yn,l+1(0)=0.
We see
[TABLE]
Bearing in mind that c˙l+1,β(l)(0)=0, we get aˉβ(l)(n)=0.
Therefore if yn,j(0)=0
for all 1≤j≤m+g+1, then aβ(j−1)(n)=0 for all 1≤j≤m+g+1.
Using Lemma 2, we get
ar(n)=0 for all 0≤r≤m−1.
Hence (4.23) is true and Theorem 4 follows.
Aknowledgment. Parts of this work were started at the Workshop ”Discrepancy
Theory and Quasi-Monte Carlo methods” held at the Erwin Schrödinger Institute,
September 25 - 29, 2017.