Faber Systems and Their Use in Sampling, Discrepancy, Numerical Integration

EMS Series of Lectures in Mathematics
Edited by Andrew Ranicki (University of Edinburgh, U.K.)
EMS Series of Lectures in Mathematics is a book series aimed at students, professional

mathematicians and scientists. It publishes polished notes arising from seminars or lecture series
in all fields of pure and applied mathematics, including the reissue of classic texts of continuing
interest. The individual volumes are intended to give a rapid and accessible introduction into
their particular subject, guiding the audience to topics of current research and the more
advanced and specialized literature.
Previously published in this series:

Katrin Wehrheim, Uhlenbeck Compactness
Torsten Ekedahl, One Semester of Elliptic Curves
Sergey V. Matveev, Lectures on Algebraic Topology
Joseph C. Várilly, An Introduction to Noncommutative Geometry
Reto Müller, Differential Harnack Inequalities and the Ricci Flow
Eustasio del Barrio, Paul Deheuvels and Sara van de Geer, Lectures on Empirical Processes
Iskander A. Taimanov, Lectures on Differential Geometry
Martin J. Mohlenkamp and María Cristina Pereyra, Wavelets, Their Friends, and What They
Can Do for You
Stanley E. Payne and Joseph A. Thas, Finite Generalized Quadrangles
Masoud Khalkhali, Basic Noncommutative Geometry
Helge Holden, Kenneth H. Karlsen, Knut-Andreas Lie and Nils Henrik Risebro, Splitting Methods
for Partial Differential Equations with Rough Solutions
Koichiro Harada, “Moonshine” of Finite Groups
Yurii A. Neretin, Lectures on Gaussian Integral Operators and Classical Groups
Damien Calaque and Carlo A. Rossi, Lectures on Duflo Isomorphisms in Lie Algebra and
Complex Geometry
Claudio Carmeli, Lauren Caston and Rita Fioresi, Mathematical Foundations of Supersymmetry
Hans Triebel
Faber Systems and

Their Use in Sampling,
Discrepancy,
Numerical Integration
Author:
Hans Triebel
Friedrich-Schiller-Universität Jena
Fakultät für Mathematik und Informatik
Mathematisches Institut
07737 Jena
Germany
E-mail: hans.triebel@uni-jena.de
2010 Mathematics Subject Classification: 46-02, 46E35, 42C40, 42B35, 68Q17, 41A55
Key words: Function spaces, Haar bases, Faber bases, Faber frames, numerical integration, discrepancy
ISBN 978-3-03719-107-1
The Swiss National Library lists this publication in The Swiss Book, the Swiss national bibliography,
and the detailed bibliographic data are available on the Internet at http://www.helveticat.ch.
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting,
reproduction on microfilms or in other ways, and storage in data banks. For any kind of use permission
of the copyright owner must be obtained.
© 2012 European Mathematical Society
Contact address:
European Mathematical Society Publishing House
Seminar for Applied Mathematics
ETH-Zentrum SEW A27
CH-8092 Zürich
Switzerland
Phone: +41 (0)44 632 34 36
Email: info@ems-ph.org
Homepage: www.ems-ph.org
Typeset using the author’s TEX files: I. Zimmermann, Freiburg

Printing and binding: Beltz Bad Langensalza GmbH, Bad Langensalza, Germany
∞ Printed on acid free paper
987654321
Preface
This book is the continuation of [T10]. A corresponding more detailed description

is given in the Introduction, Section 1.1, and in Section 1.4. Otherwise we tried to
make this text independently readable. For this purpose we provide in Chapter 1
notation, definitions, basic assertions and related references. The short Chapter 2
deals with discrepancy for Besov spaces on intervals. However it is the main aim
of this book to extend our assertions about sampling and numerical integration from
unweighted spaces on intervals and domains in Rn (preferably cubes) to corresponding
weighted spaces. Chapter 3 deals with weighted spaces on the real line. Corresponding
considerations in higher dimensions are based on weighted spaces of Besov–Sobolev
type with dominating mixed smoothness. This will be done in Chapter 4. We always
rely on Haar bases, Faber bases and Faber systems of higher smoothness.
Formulas are numbered within chapters. Furthermore in each chapter all defini-
tions, theorems, propositions, corollaries and remarks are jointly and consecutively
numbered. Chapter n is divided in sections n:k and subsections n:k:l. But when
quoted we refer simply to Section n:k or Section n:k:l instead of Section n:k or Sub-
section n:k:l. If there is no danger of confusion (which is mostly the case) we write
s r s r s r s r
Bpq , Spq B, …, bpq , spq b, … (spaces) instead of Bp;q , Sp;q B, …, bp;q , sp;q b, ….
Similarly aj m , j m , Qkm (functions, numbers, rectangles) instead of aj;m , j;m , Qk;m
etc. References ordered by names, not by labels, which roughly coincides, may oc-
casionally cause minor deviations. The numbers behind the items in the Bibliography
mark the page(s) where the corresponding entry is quoted (with the exception of [T10]);
log is always taken to base 2. All unimportant positive constants will be denoted by
c (with additional marks if there are several c’s in the same formula). To avoid any
misunderstanding we fix our use of (equivalence) as follows. Let I be an arbitrary
index set. Then
ai bi for i 2 I (equivalence)
for two sets of positive numbers fai W i 2 I g and fbi W i 2 I g means that there are
two positive numbers c1 and c2 such that
c1 ai bi c2 ai for all i 2 I:
It is my pleasure to thank Erich Novak for many stimulating discussions and

Dorothee D. Haroke for her remarks and for producing all the figures.
Jena, Winter 2011 Hans Triebel

Contents
Preface v
List of Figures viii
1 Introduction, definitions, basic assertions 1

1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Function spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.3 Numbers measuring compactness and approximation . . . . . . . . . 10
1.4 Background, motivations, aims, proposals . . . . . . . . . . . . . . . 17
2 Spaces on intervals 31
2.1 Some preparations . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.2 Discrepancy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
3 Spaces on the real line 43

3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
3.2 Haar and Faber bases . . . . . . . . . . . . . . . . . . . . . . . . . . 44
3.3 Sampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
3.4 Faber splines and sampling . . . . . . . . . . . . . . . . . . . . . . . 58
3.5 Integration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
3.6 Weighted target spaces . . . . . . . . . . . . . . . . . . . . . . . . . 68
4 Spaces on the plane 77

4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
4.2 Haar and Faber bases . . . . . . . . . . . . . . . . . . . . . . . . . . 77
4.3 Sampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
4.4 Integration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
4.5 Higher dimensions . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
Bibliography 101
Symbols 105
Index 107
List of Figures
1 Weighted spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
2 Faber bases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3 Sampling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
4 Faber splines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
1
Introduction, definitions, basic assertions
1.1 Introduction
This book is the continuation of some parts of [T10]. To be a little bit more precise we
recall first a few special cases of [T10], whereas detailed definitions and explanations
will be given later on.
Let I D .0; 1/ be the unit interval on R and Q2 D .0; 1/2 be the unit square in R2 .
r
Let Bpq .I / be the usual Besov spaces on I and Lu .I / be the usual Lebesgue spaces.
Then the embedding
r 1 1
id1 W Bpq .I / ,! Lu .I /; 1 u p 1; < r < C 1; (1.1)
p p
0 < q 1, is compact and one has
gk .id1 / gklin .id1 / k r ; k 2 N; (1.2)
for the corresponding sampling numbers gk and linear sampling numbers gklin , [T10,
pp. 185–86], as far as a constructive proof in terms of Faber bases is concerned. We
r
explained our use of in the Preface. Let Spq B.Q2 / be the usual Besov spaces with
dominating mixed smoothness on Q and let Lu .Q2 / be the usual Lebesgue spaces.
2
Then the embedding

r 1 1
id2 W Spq B.Q2 / ,! Lu .Q2 /; 1 u p < 1; <r <1C ; (1.3)
p p
1 q < 1, is compact and one has
1 1
c1 k r .log k/1 q gk .id2 / gklin .id2 / c2 k r .log k/rC1 q (1.4)
for some c1 > 0, c2 > 0 and 2 k 2 N, [T10, p. 195]. If u D 1 in (1.1), (1.3) then
r r
gklin is near to the integral numbers Int k .Bpq .I // and Int k .Spq B.Q2 // measuring the
degree of approximation of corresponding integrals on I and on Q2 if evaluated at k
points. In particular,
r 1 1
Intk .Bpq .I // k r ; 1 p 1; <r <1C ; (1.5)
p p
0 < q 1, k 2 N, [T10], p. 226, as far as a constructive proof in terms of Faber
bases is concerned, and
1 1
c1 k r .log k/1 q Intk .Spq
r
B.Q2 // c2 k r .log k/rC1 q (1.6)
2 1 Introduction, definitions, basic assertions
with
1 1
1 p < 1; < r < C 1; 1 q < 1; (1.7)
p p
2 k 2 N, [T10, p. 234]. Finally we recall that one has
r 1 1
disck .Bpq .I // k r1 ; 1 p 1; 1<r < ; (1.8)
p p
r
0 < q 1, for the discrepancy numbers measuring in Bpq .I / the deviation of k 2 N
points in I from uniformity, [T10, p. 264]. There are similar assertions with the Sobolev
spaces
Wp1 .I / in place of Bpq
r
.I / and Sp1 W .Q2 / in place of Spq
r
B.Q2 /: (1.9)
It is the main aim of this book to remove some unnatural restrictions and to extend
these considerations to other cases. First we stick at spaces on R. If one replaces
I in (1.1) by R then the corresponding embedding is no longer compact (even not
continuous if u < p). The situation is different if one deals with weighted Besov
s
spaces Bpq .R; ˛/ where ˛ indicates a weight function w˛ .x/ D .1 C x 2 /˛=2 , ˛ > 0.
Then
r 1 1 1 1
id1 W Bpq .R; ˛/ ,! Lu .R/; u 1; 0 < C ˛; r > ; (1.10)
p u p p
is compact and it makes sense to ask for counterparts of (1.2), (1.5) under the additional
restriction r < 1 C p1 . For this purpose we extend in Chapter 3 Haar bases and Faber
bases for Sobolev–Besov spaces on I to corresponding weighted spaces on R. The
restriction r > p1 in the above equivalences and inequalities is natural. It ensures that
the corresponding spaces are embedded in C.I / or C.R/. But the restriction r < 1C p1
is not natural and depends on our use of Faber bases. In Chapter 3 we switch from Faber
bases to higher order Faber systems. Then we can deal with sampling numbers and
also with corresponding integral numbers for all embeddings of type (1.10). However
before weighted spaces will be considered in detail we return in Chapter 2 to spaces
on I removing the restriction r > p1 1 for the discrepancy numbers in (1.8). This is
somewhat surprising and requires some efforts. In other words, (1.8) remains valid for
all 1 < r < 1=p. Finally we deal in Chapter 4 with weighted spaces of type
r
Spq B.R2 ; ˛/ with weights w ˛ .x/ D .1 C x12 /˛=2 .1 C x22 /˛=2 : (1.11)
We ask for Haar bases and Faber bases in these spaces and for counterparts of (1.4)
and (1.6).
In contrast to [T10] we always assume that 1 u p in the above formulas. But
this is a technical matter and simplifies some arguments especially in case of weighted
spaces. But there is little doubt that one can combine the techniques developed in
[T10] and for weighted spaces on the one hand with the new arguments in this book.
But this will not be done. Some related comments may be found in the proposals in
Section 1.4.4.
1.2 Function spaces 3
1.2 Function spaces

1.2.1 Unweighted isotropic spaces. We use standard notation. Let N be the collec-
tion of all natural numbers and N0 D N [ f0g. Let Rn be Euclidean n-space where
n 2 N. Put R D R1 , whereas C is the complex plane. Let S.Rn / be the usual
Schwartz space and S 0 .Rn / be the space of all tempered distributions on Rn . Further-
more, Lp .Rn / with 0 < p 1 is the standard quasi-Banach space with respect to the
Lebesgue measure in Rn , quasi-normed by
Z 1=p
kf jLp .Rn /k D jf .x/jp dx (1.12)
Rn
with the usual modification if p D 1. As usual, Z is the collection of all integers;

and Zn where n 2 N, denotes the lattice of all points m D .m1 ; : : : ; mn / 2 Rn with
mj 2 Z. Let Nn0 where n 2 N be the set of all multi-indices,
n
X
˛ D .˛1 ; : : : ; ˛n / with ˛j 2 N0 and j˛j D ˛j : (1.13)
j D1
We use the standard abbreviation

@j˛j
D˛ D :
@x1˛1 : : : @xn˛n
If ' 2 S.Rn / then

Z
y
'./ D .F '/./ D .2/n=2 e ix '.x/ dx; 2 Rn ; (1.14)
Rn
denotes the Fourier transform of '. As usual, F 1 ' and ' _ stand for the inverse
Fourier transform, given by the right-hand side of (1.14) with i in place of i . Here
x denotes the scalar product in Rn . Both F and F 1 are extended to S 0 .Rn / in the
standard way. Let '0 2 S.Rn / with
'0 .x/ D 1 if jxj 1 and '0 .y/ D 0 if jyj 3=2; (1.15)
and let
'k .x/ D '0 .2k x/ '0 .2kC1 x/; x 2 Rn ; k 2 N: (1.16)
Since
1
X
'j .x/ D 1 for x 2 Rn ; (1.17)
j D0
the 'j form a dyadic resolution of unity. Recall that .'j fO/_ are entire analytic functions
in Rn for any f 2 S 0 .Rn /. In particular, .'j fO/_ .x/ makes sense pointwise in Rn .
Definition 1.1. Let ' D f'j gj1D0 be the above dyadic resolution of unity.
(i) Let
0 < p 1; 0 < q 1; s 2 R: (1.18)
s
Then Bpq .Rn / is the collection of all f 2 S 0 .Rn / such that
X
1 1=q
s
kf jBpq .Rn /k' D 2jsq k.'j fO/_ jLp .Rn /kq <1 (1.19)
j D0
(with the usual modification if q D 1).

(ii) Let
0 < p < 1; 0 < q 1; s 2 R: (1.20)
s
Then Fpq .Rn / 0 n
is the collection of all f 2 S .R / such that
X
1 1=q

kf s
jFpq .Rn /k' D 2jsq j.'j fO/_ . /jq jLp .Rn / < 1 (1.21)
j D0

Remark 1.2. The theory of these spaces and their history may be found in [T83], [T92],
[T06]. In particular these spaces are independent of admitted resolutions of unity '
according to (1.15)–(1.17) (equivalent quasi-norms). This justifies our omission of the
subscript ' in (1.19) and (1.21) in the sequel. We took over the above definition from
[T10, pp. 1–2] (recall that these notes might be considered as the direct continuation of
some parts of [T10]). In [T10, pp. 3–4] we discussed some special cases and properties.
We recall a few of them as far as they are of some use later on.
(i) Let 1 < p < 1. Then
Lp .Rn / D Fp;2
0
.Rn /: (1.22)
Let, in addition, k 2 N0 . Then
Wpk .Rn / D Fp;2

k
.Rn / (1.23)
are the classical Sobolev spaces usually equivalently normed by

X 1=p
kf jWpk .Rn /k D kD ˛ f jLp .Rn /kp : (1.24)
j˛jk
(ii) We denote
C s .Rn / D B1;1
s
.Rn /; s 2 R; (1.25)
as Hölder–Zygmund spaces. Let
.1h /.x/ D f .x C h/ f .x/; .lC1

h
f /.x/ D 1h .lh f /.x/; (1.26)
where x 2 Rn , h 2 Rn , l 2 N, be the iterated differences in Rn . Let 0 < s <

m 2 N. Then
kf jC s .Rn /km D sup jf .x/j C sup jhjs jm

h f .x/j; (1.27)
x2Rn
where the second supremum is taken over all x 2 Rn and all h 2 Rn with
0 < jhj 1, are equivalent norms in C s .Rn /.
(iii) This assertion can be generalised as follows. Once more let 0 < s < m 2 N and
1 p; q 1. Then
Z

n q dh
1=q
s
kf jBpq .Rn /km D kf jLp .Rn /k C jhjsq m
h f jLp .R /
jhj1 jhjn
(1.28)
and
Z 1=q
1
n q dt
kf s
jBpq .Rn /km n
D kf jLp .R /k C t sq
sup mh f jLp .R /
0 jhjt t
(1.29)
s
(with the usual modification if q D 1) are equivalent norms in Bpq .Rn /. These
are the classical Besov spaces. We refer to [T92, Chapter 1] and [T06, Chapter 1]
where one finds the history of these spaces, further special cases and classical
assertions. As far as isotropic spaces are concerned we are mainly interested
s
in these notes in the spaces Bpq .R/, C s .R/ and Wp1 .R/, there restrictions on
intervals, and their weighted counterparts.
1.2.2 Weighted isotropic spaces. Let w be a real C 1 function in Rn such that for
all 2 Nn0 and suitable positive numbers c ,
jD w.x/j c w.x/ for all x 2 Rn (1.30)

and
0 < w.x/ c w.y/.1 C jx yj2 /˛=2 for all x 2 Rn ; y 2 Rn ; (1.31)
s
for some constants c > 0 and ˛ 0. Let Apq s
.Rn / be either Bpq .Rn / or Fpq
s
.Rn /,
hence A 2 fB; F g, with s, p, q as in Definition 1.1. We are mainly interested in the
distinguished cases
w˛ .x/ D .1 C jxj2 /˛=2 ; ˛ 2 R; x 2 Rn : (1.32)
Definition 1.3. Let

0 < p 1; 0 < q 1; s 2 R; (1.33)
with p < 1 for F -spaces.
s
(i) Let w be the above weight function. Then Apq .Rn ; w/ is the collection of all
0 n
f 2 S .R / such that
s
kf jApq .Rn ; w/k D kwf jApq
s
.Rn /k < 1: (1.34)
(ii) Let ˛ 2 R and w˛ be as in (1.32). Then
s
Apq .Rn ; ˛/ D Apq
s
.Rn ; w˛ /: (1.35)
Remark 1.4. Let Lp .Rn ; w/ with 0 < p 1 be the usual Lebesgue spaces quasi-
normed by
Z 1=p
n n p p
kf jLp .R ; w/k D kwf jLp .R /k D w .x/jf .x/j dx (1.36)
Rn
according to (1.12) with the usual modification if p D 1. The theory of the spaces
s
Apq .Rn ; w/ began in the mid 1980s. One may consult [ST87, Section 5.1], the literature
mentioned there, and [HaT94a], [HaT94b], [ET96], where we replaced Lp .Rn / in
(1.19), (1.21) by Lp .Rn ; w/, hence
X
1
q 1=q
s
kf jBpq .Rn ; w/k' D 2jsq .'j fO/_ jLp .Rn ; w/ (1.37)
j D0
and an F -counterpart. It was one of the first non-trivial observations that these spaces
can be equivalently defined by (1.34). The shortest proof (and also the history of this
assertion) may be found in [ET96, Section 4.2.2, pp. 156–160], based on [HaT94a].
We prefer the above version which is convenient for our later intentions to introduce
weighted spaces with dominating mixed smoothness. It comes out that the character-
s
isations of the spaces Apq .Rn / in terms of atoms, local means, wavelets etc. can be
s n
extended to Apq .R ; w/ with the same smoothness restrictions as for the unweighted
case. We refer to [T06, Chapter 6] and [T08, Section 1.2.3]. This applies also to Haar
s
and Faber bases and will be considered below for the spaces Bpq .R; ˛/ according to
(1.35) with n D 1 (real line). Otherwise one has similar characterisations of special
cases as described in Remark 1.2 for the unweighted case. In particular if 1 < p < 1
and k 2 N0 , then
Wpk .Rn ; w/ D Fp;2k
.Rn ; w/ (1.38)
are the weighted classical Sobolev spaces which can be equivalently normed by
X 1=p
kf jWpk .Rn ; w/k D kD ˛ f jLp .Rn ; w/kp : (1.39)
j˛jk
s
Also the characterisations (1.28) of Bpq .Rn /
can be extended to the weighted case. In
other words, if 0 < s < m 2 N and 1 p; q 1, then
Z
q dh 1=q
s
kf jBpq .Rn ; w/km D kf jLp .Rn ; w/kC jhjsq m
h f jL p .Rn
; w/
jhjn
jhj1
(1.40)
s
is an equivalent norm in Bpq .Rn ; w/. Details and references may be found in [T06,
Section 6.1.4, pp. 267–68].
1.2.3 Spaces with dominating mixed smoothness. We dealt in [T10] with sampling,
r
numerical integration and discrepancy for spaces Spq A.Qn /, A 2 fB; F g, with dom-
inating mixed smoothness in the unit cube Q D .0; 1/n , mostly restricted to n D 2,
n
hence spaces on the square Q2 D .0; 1/2 . The extension of these considerations from
Q2 to R2 requires corresponding weighted spaces. Here are the necessary definitions.
Let fO and f _ be the Fourier transform and its inverse in S 0 .R2 / as introduced in
Section 1.2.1. Let '0 2 S.R/ with
'0 .t / D 1 if jt j 1 and '0 .v/ D 0 if jvj 3=2; (1.41)
and
'l .t / D '0 .2l t / '0 .2lC1 t /; t 2 R; l 2 N; (1.42)
be the one-dimensional resolution of unity according to (1.15)–(1.17). Let
'k .x/ D 'k1 .x1 /'k2 .x2 /; k D .k1 ; k2 / 2 N20 ; x D .x1 ; x2 / 2 R2 : (1.43)
Since X
'k .x/ D 1 for x 2 R2 ; (1.44)
k2N2
0
the 'k form a resolution of unity. Recall that the entire analytic functions .'k fO/_ .x/
make sense pointwise in R2 for any f 2 S 0 .R2 /. The counterpart of Definition 1.1
reads now as follows.
Definition 1.5. Let ' D f'k gk2N2 be the above dyadic resolution of unity.
0
(i) Let
0 < p 1; 0 < q 1; r 2 R: (1.45)
r
Then Spq B.R2 / is the collection of all f 2 S 0 .R2 / such that
X 1=q
r
kf jSpq B.R2 /k' D 2r.k1 Ck2 /q k.'k fO/_ jLp .R2 /kq <1 (1.46)
k2N2
0

(ii) Let
0 < p < 1; 0 < q 1; r 2 R: (1.47)
r
Then Spq F .R2 / 0
is the collection of all f 2 S .R / such that2
X 1=q

r
kf jSpq F .R2 /k' D 2r.k1 Ck2 /q j.'k fO/_ . /jq jLp .R2 / < 1 (1.48)
k2N2
0

Remark 1.6. This formulation coincides with [T10, Definition 1.38, p. 23]. We col-
r
lected in [T10, Section 1.2, pp. 22–50] basic material about the spaces Spq A.R2 / with
A 2 fB; F g and their restrictions to domains, especially the square Q2 D .0; 1/2 , in-
cluding atomic representations, wavelet expansions and local means. This will not be
r
repeated here. We only mention that the spaces Spq A.R2 / are independent of '. Spaces
with dominating mixed smoothness have a long history. K. I. Babenko, [Bab60], and
S. M. Nikol’skij, [Nik62], [Nik63] introduced in the early 1960s the Sobolev spaces
with dominating mixed smoothness
Spr W .R2 / D ff 2 Lp .R2 / W kf jSpr W .R2 /k < 1g (1.49)
for 1 < p < 1, r 2 N, with
2 r
X @2r f
@ f
kf jSpr W .R2 /k D kf jLp .R2 /k C r jLp .R2 / C r r jLp .R2 /
@xl @x1 @x2
lD1
X
kD f jLp .R2 /k:
˛
(1.50)
˛2N2
0 ;0˛j r
Further (historical) references may be found in [T10, Section 1.2.1, p. 22–23], Chapter 2
of [ST87] and the recent surveys [Schm07], [ScS04], [Vyb06]. But we mention the
counterparts of the special cases for the isotropic spaces discussed in Remark 1.2.
(i) Let 1 < p < 1 and r 2 N0 . Then
r
Sp;2 F .R2 / D Spr W .R2 / (1.51)
are the above spaces (1.49), (1.50). In particular,
0
Sp;2 F .R2 / D Lp .R2 /: (1.52)
(ii) Let
lC1
1h;1 f .x1 ; x2 / D f .x1 C h; x2 / f .x1 ; x2 /;
h;1
f .x/ D 1h;1 .lh;1 f /.x/;
(1.53)
where x D .x1 ; x2 / 2 R2 , h 2 R, l 2 N be the iterated differences with respect to the
x1 -direction. Similarly lh;2 f , l 2 N. Let
l;l
h
f .x/ D l;l
h1 ;h2
f .x/ D lh2 ;2 .lh1 ;1 f /.x/; x 2 R2 ; (1.54)
be the iterated differences, l 2 N, h D .h1 ; h2 / 2 R2 . Let 0 < r < l 2 N and

r
1 p; q 1. Then Spq B.R2 / is the collection of all f 2 Lp .R2 / such that
2 Z
X 1=q
dh
kf jLp .Rn /k C jhjrq klh;j f jLp .R2 /kq
jhj<1 jhj
j D1
Z 1=q (1.55)
dh1 dh2
C rq
jh1 h2 j kl;l
h1 ;h2
f 2
jLp .R /k q
jh1 j1
jh2 j1
jh1 h2 j
is finite (equivalent norms). These are the classical Besov spaces with dominating
mixed smoothness. Of special interest for us are the Hölder–Zygmund spaces with
dominating mixed smoothness
S r C .R2 / D S1;1
r
B.R2 /; r 2 R: (1.56)
Let, in particular, 0 < r < l 2 N. Then one obtains as a special case of (1.55) that
S r C.R2 / collects all complex-valued continuous functions on R2 such that
kf jS r C.R2 /kl D sup jf .x/jC sup jhjr jlh;j f .x/jC sup jh1 h2 jr jl;l
h
f .x/j
x2R2 h2R;x2R2 h2R2 ;x2R2
j D1;2
(1.57)
is finite (equivalent norms). One may consult [T10, pp. 24–25] and the references
given there, especially to [ST87, pp. 122, 126].
r
We need the weighted counterparts of the spaces Spq A.R2 / as introduced in Defi-
nition 1.5 and Remark 1.6. Let
w ˛ .x/ D .1 C x12 /˛=2 .1 C x22 /˛=2 ; ˛ 2 R; x D .x1 ; x2 / 2 R2 ; (1.58)
be the counterpart of the isotropic weights w˛ .x/ according to (1.32) now reflecting
the product structure of the spaces with dominating mixed smoothness.
Definition 1.7. Let
0 < p 1; 0 < q 1; r 2 R and ˛ 2 R (1.59)
with p < 1 for the F -spaces. Let w ˛ be as in (1.58). Then Spq

r
A.R2 ; ˛/ is the
0 2
collection of all f 2 S .R / such that
r
kf jSpq A.R2 ; ˛/k D kw ˛ f jSpq
r
A.R2 /k < 1: (1.60)
Remark 1.8. This is the counterpart of Definition 1.3 based on Definition 1.5. One
may ask whether these spaces have similar properties as discussed in the Remarks 1.4
and 1.6. This is largely the case. The proof in [ET96, pp. 156–160] that (1.37) and
its F -counterpart are equivalent to the quasi-norms in (1.34) is mainly based on local
means and liftings. But this can be transferred to the spaces in the above definitions.
As for local means one can even assume that the corresponding kernels have also a
product structure. We refer to [T10, Section 1.2.3, pp. 28–30]. In particular,
X 1=q
r
kf jSpq B.R2 ; ˛/k' D 2r.k1 Ck2 /q k.'k fO/_ jLp .R2 ; w ˛ /kq (1.61)
k2N2
0
with ' D f'k gk2N2 as in Definition 1.5, and p, q, r according to (1.45) is an equivalent
0
r
quasi-norm in Spq B.R2 ; ˛/, and f 7! w ˛ f maps Spq
r
B.R2 ; ˛/ isomorphically onto
r
Spq B.R2 /. This is the counterpart both of (1.37) and (1.46). Similarly for the F -
spaces. But we use later on (1.60). The assertions about the special cases discussed in
Remark 1.6 can also be extended to the above weighted spaces. As in (1.36) the space
Lp .R2 ; w ˛ /, 1 < p < 1, is normed by
Z 1=p
2 ˛ ˛ 2 ˛ p p
kf jLp .R ; w /k D kw f jLp .R /k D w .x/ jf .x/j dx : (1.62)
R2
Let 1 < p < 1 and r 2 N. Then the weighted extensions of (1.49), (1.50) are given
by
Spr W .R2 ; ˛/ D ff 2 Lp .R2 ; w ˛ / W kf jSpr W .R2 ; ˛/k < 1g (1.63)
with X
kf jSpr W .R2 ; ˛/k D kD ˇ f jLp .R2 ; w ˛ /k: (1.64)
ˇ2N20
0ˇj r
Then one has the counterpart

r
Sp;2 F .R2 ; ˛/ D Spr W .R2 ; ˛/; 1 < p < 1; ˛ 2 R; (1.65)
and, in particular,
0
Sp;2 F .R2 ; ˛/ D Lp .R2 ; w ˛ /; 1 < p < 1; (1.66)
of (1.51), (1.52). These assertions and also weighted counterparts of (1.55)–(1.57) are
of interest for its own sake. But they will not be needed later on. We rely exclusively
on (1.60) preferably with A D B.
1.3 Numbers measuring compactness and approximation

1.3.1 Entropy and approximation numbers. We are mainly interested in sampling
numbers and integral numbers. But we wish to compare these numbers with other
distinguished numbers measuring compactness, especially entropy and approximation
numbers. We recall some standard definitions. Let
UA D fa 2 A W ka jAk 1g (1.67)
be the unit ball in the (complex) quasi-Banach space A. If A; B are two (complex)
quasi-Banach spaces then L.A; B/ is the collection of all linear and bounded operators
T W A ,! B quasi-normed by
kT k D supfkT a jBk W a 2 UA g: (1.68)
Furthermore, rank T denotes the dimension of the range of T . Recall that T 2 L.A; B/
is called compact if T .UA / is precompact in B.
1.3 Numbers measuring compactness and approximation 11
Definition 1.9. Let A, B be quasi-Banach spaces and let T 2 L.A; B/.

(i) Then for all k 2 N the k-th entropy number ek .T / of T is defined as the infimum
of all " > 0 such that
k1
2[
T .UA / .bj C "UB / for some b1 ; : : : ; b2k1 2 B: (1.69)
j D1
(ii) Then for all k 2 N the k-th approximation number ak .T / of T is defined by
ak .T / D inffkT Lk W L 2 L.A; B/; rank L < kg: (1.70)
Remark 1.10. Neither entropy numbers nor approximation numbers play a substantial
role in this book. This may justify to refer to [T06, Section 1.10] or [HaT08, Section 6.3]
for further comments, properties, and the related literature.
We illustrate the behaviour of entropy and approximation numbers for weighted

spaces according to Definition 1.3, which will be of some interest later on. Let s; ; ˛ 2
R and p; u; q; v 2 .0; 1. Let
n n
ıDs (1.71)
p u
and
1 1 ˛
D C : (1.72)
p p n
Then
s
id W Bpq .Rn ; ˛/ ,! Buv

.Rn / (1.73)
is compact if, and only if,
s > ; ı > 0; ˛ > 0; u > p ; (1.74)
the indicated area in Figure 1, p. 12. This is covered by [T06, Proposition 6.29, Theo-
rem 6.31, pp. 281–82] and its wavelet characterisation. This assertion has some history.
It goes back to [HaT05] and [KLSS06a, Proposition 1, p. 65] as far as the only-if-part
is concerned, based on wavelet isomorphisms. Otherwise entropy and approximation
numbers of the compact embeddings (1.73) have been studied since the mid-1990s by
many authors beginning with [HaT94a], [HaT94b] and [ET96, Chapter 4]. We formu-
late a very special case which is sufficient for our later purposes. We explained our use
of in the preface.
Theorem 1.11. Let ˛ > 0, u 1, 0 p1 u1 < p1 C ˛n , s > 0 and 0 < q 1. Then

the embedding
s
id W Bpq .Rn ; ˛/ ,! Lu .Rn / (1.75)
s
. p1 ; s/ . p1 ; s/
s
ıD˛
1
1 p
. u1 ; /
Figure 1. Weighted spaces.
is compact and one has

´ s n n
k n if s p
C u
< ˛;
ak .id/ ek .id/ ˛ 1 1 (1.76)
k nCup if s n
C n
> ˛;
p u
k 2 N, for the corresponding entropy and approximation numbers.
Remark 1.12. This special case is covered by [ET96, Sections 4.3.2, 4.3.3], where
the assertions about the approximation numbers go back to [Har95]. The splitting
in (1.76) means that the limiting case ı D ˛ is excluded, where ı has the same
meaning as in (1.71) with D 0. As mentioned above the study of entropy and
approximation numbers of the embeddings (1.73), (1.74) and related F -counterparts
goes back to [HaT94a], [HaT94b], [Har95], [ET96]. Nowadays one uses wavelet
isomorphisms which reduce these problems to corresponding assertions for weighted
sequence spaces. We refer to [T06, Sections 6.3, 6.4] based on [HaT05], where one
finds also corresponding assertions for entropy numbers if u > p and, in particular,
what happens in the tricky limiting case ˛ D ı where ek .id/ behaves like k .log k/%
for some > 0, % > 0 in dependence on q and v. As far as entropy numbers for the
limiting case ˛ D ı are concerned one may also consult [KLSS06a]. It is of interest to
replace in (1.73) the special weights w˛ according to (1.32) by more general weights
satisfying (1.30), (1.31) with logarithmically perturbed weights of type (1.32) as a
distinguished choice. We refer in this context to [KLSS06b], [KLSS07], [Kuhn08].
We stick in what follows at (1.75) avoiding any additional complications which may
occur if u < 1 or u > p or ı D ˛. But our methods below are qualitative and
may well be applied to more general situations. As said nowadays one has rather
final answers for the entropy numbers of the compact embeddings (1.73), (1.74) and
their F -counterparts. As far as approximation numbers are concerned the situation is
even more complicated. The outcome is rather involved. This applies not only to the
limiting case ı D ˛ but also to several cases with u > p. The first results according to
[Har95] and reported in [ET96, Section 4.3.3] left open several cases with u > p, also
in non-limiting situations. These gaps were sealed afterwards step by step in [Har97],
[Cae98], [Skr05], [SkV09].
1.3.2 Sampling numbers. As usual, T W A ,! B means that T is a linear and bounded

(continuous) operator (map) from the quasi-Banach space A into the quasi-Banach
space B. If A B then id W A ,! B stands for the identity (embedding) a D id a 2 B
with a 2 A, also abbreviated by A ,! B.
Let be either Rn or a bounded domain in Rn . Domain means open set. Later on
is either Rn or the unit cube D Qn D .0; 1/n in Rn . If n D 1 then Q1 D I D .0; 1/
is the unit interval on R. We are interested in compact embeddings
id W G1 . / ,! G2 . / (1.77)
where G1 . / and G2 . / are quasi-Banach spaces such that either G1 .Rn / G2 .Rn /
S 0 .Rn / if D Rn or G1 . / G2 . / D 0 . / if is a bounded domain. Here
we rely again on the following standard notation. As usual, D. / D C01 . / stands
for the collection of all complex-valued infinitely differentiable functions in Rn with
compact support in , considered as functions in . Let D 0 . / be the dual space of
all distributions on . Let g 2 S 0 .Rn /. Then gj denotes its restriction to ,
gj 2 D 0 . / W .gj /.'/ D g.'/ for ' 2 D. /: (1.78)
Let C.Rn / be the collection of all complex-valued bounded continuous functions on

Rn normed by
kf jC.Rn /k D sup jf .x/j: (1.79)
x2Rn
If is a bounded domain in Rn then C. / D C.Rn /j is the restriction of C.Rn / to

x
, hence the collection of all complex-valued uniformly continuous functions on ,
normed by
kf jC. /k D sup jf .x/j: (1.80)
x
x2
We always assume that the source space G1 . / is continuously embedded in C. /,
id W G1 . / ,! C. /; (1.81)
interpreted in the usual way: In each equivalence class of G1 . / there is a (uniquely

determined) continuous functions in x to which (1.81) applies.
Next we describe the basic ingredients of sampling methods for compact embed-
dings (1.77), (1.81). Let fx j gjkD1 : By (1.81) the information map
Nk W G1 . / 7! Ck ; k 2 N; (1.82)
given by
Nk f D .f .x 1 /; : : : ; f .x k //; f 2 G1 . /; (1.83)
makes sense according to the above interpretation. Here, as usual, Ck is the collection
of all k-tuples of complex numbers. Let
Sk D ˆk ı Nk ; where ˆk W Ck 7! G2 . /; (1.84)
be an arbitrary map (also called method or algorithm). Hence,
Sk f D ˆk .f .x 1 /; : : : ; f .x k // 2 G2 . /; f 2 G1 . /: (1.85)
One wishes to recover a given continuous function f 2 G1 . / in G2 . / by asking

for optimally scattered points fx j gjkD1 and optimally chosen methods ˆk .
Definition 1.13. Let be either Rn or a bounded domain in Rn , n 2 N. Let G1 . /,
G2 . / be the above distributional quasi-Banach spaces satisfying (1.77), (1.81). Let
k 2 N.
(i) Then
gk .id/ D infŒ supfkf Sk f jG2 . /k W kf jG1 . /k 1g (1.86)
is the k-th sampling number, where the infimum is taken over all k-tuples fx j gjkD1
and all maps Sk D ˆk ı Nk according to (1.82)–(1.85).
(ii) The linear sampling numbers gklin .id/ are given by (1.86), where the infimum is
taken over all k-tuples fx j gjkD1 and all linear maps Sk D ˆk ı Nk with
k
X
Sk f D f .x j / hj ; hj 2 G2 . /; f 2 G1 . /: (1.87)
j D1
Remark 1.14. This is an adapted version of a corresponding definition in [NoT06]

and coincides essentially with [T06, pp. 218–19] and [T10, pp. 174–75]. Obviously,
gk .id/ gklin .id/ and akC1 .id/ gklin .id/; k 2 N; (1.88)
where akC1 .id/ are the corresponding approximation numbers according to (1.70). A
detailed discussion of several other types of quantifications of (1.77) from the point
of view of information-based complexity may be found in [NoW08, Chapter 4] and
[NoW10]. Some related comments may also be found in [T10, Remark 4.2, p. 175].
Let id be the compact embedding (1.77) with (1.81). Let
D fx j gjkD1 . Then
˚ P
id W G1 . / D f 2 G1 . / W jkD1 jf .x j /j D 0 ,! G2 . / (1.89)
is a compact operator and its quasi-norm kid k has the usual meaning.
Proposition 1.15. Let be either Rn or a bounded domain in Rn and let G1 . /,

G2 . / and id be as in Definition 1.13. Let id be given by (1.89). Then
gk .id/ inffkid k W card
kg; k 2 N; (1.90)
where the equivalence constants are independent of k.
Remark 1.16. Assertions of this type are known, [TWW88, pp. 45, 58]. The above
version goes back to [NoT06, Proposition 19] and [T06, Proposition 4.34, p. 220]. The
arguments in [T06] apply not only to bounded domains as there but also to D Rn .
So far we introduced in Definition 1.9 approximation numbers and entropy numbers
and in Definition 1.13 sampling numbers. We recall some known assertions in case of
isotropic spaces adapted to our later intentions. Let D Qn D .0; 1/n be the unit cube
in Rn or any other bounded Lipschitz domain in Rn . Let Apqs
.Rn / with A 2 fB; F g be
the isotropic (unweighted) spaces according to Definition 1.1. Then
s
Apq . / D ff 2 D 0 . / W f D gj for some g 2 Apq
s
.Rn /g; (1.91)
s s
kf jApq . /k D inf kg jApq .Rn /k; (1.92)
s
where the infimum is taken over all g 2 Apq .Rn / with gj D f according to (1.78).
This is the standard definition of spaces on domains by restriction. One may consult
[T06, Definition 1.95, p. 59] and [T10, Definition 1.24, p. 13] for further explanations.
In particular, gj denotes again the restriction of g to . Recall that
s
id W Apq . / ,! C. / if 0 n=p (1.93)
s
(p < 1 for F -spaces). As for sharp conditions under which Apq . / is continuously
embedded in C. / (including limiting cases) one may consult [T08, p. 229] or [T10,
p. 177]. There one finds also the necessary references. For our purpose the non-limiting
s
version (1.93) is sufficient. It ensures that Apq . / can be identified with G1 . / in
(1.81).
Proposition 1.17. Let D Qn D .0; 1/n (or a bounded Lipschitz domain in Rn ),
n 2 N. Let
1 u p 1; 0 < q 1; s > n=p; (1.94)
(p < 1 for the F -spaces). Then the embedding
s
id W Apq . / ,! Lu . / (1.95)
is compact and
ak .id/ ek .id/ gk .id/ gklin .id/ k s=n ; k 2 N: (1.96)
Remark 1.18. This is a special case of [T06, Theorem 4.45, p. 229] adapted to our later
considerations. If n D 1 and D .0; 1/ then one has (1.1), (1.2) where the restriction
s < p1 C 1 refers to the constructive proof according to [T10, p. 185] whereas the
corresponding assertions in (1.96) rely on other non-constructive arguments.
1.3.3 Integral numbers. So far we introduced in Definition 1.13 sampling numbers

for embeddings (1.77) with (1.81). In [T10] and also in the above Proposition 1.17 we
always assumed that the underlying domain is bounded, maybe a bounded Lipschitz
domain or even D Qn . It is just one of the main aims of these notes to deal
with D Rn at the expense of some weights w of type (1.30), (1.31), preferably
specified by (1.32). Theorem 1.11 illustrates what can be expected. One can ask
for corresponding assertions in terms of sampling numbers. Of special interest are
weighted L1 -spaces as target spaces G2 . /. Then the corresponding linear sampling
numbers gklin are closely related to the problem of numerical integration. Later on we
are mainly interested in D Rn (preferably n D 1 and n D 2) and weights w˛ .x/
and w ˛ .x/ in (1.32) and (1.58). But it is reasonable to restrict the corresponding
definitions not to these special cases. As before we assume that is either Rn or a
bounded domain in Rn . Let again G1 . / and G2 . / be quasi-Banach spaces such that
either G1 .Rn / G2 .Rn / S 0 .Rn / if D Rn or G1 . / G2 . / D 0 . / if is
a bounded domain in Rn . Recall that domain means open set. We now assume that
G2 . / D L1 . ; w/ D 0 . /; (1.97)
where w is a weight function in , w.x/ > 0 if x 2 , and
Z
kf jL1 . ; w/k D w.x/ jf .x/j dx: (1.98)

One may think about the above weights if D Rn . In specification of (1.77), (1.81)
we are interested in compact embeddings
id W G1 . / ,! G2 . / D L1 . ; w/ (1.99)
always assuming that
id W G1 . / ,! C. /: (1.100)
n n
Definition 1.19. Let be either R or a bounded domain in R , n 2 N. Let G1 . /,
G2 . / be distributional quasi-Banach spaces satisfying (1.97) and (1.99), (1.100),
where w with w.x/ > 0 in is a weight function. Then
gklin .G1 . /; w/ D gklin .id/; k 2 N; (1.101)
with id as in (1.99). Furthermore,
Intk .G1 . /; w/
˚ˇ Z k
X ˇ
D inf sup ˇ f .x/ w.x/ dx al f .x l /ˇ W f 2 G1 . /; kf jG1 . /k 1 ;

lD1
(1.102)
k 2 N, where the infimum is taken over all k-tuples fx l gklD1 and all fal gklD1 C.
Let
gklin .G1 . // D gklin .G1 . /; 1/ and Int k .G1 . // D Intk .G1 . /; 1/ (1.103)
if w.x/ D 1 in , k 2 N0 .
1.4 Background, motivations, aims, proposals 17
Remark 1.20. The above definition is the weighted counterpart of Definition 5.1 in
[T10], pp. 221–22. By (1.86), (1.87) with G2 . / D L1 . ; w/ one has
gklin .G1 . /; w/
˚Z ˇ k
X ˇ
D inf sup ˇf .x/ f .x l / hl .x/ˇw.x/ dx W f 2 G1 . /; kf jG1 . /k 1 ;

lD1
(1.104)
where the infimum is taken over all fx l gklD1 and fhl gklD1 L1 . ; w/. Choosing
l k k
fx
R glD1 and fhl glD1 optimally in (1.104) it then follows from (1.102) with al D
hl .x/w.x/ dx that
Intk .G1 . /; w/ gklin .G1 . ; w/; k 2 N: (1.105)
However it comes out that in many cases this estimate is an equivalence. We illustrate
the situation under the same hypotheses as in Proposition 1.17 now specified by u D 1.
Let gklin .G1 . // and Intk .G1 . // be as in (1.103).
Proposition 1.21. Let D Qn D .0; 1/n .or a bounded Lipschitz domain in Rn /,

n 2 N. Let
1 p 1; 0 < q 1; s > n=p; (1.106)
(p < 1 for the F -spaces). Then the embedding
s
id W Apq . / ,! L1 . / (1.107)
is compact and
s s
gklin .Apq . // Intk .Apq . // k s=n ; k 2 N: (1.108)
Remark 1.22. This is a special case of [T10, Theorem 5.4, p. 223]. Otherwise we
have the same situation as described in Remark 1.18. If n D 1 and D .0; 1/ then one
has (1.5) where the restriction s < 1 C p1 refers to the constructive proof according to
[T10, Theorem 5.7, Corollary 5.8, pp. 226–27] whereas the corresponding assertions
in (1.108) rely on other non-constructive arguments.
1.4 Background, motivations, aims, proposals

1.4.1 Background. This book is the continuation of [T10]. We describe now our
motivations, what we intend to do (our aims) and what we do not intend to do (some
proposals). But first we collect some background assertions about Faber bases on
which we rely later on, following [T10]. We wish to provide a better understanding of
what follows and illustrate some formulas from the Introduction 1.1.
Let I D .0; 1/ be again the unit interval on R. Recall that the Faber system on I ,
fv0 ; v1 ; vj m W j 2 N0 I m D 0; : : : ; 2j 1g; (1.109)
consists of the basic functions
v0 .x/ D 1 x; v1 .x/ D x where 0 x 1; (1.110)
and the hat functions vj m .x/, 0 x 1,

8
j C1
ˆ
<2 .x 2j m/ if 2j m x < 2j m C 2j 1 ;
j C1
vj m .x/ D 2 .2j .m C 1/ x/ if 2j m C 2j 1 x < 2j .m C 1/;
:̂
0 otherwise:
(1.111)
Let again C.I / be the space of all complex-valued continuous functions on the closed
interval IN D Œ0; 1 furnished with the L1 -norm (1.80). It is a well-known seminal
observation by G. Faber, [Fab09], that the system (1.109), now named after him, is a
conditional basis in C.I /. In particular, any f 2 C.I / can be uniquely represented as
1 2Xj
1
X
f .x/ D f .0/v0 .x/ C f .1/v1 .x/ 1
2
.22j 1 f /.2j m/ vj m .x/; (1.112)
j D0 mD0
0 x 1, where 2h f are the usual second differences according to (1.26),

12 .22j 1 f /.2j m/ D f .2j m C 2j 1 / 12 f .2j m 12 f .2j m C 2j /:

(1.113)
Historical comments and also classical proofs may be found in [T10, Section 2.1].
s s
Recall that the spaces Apq .I / are defined by restriction of Apq .R/ to I , (1.91), (1.92).
It is well known that
´
s 0 1=p;
Bpq .I / ,! C.I / if, and only if, (1.114)
0 < p 1; 0 < q 1; s D 1=p:
One may consult [T10, p. 125] where one also finds a corresponding assertion for the
s
spaces Fpq .I / and related references. It comes out (and will be the starting point for us
s
later on) that functions f 2 Bpq .I / with (1.114) cannot only be uniquely represented
s
by (1.112) but that the Faber system (1.109) is even a basis in some spaces Bpq .I /
under natural restrictions for the parameters s, p, q. We follow the presentation given
C
in [T10, Section 3.1.2, pp. 126-129] using the same notation as there. Let bpq .I / with
0 < p; q 1 be the space of all sequences
D f0 ; 1 ; j m W j 2 N0 I m D 0; : : : ; 2j 1g C (1.115)
quasi-normed by
X
1 2X
j 1
q=p 1=q
C
k jbpq .I /k D j0 j C j1 j C jj m jp (1.116)
j D0 mD0
with the usual modifications if max.p; q/ D 1.
s
2
1
1 2 p
1
Figure 2. Faber bases.
Theorem 1.23. Let fv0 ; v1 ; vj m g be the Faber system (1.109)–(1.111). Let 0 < p; q
1 and
1 1
< s < 1 C min ;1 ; (1.117)
p p
see Figure 2. Let f 2 D 0 .I /. Then f 2 Bpq
s
.I / if, and only if, it can be represented
as
1 2Xj
1
X 1
f D 0 v0 C 1 v1 C j m 2j.s p / vj m ; C
2 bpq .I /; (1.118)
j D0 mD0

unconditional convergence being in Bpq .I / with < s and in C.I /. The representa-
tion (1.118) is unique, D .f /, with
1
0 .f / D f .0/; 1 .f / D f .1/; j m .f / D 2j.s p /1 .22j 1 f /; .2j m/
(1.119)
where j 2 N0 and m D 0; : : : ; 2j 1. Furthermore,
J W f 7! .f / (1.120)
s C
is an isomorphic map of Bpq .I / onto bpq .I /. If, in addition, max.p; q/ < 1 then
1
fv0 ; v1 ; 2j.s p / vj m W j 2 N0 I m D 0; : : : ; 2j 1g (1.121)
s
is an unconditional basis in Bpq .I /.
Remark 1.24. This is the B-part of [T10, Theorem 3.1, pp. 126–27]. There is also an
s
F -part and a specification to the Sobolev spaces Hps .I / D Fp;2 .I /. But this will not
be needed in the sequel.
r
Next we formulate the even more interesting Spq B.Q2 / counterpart. Recall that
2 2 2 r 2
Q D .0; 1/ is the unit square in R . Let Spq A.R / with A 2 fB; F g be the spaces
with dominating mixed smoothness as introduced in Definition 1.5. Let D Q2 or
any other bounded domain in R2 . Then
r
Spq A. / D ff 2 D 0 . / W f D gj for some g 2 Spq
r
A.R2 /g; (1.122)
r r
kf jSpq A. /k D inf kg jSpq A.R2 /k; (1.123)
r
where the infimum is taken over all g 2 Spq A.R2 / with gj D f in the understanding
of (1.78). This is the counterpart of (1.91), (1.92). One may also consult Section 1.2.6
r
of [T10], pp. 35–36, for some discussions and references. Spaces Spq A.Q2 / behave to
s
some extent similar as their counterparts Apq .I / on the unit interval. A detailed study
may be found in [T10]. In particular,
r
id W Spq A.Q2 / ,! C.Q2 / if 0 < p; q 1; r > 1=p (1.124)
(again with p < 1 for F -spaces). Here C.Q2 / has the same meaning as in (1.81)
with D Q2 . We refer to [T10, (3.87), p. 138]. As remarked there, (1.124) follows
by restriction to Q2 of a corresponding assertion for R2 which is covered by [ST87,
pp. 132–33]. One may compare (1.124) with the non-limiting case in (1.114). There
is also a remarkable counterpart of Theorem 1.23 which will be of great service for
us later on. We follow closely the relevant parts of [T10, Section 3.2] using the same
notation as there. First we describe the tensor counterpart in Q2 D .0; 1/2 of the Faber
system (1.109)–(1.111) on I D .0; 1/. Let v0 , v1 , vj m be the same functions as there.
Let x D .x1 ; x2 / 2 Q2 and
8
ˆ
ˆ vm1 .x1 /vm2 .x2 /
ˆ
ˆ
ˆ
ˆ if k D .1; 1/I m1 2 f0; 1g; m2 2 f0; 1g;
ˆ
ˆ
ˆ
ˆ
ˆ
ˆ vm1 .x1 /vk2 m2 .x2 /
ˆ
< if k D .1; k /; k 2 N I m 2 f0; 1g; m D 0; : : : ; 2k2 1;
2 2 0 1 2
vkm .x/ D
ˆ
ˆ v .x /v
k1 m1 1 m2 2 .x /
ˆ
ˆ
ˆ
ˆ if k D .k1 ; 1/; k1 2 N0 I m1 D 0; : : : ; 2k1 1; m2 2 f0; 1g;
ˆ
ˆ
ˆ
ˆ
ˆ
ˆvk1 m1 .x1 /vk2 m2 .x2 /
:̂
if k 2 N20 I ml D 0; : : : ; 2kl 1I l D 1; 2:
(1.125)
Recall that N1 D N0 [ f1g D f1; 0; 1; : : : g and N21 D N1 N1 . Let
PkF D fm 2 Z2 with m as in (1.125)g; k 2 N21 ; (1.126)
where F stands for Faber. Then
fvkm W k 2 N21 ; m 2 PkF g (1.127)
is the Faber system on Q2 . It is the counterpart of (1.109). We used this system in
r r
[T10] to construct bases in some spaces Spq B.Q2 / and Spr H.Q2 / D Sp;2 F .Q2 /. We
r 2
deal here only with the spaces Spq B.Q / which simplifies the situation somewhat.
C
First we describe the counterpart of the sequence space bpq .I / according to (1.115),
F 2
(1.116). Let spq b.Q / with 0 < p; q 1 be the space of all sequences
D fkm W k 2 N21 ; m 2 PkF g C (1.128)
quasi-normed by
X X q=p 1=q
F
k jspq b.Q2 /k D jkm jp (1.129)
k2N2
1 m2PkF
with the usual modification if max.p; q/ D 1. We recalled above Faber’s observation

that (1.109)–(1.111) is a basis in C.I / and that any f 2 C.I / can be expanded
according to (1.112). We describe the counterpart for functions belonging to C.Q2 /.
We specify (1.53), (1.54) by
2h;1 f .x1 ; x2 / D f .x1 C 2h; x2 / 2f .x1 C h; x2 / C f .x1 ; x2 /; (1.130)
where x D .x1 ; x2 / 2 R2 and h 2 R, similarly for 2h;2 f .x1 ; x2 /, and the second
mixed differences
2;2
h1 ;h2
f .x1 ; x2 / D 2h2 ;2 .2h1 ;1 f /.x1 ; x2 /; h1 2 R; h2 2 R; (1.131)
evaluating a continuous function f at the 9 points .x1 C l1 h1 ; x2 C l2 h2 / with l1 ; l2 2
f0; 1; 2g. We extend (1.113) from I to Q2 . Let k 2 N21 and m 2 PkF according to
(1.126). Let f 2 C.Q2 /. Then
2
dkm .f / D f .m1 ; m2 / if k D .1; 1/; m1 2 f0; 1g; m2 2 f0; 1g; (1.132)
2
dkm .f /D 12 22k2 1 ;2 k2
f .m1 ; 2 m2 / if k D .1; k2 /; k2 2 N0 ;
m1 2 f0; 1g; m2 D 0; : : : ; 2k2 1; (1.133)
2
dkm .f / D 12 22k1 1 ;1 f .2k1 m1 ; m2 / if k D .k1 ; 1/; k1 2 N0 ;
m2 2 f0; 1g; m1 D 0; : : : ; 2k1 1; (1.134)
2 1 2;2
dkm .f /D
4 2k1 1 ;2k2 1
f .2k1 m1 ; 2k2 m2 / if k 2 N20 ;
ml D 0; : : : ; 2kl 1I l D 1; 2: (1.135)
The counterpart of the expansion (1.112), (1.113) for f 2 C.I / reads now as follows.
Proposition 1.25. The Faber system (1.127) is a conditional basis in C.Q2 /,

1
X
f .x/ D .fKC1 .x/ fK .x// C f0 .x/; f 2 C.Q2 /; (1.136)
KD0
x 2 Q2 , convergence in C.Q2 /, with

X X
2
fK .x/ D dkm .f / vkm .x/; K 2 N0 : (1.137)
k2N21 ; m2PkF
k1 K;k2 K
Remark 1.26. This coincides essentially with [T10, Theorem 3.10, p. 136]. We refer
also to [T10, Remarks 3.11, 3.12] where one finds discussions and references. In
particular, fvkm g in (1.127) is a conditional basis in C.Q2 /. Recall that any basis in
C.Q2 / is conditional.
Next we recall the counterpart of Theorem 1.23.
Theorem 1.27. Let Q2 D .0; 1/2 be the unit square in R2 . Let fvkm g be the Faber
2
system (1.125)–(1.127). Let dkm .f / be the mixed differences according to (1.132)–
F 2
(1.135). Let spq b.Q / be the same sequence spaces as in (1.128)–(1.129). Let
r
Spq B.Q2 / be the above spaces (1.122)–(1.124) where either

1 1
0 < p < 1; 0 < q < 1; < r < 1 C min ;1 ; (1.138)
p p
or p D q D 1, 0 < r < 1, see Figure 2, p. 19, with r in place of s. Let f 2 D 0 .Q2 /

(or likewise f 2 L1 .Q2 /). Then f 2 Spqr
B.Q2 / if, and only if, it can be represented
as X X 1
f D km 2.k1 Ck2 /.r p / vkm ; 2 spq
F
b.Q2 /; (1.139)
k2N2 F
1 m2Pk
unconditional convergence being in L1 .Q2 /. The representation (1.139) is unique with

1
km D km .f / D 2.k1 Ck2 /.r p / dkm
2
.f /; k 2 N21 ; m 2 PkF : (1.140)
Furthermore,
J W f 7! .f / (1.141)
r
is an isomorphic map of Spq B.Q2 / onto spq
F
b.Q2 /. If p < 1, q < 1, then fvkm g is
r 2
an unconditional basis in Spq B.Q /.
Remark 1.28. This is one of the main assertions in [T10], where we put together
[T10, Theorems 3.13, 3.16, pp. 138, 145]. There one finds also a counterpart for the
distinguished Sobolev spaces Sp1 W .Q2 /, 1 < p < 1, this means (1.49), (1.50) with
r D 1 and Q2 in place of R2 , [T10, Theorem 3.13 (ii), p. 139].
s r
The question of Faber bases in Bpq .I / according to Theorem 1.23 or in Spq B.Q2 /
according to Theorem 1.27 is of interest for its own sake. The coefficients 0 .f /,
2
1 .f /, j m .f / in (1.119) and dkm .f / in (1.132)–(1.134) evaluate f at finitely many
points (at most 3 in case of I and at most 9 in case of Q2 ). This suggests to use
the expansions (1.118) and (1.139) to estimate linear sampling numbers gklin .id/ for
suitable compact embeddings
id W G1 . / ,! G2 . / (1.142)
according to (1.77) and (1.86) with (1.87). With D I ,

1 1
G1 .I / D Bps11 q1 .I /; 0 < p1 1; < s1 < 1 C min ;1 ; (1.143)
p1 p1
0 < q1 1, are source spaces to which Theorem 1.23 can be applied. If f is given
by (1.118), (1.119) then
J 2X
1j
X
J
S f .x/ D f .0/v0 .x/Cf .1/v1 .x/ 12 .22j 1 f /.2j m/ vj m .x/; (1.144)
j D0 mD0
J 2 N0 , fits in the scheme (1.86), (1.87). As target space G2 .I / one can choose any
space
1 1
G2 .I / D Bps22 q2 .I /; 0 < p2 ; q2 1; 1 < s2 < s1 ; (1.145)
p1 p2 C
or
G2 .I / D Lp2 .I /; 1 p2 1: (1.146)
The indicated splitting (1.144) works if one has a good control about vj m 2 G2 .I /.
This is the case if s2 > . p12 1/C in (1.145) where vj m are (not normalised) atoms, and,
of course, if G2 .I / D Lp2 .I /. We dealt in [T10, Theorems 4.11, 4.13, pp. 185–86,
189] with all these cases and obtained rather final assertions. But the outcome splits in
many cases depending on
whether p1 > p2 or p1 p2 ;
whether p1 < 1 or p1 1; (1.147)
whether s2 > 0 or s2 < 0:
The simplest but nevertheless typical case is
1 1
id W Bps11 q1 .I / ,! Lp2 .I /; 1 p2 p1 1; < s1 < 1 C ; (1.148)
p1 p1
0 < q1 1. Then one has
gk .id/ gklin .id/ k s1 ; k 2 N; (1.149)

as also mentioned in (1.2). According to Proposition 1.17 it is the same behaviour as

for the corresponding approximation numbers ak .id/ and entropy numbers ek .id/. The
r
situation for the spaces Spq B.Q2 / with dominating mixed smoothness is similar but
more complicated. With D Q2 in (1.142),

1 1
G1 .Q2 / D Spr11 q1 B.Q2 /; 0 < p1 < 1; < r1 < 1 C min ;1 ; (1.150)
p1 p1
0 < q1 < 1 or p1 D q1 D 1, 0 < r1 < 1, are source spaces to which Theorem 1.27
can be applied. As target spaces G2 .Q2 / we dealt in [T10, Theorem 4.15, 4.20, pp. 195,
204] with
1 1
G2 .Q2 / D Spr22 q2 B.Q2 /; 0 < p2 ; q2 < 1; 0 < r2 < r1 (1.151)
p1 p2 C
and
G2 .Q2 / D Lp2 .Q2 /; 1 p2 1: (1.152)
If f is represented by (1.139), (1.140) then the counterpart of (1.144) is given by

X X
M Kf D 2
dkm .f / vkm ; K 2 N: (1.153)
k1 Ck2 K m2P F
k
But now there is a splitting in even more cases than for B-spaces on I and in addition
one has now for the sampling numbers only estimates from above and from below
which differ by log-powers. The simplest case is again p2 p1 in (1.152), hence
1 1
id W Spr11 q1 B.Q2 / ,! Lp2 .Q2 /; 1 p2 p1 < 1; < r1 < 1 C ; (1.154)
p1 p1
1 q1 < 1. Then one has
1 q1 r1 C1 q1
c1 k r1 .log k/ 1 gk .id/ gklin .id/ c2 k r1 .log k/ 1 (1.155)
for some c1 > 0, c2 > 0 and 2 k 2 N, [T10, Theorem 4.15, p. 195]. We

mentioned this case also in the Introduction, Section 1.1, (1.3), (1.4). If p2 D 1 in
(1.148) and (1.154) then the linear sampling numbers gklin .id/ are closely connected
with corresponding (unweighted) integral numbers according to Definition 1.19. This
has also been mentioned briefly in the Introduction, Section 1.1, where (1.5) is related
to (1.2) = (1.149) and (1.6) is related to (1.4) = (1.155).
We mentioned in the Introduction, Section 1.1, that we wish to remove the restriction
r > p1 1 for the discrepancy numbers in (1.8). But this is more a somewhat curious
by-product and the necessary background will be provided at the end of Section 1.4.2.
1.4.2 Motivations. In connection with some assertions in [T10], partly repeated in

the above Section 1.4.1, one may ask several questions.
1. Bases and pointwise evaluations. In the Theorems 1.23, 1.27 we described
s r
Faber bases in Bpq .I / with (1.117) and in Spq B.Q2 / with (1.138). The restrictions
for the parameters are natural. The proofs in [T10] are based on Haar bases in corre-
s1 r1
sponding spaces Bpq .I / and Spq B.Q2 /, also indicated in Figure 2, p. 19. There are
s s
corresponding assertions for some spaces Fpq .I /, Hps .I / D Fp;2 .I / and in particular
1 1 2
Wp .I / and Sp W .Q /, 1 < p < 1. In all cases the coefficients of the correspond-
ing expansions, hence j m .f / in (1.118), (1.119) and km .f / in (1.139), (1.140),
evaluate f only in finitely many points. The question arises whether this remarkable
s
observation is restricted to the indicated cases or whether all spaces Bpq .I /, s > 1=p,
r 2
and Spq B.Q /, r > 1=p, have suitable bases such that the corresponding coefficients
s r
evaluate f 2 Bpq .I / or f 2 Spq B.Q2 / only at finitely many points. We have no
final answer. It seems to be a challenging task, maybe even more for corresponding
r r
spaces Spq F .Q2 /, Spr H.Q2 / D Sp;2 F .Q2 / and Spr W .Q2 /. But it is one aim of this
book to do first steps in this direction employing our considerations in [T10] about
higher Faber splines. The outcome suggests that there might be bases or frames in all
r
spaces Spq B.Q2 / with r > 1=p with coefficients evaluating f 2 Spq r
B.Q2 / only at
finitely many points, including respective equivalent quasi-norms. In [T10] we used
expansions of type (1.139), (1.140) to estimate the linear sampling numbers gklin .id/
for
id W G1 .Q2 / ,! G2 .Q2 / (1.156)
with G1 .Q2 / D Spr11 q1 B.Q2 / according to (1.150) as source space and G2 .Q2 / as in
(1.151), (1.152) as target spaces. But for this purpose one does not need that fvkm g
is a basis, a frame, or even a subset of Spr11 q1 B.Q2 /. It is sufficient to control fvkm g
2
in the target spaces and the coefficients km .f / in (1.140), hence dkm .f / involving
second mixed differences, in the source space. This means that there are good reasons
to relax G1 .Q2 / in (1.150) by
1
G1 .Q2 / D Spr11 q1 B.Q2 /; 0 < p1 < 1; < r1 < 2; (1.157)
p1
incorporating the upper left triangle in Figure 2, p. 19. This has been done in [SiU11]
in connection with embeddings
r 1
id W Spp B.Qn / ,! Lp .Qn /; < r < 2; (1.158)
p
using Faber bases, n 2. In this paper there are also some extensions to higher
splines admitting values r 2 in (1.158). It might be considered as the continuation
of [SiU07], [SiU09]. In this connection we refer also to the recent paper [Dinh11]
dealing with two-sided estimates for linear sampling numbers for embeddings of type
r z
id W Spq B.Qn / ,! Lu .Qn /; 0 1=p; (1.159)
0 < u 1, closely related to corresponding assertions in [T10]. However the source

r z
spaces Spq B.Qn / are defined intrinsically in terms of mixed differences as it has also
been done in the related paper [Kam96]. In [T10], but also in [SiU07], [SiU09],
[SiU11], corresponding spaces are always defined by restriction of respective spaces
on Rn as in (1.122), (1.123). But it may well be the case that these two types of spaces
coincide or are at least near-by, [Ull08, Ull11]. However we do not deal with questions
of this type. We are mainly interested in first steps to extend Theorems 1.23, 1.27 to
larger values of s and r such that the corresponding coefficients j m .f / and km .f /
evaluate f only at finitely many points. This could be used afterwards to say something
about linear sampling numbers.
2. Weighted spaces. One may ask whether the theory about Faber bases in spaces
s r
of type Apq .I / and Spq A.Q2 / and their use in sampling, numerical integration and
discrepancy as developed in [T10] can be extended to other domains and other spaces.
The extension from Q2 to Qn , n 2, is essentially a routine matter. We indicated
occasionally in [T10] how corresponding assertions in higher dimensions look like.
Also the above-mentioned papers deal mainly with the n-dimensional case, Rn or
Qn D .0; 1/n . This applies in particular to [Dinh11]. In [T10] we extended some
assertions also to bounded domains in Rn , especially in R2 . But one may ask whether
this theory makes sense in some weighted spaces. First and distinguished candidates
s
are the spaces Apq .R; ˛/ according to Definition 1.3 as the weighted counterpart of
Apq .I /, and Spq A.R2 ; ˛/ according to Definition 1.7 as the weighted counterpart of
s r
s
Apq .Q2 /. What can be said about sampling, numerical integration and discrepancy
for weighted spaces? Again we are not interested in most general assertions and a
systematic study. Just on the contrary. We wish to clarify the influence of the weight,
say w˛ in (1.32), Definition 1.3 with n D 1, or w ˛ in (1.58), Definition 1.7, on sampling
and numerical integration, choosing the simplest case as far as the parameters involved
are concerned. We recalled in Theorem 1.11 what can be said about approximation
numbers and entropy numbers for the embedding (1.75) in the simplest case as far
as p and u are concerned. As indicated in Remark 1.12 corresponding assertions for
other cases are more complicated. This suggests to stick at this case when it comes to
sampling and integration.
3. Discrepancy. There is a third motivation for this book originating from [T10].
First we recall what is meant by discrepancy in I D .0; 1/ and in Q2 D .0; 1/2 . Let
r
Spq B.Qn / be the spaces according to (1.122), (1.123) with D Qn D .0; 1/n . One
may think about n D 2 (as above) or n D 1. If n D 1 and Q1 D I D .0; 1/ then we
r
put Spq B.Q1 / D Bpq r
.I /. We follow [T10, Section 6.1.1, pp. 248–51]. Let R be the
characteristic function of the rectangle
R D fx 2 Qn W al < xl < bl I l D 1; : : : ; ng Qn (1.160)
where 0 al < bl 1. Let
D fx j gjkD1 n n
Q be a set of k points in Q . Then
Rj is the characteristic function of the rectangle
Rj D fx 2 Qn W xlj < xl < 1I l D 1; : : : ; ng; j D 1; : : : ; k; (1.161)
anchored at the upper right corner of Qn (with x j as the lower left corner). Let
A D faj gjkD1 C: Then the discrepancy function
n
Y k
X
disc;A .x/ D xl aj Rj .x/; x 2 Qn ; (1.162)
lD1 j D1
compares the volume of the rectangle with 0 as the lower left corner and x as the
upper right corner with the weighted number of points x j 2
within this rectangle.
r
According to [T10, Proposition 6.3, p. 250] one has R 2 Spq B.Qn / for any R with
(1.160) if, and only if,
´
either 0 < p 1; 0 < q 1; r < 1=p;
(1.163)
or 0 < p 1; q D 1; r D 1=p:
For these spaces it makes sense to define the discrepancy numbers
r
disck .Spq B.Qn // D inf k disc;A jSpq
r
B.Qn /k; k 2 N; (1.164)
where the infimum is taken over all

D fx j gjkD1 Qn and A D faj gjkD1 C.
Discrepancy measures the deviation of sets of points from uniformity. It originates from
number theory. Details and (historical) references may be found in Chapter 6 of [T10]
which will not be repeated. We are interested here in a somewhat curious question,
briefly mentioned in the Introduction, Section 1.1, (1.7), (1.8). For this purpose we
need the well-known relation between discrepancy and numerical integration. Let
r
again Spq B.Qn / be the spaces according to (1.122), (1.123), defined by restriction of
r
the spaces Spq B.Rn /, Definition 1.5 if n D 2, Definition 1.1 if n D 1, where we put
r r
Spq B.R/ D Bpq .R/. Let
1 1
1 < p; q < 1; 1<r < : (1.165)
p p
r
Then the discrepancy numbers disck .Spq B.Qn // are well defined. With
1 1 1 1 1 1
C 0 D C 0 D1 one has 0
< 1 r < 1 C 0: (1.166)
p p q q p p
Then both
Bp1r q 1r
0 q 0 .I / D ff 2 Bp 0 q 0 .I / W f .1/ D 0g (1.167)
and, according to (1.124) also
Sp1r 2 q 1r 2
0 q 0 B.Q / D ff 2 Sp 0 q 0 B.Q / W f .x/ D 0 if either x1 D 1 or x2 D 1g (1.168)
make sense. Let Intk .Sp1r n q

0 q 0 B.Q / / be the corresponding integral numbers according
to Definition 1.19 with G1 . / D Sp1r n

0 q 0 B.Q /, where the adapted embedding (1.124)
ensures (1.100). Then
r
disck .Spq B.Qn // Intk .Sp1r n q
0 q 0 B.Q / /; k 2 N: (1.169)
This is based on the famous Hlawka–Zaremba identity and some duality. We refer to
[T10, Sections 6.2.2, 6.2.3, pp. 255–58]. If n D 1 then it follows from (1.108) that
r
disck .Bpq .I // Intk .Bp1r
0 q 0 .I // k
r1
; k 2 N; (1.170)
with p, q, r as in (1.165), [T10, Theorem 6.20, Proposition 6.22, pp. 264, 266] covering
also some limiting cases. But this causes a somewhat curious question. On the one
hand, according to (1.108) the right-hand side of (1.170) remains valid for all 1 r >
1=p 0 , hence r < 1=p. On the other hand the proof of the first equivalence in (1.170)
is restricted to p, q, r as in (1.165). Looking at (1.162), (1.164) it is at least doubtful
whether (1.170) remains valid if r p1 1, or r < 1. This is the third motivation
for this book. We clarify the situation (in an affirmative way) as a very first step to deal
with corresponding problems in higher dimensions.
1.4.3 Aims, plan of the book. In Section 1.4.2 we described our motivations. It is
our aim to do first steps in the indicated directions.
s
1. Discrepancy. In Chapter 2 we deal with the spaces Bpq .I / on I D .0; 1/ and
clarify in particular that (1.170) remains valid for all reasonable parameters.
2. Faber bases, Faber systems, weighted spaces on R. We extend the Faber basis
s s
(1.109) used in Theorem 1.23 from Bpq .I / to Bpq .R; ˛/, Definition 1.3, with the same
restrictions for the parameters p, q, s as there. We discuss counterparts for larger
values of s in terms of higher Faber systems. We use these assertions afterwards to
study sampling numbers and integral numbers for the same spaces as in Theorem 1.11
with n D 1 and s > 1=p. This will be done in Chapter 3.
3. Faber bases, weighted spaces on R2 . We extend the Faber basis fvkm g in (1.127)
r
used in Theorem 1.27 from Spq B.Q2 / to Spqr
B.R2 ; ˛/, Definition 1.7, with the same
restrictions for the parameters p, q, r as there. Afterwards we use these assertions to
study sampling numbers and integral numbers for these spaces. This will be done in
Chapter 4.
1.4.4 Proposals. The proposals are the substantial difference between the problems
and expectations raised in Section 1.4.2 and what we are able to achieve, camouflaged
as our aims in Section 1.4.3.
1. Discrepancy. We deal only with (1.170). But the major interest in discrepancy
r
as described in Section 1.4.2 is connected with the spaces Spq B.Qn /, n 2. One may
ask whether discrepancy related to weighted spaces makes sense and what something
like
r
disck .Spq B.Rn ; ˛//; k 2 N; (1.171)
means. There is an interest in the literature in discrepancy related to weighted spaces.
We refer to [NoW10, Section 9.6], based on [NoW09], and the recent paper [Gne11].
In particular the symbiotic relationship between numerical integration and discrepancy
is preserved (under some restrictions). This gives the possibility to transfer our later
s r
results about numerical integration in Bpq .R; ˛/ and Spq B.R2 ; ˛/ to related assertions
for discrepancy. But this will not be done here.
2. Faber systems. For the Faber bases in (1.109) and fvkm g in (1.127) we have the
r
Theorems 1.23, 1.27 and perfect weighted counterparts for spaces of type Spq B.Rn ; ˛/
under the same restrictions for the parameters as there. As for higher-order Faber
s
systems we have some assertions which apply to Bpq .R; ˛/, s > 1=p. They are strong
enough to deal with sampling and numerical integration. But they have not the same
final character as in the Theorems 1.23, 1.27 and their weighted counterparts. It is a
s
challenging tasks to construct higher-order Faber systems which are bases in Bpq .I /,
r n s r n
Spq B.Q / and their weighted counterparts Bpq .R; ˛/, Spq B.R ; ˛/ preserving the
pointwise evaluation property for the corresponding coefficients (as in the above quoted
s
theorems). It may be even more ambitious to ask the same questions for Fpq .I /,
r n
Spq F .Q / and possible weighted counterparts. This includes in particular (weighted)
Sobolev spaces.
3. Sampling, integration. We formulated in Theorem 1.11 the simplest case for the
behaviour of the approximation numbers and entropy numbers of compact embeddings.
If u > p or ˛ D s pn C un (limiting case) then the corresponding assertions are more
complicated (especially for approximation numbers). We mentioned in Remark 1.12
the relevant literature. In the Chapters 3, 4 we deal again only with the simplest case
as far as the parameters u and p are concerned, avoiding any additional complications
from other constellations. But it would be of interest to study in detail the behaviour of
sampling numbers and integral numbers for all reasonable embeddings between source
s
spaces and target spaces of type Apq .Rn ; ˛/ and Spq
r
A.Rn ; ˛/.
4. Dimensions. We deal with the dimensions n D 1 and n D 2. We indicated in
[T10] occasionally how corresponding assertions look like in higher dimensions. One
may ask the same questions for the topics treated in this book.
2
Spaces on intervals
2.1 Some preparations

2.1.1 Preliminaries. This short chapter deals with a special and even somewhat curi-
ous problem mentioned at the end of Section 1.4.2 as a third additional motivation for
writing this book. We wish to have a closer look at discrepancy numbers in those Besov
s
spaces Bpq .I / on the unit interval I D .0; 1/ for which this question makes sense. On
the one hand we do not rely on these results in the later chapters. On the other hand as
indicated in the proposals in Section 1.4.4 the arguments and the techniques developed
here may serve as a starting point for later research in more sophisticated situations,
especially in higher dimensions.
s
Let again I D .0; 1/ be the unit interval on R. Let Bpq .I / with 0 < p; q 1 and
s 2 R be the Besov spaces on I according to (1.91), (1.92) specified by D I and
A D B. Let R be the characteristic function of the interval
R D fx 2 I W a < x < bg I (2.1)
s
where 0 a < b 1. Then R 2 Bpq .I / if, and only if,
´
either 0 < p 1; 0 < q 1; s < 1=p;
(2.2)
or 0 < p 1; q D 1; s D 1=p:
This is a special case of (1.163). We refer also to [T10, p. 263]. Let

D fx j gjkD1 I
be a set of k points in I ,
Rj D fx 2 I W x j < x < 1g; j D 1; : : : ; k; (2.3)
and A D faj gjkD1 C. Then
k
X
disc;A .x/ D x aj Rj .x/; x 2 I; (2.4)
j D1
k
1X
disc .x/ D x Rj .x/; x 2 I; (2.5)
k
j D1
are the discrepancy functions. Here disc;A is the one-dimensional version of (1.162),
now complemented by (2.5). Let p, q, s be as in (2.2). Then the discrepancy numbers
s s
disck .Bpq .I // D inf k disc;A jBpq .I /k; k 2 N; (2.6)
32 2 Spaces on intervals

D fx j gjkD1 I , A D faj gjkD1 C, and
disck .Bpq
s s
.I // D inf k disc jBpq .I /k; k 2 N; (2.7)

D fx j gjkD1 I , make sense. Here (2.6) is the
one-dimensional version of (1.164), now complemented by (2.7). According to [T10,
Theorem 6.20, p. 264] we have
s
disck .Bpq .I // disck .Bpq
s
.I // k s1 ; k 2 N; (2.8)
if
1 1
1 p 1; 1<s < ; 0 < q 1: (2.9)
p p
This complements (1.170) with (1.165). We wish to extend this observation to other
values of s, p, q covered by (2.2). As mentioned in connection with (1.165)–(1.170) the
proof of (1.169), (1.170) relies on the Hlawka–Zaremba identity and some duality. We
wish to rely again on duality assertions. But for this purpose we need some preparations.
Let Bzpq
s
.I / and Bzpq
s
.IN/ with IN D Œ0; 1 be the spaces as introduced in [T08, Section
2.1.1, pp. 28–29]. If 0 < p; q 1 and s > max. p1 1; 0/ then
Bzpq
s
.I / D Bzpq
s
.IN/ D ff 2 Bpq
s
.R/ W supp f INg (2.10)
interpreted as a subspace of D 0 .I /. Let

8
<Bzpq .I / if 0 max. p 1; 0/;
s 1
ˆ
Bxpq
s
.I / D Bpq0
.I / if 1 < p < 1; 0 < q 1; s D 0; (2.11)
:̂ s
Bpq .I / if 0 < p 1; 0 < q 1; s < 0;
[T08, (3.46), p. 79]. Let

1 1 1 1
s 2 R; 1 p; q < 1; C 0 D C 0 D 1; (2.12)
p p q q
with 1 < p < 1 if s D 0. Then D.I / D C01 .I / is dense in Bxpq

s
.I / and
Bxpq
s
.I /0 D Bxps0 q 0 .I / (2.13)
are dual spaces interpreted within the dual pairing .D.I /; D 0 .I //. This is a special
case of [T08, Theorem 3.30, Corollary 3.32, pp. 98–99]. Recall that
1
Bzpq
s
.I / D BVpq
s
.I / if 1 p < 1; 1 < s D6 N0 ; (2.14)
p
0 < q < 1, where BVpq

s s
.I / is the completion of D.I / in Bpq .I /, [T08, Theorem 5.21,
pp. 148–49].
2.1 Some preparations 33
2.1.2 A mapping property. According to (1.93) one has

s
Bpq .I / ,! C.I / if 0 < p; q 1; s > 1=p: (2.15)
In particular,
s
ff 2 Bpq .I / W f .1/ D 0g (2.16)
s
with s, p, q as in (2.15) is a closed subspace of Bpq .I /. We need the following simple
mapping property.
Proposition 2.1. Let 0 < p; q 1 and s > 1=p. Then f 7! f 0 is an isomorphic
map of
s s1
ff 2 Bpq .I / W f .1/ D 0g onto Bpq .I /: (2.17)
Proof. Step 1. The first equivalence in
s s1
kf jBpq .I /k kf jBpq .I /k C kf 0 kBpq
s1
.I /k jf .1/j C kf 0 jBpq
s1
.I /k (2.18)
is well known and may be found in [T10, Section 3.1.1, p. 125] as a special case of [T08,
Proposition 4.21, p. 113]. By (2.15) the right-hand side of (2.18) can be estimated from
above by the left-hand side. For the converse one has to show that there is a constant
c > 0 such that
s1
kf jBpq .I /k c jf .1/j C c kf 0 jBpq
s1
.I /k; s
f 2 Bpq .I /: (2.19)
This can be done in the standard way by contradiction. If there is no such number c
s
then one can find for any j 2 N a function fj 2 Bpq .I / with
s1
kfj jBpq .I /k D 1 and jfj .1/j C kfj0 jBpq
s1
.I /k 1=j: (2.20)
s
It follows from the first equivalence in (2.18) that the set ffj g is bounded in Bpq .I /
s1 s1
and hence precompact in Bpq .I /. We may assume that fj ! f in Bpq .I /. Then
it follows again from the first equivalence in (2.18) and (2.20) that fj ! f even in
s
Bpq .I /. Furthermore
s1
kf jBpq .I /k D 1; f .1/ D 0; f 0 D 0: (2.21)
Then f is constant and hence f D 0. This contradicts the first assertion.
Step 2. It remains to prove that the range of the map f 7! f 0 is Bpq s1
.I /. If
max.p; q/ < 1 then the smooth functions are dense in Bpq .I /. Let g be a C 1
s1
function in IN D Œ0; 1. Then

Z 1
g D f 0 with f .x/ D g.y/ dy; 0 x 1; (2.22)
x
has the desired properties. This proves (2.17) if max.p; q/ < 1. Let p < 1. Then
the real interpolation
s0 s1 s
.Bpp .I /; Bpp .I //;1 D Bp;1 .I /; s D .1 /s0 C s1 ; (2.23)
1=p < s0 < s1 < 1, can be transferred to the corresponding complemented subspaces
according to (2.17) of co-dimension 1. This is well known. A simple argument of this
type may be found in [T08, p. 110]. This proves (2.17) if p < 1. We denote the
completion of smooth functions in C s .I / D B11
s
.I / by c s .I /. Recall that
.c s0 .I /; c s1 .I //;1 D C s .I / (2.24)
with 0 < s0 < s1 < 1, s.1 /s0 C s1 . This may be found in [T83, (4), p. 236]
with a reference to [Tri78a, pp. 1155–56]. The above arguments can be applied first
to the spaces c s .I / and afterwards by interpolation to C s .I /. This proves (2.17) if
p D q D 1. The case p D 1, 0 < q < 1 follows again by interpolation.
Remark 2.2. Instead of interpolation one can use in step 2 of the above proof wavelet
s1 s1
arguments as follows. Let g 2 Bpq .I / and let gQ 2 Bpq Q D g and,
.R/ with gjI
u u
say, supp gQ .1; 2/. Let F 2 C .R/, M 2 C .R/ be the compactly supported
wavelets as described in [T10, Section 1.14, p. 8] with the cancellation [T10, (1.56),
s1
p. 8] for M . We write the wavelet expansion for gQ 2 Bpq .R/ according to [T10,
Theorem 1.18, p. 10–11] as in [T10, p. 73],
X 1 X
X
gQ D 0;F
l
Q
.g/ F .x l/ C k;M
l
Q
.g/ k
M .2 x l/ D gQ F C gQM (2.25)
l2Z kD0 l2Z
with the properties of the coefficients 0;F

l
Q and k;M
.g/ l
Q as there. Here gQ F collects
.g/
the finitely many F -terms. Of course there is a smooth compactly supported function
fQF in R such that fQF0 jI D gQ F jI . Using the cancellations of M it follows that
Z x 1 X
X Z x
fQM .x/ D gQM .y/ dy D k;M
l
Q
.g/ k
M .2 y l/ dy (2.26)
1 1
kD0 l2Z
s1
is an atomic decomposition. Using gQM 2 Bpq .R/ one obtains from the atomic
s
characterisation of Bpq .R/ according to [T10, Theorem 1.7, p. 5] and some calculations
that fQM 2 Bpq
s
.R/. Furthermore fQM0 D gQM . Let
fQ D fQF C fQM C c; c 2 C: (2.27)
If c is appropriately chosen then f D fQjI 2 Bpq s

.I / with f .1/ D 0 and f 0 D g.
These wavelet arguments are not shorter than step 2 of the above proof, but they might
be more transparent especially in the cases with max.p; q/ D 1.
2.2 Discrepancy 35
2.2 Discrepancy
s
2.2.1 Main assertions. The discrepancy numbers disck .Bpq .I // as introduced in
s
(2.6) make sense for all spaces Bpq .I / with s, p, q according to (2.2). So far we
have (2.8) under the restriction (2.9). The structure of the discrepancy function disc;A
in (2.4) and also the proof of (2.8), (2.9) in [T10, Theorem 6.20, pp. 264-66] seem to
s
suggest that one cannot expect very much for discrepancy numbers disck .Bpq .I // in
s
other admitted spaces Bpq .I / covered by (2.2). But this impression is wrong as the
following assertions will show. Our use of (equivalence) has been explained in the
Preface.
Theorem 2.3. Let
1
0 0,
s
kdisck .Bpq .I //k c k s1 ; k 2 N; (2.30)
under the restrictions

1
s < 0; 1 < p; q 1; s 1 C 62 N0 (2.31)
p

for the parameters involved. Let f 2 Buv .I / with
0 < u; v 1; > 1=u and f .1/ D 0; (2.32)
which makes sense according to (2.15). With disc;A as in (2.4) it follows from inte-
gration by parts for smooth functions f that
Z Z k
X
disc;A .x/f 0 .x/ dx D f .x/ dx aj f .x j /: (2.33)
I I j D1

This can be extended to arbitrary functions f 2 Buv .I / with (2.32) approximating f
"
in Buv .I / where " > 0 and " > 1=u by smooth functions. One may also consult
[T10, pp. 255–56] for similar arguments in more complicated situations. Let s, p, q
be as in (2.31) and
1 1 1 1
C 0 D C 0 D 1; (2.34)
p p q q
1
in particular s p0
62 N0 . Then we have by (2.11)–(2.13) and (2.14)
BVps 0 z s 0 s
0 q 0 .I / D Bp 0 q 0 .I / D Bpq .I /: (2.35)
Hence,
˚ˇ Z ˇ
s
kdisc;A jBpq .I /k sup ˇ disc;A .x/ g.x/ dx ˇ W kg jBVps
0 q 0 .I /k 1 : (2.36)
I
We apply (2.33) with u D p 0 , v D q 0 , D 1 s > 1=u in (2.32) and f 0 D g 2

Bps
0 q 0 .I / where
Z 1
f .x/ D g.y/ dy 2 Bp1s
0 q 0 .I /; 0 x < 1: (2.37)
x
It follows from Proposition 2.1 that f 7! f 0 is an isomorphic map of

fh 2 Bp1s s
0 q 0 .I / W h.1/ D 0g onto Bp 0 q 0 .I /: (2.38)
R1
The inverse of f 7! f 0 , hence g 7! x g.y/ dy maps BVps 0 q 0 .I / isomorphically onto
sC1
a closed subspace of Bp0 q 0 .I /. Now it follows from (2.36) and (2.33) that
˚ˇ Z k
X ˇ
s
kdisc;A jBpq .I /k c sup ˇ f .x/ dx aj f .x j /ˇ W kf jBp1s
0 q 0 .I /k 1 :
I
j D1
(2.39)
The infimum over all admitted
and A on the right-hand side gives the integral numbers
according to Definition 1.19. One obtains from Proposition 1.21 and (2.6) that
s
kdisck .Bpq .I //k c k s1 ; k 2 N; (2.40)
hence (2.30).
Step 2. We remove the exceptional values in (2.31) and incorporate the remaining
cases. For this purpose we rewrite (2.39). If aj and x j are optimally chosen in (2.4)
then it follows from (2.39) and Remark 1.20 that
k
X
s
x aj Rj .x/ jBpq .I / c gklin .Bp1s
0 q 0 .I //; k 2 N: (2.41)
j D1

The estimates from above of gklin .Buv .I // in [T06, Proposition 4.36, step 1 of the proof
of Theorem 4.37, pp. 222–24], based on [NoT06], and Remark 1.20 show that the
coefficients faj gjkD1 and the points fx j gjkD1 do not depend on the spaces Bpq s
.I / as
long as they are covered by step 1, hence (2.31). But this applies also to the spaces
s
Bpq .I / with (2.8), (2.9), p; q > 1. This follows from [T10, Theorem 6.20, pp. 264–
266] based on the same type of arguments. Let
1
1 < p 1; 1 < s0 < 0 < s1 < 1=p; s0 1 C 62 N0 ; (2.42)
p
and 1 < q0 ; q1 1. Let 0 < < 1 and
s D .1 /s0 C s1 ; 0 < q 1: (2.43)
2.2 Discrepancy 37
Using the interpolation formula

s s0 s1
Bpq .I / D .Bpq 0
.I /; Bpq 1
.I //;q (2.44)
it follows from (2.41) (with aj and x j independent of the spaces involved) that
k
X

x s
aj Rj .x/ jBpq .I / c gklin .Bp1s 0
0 q 0 .I // gk .Bp1s
1 lin 1
0 q 0 .I //

0 1 (2.45)
j D1
c 0 k 1s ; k 2 N;
where we used (1.108). Hence,

s
disck .Bpq .I // c k s1 ; k 2 N; (2.46)
if
1 < p 1; 0 < q 1; 1 < s < 1=p: (2.47)
Recall that for fixed s and q
Bps0 q .I / ,! Bps1 q .I / if 0 < p1 p0 1: (2.48)
This shows that (2.46) can be extended to all p, q, s in (2.28).

Step 3. We prove the converse of (2.46). Let
Z
Kj m .f / D .f; Kj m / D Kj m .y/ f .y/ dy; j 2 N0 ; m 2 Z; (2.49)
R
be the local means in R according to [T10, Definition 1.9, (1.47), pp. 6–7] (where
we replaced kj m by Kj m ). Since s < 1 it is sufficient to choose B D 1 in [T10,
Theorem 1.15, p. 7], hence
Z
Kj m .x/ dx D 0; j 2 N; m 2 Z: (2.50)
R
Let k D 2j 1 , j 2 N, in (2.4),
j 1
2X
disc;A .x/ D x al Rl .x/; x 2 I; (2.51)
lD1
j 1 j 1
with
D fx l g2lD1 I and A D fal g2lD1 C. There are 2j 1 disjoint (open)
S j 1
intervals I l .0; 1/, l D 1; : : : ; 2j 1 , of length 2j such that
\ 2lD1 I l D ;, in
particular
disc;A .x/ D x cl in I l : (2.52)
Let Kjl D Kj;ml such that
supp Kjl I l and jD ˛ Kjl .x/j 2j Cj j˛j ; j˛j L; (2.53)
as required in [T10, Definition 1.9, Theorem 1.15, pp. 6–7] together with Kj;ml D Kjl
in (2.50). One can choose Kjl such that
ˇZ ˇ ˇZ ˇ
ˇ l ˇ ˇ ˇ
ˇ Kj .x/ disc;A .x/ dx ˇ D ˇ Kjl .x/ x dx ˇ c 2j 22j D c 2j ; (2.54)
Il Il
where c > 0 is independent of j and l. Then it follows from [T10, Theorem 1.15, p. 7]
that
1
2X
j 1
1=p
s j.s p / j
kdisc;A jBpq .I /k c2 2 1 D c 0 2j.s1/ ; (2.55)
lD1
j 1 j 1
where c 0 > 0 is independent of A D fal g2lD1 and
D fx l g2lD1 . This proves the
converse of (2.46) with p, q, s as in (2.28), hence
s
disck .Bpq .I // c k s1 ; k 2 N; (2.56)
for some c > 0.
Remark 2.4. The case (2.8), (2.9) is covered by [T10, Theorem 6.20, p. 264]. The
extension (2.29) with (2.28) looks quite natural. But it required some efforts and it
may be even somewhat surprising especially if s < 1. We discuss this observation
from the point of view of atomic representations. Let bj m 2 L1 .R/ with j 2 N,
m D 0; : : : ; 2j 1,
jbj m .x/j 2j ; supp bj m 2j m C d.2j ; 2j /; (2.57)
and Z
x l bj m .x/ dx D 0 if l D 0; : : : ; L 1 (2.58)
R
for some d > 0 and L 2 N. Then

j 1
2X j 1
2X
1 1
j.s p 1/
f .x/ D bj m .x/ D 2 2j.s p / 2j bj m .x/ (2.59)
mD0 mD0
s
is an atomic decomposition in Bpq .R/ with 1 p 1, L < s < 0, 0 < q 1
and
s s
kf jBpq .I /k kf jBpq .R/k c 2j.s1/ : (2.60)
2.2 Discrepancy 39
This follows from [T10, Theorem 1.7, p. 5] and the references given there. Let
D
2j 1 2j 1
fx m gmD0 I and A D fam gmD0 in (2.4),
j 1
2X
disc;A .x/ D x am Rm .x/; x 2 I: (2.61)
mD0
Then one can ask whether disc;A can be represented as the restriction of a suitable
atomic decomposition (2.59) to I ,
j 1
2X
disc;A .x/ D bj m .x/jI; x 2 I: (2.62)
mD0
If this is possible then (2.46) follows from (2.6) and (2.60). There is a good chance
to construct explicitly optimal sets
and A with (2.61), (2.62). This would provide a
better understanding of (2.29). A special case will be considered below.
Remark 2.5. Let disck .Bpq
s
.I // be as in (2.7) based on (2.5). Then one has
k s1 disck .Bpq

s
.I // disck .Bpq
s
.I //; k 2 N; (2.63)
for all cases covered by Theorem 2.3. One may ask whether this estimate is an equiv-
alence. Using (2.8), (2.9) it then follows from (2.48) in the same way as at the end of
step 2 of the proof of Theorem 2.3
disck .Bpq
s
.I // k s1 ; k 2 N; (2.64)
if
1
0 < p 1; 0 < q 1; 1 < s < min p

;1 : (2.65)
It is not so clear whether this equivalence can be extended to s 1. On the one
hand we used in some parts of the proof of Theorem 2.3 the higher flexibility of
disc;A in (2.4) compared with disc in (2.5). On the other hand the discussions in the
preceding Remark 2.4 show that one needs in (2.58), (2.59) and, hence, in (2.62) higher
cancellations if s 1. Whereas there might be a good chance to prove something
like (2.62) if
and A are chosen properly, corresponding assertions for the more rigid
functions disc in (2.5) might be more doubtful. If 1 < s < 0 and 1 p 1 then
L D 1 in (2.58) is sufficient and one can construct an admitted atomic decomposition
of type (2.62),
j 1
2X
discj .x/ D bj m .x/jI; x 2 I; (2.66)
mD0
j 2j 1 j
with
j D fxm gmD0 , j 2 N, where xm D 2j 1 C m2j , as follows. Let
bj .x/ D x if 2j 1 < x 2j 1 and bj .x/ D 0 otherwise in R: (2.67)

Then the sawtooth functions

j 1
2X
fj .x/ D bj m .x/ with bj m .x/ D bj .x 2j m/; j 2 N; (2.68)
mD0
are atomic decompositions of type (2.57)–(2.59) with L D 1 in

s
Bpq .R/; 1 < s < 0; 1 p 1; 0 < q 1: (2.69)
The restriction to I can be written as

j 1
2X
j
discj .x/ D fj .x/jI D x 2 Rj .x/; x 2 I; (2.70)
m
mD0
j j j
where Rm D .xm ; 1/, xm D 2j 1 C 2j m. Then one has (2.60) and by (2.64)
disc2j .Bpq
s s
.I // k discj jBpq .I /k 2j.s1/ ; j 2 N; (2.71)
s
for Bpq .I / in (2.69). Using the monotonicity argument then (2.71) can be extended to
all p, q, s with (2.65).
2.2.2 Complements. If one compares (2.28) with (2.2) then there remain the border-
line spaces
1=p
Bp;1 .I /; 0 < p 1; (2.72)
and the spaces
s
Bpq .I /; 0 < p < 1; 0 < q 1; 1 s < 1=p: (2.73)
We have no final solutions in these cases but the following assertions.

Corollary 2.6. (i) If 0 0 and for
any " > 0 a constant c" > 0 such that
c" k " disck .Bpq

s
.I // c for k 2 N: (2.76)
If, in addition, s > max.1; p1 1/, then

s
disck .Bpq .I // 1; k 2 N; (2.77)
2.2 Discrepancy 41
(iii) Let
0 < p 1; 0 < q 1; 1 < s 1=p (2.78)
with q D 1 if s D 1=p. Let j 2 N,
j
j 2 1 j j j

j D fxm gmD0 and Rm D .xm ; 1/ with xm D 2j 1 C 2j m: (2.79)
Let
j 1
2X
j
discj .x/ D x 2 Rj .x/; x 2 I: (2.80)
m
mD0
Then there is a constant c > 0 such that for all j 2 N,
s
k discj jBpq .I /k c 2j.s1/ : (2.81)
Proof. Step 1. If 1 p 1 then both (2.74) and (2.75) are covered by [T10,
Proposition 6.22, p. 266]. Choosing aj D 0 it then follows from (2.4), (2.6) that
s
disck .Bpq .I // c; k 2 N; (2.82)
1=p
in all admitted cases. This applies in particular to Bp;1 .I /. Using in addition the
embedding
1=p 1
Bp;1 .I / ,! B1;1 .I /; 0 < p 1; (2.83)
and p D 1 in (2.74) one obtains
1=p
disck .Bp;1 .I // 1; 0 < p 1; k 2 N: (2.84)
This proves (i).
Step 2. We prove part (ii). Using again (2.82) and (2.29) one obtains (2.76) by
embedding with fixed p. Next we prove (2.77). It follows again by embedding that
we may assume

0 < p D q < 1; max.1; p1 1/ < s < min p1 ; 2 : (2.85)

We prove (2.77) for these parameters by contradiction and assume that
s
disck .Bpq .I // ! 0 if k ! 1: (2.86)
s
This means that the function f .x/ D x can be approximated in Bpq .I / with p, q,
s as in (2.85) by finite linear combinations of characteristic functions. In connection
with Haar bases we dealt in [Tri78b, Proposition 3, p. 338] with problems of this
type. On the one hand it is well known that one needs at least second differences in
s s
equivalent quasi-norms for f 2 Bpp .R/ with (2.85). However, if f 2 Bpp .R/ can be
s
approximated in Bpp .R/ by finite linear combinations of characteristic functions, then
first differences are sufficient and, in particular,
Z Z 1
dh
hsp jf .x C h/ f .x/jp < 1: (2.87)
I 0 h
But this is not possible if f .x/ D x near the origin and s 1. This disproves (2.86)
and proves (2.77).
Step 3. We prove part (iii). Let

0 < p 1; 0 < q 1; 1 < s1 < min p1 ; 1 : (2.88)
Then it has been mentioned at the end of Remark 2.5 that

s1
kdiscj jBpq .I /k 2j.s1 1/ ; j 2 N: (2.89)
Let
1
s1 < s < s0 < 1=p and s D .1 /s0 C s1 < min p

;1 : (2.90)
Then it follows from (2.89), its counterpart with s in place of s1 and interpolation (or
Hölder’s inequality) that for some c > 0 and c 0 > 0,
c 2j.s1/ k discj jBpq

s0
.I /k1 2j.s1 1/ ; j 2 N; (2.91)
and
s0
kdiscj jBpq .I /k c 0 2j.s0 1/ ; j 2 N: (2.92)
This proves (2.81).
Remark 2.7. Based on (2.76), (2.77) and (2.74) with p D 1 one may conjecture that
s
disck .Bpq .I // 1 if 0 < p < 1; 0 < q 1; 1 s < 1=p: (2.93)
However a corresponding assertion for disck .Bpqs

.I // is unlikely. This is supported by
j
(2.81) with regularly distributed off-points for the intervals Rm in (2.80). This seems
to be the best possible choice, but it does not totally exclude better more irregularly
distributed off-points. The above corollary has not the same final character as Theo-
rem 2.3. However it makes clear that the cases covered by (2.2) but not by (2.28) are
somewhat exotic.
3
Spaces on the real line
3.1 Introduction
s
Theorem 1.23 deals with Faber bases in some Besov spaces Bpq .I / on the unit interval
I D .0; 1/. The coefficients in (1.119) admit pointwise evaluations. This was the
starting point in [T10] to study sampling numbers and integral numbers for suitable
embeddings between these spaces. Recall the special but nevertheless typical example
mentioned in Section 1.1. The embedding
s 1 1
id W Bpq .I / ,! Lu .I /; 1 u p 1; <s <1C ; (3.1)
p p
gk .id/ gklin .id/ k s ; k 2 N; (3.2)
for the sampling numbers according to Definition 1.13. The restriction 1 u p is

convenient, but not necessary. We stick at this distinguished case in what follows leav-
ing a more comprehensive study in analogy to [T10] to later occasions. The restriction
s < 1 C p1 comes from our use of Faber bases according to Theorem 1.23 and admits
a direct constructive proof of (3.2). By Proposition 1.17 with n D 1, the assertion
(3.2) itself remains valid without this restriction. However the corresponding proofs
in the context of Rn , n 2 N, are not constructive. This raises the question whether
s
there are expansions comparable with (1.118) in all spaces Bpq with s > 1=p where
the coefficients reflect pointwise evaluation at finitely many points. This problem is of
interest for its own sake. It will be considered in Section 3.4 below stepping from the
above Faber bases to Faber splines. But the main aim of this chapter is the extension
s
of assertions of type (3.1), (3.2) from spaces Bpq .I / on intervals to corresponding
s
weighted spaces Bpq .R; ˛/ according to Definition 1.3. We wish to study the influence
of the weight w˛ .x/ D .1 C x 2 /˛=2 on sampling numbers for the compact embedding
s 1 1 1
id W Bpq .R; ˛/ ,! Lu .R/; ˛ > 0; < C ˛; (3.3)
p u p
again restricting us to the most convenient constellation of the parameters involved,
1 u p (leaving more sophisticated cases for future research). The corresponding
Theorem 3.7 may be considered as the main result of this Chapter 3. In Section 3.5
we complement the assertions about sampling by integral numbers. Finally we shift
in Section 3.6 the weight w˛ from the source spaces to the target spaces and deal with
44 3 Spaces on the real line
sampling and integration for the compact embedding
s 1 1 1
id W Bpq .R/ ,! Lu .R; ˛/; ˛ > 0; < C ˛: (3.4)
p u p
3.2 Haar and Faber bases

3.2.1 Faber bases in C0 .R/. Recall that C.R/ collects all complex-valued bounded
continuous functions on the real line R furnished with the L1 -norm according to (1.79),
kf jC.R/k D sup jf .x/j: (3.5)

x2R
Let
C0 .R/ D ff 2 C.R/ W jf .x/j ! 0 if jxj ! 1g; (3.6)
hence the completion of D.R/ D C01 .R/ in the L1 -norm. Recall that aC D
max.a; 0/, a 2 R. Let
vj .x/ D .1 2j C1 jxj/C ; j 2 N1 D N0 [ f1g; (3.7)

v1;m .x/ D v1 .x m/; m 2 Z; (3.8)
and
vj m .x/ D vj .x 2j 1 2j m/; j 2 N0 ; m 2 Z: (3.9)
This is the adapted Faber system compared with the Faber basis (1.109)–(1.111), in
C.I /. We have now the overlapping terms with j D 1 and the not overlapping terms
with j 2 N0 . They will be treated differently. It is reasonable for our purpose to adapt
the above Faber system to the interval .k; k C 1/, k 2 Z,
fvj m W j 2 N1 ; m 2 Zg D fv k ; vjkm W k 2 Z; j 2 N0 ; m D 0; : : : ; 2j 1g; (3.10)
where
v k .x/ D v1 .x k/; vjkm .x/ D vj m .x k/; j 2 N0 ; m D 0; : : : ; 2j 1; (3.11)
k 2 Z, x 2 R. This is essentially the Faber basis as described in (1.111)–(1.113)

extended by translations from the unit interval .0; 1/ to .k; k C 1/ and glued together
as far as the starting terms with j D 1 are concerned.
Recall that fbj gj1D0 B in a separable complex quasi-Banach space is called a
basis if any b 2 B can be uniquely represented as
1
X
bD j bj ; j 2 C; convergence in B: (3.12)
j D1
3.2 Haar and Faber bases 45
A basis fbj gj1D1 is called an unconditional basis if for any rearrangement of N

(one-to-one map of N onto itself) fb .j / gj1D1 is again a basis and
1
X
bD .j / b .j / ; convergence in B; (3.13)
j D1
for any b 2 B with (3.12). A basis in a separable quasi-Banach space which is not
unconditional is called a conditional basis. We refer to [AlK06] for details about bases
in Banach (sequence) spaces. According to [Woj91, p. 63] any basis in C.I / and, as a
consequence, also any basis in C0 .R/ is conditional.
The extension of the Faber basis (1.109) in C.I /, (1.112), to C0 .R/ needs some
care. We prefer now a formulation similar to Proposition 1.25. Let again 2h f be the
second differences as used in (1.112), (1.113).
Theorem 3.1. The system (3.10) is a conditional basis in C0 .R/. For K 2 N0 let
JK;k D JK;k 2 N; jkj D 0; : : : ; K; JKC1;jkj JK;jkj ;

(3.14)
1 JK;K JK;K1 JK;0 K C 1; lim JK;k D 1;
K!1
for any k 2 Z. Then

1
X
f .x/ D .fKC1 .x/ fK .x// C f0 .x/; x 2 R; (3.15)
KD0
with
K K JK;k 2 1 j
X 1 X X X 2
k
fK .x/ D f .k/ v .x/ .2j 1 f /.k C 2j m/ vjkm .x/
kDK
2 kDK j D0 mD0
(3.16)
being the related expansion.
Proof. This can be proved by the same arguments as in [T10, proof of Theorem 2.1,
step 4, pp. 67–68], which is essentially the classical proof by G. Faber, [Fab09]. Here
f 2 C0 .R/ ensures uniform convergence.
Remark 3.2. One needs essentially only the assumption limK!1 JK;k D 1 for any
k 2 Z. The simplest choice for JK;k with jkj K might be JK;k D K. But later
on we need representations of type (3.15), (3.16) with more general JK;k (adapted to
weights and sampling numbers). This may be taken as an excuse for the above (at this
moment unnecessarily involved) formulation.
s
3.2.2 Haar bases in weighted spaces. Let Bpq .R; ˛/ be weighted Besov spaces ac-
cording to Definition 1.3. In the following Section 3.2.3 we ask for conditions ensuring
s
that the Faber system in (3.10) is an unconditional basis in Bpq .R; ˛/. Similarly as in
[T10] we reduce problems of this type to corresponding assertions for Haar bases.
s
Let Apq .R; ˛/ be the spaces introduced in Definition 1.3. The representation of
s
f 2 Apq .R; ˛/ in terms of wavelets is based on sequence spaces. The final version may
be found in [T08, Section 1.2.3, pp. 17–19]. On the other hand we characterised in [T10,
s
Section 2.2.3] some spaces Bpq .Rn / and Fpq
s
.Rn / in terms of Haar bases. All arguments
are local and weights of the above type can be incorporated without additional efforts,
based on the indicated wavelet characterisations. We restrict ourselves to B-spaces and
adapt the needed sequence spaces to our later needs. Let
D fjkm 2 C W j 2 N1 ; k 2 ZI m D 0; : : : ; .2j 1/C g: (3.17)
This means m D 0 if j D 1 (recall that aC D max.a; 0/ with a 2 R). Similarly

P2j 1 2 ˛=2
mD0 means m D 0 if j D 1. Let w˛ .x/ D .1Cx / , ˛ 2 R. Let 0 < p; q 1.
Then bpq .R; ˛/ collects all sequences in (3.17) such that
1 X
X j 1
2X q=p 1=q
p
k jbpq .R; ˛/k D w˛ .k/ jjkm jp (3.18)
j D1 k2Z mD0
is finite (usual modification if max.p; q/ D 1). Let
fhj m W j 2 N1 ; m 2 Zg D fhjkm W j 2 N1 ; k 2 ZI m D 0; : : : ; .2j 1/C g (3.19)
be the Haar system according to [T10, Section 2.2.2, p. 78] reorganised by

p
hk1;0 .x/ D 2 k .x/; hjkm .x/ D hj m .x k/; k 2 Z; (3.20)
where k is the characteristic function of the interval .k; k C 1/ and

8
ˆ
<1 if 2j m x < 2j m C 2j 1 ;
hj m .x/ D 1 if 2j m C 2j 1 x < 2j .m C 1/; (3.21)
:̂
0 otherwise;
with j 2 N0 and m D 0; : : : ; 2j 1. Our approach covers also spaces Bpq s

.R; ˛/
with max.p; q/ D 1. Then one cannot expect that corresponding expansions by Haar
systems or (later on) by Faber systems converge in these spaces, but in larger ones.
Recall that we say that a series converges unconditionally in S 0 .R/ if any rearrangement
(as described in connection with (3.13)) converges also in S 0 .R/ and has the same limit.

Furthermore, local convergence in Bpq .R/ means convergence in Bpq . / for any finite
interval in R.
Theorem 3.3. Let 0 < p; q 1,

1 1
1 < s < min 1; ; (3.22)
p p
see Figure 2, p. 19, and ˛ 2 R. Let f 2 S 0 .R/. Then f 2 Bpq

s
.R; ˛/ if, and only if, it
can be represented as
1 X 2X
1 j
X 1
f D jkm 2j.s p / hjkm ; 2 bpq .R; ˛/; (3.23)
j D1 k2Z mD0
unconditional convergence being in S 0 .R/ and locally in any space Bpq

.R/ with < s.
The representation (3.23) is unique,
Z
1
jkm D jkm .f / D 2j.s p C1/ f .x/ hjkm .x/ dx; (3.24)
R
and
J W f 7! .f / (3.25)
s
is an isomorphic map of Bpq .R; ˛/ onto bpq .R; ˛/. If, in addition, p < 1, q < 1,
then
1
f2j.s p / w˛ .k/1 hjkm W j 2 N1 ; k 2 ZI m D 0; : : : ; .2j 1/C g (3.26)
s
is an unconditional (normalised ) basis in Bpq .R; ˛/.
Proof. This is the extension of [T10, Theorem 2.9, Section 2.2.3, p. 80] from the
s s
unweighted case Bpq .R/ to the weighted case Bpq .R; ˛/. All arguments are local.
They work also for these specific weighted cases. As far as the incorporation of the
weights w˛ is concerned one may compare the above formulation with the related
wavelet expansion in [T08, pp. 18–19].
Remark 3.4. In this way one can also extend corresponding expansions by Haar
s
functions in Fpq .R/ as covered by [T10, Theorem 2.9, Section 2.2.3, pp. 80–83] to
s
their weighted counterparts Fpq .R; ˛/. But this will not be done here.
s
3.2.3 Faber bases in weighted spaces. Let again Bpq .R; ˛/ be weighted Besov
spaces according to Definition 1.3. Roughly speaking Faber bases in some spaces
sC1
Bpq .R; ˛/ can be obtained from Theorem 3.3 lifting the smoothness s in (3.22) by 1,
as indicated in Figure 2, p. 19. This has been done in [T10] with respect to correspond-
s
ing spaces Bpq .I / on the interval I D .0; 1/. But in contrast to the Haar bases in the
preceding Section 3.2.2 the extension of this procedure from I to R requires now some
care and a detailed discussion of what happens in the points k 2 Z on R. On the other
hand it is quite clear by Theorem 3.1 that (3.10) is the Faber system we are looking
s
for. We begin with a preparation. Let again Apq .R; ˛/ be the spaces as introduced in
Definition 1.3. Then
s
f 2 Apq .R; ˛/ if, and only if, f; f 0 2 Apq
s1
.R; ˛/; (3.27)
and
s s1
kf jApq .R; ˛/k kf jApq .R; ˛/k C kf 0 jApq
s1
.R; ˛/k: (3.28)
s
This follows from the Fourier-analytical version of Bpq .R; w/ and its F -counterpart as
described in Remark 1.4 where it is helpful in this context to complement the references
given there by [ST87, Section 5.1] and in particular by [ST87, Theorem 1.9.1, p. 63].
This rather general vector-valued inequality shows in particular that the usual Fourier
s
multiplier assertions for the unweighted spaces Apq .Rn / have direct counterparts for
weighted spaces. In particular, (3.28) is a rather special consequence.
Recall that C.R/ is the space of all complex-valued bounded continuous functions
on R normed as usual by the L1 -norm. Let as before w˛ .x/ D .1 C x 2 /˛=2 , ˛ 2 R.
Proposition 3.5. Let 0 < p; q 1 (p < 1 for the F -spaces), ˛ 0 and s > 1=p.
Then
s
Apq .R; ˛/ ,! C.R/ (3.29)
and
X 1=p
s
kf jApq .R; ˛/k jf .k/ w˛ .k/jp C kf 0 jApq
s1
.R; ˛/k: (3.30)
k2Z
Proof. The embedding (3.29) follows from ˛ 0 and the R-counterpart of (1.114),
[T08, (6.300), (6.301), p. 229]. We prove (3.30) where we may assume that ˛ D 0.
Let 1=p < < s and let Ik D .k 1; k C 1/ with k 2 Z. Then
X 1=p X 1=p
jf .k/jp c
kf jBpp .Ik /kp
k2Z k2Z (3.31)
c 0 kf jBpp

.R/k c 00 kf jApq
s
.R/k;
where we used the so-called localisation principle, [T92, Section 2.4.7, p. 124] and
pointwise multipliers. This proves that the right-hand side of (3.30) can be estimated
from above by the left-hand side. We prove the converse. By Fourier-analytical argu-
s1 1
ments it follows that one can replace kf jApq .R/k in (3.28) by kf jBpp .R/k again
with 1=p < < s. Then one obtains as in [T10, Section 3.1.1] that
X 1=p
1 1
kf jBpp .R/k kf jBpp .Ik /kp
k2Z
X 1=p X 1=p
c jf .k/jp Cc kf 0 jBpp
1
.Ik /kp (3.32)
k2Z k2Z
X 1=p
c0 jf .k/jp C c 0 kf 0 jApq
s1
.R/k:
k2Z
This proves that the left-hand side of (3.30) can be estimated from above by the right-
hand side.
Let and the sequence space bpq .R; ˛/, quasi-normed by k jbpq .R; ˛/k, be as in
P2j 1
(3.17), (3.18), where we again agree that mD0 means m D 0 if j D 1. Similarly
we put
fvjkm W j 2 N1 ; k 2 ZI m D 0; : : : ; .2j 1/C g (3.33)
k
for the conditional basis (3.10), (3.11) in C0 .R/, Theorem 3.1, where v1;0 D v k . We
s
wish to show that (3.33) is an unconditional basis in some spaces Bpq .R; ˛/ reducing
Faber bases to Haar bases in the same way as done in [T10] with respect to the unit
interval I D .0; 1/. We recalled in connection with (3.12), (3.13) what is meant
by conditional and unconditional bases. If s > 1=p and ˛ > 0 then (3.29) can be
strengthened by
s
Apq .R; ˛/ ,! C0 .R/; s > 1=p; ˛ > 0; (3.34)
using the same arguments and references as at the beginning of the proof of Propo-
sition 3.5. In particular any function f belonging to these spaces can be expanded
according to Theorem 3.1. We explained after (3.21) what is meant by local conver-

gence in Bpq .R/. Let again 2h f be the second differences as used in (1.112), (1.113)
and in Theorem 3.1. Let bpq .R; ˛/ be the sequence spaces (3.17), (3.18). Recall again
P2j 1
that mD0 means m D 0 if j D 1.
Theorem 3.6. Let 0 < p; q 1,

1 1
< s < 1 C min 1; ; (3.35)
p p
see Figure 2, p. 19, and ˛ > 0. Let f 2 S 0 .R/. Then f 2 Bpq
s
.R; ˛/ if, and only if, it
can be represented as
1 X 2X
1 j
X 1
f D jkm 2j.s p / vjkm ; 2 bpq .R; ˛/; (3.36)
j D1 k2Z mD0

unconditional convergence being in C0 .R/ and locally in any space Bpq .R/ with < s.
Then representation (3.36) is unique,
.f / D fjkm .f / W j 2 N1 ; k 2 ZI m D 0; : : : ; .2j 1/C g (3.37)
with
1
k1;0 .f / D 2sC p f .k/; k 2 Z; (3.38)
1
j.s p /1
jkm .f / D 2 .22j 1 f /.k C 2 j
m/;
(3.39)
j 2 N0 ; k 2 ZI m D 0; : : : ; 2j 1:
Furthermore,
J W f 7! .f / (3.40)
s
is an isomorphic map of Bpq .R; ˛/ onto bpq .R; ˛/. If, in addition, max.p; q/ < 1
then
1
f2j.s p / w˛ .k/1 vjkm W j 2 N1 ; k 2 ZI m D 0; : : : ; .2j 1/C g (3.41)
s
is an unconditional (normalised ) basis in Bpq .R; ˛/.
s
Proof. Step 1. Let f 2 Bpq .R; ˛/. We apply Theorem 3.3 to f 0 2 Bpq
s1
.R; ˛/,
1 X 2X
1 j
X X 1
f D0
.f .k C 1/ f .k//k C jkm .f 0 / 2j.s1 p / hjkm ; (3.42)
k2Z j D0 k2Z mD0
1
jkm .f 0 / D 2j.s p / 22j 1 f .k C 2j m/ D 2 jkm .f /; (3.43)
where we used (3.24) and (3.39). Furthermore,
X 1=p
kf 0 jBpq
s1
.R; ˛/k w˛ .k/p jf .k C 1/ f .k/jp
k2Z
(3.44)
1 X 2X
X j 1
q=p 1=q
C w˛ .k/p jjkm .f 0 /jp :
j D0 k2Z mD0
The expansion (3.42) can be rewritten as
1 X 2X
1 j
X X 1
f D 0
f .k/.k1 k / C 2 jkm .f / 2j.s1 p / hjkm : (3.45)
k2Z j D0 k2Z mD0
Let f 2 D.R/ D C01 .R/. Then it follows by integration that
1 X 2X
1 j
X X 1
f D k
f .k/v1;0 C jkm .f / 2j.s p / vjkm
k2Z j D0 k2Z mD0
(3.46)
1 X X
X 2j 1
1
j.s p /
D jkm .f / 2 vjkm ;
j D1 k2Z mD0
k
where we incorporated the starting terms v1;0 D v k according to (3.11), (3.33), (3.38).
Now it follows from (3.44), (3.43) and Proposition 3.5 that
s
k.f / jbpq .R; ˛/k c kf jBpq .R; ˛/k: (3.47)
3.3 Sampling 51
s
If max.p; q/ < 1 then D.R/ is dense in Bpq .R; ˛/ and (3.47) can be extended from
s
D.R/ to Bpq .R; ˛/ by completion. If max.p; q/ D 1 then one obtains (3.47) from
s
pointwise multiplier assertions and the Fatou property of Bpq .R; ˛/, which follows
s
from the Fatou property of Bpq .R/. As for the Fatou property we refer to [T01, p. 360]
or [RuS96, p. 15].
Step 2. Let f be given by (3.36). Then one has for f 0 a representation of type
(3.42), (3.44) and it follows from Theorem 3.3 that f 0 2 Bpq
s1
.R; ˛/,
kf 0 jBpq
s1
.R; ˛/k c k jbpq .R; ˛/k: (3.48)
The Lipschitz functions vjkm are (not normalised) atoms in

1
Bpq .R; ˛/ with max ; 1 1 < < min.1; s/: (3.49)
p
The unweighted case ˛ D 0 of this assertion is covered by [T10, Definition 1.5,
Theorem 1.7, pp. 4–5] (with K D 1, L D 0). One may also consult Figure 2, p. 19.
s
This assertion can be extended to the weighted spaces Bpq .R; ˛/ by the arguments in
[T06, Chapter 6]. With s as (3.35) we choose with (3.49) such that s 1 . Then

one has f 2 Bpq .R; ˛/ and in particular
s1
kf jBpq .R; ˛/k c k jbpq .R; ˛/k: (3.50)
s
By (3.27), (3.28) and (3.48), (3.50) one obtains f 2 Bpq .R; ˛/ and
s
kf jBpq .R; ˛/k c k jbpq .R; ˛/k: (3.51)
Theorem 3.1 and (3.34) show that the uniquely determined coefficients jkm are given
by (3.38), (3.39). Furthermore from (3.47), (3.51) it follows that J in (3.40) is an
s
isomorphic map. If max.p; q/ < 1 then (3.41) is an unconditional basis in Bpq .R; ˛/.

3.3 Sampling
3.3.1 The problem. We collect what we already know and indicate what we wish to
s
do. Let again I D .0; 1/ be the unit interval in R and let Bpq .I / be the Besov spaces
defined in the usual way by restriction as in (1.91), (1.92). If
1 u p 1; 0 < q 1; s > 1=p; (3.52)
then the embedding

s
id W Bpq .I / ,! Lu .I / (3.53)
ak .id/ ek .id/ gk .id/ gklin .id/ k s ; k 2 N; (3.54)
for the approximation numbers ak .id/, the entropy numbers ek .id/ and the sampling
numbers gk .id/, gklin .id/. This is a special case of Proposition 1.17 where one finds
also in the Remarks 1.16, 1.18 the necessary explanations and references. Approx-
imation numbers, entropy numbers and sampling numbers have been introduced in
Sections 1.3.1, 1.3.2. If
1 1
1 u p 1; 0 < q 1; <s <1C ; (3.55)
p p
see Figure 2, p. 19, then one has by Theorem 1.23 the Faber expansion (1.118) with the
coefficients (1.119) admitting pointwise evaluation. Under the restriction (3.55) one
can prove (3.54) for the sampling numbers by construction of optimal approximations
in terms of Faber expansions. This is the case mentioned in (3.1), (3.2) and also in
(1.1), (1.2) where one finds also the necessary references to [T10]. Now we switch
s
to the weighted spaces Bpq .R; ˛/ according to Definition 1.3. On the one hand we
have the Faber expansion according to Theorem 3.6. On the other hand the weight
w˛ .x/ D .1 C x 2 /˛=2 requires additional restrictions for the parameters involved as
indicated in Theorem 1.11, Figures 1, p. 12 and 3, p. 53. Then the natural counterpart
of (3.53), (3.55) is given by
s
id W Bpq .R; ˛/ ,! Lu .R/; (3.56)
where
1 1 1
˛ > 0; u 1; 0 < C ˛; 0 < q 1; (3.57)
p u p
and p1 < s < 1 C p1 . One has according to Theorem 1.11 for the approximation
numbers ak .id/ and the entropy numbers ek .id/,
´
1 1
k s if s p
C u
< ˛;
ak .id/ ek .id/ 1
˛C u 1
p 1 1
(3.58)
k if s p
C u
> ˛;
k 2 N. Explanations and references may be found in Remark 1.12. It is the main aim
of this Section 3.3 to show that the equivalences in (3.58) apply also to the sampling
numbers gk .id/ and gklin .id/.
3.3.2 Main assertions. The notation have the same meaning as in the preceding Sec-
tion 3.3.1.
3.3 Sampling 53
1 1 1
Theorem 3.7. Let ˛ > 0, u 1, 0 p
u
s C ; (3.60)
p u
then
ak .id/ ek .id/ gk .id/ gklin .id/ k s ; k 2 N: (3.61)
(ii) If, in addition,

1 1
˛<s C ; (3.62)
p u
then
1 1
ak .id/ ek .id/ gk .id/ gklin .id/ k ˛C u p ; k 2 N: (3.63)
(iii) If, in addition,

1 1
˛Ds C ; (3.64)
p u
then there is a number c > 0 and for any ", 0 < " < 1, a number c" > 0 such that
c k s gk .id/ gklin .id/ c" k s .log k/˛C" ; 2 k 2 N: (3.65)
If u D p and ˛ D s then (3.65) remains valid with " D 0.
s
2
s
1
1 1 1 1 1
p u
1 p
D p
C˛ p
Figure 3. Sampling.
Proof. Step 1. The compactness of the embedding (3.59) and also the assertions about
the approximation numbers and entropy numbers in (3.61), (3.63) are covered by (3.58).
In this step we prove
1 1
gk .id/ c k min.s;˛C p u / ; k 2 N; (3.66)
for some c > 0. We use Proposition 1.15. Then it follows from corresponding
assertions for embeddings on the unit interval that gk .id/ c k s . This has been
mentioned in [T10, (4.19), p. 177] with a reference to [NoT06] and [T06, Theorem 4.37,
pp. 224–25] for details. We now justify
1 1
gk .id/ c k ˛ p C u ; k 2 N; (3.67)
for some c > 0 using again Proposition 1.15 with D R. Let
D fx1 ; : : : ; xk g R.
Then there are k intervals Il D .l; l C 1/ with l 2 Z Z, k l < k, such that
Il \
D ;. Let X
l
f .x/ D v0;0 .x/; x 2 R; (3.68)
l2Z
l
with v0;0 .x/ as in (3.10) (hat-functions above Il ). It follows from Theorem 3.6 that
1
s
kf jBpq .R; ˛/k c k ˛C p ; k 2 N; (3.69)
where c is independent of k. On the other hand,
kf jLu .R/k k 1=u ; k 2 N: (3.70)
Then (3.67), and hence also (3.66), follow from Proposition 1.15.
Step 2. It remains to prove that gK
lin
.id/ can be estimated from above by the right-
s
hand sides of (3.61), (3.63), (3.65) with K in place of k. We expand f 2 Bpq .R; ˛/
by (3.36),
1 X 2X
1 j
X 1
f D jkm 2j.s p / vjkm ; 2 bpq .R; ˛/: (3.71)
j D1 k2Z mD0
Let K 2 N and let

J K D fJkK W k 2 Zg (3.72)
with
JkK D Jk
K
2 N0 if k D 0; : : : ; K and JkK D 1 if jkj > K (3.73)
be the adapted counterpart of (3.14), where JkK will be chosen later on appropriately.
Let
K
X JX k 1 2X
j 1
1
JK
S f D jkm 2j.s p / vjkm (3.74)
k2Z j D1 mD0
3.3 Sampling 55
P
be a finite partial sum of (3.71) where we agree that j2
D1 means that the correspond-
P2j 1
ing sums over jkj > K are empty. As before mD0 in case of j D 1 means m D 0.
It follows from (3.38), (3.39) that one needs in (3.74) only the knowledge of f in
K
X K
2Jk points on R: (3.75)
kD0
Let u < 1 (if u D 1 then one has to modify what follows appropriately). It follows
from (3.71), (3.74) and the above convention
hXn X
1
1 1
2X
1 1=u ou i1=u j
f S J Kf jLu .R/ c 2j.s p C u / jjkm ju : (3.76)

k2Z j DJkK mD0
1 1
Let u
D p
C ˇ. Then 0 ˇ < ˛. With 0 < ˇ < < ˛ and 0 < " < s one obtains
K
kf S J f jLu .R/k
hXn X
1
1 1
2X
j 1
1=p ou i1=u
j.s p Cu ˇ /
c 2 jjkm jp
k2Z j DJkK mD0
hXn X
1 j 1
2X 1=p ou i1=u
0 JkK s .j JkK /.s"/p
c 2 2 jjkm jp
k2Z mD0
(3.77)
j DJkK
hX X
1 j 1
2X i1=p
00 p JkK sp .j JkK /.s"/p
c .1 C jkj/ 2 2 jjkm jp
k2Z j DJ K mD0
k
X ˇ
.1 C jkj/=ˇ :
k2Z
By (3.18) and s > " > 0 one has for u < p,

K K
kf S J f jLu .R/k c Œ sup .1 C k/˛ 2Jk s k jbpq .R; ˛/k: (3.78)
k2N0
If u D p, hence ˇ D 0, then (3.78) can be improved by

K K
kf S J f jLp .R/k c Œ sup .1 C k/˛ 2Jk s k jbpq .R; ˛/k: (3.79)
k2N0
1
Step 3. We prove part (i) and assume ˛ > s p
C u1 . Let 1
u
1
p
Dˇ< <˛
and ~ > 1 such that ˛ > ~s C . Let
K K
2Jk 2J0 .1 C k/~ ; k D 0; : : : ; K; (3.80)
K
and 2J0 K. Then it follows from (3.78) and Theorem 3.6 that
K K
kf S J f jLu .R/k c 2J0 s kf jBpq
s
.R; ˛/k c 0 K s kf jBpq
s
.R; ˛/k (3.81)
and
K
X K K
2Jk 2J0 K: (3.82)
kD0
Now one has by (3.74), (3.75) and (3.81), (3.82)

s
lin
gK .id W Bpq .R; ˛/ ,! Lu .R// c K s ; K 2 N: (3.83)
This proves (3.61).

Step 4. We prove part (ii) of the above theorem and assume first u D p, hence
˛ < s. With
K
X
K K K K ˛
2Jk 2J0 .1 C k/˛=s one has 2Jk 2J0 K 1 s : (3.84)
kD0
K
We choose now 2J0 K ˛=s . Then it follows from (3.74), (3.75) and (3.79) that
s
lin
gK .id W Bpq .R; ˛/ ,! Lp .R// c K ˛ ; K 2 N: (3.85)
This proves (3.63) if u D p.

Step 5. For the remaining cases u < p with (3.62) we need a preparation. Let tem-
s
porarily Bpq;.t/ .R; ˛/ be the corresponding weighted spaces where the basic Lebesgue
spaces Lp .R/ in (1.19) and in Definition 1.3, (1.37) are replaced by the Lorentz spaces
Lp;t .R/. We refer to [T78, Definition, Section 2.4.1, p. 181] and (including the needed
s
limiting cases) [Pee67] as far as the unweighted spaces Bpq;.t/ .R/ are concerned. The
2 ˛=2
weights w˛ .x/ D .1 C x / are incorporated as in Definition 1.3 and Remark 1.4.
Then one has by [T78, Section 2.4.1,Theorem, Remark 4, pp. 181–83] and (again as
far as limiting cases are concerned) [Pee67] the real interpolation
.Bps0 1 .R; ˛/; Bps1 1 .R; ˛//;1 D Bp1;.1/

s
.R; ˛/ (3.86)
where 0 < < 1 and

1 1
p0 6D p1 ; D C : (3.87)
p p0 p1
K
Our estimates from above of gK lin
rely in all cases on the approximating operators S J f
in (3.74). This justifies the application of real interpolation. If ˛ < s then it follows
from step 4 and (3.86)
s
lin
gK .id W Bp1;.1/ .R; ˛/ ,! Lp;1 .R// c K ˛ ; K 2 N: (3.88)
3.3 Sampling 57
Let now 1 u < p and

1 1
0 < ˛u D ˛ C < s: (3.89)
p u
According to [ET96, Theorem 4.2.4, p. 163] one has the continuous embedding
s s
idp;u W Bp1 .R; ˛/ ,! Bu1;.1/ .R; ˛u /: (3.90)
K
We apply the interpolation property to the universal linear operator f S J f . Then
it follows from (3.90) and (3.88) with u in place of p that
1 1
lin
gK s
.id W Bpq .R; ˛/ ,! Lu;1 .R// c K ˛ p C u : (3.91)
s
For fixed Bpq and two admitted spaces Lu1 ;1 .R/ and Lu2 ;1 .R/, u1 6D u2 , it
.R; ˛/
follows again by real interpolation that
1 1
lin
gK s
.id W Bpq .R; ˛/ ,! Lu .R// c K ˛ p C u ; K 2 N: (3.92)
Together with (3.67) one obtains (3.63).
Step 6. We prove (iii). The estimate from below is covered by (3.66) with s D
˛ C p1 u1 . As for the estimate from above we replace in (3.77) with u < p,
1 1
.1 C jkj/ by .1 C jkj/ˇ .log.2 C jkj// ; >ˇD : (3.93)
u p
Then the last factor in (3.77) converges and (3.78) can be replaced by
K K
kf S J f jLu .R/k c Œ sup .1 C k/ˇ ˛ .log.2 C k// 2Jk s k jbpq .R; ˛/k
k2N0
K
c Œ sup .1 C k/s .log.2 C k// 2Jk s kf jBpq
0 s
.R; ˛/k:
k2N0
(3.94)
We choose
K K K
2Jk 2J0 .1 C k/1 .log.2 C k//=s and 2J0 K.log K/=s : (3.95)
Then
K
kf S J f jLu .R/k c K s .log K/ kf jBpq
s
.R; ˛/k (3.96)
and
K
X K
X
JkK =s
2 K.log K/ k 1 .log k/=s K log K (3.97)
kD0 kD2
for the numbers of needed points according to (3.75). With L K log K and, hence
log L log K it follows that
gLlin .id/ c Ls .log L/sC D c Ls .log L/˛C" ; 2 L 2 N: (3.98)
This proves (3.65) for u < p. If u D p and ˛ D s then one can use (3.79). Now (3.98)
with " D 0 follows from (3.94)–(3.97) with D 0.
Remark 3.8. In the non-limiting cases ˛ 6D s p1 C u1 we obtained final assertions in

(3.61) and (3.63) for sampling numbers (under the restrictions of the theorem) which
complement corresponding results for approximation numbers and entropy numbers
according to Theorem 1.11. The limiting case ˛ D s p1 C u1 attracted a lot of
attentions and one has now many assertions. We collected in Remark 1.12 the relevant
references. In particular, log-terms are quite natural for the asymptotic behaviour of
approximation numbers and entropy numbers. We mention here only a special case
adapted to the restrictions of the parameters in the above theorem. Let
Hps .R; ˛/ D Fp;2

s
.R; ˛/; 1 0, 1 < u < p < 1, u1 < p1 C ˛ and p1 < s < 1 C p1 . Let
1 1
˛Ds C (limiting case): (3.100)
p u
Then
ek .id W Hps .R; ˛/ ,! Lu .R// k s .log k/˛ ; 2 k 2 N: (3.101)
This is a special case of [HaT05, Corollary 4.7]. We refer also to [T06, Section 6.4.2,
pp. 284–86] where we collected further results and related references in limiting situ-
ations. One can expect that the sampling numbers behave similarly. But as in case of
s s
entropy numbers the q-index in Bpq .R; ˛/ and Fpq .R; ˛/ will play a role in limiting
situations.
3.4 Faber splines and sampling

s
3.4.1 Faber splines. By Theorem 3.6 any f 2 Bpq .R; ˛/ with 0 < p; q 1, ˛ > 0,
and s restricted by (3.35) can be uniquely expanded according (3.36)–(3.39). The
coefficients jkm .f / reflect the possibility of pointwise evaluation based on s > 1=p.
This crucial observation was the main ingredient in Theorem 3.7 where we dealt with
the sampling numbers gk .id/ and gklin .id/ for the embedding
s
id W Bpq .R; ˛/ ,! Lu .R/: (3.102)
The restrictions ˛ > 0, s > 1=p and also u1 < p1 C ˛ are natural in this context. We
assumed in addition 1 u p. This is not necessary. It is the simplest case as far as
these parameters are concerned, illustrated in Figure 3, p. 53. In [T10] we dealt also
with other admitted combinations and with more general target spaces. Now we are
mainly interested in the influence of the weight function w˛ .x/ D .1 C x 2 /˛=2 both in
s
the construction of bases and frames in the spaces Bpq .R; ˛/ and their subsequent use to
3.4 Faber splines and sampling 59
deal with sampling. Additional complications caused by other admitted combinations

of p, u and related target spaces are left for future research. However the situation is
different as far as the restriction s < 1C p1 in Theorem 3.7, based on (3.35), is concerned.
The underlying Faber system (3.33) in the expansion (3.36) originates from the hat
functions in (3.7)–(3.11). Then (3.35) is natural. If the study of sampling numbers is
based on Faber bases or frames in the source space then s < 1 C p1 in Theorem 3.7
is obvious. In this context one may also consult Point 1 in Section 1.4.2, in particular
(1.157), (1.158) referring to [SiU11]. We stick here at our procedure asking first
for bases or frames in source spaces with coefficients admitting pointwise evaluation
and apply the outcome afterwards to sampling. Then, as said above, s < 1 C p1 in
Theorem 3.7 is natural. It is the main aim of Section 3.4 to outline a method which shows
that this approach can be extended naturally to all s > 1=p switching from the above
Faber bases (consisting of hat functions) to higher Faber spline frames (consisting of
piecewise polynomials). We collect the necessary ingredients following closely [T10,
Sections 3.5.2, 3.5.3, pp. 167–172] where one finds further information and references.
Let Vl .x/, l 2 N0 , x 2 R, be a basic Faber spline of order l according to [T10,
(3.273), p. 168], denoted there as v l .x/. In particular the hat function V0 .x/ D v0;0 .x/
is the basic Faber spline of order 0 according to (1.111) extended from the interval
I D .0; 1/ to R, underlying also the constructions of Faber bases in the Theorems 3.1,
3.6. Now we extend these constructions to Faber spline frames of order l 2 N. Recall
the following properties of Vl , l 2 N0 , according to [T10, Proposition 3.37, p. 168]:
(i) The function Vl has classical continuous derivatives up to order 2l inclusively
on R.
(ii) The restriction of Vl to each interval .m; m C 12 / with 2m 2 Z is a polynomial
of order 2l C 1.
(iii) There are constants c > 0, > 0, such that
jVl .x/j c 22 jxj ; x 2 R: (3.103)
In contrast to the compactly supported hat function V0 we have now only the exponential
decay (3.103) for Vl , l 2 N, with some D l > 0.
Definition 3.9. Let l 2 N0 and let Vl be a basic Faber spline of order l. Then
fvj m;l .x/ D Vl .2j x m/ W j 2 N0 ; m 2 Zg (3.104)
is called a Faber spline system of order l.
Remark 3.10. Let vj m be the same functions as in (1.111) now with m 2 Z and x 2 R.
Then
fvj m;0 D vj m W j 2 N0 ; m 2 Zg (3.105)
is the Faber spline system (3.104) of order 0. It is the classical system (1.109) without
the functions v0 , v1 , but extended from I D .0; 1/ to R. We refer also to (3.7)–(3.11).
The extension of Theorem 1.23 and afterwards of the Theorems 3.1 and 3.6, from
Faber spline systems of order 0 to higher Faber spline systems causes some problems
as far as counterparts of the starting terms v0 , v1 in (1.118), (1.119) are concerned.
s
But these difficulties can be avoided dealing first with functions f 2 Bpq .R/ having
small supports, supp f Œ0; 1=2. This explains why we deal with (3.104) as the
extension (3.105) without the starting functions v0 , v1 . In [T10, Theorem 3.40, p. 169]
we expanded
s
f 2 Bpq .R/; supp f Œ0; 1=2 (3.106)
with 0 < p; q 1, l 2 N0 ,

1 1
< s < 2l C 1 C min ;1 ; (3.107)
p p
see Figure 4, with respect to the system (3.104). Later on we restrict p by 1 p 1.

We incorporate now some discussions and comments according to [T10, Section 3.5.3,
pp. 172–73] in the following assertion, adapted to our later needs.
s
2l C 2
2l C 1
l C1
l
1
1 2l C 2 p
l
l 1
Figure 4. Faber splines.
Proposition 3.11. Let l 2 N0 and let fvj m;l g be the Faber spline system of order l
according to Definition 3.9. Let 0 < p; q 1,

1 1
< s < 2l C 1 C min ;1 ; (3.108)
p p
see Figure 4. Then

s
f 2 Bpq .R/; supp f Œ0; 1=2; (3.109)
can be uniquely expanded by
X 2X
1j
X XX 1
f .x/ D f .2j 1 k/ l
akm vj m;l .x/ D j m 2j.s p / vj m;l .x/;
j 2N kD1 m2Z j 2N m2Z
(3.110)
x 2 R, with
1 X
X q=p 1=q
s
kf jBpq .R/k jj m jp : (3.111)
j D1 m2Z
Furthermore, ajl m 2 R and

l
jakm j c 2%j2mkj ; m 2 Z; k 2 N; (3.112)
for some c > 0, % > 0, and

j 1
2X
1
j.s p / l
j m D 2 akm f .2j 1 k/: (3.113)
kD1
Remark 3.12. The above assertions follow from [T10, Theorem 3.40, Section 3.5.3,
pp. 169–73]. We add two comments. By (3.103), (3.104) and (3.112) one has
ˇX ˇ X
ˇ l ˇ j C1
ˇ a v
km j m;l .x/ˇc 2%j2mkj j2 x2mj
m2Z m2Z
X j C1 xkmj
c 2%jmj j2 (3.114)
m2Z
j C1 xkj
c 2ıj2
0
; x 2 R;
for some c > 0, c 0 > 0, ı > 0, where the last estimate follows from the preceding ones
if one splits m 2 Z into, say, 2jmj < j2j C1 x kj and 2jmj j2j C1 x kj. Hence
f .2j 1 k/ in (3.110) is multiplied with a function concentrated at x 2j 1 k and an
exponential decay. This is the natural (not compact but rapidly decaying) counterpart
of the term
.22j 1 f /.2j k/ vj k ; j 2 N0 ; k D 0; : : : ; 2j 1; (3.115)
in (1.112), based on the Faber spline system (3.105) of order 0. Recall that the functions
vj k in (3.115) have compact supports, (1.111), and only the values of f in a few
neighbouring points of 2j k contribute to the factor in front of vj k . For higher Faber
spline systems one has (3.110) with
j 1
2X
1 1
j m D 2j.s p / l
akm f .2j 1 k/ D 2j.s p / Djl m f; (3.116)
kD1
indicating notationally that these coefficients are finite distinguished linear combina-
tions of the function values f .2j 1 k/. By (3.111) we have
X
1
1
X q=p 1=q
2j.s p /q jDjl m f jp s
kf jBpq .R/k (3.117)
j D0 m2Z
with f as in (3.109).
Problem 3.13. For the Faber systems (1.109) in I and (3.10) in R we have the Theo-
s
rems 1.23 and 3.6. They are bases in the admitted Bpq -spaces with max.p; q/ < 1.
Proposition 3.11 has not the same final character. The underlying arguments in [T10,
proof of Theorem 3.40, pp. 170–71] forced us to eliminate the counterparts of the start-
ing terms v1;m in (3.36). It remains the challenging task to complement the Faber
spline systems fvj m;l g of order l 2 N in the above proposition by starting terms such
s
that one has unique representations of type (3.110) for all f 2 Bpq .R/ and its weighted
s
counterparts f 2 Bpq .R; ˛/. This has not yet been done. It would be of interest for its
own sake. On the other hand Proposition 3.11 will be sufficient to extend Theorem 3.7
to all s > 1=p.
s
3.4.2 Sampling. Let Bpq .R; ˛/ be the weighted Besov spaces according to Defini-
tion 1.3. As described in Section 3.3.1 we are interested in approximation numbers
ak .id/, entropy numbers ek .id/ and sampling numbers gk .id/, gklin .id/ for the compact
embedding
s
id W Bpq .R; ˛/ ,! Lu .R/ (3.118)
where
1 1 1
˛ > 0; u 1; 0 < C ˛; 0 < q 1; (3.119)
p u p
now for all s > 1=p. Approximation numbers, entropy numbers and sampling numbers
have been introduced in the Sections 1.3.1, 1.3.2. By Theorem 1.11 one has for the
embedding (3.118) with (3.119) and s > 0,
´
k s if s p1 C u1 < ˛;
ak .id/ ek .id/ 1 1 (3.120)
k ˛C u p if s p1 C u1 > ˛;
k 2 N. We refer also to the Figures 1, 3, 4, pp. 12, 53, 60, illustrating the situation.
Now we can remove the restriction s < 1 C p1 in Theorem 3.7.
Theorem 3.14. Let ˛ > 0, u 1, 0 p1 u1 < p1 C ˛, 0 < q 1 and s > 1=p.

Then the embedding
s
id W Bpq .R; ˛/ ,! Lu .R/ (3.121)
is compact.

1 1
˛>s C ; (3.122)
p u
then
1 1
˛<s C ; (3.124)
p u
then
1 1

1 1
˛Ds C ; (3.126)
p u
then there is a constant c > 0 and for any ", 0 < " < 1, a constant c" > 0 such that

Proof. Step 1. The assertions about ak .id/, ek .id/ in (3.120) and also the estimate
from below
gk .id/ c k s ; k 2 N; (3.128)
for some c > 0 in (3.66) applies to all s > 1=p. As for
1 1
gk .id/ c k ˛ p C u ; k 2 N; (3.129)
with some c > 0 we modify the arguments in (3.67)–(3.70) slightly. Let ' 2 D.R/
with supp ' D Œ0; 1 and '.x/ > 0 if 0 < x < 1. Let
D fx1 ; : : : ; xk g R.
Then there are k intervals Il D .l; l C 1/ with l 2 Z Z, k l k such that
Il \
D ;. Let X
f .x/ D '.x l/; x 2 R; (3.130)
l2Z
be the smooth counterpart of (3.68). One obtains by Definition 1.3, (1.37) and atomic
s
arguments for the spaces Bpq .R/
1
s
kf jBpq .R; ˛/k c k ˛ kf jBpq
s
.R/k c k ˛C p ; k 2 N; (3.131)
for some c > 0. On the other hand,

Z
fu .x/ dx k; k 2 N: (3.132)
R
Similarly as in step 1 of the proof of Theorem 3.7 one obtains (3.129) from (3.131),
(3.132) and Proposition 1.15.
Step 2. We estimate gklin .id/ from above in the same way as in the steps 2–6 of
the proof of Theorem 3.7. There is essentially only one new point. Proposition 3.11
s
is restricted to functions f with (3.109). One has to decompose f 2 Bpq .R/, and
s 1 1
similarly f 2 Bpq .R; ˛/ appropriately. Let 2 D.R/ with supp . 4 ; 4 /,
X
t t
.x/ D .x 4
C w/; t D 1; 2; 3; 4; (3.133)
w2Z
and
4
X
t
.x/ D 1; x 2 R: (3.134)
tD1
A function with the above properties can constructed by a suitable mollification of

the characteristic function of the interval . 18 ; 18 /. These functions t are pointwise
s s
multipliers in Bpq .R/ and hence also in Bpq .R; ˛/. Then one has
4
X
s t s
kf jBpq .R; ˛/k k f jBpq .R; ˛/k: (3.135)
tD1
By Proposition 3.11 the function .x 14 /f .x/ can be expanded by sharply located

molecules in both versions of (3.110) with (3.114), a counterpart for vj m;l .x/, (3.113),
(3.116), (3.117). This applies also to the translated terms .x 14 C w/ in 1 .x/
according to (3.133). For this purpose one can replace x in the term in (3.104) by
x C w, hence
vj m;l .x C w/ D Vl .2j x C 2j w m/; j 2 N0 ; m 2 Z; w 2 Z: (3.136)
This can be clipped together with respect to w 2 Z. The other functions t f can be
treated in the same way after translated by . t f /.x t1
4
/. Otherwise one can proceed
as in step 2 of the proof of Theorem 3.7. The steps 3–6 of the proof of Theorem 3.7
remain unchanged.
3.4.3 Sampling on intervals, revisited. Let again I D .0; 1/ be the unit interval on
R. Let ak .id/, ek .id/, gk .id/, gklin .id/ be the approximation numbers, entropy numbers
and sampling numbers for the compact embedding
s
id W Bpq .I / ,! Lu .I /; 1 u p 1; s > 1=p; (3.137)
0 < q 1, as introduced in the Sections 1.3.1, 1.3.2. According to Proposition 1.17

one has
ak .id/ ek .id/ gk .id/ gklin .id/ k s ; k 2 N; (3.138)
as a special case of [T06, Theorem 4.45, p. 229]. The proofs in [T06] are not construc-
tive. Our intentions both in this book and in [T10] are different. We ask first for bases
s
or frames in Bpq -spaces with s > 1=p such that the coefficients of the corresponding
expansions evaluate f at finitely many points. Afterwards we use these expansions for
constructive explicit approximations resulting in optimal assertions for corresponding
sampling numbers. This has been done in [T10] in a rather general way whereas we
restrict ourselves in the present book to some model cases as described in Section 3.1.
The first and in some sense decisive step was done in [T10, Theorem 3.1, pp. 126–27]
s
where we constructed explicitly Faber bases in some spaces Apq .I /. We recalled in
the above Theorem 1.23 the B-part of this assertion. These observations had been used
in [T10, Theorem 4.13, pp. 189–90] to construct explicitly optimal approximations for
the sampling numbers gk .id/ and gklin .id/ of our model case
s 1 1
id W Bpq .I / ,! Lu .I /; 1 u p 1; <s <1C ; (3.139)
p p
(and more general source and target spaces) resulting in (3.138). We extended these
s
considerations in Theorems 3.6, 3.7 from I D .0; 1/ to R and from Bpq .I / to the
s
weighted spaces Bpq .R; ˛/ with s restricted as in (3.139). The attempt to stick at the
one hand at this constructive approach but on the other hand to remove the restriction
s < 1 C p1 resulted in Proposition 3.11 and Theorem 3.14 in the generalisation of the
above Faber bases (Faber spline system of order 0) to higher Faber spline systems of
order l 2 N0 . But there is a decisive difference. In Theorem 3.6 we stepped from the
basis (1.109), underlying Theorem 1.23, to the basis (3.41). This required some extra
k
attention at the points k 2 Z in R, reflected by the terms v1;m in (3.41) and k1;0 .f /
in (3.38). In Proposition 3.11 and subsequently in Theorem 3.14 we dealt from the
very beginning with Faber spline systems of order l on R and avoided a discussion
what happens at the points 2m 2 Z in R. One may ask for a way back from R to I .
We outline a possibility following the suggestions in [T10, pp. 166–67].
Let again I D .0; 1/ be the unit interval on R and let

s 1
f 2 Bpq .I /; 0 < p; q 1; s > max ; 1 1: (3.140)
p
Then f can be extended from I to R by the classical Hestenes method: We may assume
supp f Œ0; 1=2/ and put f .x/ D 0 if 1=2 x < 1. Then f can be extended from
x > 0 to x < 0 by
´
f .x/ if x > 0;
extL f .x/ D PL (3.141)
lD1 al f .lx/ if x < 0;
with s < L 2 N and

L
X
.1/k al l k D 1; k D 0; : : : ; L 1: (3.142)
lD1
We refer for details to [T92, Section 4.5.2, p. 223] and for historical comments to
[HaT08, Section 4.6.1, p. 112]. If s > 1=p then pointwise evaluation makes sense and
L
X
extL f .2j m/ D al f .2j lm/; j 2 N0 ; m 2 N0 : (3.143)
lD1
In particular, the function values of extL f in the lattice points 2j Z can be reduced to
the function values of f in I \2j Z. Obviously, extL f has a compact support in R. We
apply Proposition 3.11 to extL f in place of f (after some dilations and translations).
Then it follows from (3.110) with extL f in place of f and (3.143), based on (3.141),
that one needs only the function values of f in the lattice points I \ 2j 1 Z. This
shows that optimal constructive approximations for the sampling numbers in (3.137),
(3.138) can be reduced to corresponding constructions in Theorem 3.14. But we do
not go into the details.
Problem 3.15. We complement Problem 3.13 by the request to construct (extended)
s
Faber spline systems of order l 2 N0 which are bases in Bpq .I / with

1 1
0 < p; q < 1; < s < 2l C 1 C min ;1 ; (3.144)
p p
Figure 4, p. 60. The case l D 0 is covered by Theorem 1.23 based on (1.109)–(1.111).
This suggests that the Faber spline systems of order l 2 N as used in Proposition 3.11
and afterwards must be (and can be) extended suitably.
3.5 Integration
3.5.1 Preparations. Numerical integration, discrepancy and linear sampling num-
bers with target spaces of L1 -type are closely related to each other. We dealt in [T10,
Chapters 5, 6] extensively with problems of this type. So far we used the symbiotic
relationship between numerical integration and discrepancy in Theorem 2.3 and its
proof. Otherwise we rely on Section 1.3.3 and specify the integral numbers introduced
in Definition 1.19 as follows. Let D R and
s
G1 . / D Bpq .R; ˛/; 0 < p; q 1; s > 1=p; ˛ > 0: (3.145)
Then one has by (3.29), (3.34),

s
id W Bpq .R; ˛/ ,! C.R/ (3.146)
as requested in (1.100). Let

1
1 p 1; 0 < q 1; 1< C ˛; s > 0: (3.147)
p
3.5 Integration 67
Then the embedding

s
id W Bpq .R; ˛/ ,! L1 .R/ (3.148)
is compact. This is a special case of Theorem 1.11 with n D u D 1. Figure 3, p. 53,

illustrates both (3.145), (3.146) and (3.147), (3.148). In particular one has (1.99) with
n D 1 and L1 . ; w/ D L1 .R/. Then the corresponding integral numbers according
to (1.102), (1.103) are given by
s
Int k .Bpq .R; ˛//
˚ˇ Z k
X ˇ
D inf sup ˇ f .x/ dx al f .x l /ˇ W f 2 Bpq
s s
.R; ˛/; kf jBpq .R; ˛/k 1 ;
R
lD1
(3.149)
k 2 N, where the infimum is taken over all k-tuples fx l gklD1 R and all fal gklD1 C.
Recall that the sampling numbers gklin .id/ of the embedding (3.148) can be written as
s
gklin .Bpq .R; ˛//
˚Z ˇ k
X ˇ
D inf sup ˇf .x/ f .x l / hl .x/ˇdx W f 2 Bpq
s s
.R; ˛/; kf jBpq .R; ˛/k 1 ;
R
lD1
(3.150)
k 2 N, where the infimum is taken over all k-tuples fx l gklD1 R and fhl gklD1
L1 .R/. This is a special case of (1.104). By (1.105) one has
s s
Int k .Bpq .R; ˛// gklin .Bpq .R; ˛//; k 2 N: (3.151)
Proposition 1.21 describes the situation in case of n-dimensional isotropic spaces.
3.5.2 Main assertions. All notation have the same meaning as in the preceding Sec-
tion 3.5.1.
Theorem 3.16. Let ˛ > 0 and 1 p 1 such that p1 D 1

p
C˛ > 1. Let 0 < q 1
and s > 1=p. Then
´
1
s s
k s if ˛ > s p
C 1;
Intk .Bpq .R; ˛// gklin .Bpq .R; ˛// 1
˛ p C1 1
(3.152)
k if ˛ < s p
C 1;
k 2 N, see Figure 1, p. 12. Furthermore, if ˛ D s p1 C 1 then there are numbers

c > 0 and for any ", 0 < " < 1, numbers c" > 0 such that
c k s Intk .Bpq
s s
.R; ˛// gklin .Bpq .R; ˛// c" k s .log k/˛C" ; (3.153)
2 k 2 N. If p D 1 and ˛ D s > 1 then (3.153) remains valid with " D 0.

Proof. The estimate from above follows from Theorem 3.14 and (3.151). By [T10,
Theorem 5.4, p. 223] and its proof one obtains
s
Int k .Bpq .R; ˛// c k s ; k 2 N; (3.154)
for some c > 0. It remains to prove that for some c > 0,

1
s
Intk .Bpq .R; ˛// c k ˛ p C1 ; k 2 N: (3.155)
But this can be done in the same way as in step 1 of the proof of Theorem 3.7 based
on (3.130), (3.131) and u D 1 in (3.132).
Remark 3.17. The proof of the above theorem relies on Theorem 3.14 which in turn
is the somewhat sketchy extension of Theorem 3.7 from p1 < s < 1 C p1 to s > 1=p.
In case of Theorem 3.7 we constructed explicitly best approximating functions. This
K
is S J f in (3.74) with the specifications (3.80), (3.84) for the numbers JkK in (3.72),
(3.73). This can be transferred to the above theorem (with u D 1 in Theorem 3.7).
Hence best assertions for numerical integration (as far as the order of convergence is
concerned) can be obtained explicitly if one expands f according to Theorem 3.6 in
terms of the Faber basis (3.33). This requires s < 1 C p1 . If s 1 C p1 then one has
so far no such convincing explicit constructions.
3.6 Weighted target spaces

3.6.1 Preliminaries. We stick at our model case as described in (3.3) and (3.56),
(3.57) temporarily denoted as
id˛ W Bpq
s
.R; ˛/ ,! Lu .R/ (3.156)
with
1 1 1 1
˛ > 0; u 1; 0 < C˛ D ; 0 < q 1; (3.157)
p u p p
see Figures 1 and 3, p. 12 and p. 53, s > 1=p. Let Lp .R; ˇ/ D Lp .R; wˇ / with
wˇ .x/ D .1 C x 2 /ˇ=2 , ˇ 2 R, 0 < p 1, be the usual Lebesgue spaces quasi-
normed by
Z 1=p
kf jLp .R; ˇ/k D kwˇ f jLp .R/k D wˇp .x/ jf .x/jp dx (3.158)
R
according to Remark 1.4, adapted to Definition 1.3 (usual modification if p D 1). We

shift the weight w˛ from the source space in (3.156) to the target space. Let
s
id˛ W Bpq .R/ ,! Lu .R; ˛/ (3.159)
3.6 Weighted target spaces 69
with the same parameters as above. Interpreting w˛ and w˛ as multiplication operators
one has
id˛ D w˛ ı id˛ ı w˛ ; (3.160)
s s
where w˛ maps Bpq .R; ˛/ isomorphically onto Bpq .R/ and w˛ maps Lu .R; ˛/
isomorphically onto Lu .R/. One has by well-known properties of the approximation
numbers ak and the entropy numbers ek , introduced in Definition 1.9,
ak .id˛ / ak .id˛ / and ek .id˛ / ek .id˛ /; k 2 N: (3.161)
It is not clear whether sampling numbers gk , gklin and integral numbers Int k in the
generality as introduced in Sections 1.3.2 and 1.3.3 have similar properties as the
approximation and entropy numbers. But this is the case at least for the above described
model situation. We are again interested in explicit constructions. This requires some
specific arguments based on Faber expansions for unweighted spaces.
In Theorem 3.6 we assumed ˛ > 0 to ensure that the Faber expansion (3.36) of
s
f 2 Bpq .R; ˛/ converges unconditionally in C0 .R/. If one replaces C0 .R/ in this
context by, say, L1 .R; ˇ/ with some ˇ < 0 then Theorem 3.6 remains valid for all ˛
s
with ˛ > ˇ, including in particular ˛ D 0, hence Bpq .R/ with 0 < p; q 1 and s as
in (3.35). (Remark that also Proposition 3.5 can be appropriately extended to ˛ < 0.)
We will not stress this point in what follows.
3.6.2 Sampling. What follows is essentially a copy of corresponding assertions in the

preceding Sections 3.3–3.5. But it is not obvious somewhat in contrast to the related
observation (3.161) for approximation numbers and entropy numbers. Furthermore
we are again interested in the explicit construction of best approximations. This may
justify to formulate the outcome with some care.
Theorem 3.18. Let ˛ > 0, u 1, 0 p1 u1 < p1 C ˛, 0 < q 1 and
1
p
< s < 1 C p1 , see Figure 3, p. 53. Then the embedding
s
id W Bpq .R/ ,! Lu .R; ˛/ (3.162)
is compact.
1 1
˛>s C ; (3.163)
p u
then

1 1
˛<s C ; (3.165)
p u
then
1 1

1 1
˛Ds C ; (3.167)
p u
then there is a number c > 0 and for any ", 0 < " < 1, a number c" > 0 such that

Proof. The assertions about the approximation numbers ak .id/ and the entropy num-
bers ek .id/ follow from Theorem 3.7, based on (3.58) and (3.161).The justification of
the counterpart of (3.66) with id according to (3.162) is the same as in step 1 of the
proof of Theorem 3.7, based on f in (3.68) now with
s
kf jBpq .R/k c k 1=p ; k 2 N; (3.169)
and
1
kf jLu .R; ˛/k c k ˛C u ; k 2 N; (3.170)
for some c > 0. The modification of step 2 of the proof of Theorem 3.7 gives
K K
kf S J f jLu .R; ˛/k c Œ sup .1 C k/˛ 2Jk s k jbpq .R/k (3.171)
k2N0
as the substitute of (3.78) if u < p and

K K
kf S J f jLp .R; ˛/k c Œ sup .1 C k/˛ 2Jk s k jbpq .R/k (3.172)
k2N0
if u D p. Here bpq .R/ D bpq .R; 0/ according to (3.17), (3.18) with 1 in place of
w˛ .k/. For this purpose one can rely on Theorem 3.6 with ˛ D 0 and the comments
at the end of Section 3.6.1. Hence for the proof of (3.78), (3.79) and (3.171), (3.172)
it does not matter whether the weight w˛ .x/ is incorporated in the source spaces or
the target spaces. Afterwards one can proceed as in the steps 3–6 of the proof of
Theorem 3.7. This applies also to the appropriately modified step 5.
Remark 3.19. The equivalences in (3.161) are consequences of general abstract map-
ping properties of approximation numbers and entropy numbers in quasi-Banach spaces.
One may consult [ET96, Section 1.3.1, pp. 7–13]. But the crucial transfer of (3.78),
(3.79) (weighted source spaces) to (3.171), (3.172) (weighted target spaces) depends
on the special explicit expansions of corresponding elements in terms of Faber bases.
There is no underlying abstract assertion and it is not clear whether the behaviour of
sampling numbers remains the same when (more general) weights are shifted from
source spaces to target spaces. On the other hand we outlined in Section 3.4 the theory
of higher Faber splines and their use in sampling. This is a constructive procedure to
which the above arguments can be applied. In other words, one can shift the weight
w˛ in Theorem 3.14 from source spaces to target spaces. The outcome is an extension
of s in Theorem 3.18 to all s > 1=p which can be formulated as follows.
Corollary 3.20. Theorem 3.18 remains valid for all ˛, u, p, q as there and s > 1=p.
s
3.6.3 Integration. Theorem 3.16 deals with the integral numbers Intk .Bpq .R; ˛//
s
according to (3.149) for the weighted spaces Bpq .R; ˛/. This is closely related to the
s
special sampling numbers gklin .Bpq .R; ˛// as introduced in (3.150). Now we are doing
the same shifting the weight from the source side to the target side. First we specify
the integral numbers introduced in Definition 1.19 as follows. Let D R and
s
G1 . / D Bpq .R/; 0 < p; q 1; s > 1=p: (3.173)
Then one has (3.29) as requested in (1.100). Let
1
1 p 1; 0 < q 1; 1< C ˛; s>0 (3.174)
p
(hence ˛ > 0). Then the embedding
s
id W Bpq .R/ ,! L1 .R; ˛/ (3.175)
with L1 .R; ˛/ as in (3.158), (3.159) is compact. This is a special case of Theorem 1.11
with n D u D 1 and the comments in Section 3.6.1. In particular one has (1.99) with
n D 1 and L1 . ; w/ D L1 .R; ˛/. The corresponding integral numbers according
to (1.102) are given by
˚ˇ Z k
X ˇ
s
Intk .Bpq .R/; ˛/ D inf sup ˇ f .x/w˛ .x/ dx al f .x l /ˇ W
R (3.176)
lD1
s s

f 2 Bpq .R/; kf jBpq .R/k 1 ;
k 2 N, where the infimum is taken over all k-tuples fx l gklD1 R and all fal gklD1 C.
Recall that the sampling numbers gklin .id/ of the embedding (3.175) can be written as
˚Z ˇ k
X ˇ
s
gklin .Bpq .R/; ˛/ D inf sup ˇf .x/ f .x l / hl .x/ˇw˛ .x/dx W
R (3.177)
lD1
s s

f 2 Bpq .R/; kf jBpq .R/k 1 ;
k 2 N, where the infimum is taken over all k-tuples fx l gklD1 R and fhl gklD1
L1 .R; ˛/. This is a special case of (1.104). By (1.105) one has
s s
Intk .Bpq .R/; ˛/ gklin .Bpq .R/; ˛/; k 2 N: (3.178)
This is the counterpart of corresponding definitions and assertions in Section 3.5.1.
Theorem 3.21. Let ˛ > 0 and 1 p 1 such that p1 D 1

p
C˛ > 1. Let 0 < q 1
and s > 1=p. Then
´
1
s s
k s if ˛ > s p
C 1;
Int k .Bpq .R/; ˛/ gklin .Bpq .R/; ˛/ 1
˛ p C1 1
(3.179)
k if ˛ < s p
C 1;
k 2 N, see Figure 1, p. 12. Furthermore, if ˛ D s p1 C 1 then there are numbers

c > 0 and for any ", 0 < " < 1, numbers c" > 0 such that
c k s Intk .Bpq
s s
.R/; ˛/ gklin .Bpq .R/; ˛/ c" k s .log k/˛C" ; (3.180)
2 k 2 N. If p D 1 and ˛ D s > 1 then (3.180) remains valid with " D 0.
Proof. This is the direct counterpart of Theorem 3.16 where the weights are shifted
s s
from the source spaces, this means Bpq .R/ in place of Bpq .R; ˛/, to the target side,
weighted integration,
Z Z
f .x/
dx in place of f .x/ dx: (3.181)
R .1 C x 2 /˛=2 R
The estimates from above follow from Theorem 3.18, Corollary 3.20 and (3.178).
For the estimates from below one can rely on the same arguments as in the proof of
Theorem 3.16 and the references given there.
Remark 3.22. In this Section 3.6 we shifted the weight w˛ .x/ D .1 C x 2 /˛=2 , ˛ > 0,
from the source side to the target side and dealt with id˛ in (3.159) instead of id˛
in (3.156). In case of approximation numbers ak and entropy numbers ek one has
(3.160), (3.161) and this modification is not very interesting. The situation is different
for sampling and numerical integration. The outcome is the same, but it depends
mainly on the rather peculiar observation that the right-hand sides of (3.78), (3.79)
on the one hand and (3.171), (3.172) on the other hand coincide essentially (at least
as far as the influence of the weight w˛ is concerned). In step 5 of the proof of
Theorem 3.7 we dealt with several weights on the source side. These arguments
remained unchanged in the proof of Theorem 3.18. This makes clear that at least
by our arguments weights on the source side are desirable in any case. As far as
sampling is concerned it might be a matter of taste whether one prefers Theorems 3.7,
3.14 or Theorem 3.18, Corollary 3.20. For numerical integration one may have the
impression that Theorem 3.21 looks more handsome than Theorem 3.16. This will
be illustrated by some examples below. Furthermore there is some interest to study
sampling, numerical integration and discrepancy in the context of Lp -spaces based
on more general measures, preferably probability measures. We refer to [NoW09],
[Gne11] and [NoW10, Section 9.6].
3.6.4 Comments and inequalities. In [T10, Section 5.2.2, pp. 228–30] we added
s
some discussions about numerical integration for functions f 2 Bpq .I /, s > 1=p,
s
on the unit interval I D .0; 1/. We extend these considerations now to f 2 Bpq .R/,
s > 1=p. In particular we wish to rewrite the best approximating linear expressions
K
S J f in (3.74) and their integrals in a more handsome way.
Let
1 1 1
1 p 1; 0 < q 1; < s < 1 C ; ˛ C > 1: (3.182)
p p p
According to Theorem 3.6 and the comments at the end of Section 3.6.1 any f 2
s
Bpq .R/ can be expanded by
1 2X
1 j
X 1 XX
k
f .x/ D f .k/ v1;0 .x/ .22j 1 f /.kC2j m/ vjkm .x/: (3.183)
2
k2Z k2Z j D0 mD0
Here vjkm are again the Faber functions according to (3.7)–(3.11) with v1;0
k
D v k as
in (3.33). Let
K
Jk 1 2 1 j
X 1 X X X
JK k
S f D f .k/ v1;0 .22j 1 f /.k C 2j m/ vjkm (3.184)
2 mD0
jkjK jkjK j D0
with JkK 2 N be the best approximating linear expressions according to (3.72)–(3.74)

and the related specifications of J K . In the target space L1 .R; ˛/ originating from
(3.158), (3.159) and hence also in (3.175)–(3.177) one can replace
w˛ .x/ D .1 C x 2 /˛=2 ; x 2 R; by wz ˛ .x/ D .1 C k 2 /˛=2 ; k x < k C 1;
(3.185)
k 2 Z. Then it follows from Theorems 3.18, 3.21, their proofs and relevant specifica-
tions of J K that
ˇZ ˇ
ˇ K ˇ
ˇ .f .x/ S J f .x// w s
z ˛ .x/ dx ˇ c IntK .Bpq s
.R/; ˛/ kf jBpq .R/k; K 2 N;
R
(3.186)
1
excluding limiting cases, hence ˛ 6D s p
C 1. It is desirable to calculate the integral
K
over S J f in (3.186) more explicitly.
K
Proposition 3.23. Let S J f with K 2 N be as in (3.184) and let w z ˛ .x/ with ˛ > 0
be the discrete version of w˛ .x/ according to (3.185). Then
Z
K f .K C 1/ C f .K/
S J f .x/ wz ˛ .x/ dx D
R 2.1 C .1 C K/2 /˛=2
JK
X K 2Xk 1 (3.187)
2Jk 1 JkK
C .f .k/ C f .k C 1// C f .k C l 2 / :
.1 C k 2 /˛=2 2
jkjK lD1
Proof. By (3.184) one has

Z
K
S J f .x/ w
z ˛ .x/ dx
R
K
X Z kC1 (3.188)
f .K C 1/ C f .K/ 1 K
D 2 ˛=2
C 2 ˛=2
S J f .x/ dx:
2.1 C .1 C K/ / .1 C k / k
kDK
K
The function S J f in the interval .k; k C 1/ coincides with [T10, (5.30), p. 226] after
replacing there x 2 I by x 2 .k; k C1/ and J by JkK 1. Then the terms with jkj K
follow from [T10, (5.31), (5.39), pp. 226–27].
Remark 3.24. Recall that we always assume 1 p 1, p1 < s < 1 C p1 . If,
in addition, ˛ 6D s p1 C 1 then we have both (3.179) and (3.186), (3.187). Since
s
Bpq .R/ ,! C.R/ it follows that the first term on the right-hand side of (3.187) can
be shifted to the right-hand side of (3.186). The function values of f at k 2 Z with
jkj K are counted twice in (3.187). This suggests the abbreviation
JK JK
2Xk 2X
k 1
0 JkK 1 K
f .k C l 2 / D .f .k/ C f .k C 1// C f .k C l 2Jk /: (3.189)
2
lD0 lD1
K
These are the brackets Œ : : : in (3.187). The numbers 2Jk , JkK 2 N, are the same as
in the steps 3–5 of the proof of Theorem 3.7. This means that
K 1
2Jk K .1 C jkj/~ if 1 < ~ < .˛ C 1/ s 1 (3.190)
p
and
.˛C 1 1/s 1
JkK K p 1
2 if ˛ C 1 < s: (3.191)
1 C jkj p
This covers the two cases in (3.179) and gives an impression of the decay of JkK if
jkj " K. We summarise the above comments.
Corollary 3.25. Let ˛ > 0 and 1 p 1 such that p1 C ˛ > 1. Let 0 < q 1
and p1 < s < 1 C p1 . Let w
z ˛ be as in (3.185). Then one has for some c > 0 and all
s
f 2 Bpq .R/,
K
ˇZ X
J
2X k ˇ
ˇ JkK 2 ˛=2 0 K ˇ
z ˛ .x/ dx
ˇ f .x/ w 2 .1 C k / f .k C l 2Jk /ˇ
R
jkjK lD0 (3.192)
´
s 1
s
K if s < ˛ C p
1;
c kf jBpq .R/k 1
˛ p C1 1
K if s > ˛ C p
1;
K 2 N, with
8
K
<K.1 C jkj/~ if s < ~s < ˛ C p1 1;
2Jk .˛C p1 1/s 1 (3.193)
: K if s > ˛ C p1 1:
1Cjkj
Proof. This follows from (3.186), Theorem 3.21 with (3.182) and the comments in
Remark 3.24, especially (3.189)–(3.191).
Remark 3.26. The constant c in (3.192) depends on ~ with ~ > 1 and ~s < ˛ C p1 1.
One can incorporate the limiting case ˛ D s p1 C 1 based on (3.180) and (3.95).
Otherwise the outcome looks quite natural: In each interval .k; k C 1/, k 2 Z, the
K
integral over f is approximated by Riemannian sums, the lattice points k C l 2Jk
getting thinner if jkj " K, compensated by decaying weights .1 C k 2 /˛=2 . In [T10,
Section 5.2, pp. 225–30] we dealt with numerical integration for function spaces on the
unit interval I D .0; 1/. The above assertions, especially Corollary 3.25, extend these
consideration to spaces on R (at the expense of weights). As in [T10, Section 5.2.2]
we illustrate the outcome by some examples.
Example 3.27. Recall that Bpq s

.R/ can be normed by (1.28) where m h
f are the same
differences as in (1.26). Let p, q, s, ˛ be as in (3.182) and let s < m 2 N. Then
K
ˇZ X
J
2X k ˇ
ˇ JkK 2 ˛=2 0 K ˇ
z ˛ .x/ dx
ˇ f .x/ w 2 .1 C k / f .k C l 2Jk /ˇ
R
jkjK lD0
Z 1=q
dh (3.194)
c kf jLp .R/k C jhjsq km
h f jLp .R/k
q
jhj1 jhj
´
1
K s if s < ˛ C p
1;
1
˛ p C1 1
K if s > ˛ C p
1;
K
with 2Jk as in (3.193). Recall that C s .R/ D B1;1
s
.R/ are the usual Hölder–Zygmund
spaces. If ˛ > 1 and 0 < s < 1 then one obtains as a special case of (3.194),
K
ˇZ X
J
2X k ˇ
ˇ JkK 2 ˛=2 0 K ˇ
z ˛ .x/ dx
ˇ f .x/ w 2 .1 C k / f .k C l 2Jk /ˇ
R
jkjK lD0 (3.195)
´
jf .x/ f .y/j K s if s < ˛ 1;
c sup jf .x/j C sup
x2R jxyj1 jx yjs K ˛C1 if s > ˛ 1:
Example 3.28. For the Sobolev spaces Wp1 .R/ with 1 2;
c .kf jLp .R/k C kf 0 jLp .R/k/ 1
˛ p C1 1
K if 1 < ˛ C p
< 2:
This follows from (3.182), (3.194) with s D 1 and

1
Bp;1 .R/ ,! Wp1 .R/ ,! Bp;1
1
.R/: (3.197)
4
Spaces on the plane
4.1 Introduction
In this Chapter 4 we are mainly interested in sampling numbers of the compact em-
beddings
r
id W Spq B.R2 ; ˛/ ,! Lu .R2 / (4.1)
where
1 1 1 1 1 1
˛ > 0; u 1; < C˛ D and <r <1C ; (4.2)
p u p p p p
r
see Figures 1 and 3, p. 12 and p. 53 (with r in place of s). Here Spq B.R2 ; ˛/ are the
weighted spaces with dominating mixed smoothness according to the Definitions 1.5,
1.7 and the Remarks 1.6, 1.8. The corresponding Theorem 4.5 in Section 4.3 is the main
result of this chapter. On the one hand it is the weighted counterpart of (1.3), (1.4). On
the other hand it extends the main result of Chapter 3 according to Theorem 3.7 from
the real line R to the plane R2 . At the end of this Chapter 4 we formulate in Section 4.5
how corresponding assertions look like in higher dimensions. As in Chapter 3 we
restrict ourselves to the model case (4.1), (4.2) avoiding any additional complications
originating from more general target spaces (as considered in [T10]) or other admitted
constellations of u and p. This is left for future research. We rely again on Faber
bases extending in Section 4.2 Theorem 3.6 from R to R2 . This restricts r in (4.2) to
r < 1C p1 . In Section 3.4 we introduced in Definition 3.9 and Remark 3.10 Faber spline
systems of order l 2 N0 on R (where l D 0 corresponds to the above Faber basis).
Then r < 1 C p1 can be replaced by (3.107) and one arrives at Theorem 3.14. The
tensor product procedure of Faber bases (Faber spline systems of order 0) on which we
rely below should also work for higher Faber spline systems. But this will not be done
here and is again left for future research. In Section 4.4 we collect some results about
numerical integration both for weighted source spaces and weighted target spaces.
4.2 Haar and Faber bases

4.2.1 Faber bases in C0 .R2 /. In [T10] we dealt with Haar tensor bases first in Rn and
then in the unit cube Qn (preferably n D 2). Based on these assertions we considered
afterwards Faber bases only in Qn but not in Rn . Here we follow the reverse procedure.
78 4 Spaces on the plane
The step from I D Q1 D .0; 1/ to R was done in the above Section 3.2. Now we are
doing the same in higher dimensions restricting us to n D 2. Let
fvj m W j 2 N1 ; m 2 Zg (4.3)
be the Faber basis in R according to (3.7)–(3.10). Let
fvkm .x/ D vk1 m1 .x1 / vk2 m2 .x2 / W k 2 N21 ; m 2 Z2 g (4.4)
be the usual two-dimensional tensor product. Recall that N1 D N0 [ f1g and
N21 D N1 N1 . Of course x D .x1 ; x2 / 2 R2 . We ask for the two-dimensional
counterparts of the Theorems 3.1 and 3.6. For this purpose we extend first [T10,
(3.74)–(3.77), p. 136] from Q2 to R2 . Let
2h;1 f .x1 ; x2 / D f .x1 C 2h; x2 / 2f .x1 C h; x2 / C f .x1 ; x2 / (4.5)
where x D .x1 ; x2 / 2 R2 and h 2 R. Similarly 2h;2 f .x1 ; x2 /. Let
2;2
h1 ;h2
f .x1 ; x2 / D 2h2 ;2 .2h1 ;1 f /.x1 ; x2 /; h1 2 R; h2 2 R: (4.6)
Then
2
dkm .f / D f .m/ if k D .1; 1/; m 2 Z2 ; (4.7)
2
dkm .f /D 12 22k2 1 ;2 k2
f .m1 ; 2 2
m2 / if k D .1; k2 /; k2 2 N0 ; m 2 Z ;
(4.8)
2
dkm .f / D 12 22k1 1 ;1 f .2k1 m1 ; m2 / if k D .k1 ; 1/; k1 2 N0 ; m 2 Z2 ;
(4.9)
2
dkm .f / D 1
4
2;2
2k1 1 ;2k2 1
f .2k1 m1 ; 2k2 m2 / if k 2 N20 ; m 2 Z2 : (4.10)
In other words, a continuous function f is evaluated at the indicated points in R2 . Recall

that C.R2 / is the collection of all complex-valued bounded continuous functions in R2 ,
normed according to (1.79), hence
kf jC.R2 /k D sup jf .x/j: (4.11)

x2R2
Let
C0 .R2 / D ff 2 C.R2 / W jf .x/j ! 0 if jxj ! 1g (4.12)
be the counterpart of (3.6). Then D.R2 / D C01 .R2 / is dense in C0 .R2 /. We explained
in Section 3.2.1 what is meant by a conditional basis. We have the following counterpart
of Theorem 3.1.
Theorem 4.1. The system (4.4) is a conditional basis in C0 .R2 /,

1
X
f .x/ D .fKC1 .x/ fK .x// C f0 .x/; f 2 C0 .R2 /; (4.13)
KD0
convergence in C0 .R2 /, with

X X
2
fK .x/ D dkm .f / vkm .x/; K 2 N0 : (4.14)
k2N21
m2Z2
jm1 jK; jm2 jK
k1 K; k2 K
Proof. This follows from the expansion of f 2 C.Q2 / in [T10, Theorem 3.10, p. 136]
and Theorem 3.1, Remark 3.2 above.
Remark 4.2. The more sophisticated version in Theorem 3.1 prepared decompositions
of type (3.74) in connection with sampling numbers for weighted spaces on R. One
can do the same in higher dimensions, but the corresponding decompositions are more
complicated and will be shifted to later on.
4.2.2 Haar bases in weighted spaces. On the one hand we extended in Section 3.2.2
s s
Haar bases from Bpq .R/ to Bpq .R; ˛/. On the other hand we dealt in [T10, Sec-
r
tion 2.4.3, Theorem 2.38, p. 104] with Haar tensor bases in some spaces Spq B.R2 /. This
r
can be combined resulting in Haar tensor bases in some weighted spaces Spq B.R2 ; ˛/
with dominating mixed smoothness as introduced in Definitions 1.5, 1.7. We describe
the outcome.
Let y 2 R,
8
ˆ
<1 if 0 y < 1=2;
hM .y/ D 1 if 1=2 y < 1; (4.15)
:̂
0 otherwise;
p
hF .y/ D jhM .y/j; h1;m .y/ D 2 hF .y m/; m 2 Z; (4.16)
and
hj m .y/ D hM .2j y m/; j 2 N0 ; m 2 Z: (4.17)
Then
fhj m W j 2 N1 ; m 2 Zg (4.18)
is the same L1 -normalised Haar system on R as in (3.19) and in [T10, (2.96), p. 78].
Recall that N1 D N0 [ f1g and N21 D N1 N1 . Let x D .x1 ; x2 / 2 R2 . Then
fhkm .x/ W k 2 N21 ; m 2 Z2 g with hkm .x/ D hk1 m1 .x1 / hk1 m2 .x2 / (4.19)
is the same Haar tensor system as in [T10, Section 2.4, p. 98] with n D 2. We
s r
wish to extend Theorem 3.3 from Bpq .R; ˛/ to Spq B.R2 ; ˛/ and [T10, Theorem 2.38,
r
Section 2.4.3, p. 104] from Spq B.R2 / to Spq
r
B.R2 ; ˛/. For this purpose we need the
sequence spaces spq b.R2 ; ˛/ where 0 < p; q 1, ˛ 2 R, and
D fkm 2 C W k 2 N21 ; m 2 Z2 g (4.20)
with
X X q=p 1=q
k jspq b.R2 ; ˛/k D w ˛ .2k1 m1 ; 2k2 m2 /p jkm jp < 1;
k2N2
1 m2Z2
(4.21)
(usual modification if max.p; q/ D 1), where w ˛ has the same meaning as in (1.58). In
connection with the Theorems 3.1 and 3.3 we explained what is meant by unconditional
and conditional bases in quasi-Banach spaces, unconditional convergence in S 0 .R2 /
%
(replacing there R by R2 ) and local convergence now with respect to Spq B.R2 /.
Theorem 4.3. Let ˛ 2 R, 0 < p 1, 0 < q 1 .1 < q 1 if p D 1/ and

1 1
1 < r < min ;1 ; (4.22)
p p
see Figure 2, p. 19 (with r in place of s). Let f 2 S 0 .R2 /. Then f 2 Spq r

B.R2 ; ˛/ if,
and only if, it can be represented as
X X 1
f D km 2.k1 Ck2 /.r p / hkm ; 2 spq b.R2 ; ˛/; (4.23)
k2N2
1
m2Z2
%
unconditional convergence being in S 0 .R2 / and locally in any space Spq B.R2 / with
% < r. The representation (4.23) is unique,
Z
1
km D km .f / D 2.k1 Ck2 /.r p C1/ f .x/ hkm .x/ dx; k 2 N21 ; m 2 Z2 :
R2
(4.24)
Furthermore
J W f 7! fkm .f /g (4.25)
r
is an isomorphic map of Spq B.R2 ; ˛/ onto spq b.R2 ; ˛/. If p < 1, q < 1 then (4.19)
r
is an unconditional basis in Spq B.R2 ; ˛/.
Proof. This is the generalisation of [T10, Theorem 2.38, Section 2.4.3, p. 104] from
r
Spq B.R2 / (unweighted case ˛ D 0) to Spq r
B.R2 ; ˛/. The arguments in [T10, Section
2.4.3] rely on the observation that it is sufficient to work with atoms, wavelets and
kernels of local means in R2 which are products of corresponding building blocks in
r
R although the spaces Spq B.R2 / with q 6D p are not tensor products of some spaces
on R. We refer also to [T10, Sections 1.2.2–1.2.4]. The weight w ˛ in (1.58) fits in
this scheme. In other words, the above theorem can be proved using the technique in
connection with [T10, Section 2.4.3] combined with the above Theorem 3.3.
4.3 Sampling 81
4.2.3 Faber bases in weighted spaces. Let spq b.R2 ; ˛/ be the sequence spaces (4.20),
2
(4.21). Let fvkm g be the Faber system in R2 according to (4.4) and let dkm .f / be the
mixed second differences as introduced in (4.7)–(4.10).
Theorem 4.4. Let either p D q D 1 or 0 < p; q < 1 and
1

p
< r < 1 C min p1 ; 1 ; (4.26)
see Figure 2, p. 19 (with r in place of s). Let ˛ > 0. Let f 2 S 0 .R2 /. Then
r
f 2 Spq B.R2 ; ˛/ if, and only if, it can be represented as
X X 1
f D km 2.k1 Ck2 /.r p / vkm ; 2 spq b.R2 ; ˛/; (4.27)
k2N2
1
m2Z2
%
unconditional convergence being in C0 .R2 / and locally in any space Spq B.R2 / with
% < r. The representation (4.27) is unique,
1
km D km .f / D 2.k1 Ck2 /.r p / dkm
2
.f /; k 2 N21 ; m 2 Z2 : (4.28)
Furthermore,
J W f 7! .f / (4.29)
r
is an isomorphic map of Spq B.R2 ; ˛/ onto spq b.R2 ; ˛/. If p < 1, q < 1, then
1
f2.k1 Ck2 /.r p / w ˛ .2k1 m1 ; 2k2 m2 /1 vkm W k 2 N21 ; m 2 Z2 g (4.30)
r
is an unconditional (normalised ) basis in Spq B.R2 ; ˛/.
Proof. In [T10, Theorem 3.16, p. 145] we dealt with expansions of type (4.27) for
r
spaces Spq B.Q2 / with 0 < p; q < 1 and r as in (4.26) in the unit square Q2 in
2 r
R . The corresponding assertion for spaces Spq B.Q2 / with p D q D 1 is covered
by [T10, Theorem 3.13, p. 138]. This was based on related expansions of the spaces
r1
Spq B.Q2 / in terms of Haar tensor bases. One can follow these arguments now with
Theorem 4.3 as the underlying Haar expansions. There are some minor complications
as far as the starting terms vkm with k 2 N21 n N20 in (4.27) are concerned. But here
one can rely on the same arguments as in the proof of Theorem 3.6.
4.3 Sampling
4.3.1 Main assertions. We come to the main assertions of this Chapter 4. This is the
study of sampling numbers for compact embeddings of type
r
id W Spq B.R2 ; ˛/ ,! Lu .R2 /: (4.31)
r
The spaces Spq B.R2 ; ˛/ have the same meaning as in the Definitions 1.5, 1.7 and the
Remarks 1.6, 1.8. So far we dealt with the one-dimensional counterpart (3.56) which
resulted in Theorem 3.7. As there we restrict ourselves to the model case (3.57),
1 1 1 1
˛ > 0; u 1; 0 < C˛ D ; (4.32)
p u p p
leaving other possible cases for future research. First we justify that (4.31) with (4.32)
makes sense. Let
1 1
˛ > 0; 1up1 and D Cˇ with ˇ > 0: (4.33)
u p
Then it follows from Hölder’s inequality, the product structure of w ˛ according to
(1.58) and ˇ < ˛ that
Z 2ˇ
˛
2 ˛ 2 2 2ˇ
kg jLu .R /k kgw jLp .R /k .1 C t / dt < 1: (4.34)
R
Hence, (4.31) with (4.32) makes sense and one can ask whether this embedding is
compact. We rely on Theorem 4.4 which means that we restrict r by p1 < r < 1 C p1 .
We refer to the Figures 1, p. 12 and 3, p. 53 (with r in place of s). Then it makes sense
to ask for the sampling numbers gk .id/ and gklin .id/ as introduced in Definition 1.13.
The conditions (4.32) and also the restrictions for r (in place of s) are the same as
in Theorem 3.7 where we dealt with sampling for the one-dimensional counterpart
(3.59) of (4.31). This suggests that the sampling numbers behave similar and that there
is again a splitting according to (3.60), (3.62). This is the case, but there is now a
further complication. Let p, q, r be as in Theorem 4.4 and let 0 < u 1. In [T10,
Theorem 4.15, (4.123), pp. 193, 195] we dealt in detail with sampling numbers for the
embedding
r
id W Spq B.Q2 / ,! Lu .Q2 / (4.35)
where again Q2 is the unit cube in R2 . It comes out that in contrast to spaces on R or
on the unit interval I D .0; 1/ the parameter q plays a role in the log-perturbations.
We described in (1.3), (1.4) a typical assertion adapted to our model case. It is quite
clear that something similar must be expected for the embedding (4.31). But again we
try to avoid any complications caused by the q-dependence and deal with the simplest
case, that is p D q, at least partly. A more detailed study of the q-dependence is left
for future research.
1 1 1 1
Theorem 4.5. Let ˛ > 0, u 1, 0 p
u
r C (4.37)
p u
then
r
id W Spp B.R2 ; ˛/ ,! Lu .R2 / (4.38)
is compact and there are two positive numbers c1 , c2 such that
1 1
c1 k r .log k/1 p gk .id/ gklin .id/ c2 k r .log k/rC1 p ; (4.39)
2 k 2 N.
1 1
˛<r C (4.40)
p u
and 0 < q 1 then
r
id W Spq B.R2 ; ˛/ ,! Lu .R2 / (4.41)
is compact and there are a number c > 0 and for any ", 0 < " < 1, numbers c" > 0
such that
1 1 1 1 ˛ 1
c1 k ˛ p C u .log k/˛ gk .id/ gklin .id/ c" k ˛ p C u .log k/2˛C r .1 u /C" ;
(4.42)
2 k 2 N. If 0 < ˛ < r and 0 < q p D u in (4.41) then there are two positive
numbers c1 , c2 such that
˛ 1
c1 k ˛ .log k/˛ gk .id/ gklin .id/ c2 k ˛ .log k/2˛C r .1 p / ; (4.43)
2 k 2 N.
Proof. Step 1. The estimate from below in (4.39) follows from the unweighted case
with the unit square Q2 in place of R2 , [T10, Theorem 4.15, (4.133), p. 195] based on
Proposition 1.15. We prove the estimate from below in (4.42) which covers also the
estimate from below in (4.43). We rely again on Proposition 1.15. Let
D fx j gjkD1
R2 be k points in R2 and let k L log L with L 2 N. Let
v.0;0/;m .x/ D v0;m1 .x1 / v0;m2 .x2 /; m D .m1 ; m2 / 2 Z2 ; (4.44)
x D .x1 ; x2 / 2 R2 be as in (4.4) based on (3.9). Let

k
X
f .x/ D v.0;0/;ml .x/; ml 2 Z2 ; f .x j / D 0; (4.45)
lD1
where j D 1; : : : ; k and ml1 6D ml2 if l1 6D l2 . In the region
f.x1 ; x2 / 2 R2 W .1 C jx1 j/.1 C jx2 j/ 2.L C 1/g; L 2 N; (4.46)

one finds L log L squares with integer-valued corners and of side-length 1. Recall
that k L log L in (4.45). Then ml can be chosen such that
w ˛ .ml / c .1 C jm1 j/˛ .1 C jm2 j/˛ c L˛ ; L 2 N; (4.47)
for some c > 0 which is independent of L. Let p, q, r, ˛ be as in Theorem 4.4. Then
it follows from this theorem and (4.21) that
r
kf jSpq B.R2 ; ˛/k c L˛ .L log L/1=p ; (4.48)
2 L 2 N. On the other hand we have
kf jLu .R2 /k .L log L/1=u : (4.49)
From log k log L C log log L it follows that log k log L and hence L
k.log k/1 . In other words,
1
r
kf jSpq B.R2 ; ˛/k k ˛C p .log k/˛ (4.50)
and
kf jLu .R2 /k k 1=u : (4.51)
Then one obtains by Proposition 1.15
1 1
gk .id/ c k ˛ p C u .log k/˛ (4.52)
for those k 2 N which are covered by the above procedure. But this is sufficient to
prove the left-hand sides of (4.42) and (4.43).
Step 2. To prove the right-hand sides of (4.39), (4.42), (4.43) we use the same
splitting technique as in the proof of Theorem 3.7. Let L 2 N,
K L D fKlL 2 N2 W l 2 Z2 g; N2 D N0 [ f1; 2g; (4.53)
and with KlL chosen later on
L
X X X 1
SK f D km 2.k1 Ck2 /.r p / vkm : (4.54)
l2Z2 k1 Ck2 <KlL m2Pkl
P L
Here k1 Ck2 <KlL is empty if KlL D 2 (no terms). Otherwise S K f is a partial sum
of (4.27), with (4.28) based on (4.7)–(4.10) now related to the squares l C .0; 1/2 . In
particular,
l
P.1;1/ D flg;
l
P.1;k 2/
D f.l1 ; 2k2 l2 C ml2 / W ml2 D 0; : : : ; 2k2 1g; k2 2 N0 ;
(4.55)
l k1
P.k 1 ;1/
D f.2 l1 C ml1 ; l2 / W ml1 k1
D 0; : : : ; 2 1g; k1 2 N0 ;
Pkl D f.2k1 l1 C ml1 ; 2k2 l2 C ml2 / W mlt D 0; : : : ; 2k t 1g; k 2 N20 :
4.3 Sampling 85
This corresponds to (4.7)–(4.10). In particular,
card Pkl 2k1 Ck2 ; k 2 N21 (4.56)
(interpreted as card Pkl 1 if k1 C k2 < 0). Then

L
kf S K f jLu .R2 /k
hXn X 1 1
X 1=u ou i1=u
c 2.k1 Ck2 /.r p C u / jkm ju : (4.57)
l2Z2 k1 Ck2 KlL m2Pkl
With
1 1
D C ˇ; hence 0 ˇ < ˛; (4.58)
u p
one has X 1=u X 1=p
jkm ju c 2.k1 Ck2 /ˇ jkm jp : (4.59)
m2Pkl m2Pkl
Then f : : : g can be estimated from above by

X X 1=p
f:::g c 2.k1 Ck2 /r jkm jp : (4.60)
k1 Ck2 KlL m2Pkl
We insert (4.60) in (4.57). Let ˇ > 0 in (4.58), hence u < p, and let ˇ < < ˛. Then
X ˇ X
1 2ˇ
w .l/1=ˇ c t =ˇ <1 (4.61)
l2Z2 tD1
and by Hölder’s inequality based on (4.58)

L
kf S K f jLu .R2 /k
hXn L X1
L X X 1=p ou i1=u
c 2Kl r 2.KKl /r jkm jp
l2Z2 KDKlL k1 Ck2 DK m2Pkl
hX L rp
nX
1
L /r X X 1=p op i1=p
c w .l/p 2Kl 2.KKl jkm jp :
l2Z2 KDKlL k1 Ck2 DK m2Pkl
(4.62)
If p D u then the last estimate is not needed and one has (4.62) with D 0, hence 1,
in place of w .l/. For K KlL 1 one has
K KlL
K D KlL 1 C KlL .1 C K KlL / (4.63)
KlL
and
X X 1=p
jkm jp
k1 Ck2 DK m2Pkl
1
X X 1=p
c K 1 p jkm jp (4.64)
k1 Ck2 DK m2P l
k
1 1
X X 1=p
c.KlL /1 p .1 C K KlL /1 p jkm jp :
k1 Ck2 DK m2P l
k
We insert (4.64) in (4.62) and incorporate also the terms with KlL D 2; 1; 0. Then
one obtains for any " with 0 < " < r;
L
kf S K f jLu .R2 /k
hX L 1
1
X 1
c w .l/p 2Kl rp .KlL C 3/.1 p /p .1 C K KlL /.1 p /p
l2Z2 KDKlL
L /.r"/p X X i1=p (4.65)

2.KKl jkm jp
k1 Ck2 DK m2P l
k
L 1
c Œ sup w ˛ .l/ 2Kl r .KlL C 3/1 p k jspp b.R2 ; ˛/k
l2Z2
where we used (4.21). If u D p then it follows from the comments after (4.62)
L L 1
kf S K f jLp .R2 /k c Œ sup w ˛ .l/ 2Kl r .KlL C 3/1 p k jspp b.R2 ; ˛/k:
l2Z2
(4.66)
These are the counterparts of (3.78), (3.79). We proceed now similarly as there.
Step 3. Let L 2 N. We ask for numbers KlL C 2 2 N0 such that
L 1
w ˛ .l/ 2Kl r .KlL C 3/1 p c L˛C ; l 2 Z2 ; (4.67)
in (4.65). If jl1 l2 j > L then we choose KlL D 2. This means that there are no terms
with jl1 l2 j > L in (4.54). In what follows we may assume that l1 1, l2 1 and that
KlL 2 N (the remaining terms can be incorporated easily). We choose for some ~ > 0,
L L
2Kl 2K0 .l1 l2 /~ if l1 l2 L: (4.68)
Then the number of terms in (4.54) and by (4.56), (4.28), based on (4.7)–(4.10), also
the number of points NL in R2 at which f is evaluated, can be estimated by
X L L X
NL c KlL 2Kl c 0 K0L 2K0 .l1 l2 /~ ; (4.69)
1l1 l2 L 1l1 l2 L
4.3 Sampling 87
where we used KlL c K0L . For the left-hand side of (4.67) one has
L 1 1 L
w ˛ .l/ 2Kl r .KlL /1 p c .K0L /1 p 2K0 r .l1 l2 /~r˛C : (4.70)
Let ˛ > r p1 C u1 be as in (4.37). Recall that ˇ < < ˛ with (4.58). Then we can
choose ~ > 1 and " > 0 such that
1 1
~r ˛ D ˛ C ": (4.71)
u p
Let
1 L
.K0L /1 p 2K0 r L˛C ; L 2 N: (4.72)
Then (4.67) follows from (4.70). Furthermore,
L
NL c K0L 2K0 M 2 N (4.73)
according to (4.69). With
log M K0L C log K0L one has K0L log M (4.74)

and hence
L M 1 L 1
2K0 ; .K0L /1 p 2K0 r M r .log M /rC1 p : (4.75)
log M
The right-hand side of (4.39) follows now from (4.73), and (4.72), (4.75) inserted in
(4.65), (4.67).
Step 4. We prove the right-hand side of (4.43) for 1 p D q D u 1 and,
hence, 0 < ˛ < r. Let L 2 N. We ask for numbers KlL C 2 2 N0 such that
L 1
w ˛ .l/ 2Kl r .KlL C 3/1 p c L˛ ; l 2 Z2 ; (4.76)
in (4.66). This is the counterpart of (4.67). If jl1 l2 j > L then we choose again
KlL D 2. This means that there are no terms with jl1 l2 j > L in (4.54). As before
we assume l1 1, l2 1 and KlL 2 N in what follows. In (4.68) we choose now
~ D ˛=r < 1, hence
L L
2Kl 2K0 .l1 l2 /˛=r if l1 l2 L: (4.77)
Then one has

L 1 1 L
w ˛ .l/ 2Kl r .KlL /1 p c .K0L /1 p 2K0 r (4.78)
where we used again KlL K0L . Then one has (4.76) if one chooses
1 L
.K0L /1 p 2rK0 L˛ ; L 2 N: (4.79)
Then the counterpart of NL in (4.69) can now be estimated by

L X
NL c K0L 2K0 .l1 l2 /˛=r
1l1 l2 L
L
X L=
X l1
K0L
c K0L 2 l1˛=r l2˛=r
l1 D1 l2 D1 (4.80)
L
X
L ˛
cK0L 2K0 L1 r l11
l1 D1
K0L 1 ˛
c K0L 2 L r log L M 2 N:
With K0L as in (4.79) one has

L 1 1
2K0 L˛=r .K0L / r .1 p / and log L K0L : (4.81)
Instead of (4.80) one obtains

1 1
NL c L.log L/2C r .1 p / M 2 N: (4.82)
Then one has by (4.78), (4.79)

L 1 ˛ 1
w ˛ .l/ 2rKl .KlL /1 p c M ˛ .log M /2˛C r .1 p / : (4.83)
The right-hand side of (4.43) with p D q D u follows now from (4.82), (4.83) and
(4.66).
Step 5. We wish to reduce the estimate of gklin .id/ from above in (4.42) with
1 u < p 1 to a modified version of (4.43). For this purpose we need a
preparation replacing w ˛ .x/ in (1.58) by logarithmically perturbed weights
w ˛;ı .x/ D .1 C x12 /˛=2 .1 C x22 /˛=2 .log.2 C x12 //ı .log.2 C x22 //ı (4.84)
r
where ˛ 2 R and ı 2 R. Let Spq B.R2 ; w ˛;ı / be the corresponding spaces according to
Definition 1.7 with w in place of w ˛ . Instead of (4.66) one has in obvious notation
˛;ı
L
kf S K f jLp .R2 /k
L 1 (4.85)
c Œ sup w ˛;ı .l/ 2rKl .KlL C 3/1 p kf jSpp
r
B.R2 ; w ˛;ı /k:
l2Z2
Let ı > 0 and 2 L 2 N. Then one has
w ˛;ı .l/ c.log L/2ı w ˛ .l/; l D .l1 ; l2 / 2 N2 ; l1 l2 L: (4.86)

4.3 Sampling 89
Otherwise one can proceed as in step 4. One has now the additional factor .log M /2ı
on the right-hand side of (4.83). Then one obtains
˛ 1
r
gklin .id W Spp B.R2 ; w ˛;ı / ,! Lp .R2 // c k ˛ .log k/2˛C r .1 p /C2ı ; (4.87)
2 k 2 N.
Step 6. Let u ˇ D u
p1 . Then it follows from Hölder’s inequality
Z 1=u
˛u ;ı u
jg.x/ w .x/j dx
R2
Z 1=p Z 2ˇ (4.89)
jg.x/ w ˛ .x/jp dx .1 C t 2 /1=2 .log.2 C t 2 //ı=ˇ dt :
R2 R
The last integral converges. Then it follows from Definition 1.7, (1.61) and the indicated
modifications in step 5 that
r
id W Spu B.R2 ; w ˛ / ,! Suu
r
B.R2 ; w ˛u ;ı / (4.90)
1
is a continuous embedding. Using (4.87) with u; ˛u in place of p; ˛ and ı D u
p1 C 2" ,
" > 0, one obtains by (4.90) that
˛u 1
r
gklin .id W Spu B.R2 ; ˛/ ,! Lu .R2 // c" k ˛u .log k/2.˛u Cı/ .log k/ r .1 u /
1 1 ˛ 1
(4.91)
c" k ˛ p C u .log k/2˛C r .1 u /C" ;
where we used ˛u ˛. This proves the right-hand side of (4.42) with q D u.
Step 7. The right-hand sides in part (ii) of the theorem follow from the above
assertions and the elementary embeddings
r
Spq 1
B.R2 ; ˛/ ,! Spq
r
2
B.R2 ; ˛/; 0 < q1 q2 1; (4.92)
and
r
Spq 1
B.R2 ; ˛/ ,! Spq
r"
2
B.R2 ; ˛/; " > 0; 0 < q1 ; q2 1: (4.93)

Remark 4.6. The above proof is based on the Faber basis (4.4). This explains the
restriction r < 1 C p1 in (4.36). In the one-dimensional case we outlined in Section 3.4
how to overcome this restriction of smoothness by using the Faber splines in (3.104).
We refer in particular to Theorem 3.14. It should be possible to extend this theory from
one to higher dimensions and to remove the restriction r < 1 C p1 in (4.36). But this
may be an ambitious task which requires a lot of efforts. Nothing has been done so far.
Remark 4.7. It would be of interest to deal not only in part (ii) of the above Theorem 4.5
r
with the full scale of the admitted spaces Spq B.R2 ; ˛/, but also in part (i). Then one
must expect that both sides of (4.39) depend on q as in the unweighted case in the unit
square Q2 according to (1.3), (1.4) adapted to our model situation or, more generally,
as in [T10, Theorem 4.15, p. 195]. But the price to pay is a further complication of the
corresponding estimates in the proof of the theorem.
Remark 4.8. The Theorems 3.7 and 4.5 are the main assertions of this book. With
r in place of s in Theorem 3.7 one has the same splitting (3.60), (3.62) on the one
1 1
hand and (4.37), (4.40) on the other hand. Also the main factors k r and k ˛ p C u
in the behaviour of the sampling numbers gk .id/ and gklin .id/ are the same, perturbed
s
in case of Theorem 4.5 by powers of log-terms. Hence replacing Bpq .R; ˛/ in one
r 2
dimension by their counterparts Spq B.R ; ˛/ with dominating mixed smoothness in
two dimensions changes the behaviour of the respective sampling numbers only by log-
perturbations. This remarkable effect is well known from related unweighted spaces
on intervals and squares and has been described in (1.1), (1.2) in comparison with (1.3),
(1.4) (adapted to our model case).
4.3.2 Complements. For 1 < p < 1 and r 2 N we introduced in (1.63), (1.64) the
weighted Sobolev spaces Spr W .R2 ; ˛/, ˛ 2 R, with dominating mixed smoothness.
According to (1.65), (1.66) they are special cases of Definition 1.7. In particular
f 7! w ˛ f is an isomorphic map of Spr W .R2 ; ˛/ onto Spr W .R2 / and
X
kD ˇ w ˛ f jLp .R2 /k D kw ˛ f jSpr W .R2 /k
ˇ2N20
0ˇj r kf jSpr W .R2 ; ˛/k
X (4.94)
D kD ˇ f jLp .R2 ; w ˛ /k:
ˇ2N20
0ˇj r
Here kg jLp .R2 ; w ˛ /k has the same meaning as in (1.62) with w ˛ as in (1.58). It follows
from the well-known elementary embeddings for the unweighted spaces according to
[ST87, Proposition 2.2.3/2, pp. 88–89] or [ScS04, Theorem 1, p. 121] that
r
Sp;min.p;2/ B.R2 ; ˛/ ,! Spr W .R2 ; ˛/ ,! Sp;max.p;2/
r
B.R2 ; ˛/: (4.95)
Of special interest are the distinguished spaces Sp1 W .R2 ; ˛/, 1 0, 1 1 p
C u
, then
id W Sp1 W .R2 ; ˛/ ,! Lu .R2 / (4.96)

4.3 Sampling 91

1
c1 k 1 .log k/1=2 gk .id/ gklin .id/ c2 k 1 .log k/2 p ; (4.97)
2 k 2 N.
(ii) If, in addition, ˛ < 1 p1 C u1 , then id in (4.96) is compact and there are
numbers c > 0 and for any ", 0 < " < 1, numbers c" > 0 such that
1 1 1 1 1
c k ˛ p C u .log k/˛ gk .id/ gklin .id/ c" k ˛ p C u .log k/˛.3 u /C" ; (4.98)
2 k 2 N. If 2 p D u and 0 < ˛ < 1 then (4.98) remains valid with " D 0.

Proof. The left-hand side of (4.97) follows from the unweighted case with the unit
square Q2 in place of R2 , [T10, Corollary 4.16, pp. 199–200]. The right-hand side
of (4.97) is a consequence of (4.95) with r D 1, p 2, and (4.39). Part (ii) can be
obtained from (4.95) and (4.42), (4.43).
In Section 3.6 we shifted the weight w˛ .x/ D .1 C x 2 /˛=2 , ˛ > 0, x 2 R, from the
s
source spaces Bpq .R; ˛/ to the target spaces Lu .R; ˛/ and transferred Theorem 3.7
˛
from id in (3.156) to id˛ in (3.159). The outcome is Theorem 3.18 which is essentially
a copy of Theorem 3.7. The proof shows that one can rely on the same reasoning as in
connection with the justification of Theorem 3.7. In two dimensions we have the same
situation and one can again shift the weight
w ˛ .x/ D .1 C x12 /˛=2 .1 C x22 /˛=2 ; ˛ > 0; (4.99)

r
from the source spaces Spq B.R2 ; ˛/ to the target spaces Lu .R2 ; w ˛ /. Of course,
Spq B.R /, Spq B.R ; ˛/, Lu .R2 /, Lu .R2 ; w ˛ / and also the Sobolev spaces Sp1 W .R2 /,
r 2 r 2
Sp1 W .R2 ; ˛/ have the same meaning as before. We refer in particular to the Defini-
tions 1.5, 1.7 and Remarks 1.6, 1.8. Definition 1.13 of the sampling numbers gk .id/
and gklin .id/ applies also to this modified situation. After these comments it is quite clear
that one can copy Theorem 4.5 and Corollary 4.9 shifting the weight from the source
space to the target space. But it seems to be reasonable, also for later applications, to
give an explicit formulation.
Theorem 4.10. Let ˛ > 0, u 1, 0 p1 1
u
< 1
p
C ˛, and 1
p
< r < 1 C p1 :
(i) If, in addition, ˛ > r p1 C u1 then
r
id W Spp B.R2 / ,! Lu .R2 ; w ˛ / (4.100)

1 1
c1 k r .log k/1 p gk .id/ gklin .id/ c2 k r .log k/rC1 p ; (4.101)
2 k 2 N.
1 1
(ii) If, in addition, ˛ < r p
C u
and 0 < q 1 then
r
id W Spq B.R2 / ,! Lu .R2 ; w ˛ / (4.102)
is compact and there are a number c > 0 and for any ", 0 < " < 1, numbers c" > 0
such that
1 1 1 1 ˛ 1
c k ˛ p C u .log k/˛ gk .id/ gklin .id/ c" k ˛ p C u .log k/2˛C r .1 u /C" ;
(4.103)
2 k 2 N. If 0 < ˛ < r and 0 < q p D u in (4.102) then there are two positive
numbers c1 , c2 such that
˛ 1
c1 k ˛ .log k/˛ gk .id/ gklin .id/ c2 k ˛ .log k/2˛C r .1 p / ; (4.104)
2 k 2 N.
1
(iii) If, in addition, 2 p < 1, ˛ > 1 p
C u1 , then
id W Sp1 W .R2 / ,! Lu .R2 ; w ˛ / (4.105)

1
c1 k 1 .log k/1=2 gk .id/ gklin .id/ c2 k 1 .log k/2 p ; (4.106)
2 k 2 N.
(iv) If, in addition, 1 0 and for any ", 0 < " < 1, numbers c" > 0 such that
1 1 1 1 1
c k ˛ p C u .log k/˛ gk .id/ gklin .id/ c" k ˛ p C u .log k/˛.3 u /C" ; (4.107)
2 k 2 N. If 2 p D u and 0 < ˛ < 1 then (4.107) remains valid with " D 0.

Proof. Step 1. The parts (i) and (ii) can be justified in the same way as in the proof of
Theorem 3.18 now based on the corresponding arguments in the proof of Theorem 4.5.
Step 2. We reduced Corollary 4.9 to Theorem 4.5 and some well-known inclusion
properties. Now one can do the same and justify the parts (iii) and (iv) using again
related inclusions and the above parts (i) and (ii).
4.4 Integration
4.4.1 Definitions. Numerical integration is one of the major topics in analysis since
ages. The classical and modern theory covers numerous books and thousands of pa-
pers. We refer in particular to the detailed and comprehensive study of multivariate
integration from the point of view of tractability in [NoW10] based on [NoW08]. In
4.4 Integration 93
[T10, Chapter 5] we dealt with numerical integration based on Faber expansions in

the unit cube Qn D .0; 1/n in Rn concentrating us mainly to n D 1 and n D 2. We
formulated in (1.6) a typical result. Now we wish to extend these considerations from
Qn to Rn at the expense of weighted spaces. So far we have for the one-dimensional
case Theorem 3.16 and, shifting the weight from the source side to the target side, The-
orem 3.21. Now we are doing the same in two dimensions based on Faber expansions
r
for the spaces Spq B.R2 ; ˛/. Similarly as in the Sections 3.5.1 and 3.6.3 it seems to be
reasonable to recall the basic notation, specifying and modifying Definition 1.19 and
Remark 1.20.
r
Let again Spq B.R2 / and Spr W .R2 / be the spaces with dominating mixed smooth-
ness according to Definition 1.5 and Remark 1.6. Let
w ˛ .x/ D .1 C x12 /˛=2 .1 C x22 /˛=2 ; ˛ 2 R; x D .x1 ; x2 / 2 R2 ; (4.108)

r
be the same weights as in (1.58) and let Spq B.R2 ; ˛/, Spr W .R2 ; ˛/ be the correspond-
ing weighted spaces as introduced in Definition 1.7 and Remark 1.8. Otherwise we
extend the integration in one dimension in Section 3.5 (weighted source spaces) and in
Section 3.6.3 (weighted target spaces) to two dimensions. Recall that L1 .R2 ; w ˛ / is
normed by (1.62),
Z
2 ˛ jg.x/j
kg jL1 .R ; w /k D 2 ˛=2
dx: (4.109)
R 2 .1 C x 1 / .1 C x22 /˛=2
Definition 4.11. (i) Let
1 1
1 p 1; 0 < q 1; ˛ >1 ; r> : (4.110)
p p
Let k 2 N. Then
r
gklin .Spq B.R2 ; ˛// D gklin .id W Spq
r
B.R2 ; ˛/ ,! L1 .R2 //; (4.111)
r
gklin .Spq B.R2 //˛ D gklin .id W Spq
r
B.R2 / ,! L1 .R2 ; w ˛ //: (4.112)
Furthermore,
˚ˇ Z k
X ˇ
r
Intk .Spq B.R2 ; ˛// D inf sup ˇ 2
f .x/dx al f .x l /ˇ W
R (4.113)
lD1
r

f 2 Spq B.R2 ; ˛/; r
kf jSpq B.R2 ; ˛/k 1
where the infimum is taken over all fx l gklD1 R2 and all fal gklD1 C. Similarly
˚ˇ Z k
X ˇ
r
Intk .Spq B.R2 //˛ D inf sup ˇ 2
f .x/w ˛ .x/ dx al f .x l /ˇ W
R (4.114)
lD1
r

f 2 Spq B.R2 /; kf r 2
jSpq B.R /k 1 ;
where again the infimum is taken over all fx l gklD1 R2 and all fal gklD1 C.
(ii) Let 1 1 p1 . Let k 2 N. Then
gklin .Sp1 W .R2 ; ˛//; gklin .Sp1 W .R2 //˛ (4.115)

and
Intk .Sp1 W .R2 ; ˛//; Int k .Sp1 W .R2 //˛ (4.116)
are defined as above with Sp1 W in place of Spq

r
B.
Remark 4.12. By Remark 1.20 and as in (3.150), (3.177) one can re-write (4.111) as
r
˚Z k
X
gklin .Spq B.R2 ; ˛// D inf sup 2
jf .x/ f .x l / hl .x/j dx W
R (4.117)
lD1
r

f 2 Spq B.R2 ; ˛/; kf r
jSpq B.R2 ; ˛/k 1
where the infimum is taken over all fx l gklD1 R2 and fhl gklD1 L1 .R2 /, and (4.112)
as
r
˚Z k
X
gklin .Spq B.R2 //˛ D inf sup jf .x/ f .x l / hl .x/jw ˛ .x/ dx W
R2 (4.118)
lD1
r

f 2 Spq B.R2 /; kf r
jSpq B.R2 /k 1 ;
where the infimum is taken over all fx l gklD1 R2 and fhl gklD1 L1 .R2 ; w ˛ /. Then
it follows from (1.105) that
r
Intk .Spq B.R2 ; ˛// gklin .Spq
r
B.R2 ; ˛//; k 2 N; (4.119)
r
Intk .Spq B.R2 //˛ r
gklin .Spq B.R2 //˛ ; k 2 N; (4.120)
and similarly for the other cases. Otherwise we refer to the Theorems 4.5 and 4.10
with u D 1 which show that the conditions (4.110) in part (i) and similarly ˛ > 1 p1
in part (ii) are natural.
Remark 4.13. Maybe one word about the notation used above seems to be in order. For
weighted isotropic spaces with w˛ .x/, x 2 Rn , as in (1.32), we shortened Apq s
.Rn ; w˛ /
s n n n
in (1.35) by Apq .R ; ˛/. This applies also to Lp .R ; ˛/ D Lp .R ; w˛ /, 1 p 1.
It may also explain the notation used in Section 3.6 in connection with weighted target
spaces. We refer in particular to (3.158), but also to (3.176), (3.177). In case of
r
spaces with dominating mixed smoothness we abbreviated Spq A.R2 ; w ˛ / in (1.60) by
r 2
Spq A.R ; ˛/. There is no danger of confusion with isotropic spaces. But the situation
is different when it comes to the spaces Lp .R2 ; w ˇ /, in particular in (4.94) and even
more with respect to the target spaces Lu .R2 ; w ˛ / in Theorem 4.10. To avoid any
misunderstanding we do not abbreviate Lu .R2 ; w ˇ /. But this may also explain the
notation in (4.112), (4.114), the counterparts in (4.115), (4.116) and (4.118) avoiding
any misunderstanding with corresponding notation for isotropic spaces.
4.4 Integration 95
4.4.2 Main assertions. We come now to the two-dimensional counterparts both of

Theorem 3.16 and Theorem 3.21. All notation have the same meaning as in the pre-
ceding Section 4.4.1.
Theorem 4.14. Let
1 1 1
1 p 1; ˛ >1 ; <r <1C ; (4.121)
p p p
see Figures 1 and 3 , p. 12 and p. 53.
1
˛ >r C1 (4.122)
p
then there are two positive numbers c1 , c2 such that
1
c1 k r .log k/1 p minŒIntk .Spp
r
B.R2 ; ˛//; Intk .Spp
r
B.R2 //˛
r
maxŒgklin .Spp B.R2 ; ˛//; gklin .Spp
r
B.R2 //˛ (4.123)
1
rC1 p
c2 k r .log k/ ; 2 k 2 N:
1
˛ <r C1 ; 0 < q 1; (4.124)
p
then there are a positive number c and for any ", 0 < " < 1, numbers c" > 0 such that
1
c k ˛C1 p .log k/˛ minŒIntk .Spq
r
B.R2 ; ˛//; Intk .Spq
r
B.R2 //˛
r
maxŒgklin .Spq B.R2 ; ˛//; gklin .Spq
r
B.R2 //˛ (4.125)
1
˛C1 p
c" k .log k/2˛C" ; 2 k 2 N:
Proof. The estimate from below in (4.123) is covered by [T10, Theorem 5.13, p. 234]
where we dealt with the unweighted case in the unit square Q2 . As for the estimate
from below in (4.125) we refer to step 1 of the proof of Theorem 4.5 which works also
for the smaller integral numbers Intk having in mind that the functions f in (4.45) are
non-negative. This applies also to Theorem 4.10. The estimates from above in (4.123),
(4.125) are covered by the Theorems 4.5, 4.10 with u D 1 and (4.119), (4.120).
Remark 4.15. There is little doubt that
r
Intk .Spq B.R2 ; ˛// Intk .Spq
r
B.R2 //˛ ; k 2 N; (4.126)
and
r
gklin .Spq B.R2 ; ˛// gklin .Spq
r
B.R2 //˛ ; k 2 N; (4.127)
under the assumptions of the above theorem. We discussed this situation in the one-
dimensional case in Section 3.6.1 and Remark 3.19. This applies also to higher dimen-
sions. But in addition of discussing (4.126), (4.127) it might be even more interesting
r
to deal with the log-gaps in (4.123), (4.125) and to extend (4.123) to Spq B.R2 ; ˛/ with
log-perturbations depending on q in analogy to (1.6).
The above theorem is more or less a direct consequence of the Theorems 4.5 and
4.10. In the same way one can reduce corresponding assertions for the distinguished
Sobolev spaces Sp1 W .R2 ; ˛/ and Sp1 W .R2 / to Corollary 4.9 and the parts (iii), (iv) of
Theorem 4.10. The corresponding numbers gklin and Intk have the same meaning as
indicated in Definition 4.11(ii).
Corollary 4.16. Let 1 1 p1 .
(i) If, in addition, p 2, ˛ > 2 p1 , then there are two positive numbers c1 , c2
such that
c1 k 1 .log k/1=2 minŒIntk .Sp1 W .R2 ; ˛//; Intk .Sp1 W .R2 //˛
maxŒgklin .Sp1 W .R2 ; ˛//; gklin .Sp1 W .R2 //˛ (4.128)
1
1 2 p
c2 k .log k/ ; 2 k 2 N:
(ii) If, in addition, ˛ < 2 p1 , then there are numbers c > 0 and for any ",
0 < " < 1, numbers c" > 0 such that
1
c k ˛C1 p .log k/˛ minŒIntk .Sp1 W .R2 ; ˛//; Intk .Sp1 W .R2 //˛
maxŒgklin .Sp1 W .R2 ; ˛//; gklin .Sp1 W .R2 //˛ (4.129)
1
˛C1 p
c" k .log k/2˛C" ; 2 k 2 N:
Proof. As mentioned above this corollary follows from Corollary 4.9 and the parts (iii),
(iv) of Theorem 4.10 by the same arguments as in the proof of Theorem 4.14.
Remark 4.17. The estimates from above in (4.123), (4.125) and as a consequence also
in (4.128), (4.129) originate in an explicit constructive way from the linear finite rank
L
operators f 7! S K f in (4.54), (4.53), which are partial sums of (4.27), (4.28). The
numbers KlL of K L D fKlL g are chosen according to the steps 3 and 4 of the proof
of Theorem 4.5. The coefficients km in (4.28) evaluate f in at most 9 points. This
corresponds in each square l C.0; 1/2 , l 2 Z2 , to the Smolyak algorithm (or hyperbolic
cross) clipped together in dependence on w ˛ .l/. In other words, one has constructive
procedures about the points x m at which f is evaluated and how the related coefficients
can be calculated explicitly. We refer to Section 3.6.4 where we dealt with the simpler
one-dimensional case. In two and higher dimensions explicit quantitative counterparts
look more complicated. But it seems to be reasonable to fix in Section 4.4.3 below
some distinguished examples in a qualitative way.
4.4.3 Inequalities. We are interested in the two-dimensional counterparts of the ex-

amples discussed in Section 3.6.4. In Remark 1.6 we described distinguished norms for
the spaces Spr W .R2 /, Spq
r
B.R2 / and S r C .R2 /. There one finds also further references.
4.4 Integration 97
Example 4.18. The Hölder spaces
S r C .R2 / D S1;1
r
B.R2 /; 0 < r < 1; (4.130)
with dominating mixed smoothness can be equivalently normed by

h jf .x1 ; x2 / f .y1 ; x2 /j jf .x1 ; x2 / f .x1 ; y2 /j
kf jS r C.R2 /k D sup jf .x/j C r
C
jx1 y1 j jx2 y2 jr
jf .x1 ; x2 / f .y1 ; x2 / f .x1 ; y2 / C f .y1 ; y2 /j i
C ; (4.131)
jx1 y1 jr jx2 y2 jr
where the supremum is taken over all x D .x1 ; x2 / 2 R2 and y D .y1 ; y2 / 2 R2 with
x1 6D y1 and x2 6D y2 . If 0 < r < 1 and ˛ > 1 C r then there are a number c > 0
and for any 2 k 2 N points fx l;k gklD1 R2 and numbers fal;k gklD1 C such that
ˇZ 2
Y k
X ˇ
ˇ ˇ
ˇ f .x/ .1 C xj2 /˛=2 dx al;k f .x l;k /ˇ c k r .log k/1Cr kf jS r C .R2 /k
R2 j D1 lD1
(4.132)
for all f 2 S r C .R2 /. If 0 < r < 1 and 1 < ˛ < 1 C r, then there are for any
", 0 < " < 1, numbers c" > 0 and for any 2 k 2 N points fx l;k gklD1 R2 and
numbers fal;k gklD1 C such that
ˇZ 2
Y Xk ˇ
ˇ ˇ
ˇ f .x/ .1Cxj2 /˛=2 dx al;k f .x l;k /ˇ c" k 1˛ .log k/2˛C" kf jS r C .R2 /k
R2 j D1 lD1
(4.133)
for all f 2 S r C .R2 /. This is a special case of (4.123), (4.125).
Example 4.19. Recall that the Sobolev spaces Sp1 W .R2 / can normed by (1.50). If
2 p < 1 and ˛ > 2 p1 then there a number c > 0 and for any 2 k 2 N points
fx l;k gklD1 R2 and numbers fal;k gklD1 C such that
ˇZ 2
Y k
X ˇ
ˇ ˇ
ˇ f .x/ .1 C xj2 /˛=2 dx al;k f .x l;k /ˇ
R2 j D1 lD1
1 X (4.134)
2 p
c k 1 .log k/ kD ˇ f jLp .R2 /k
ˇ2N2 0
ˇj 2f0;1g
for all f 2 Sp1 W .R2 /. If 1 0 and for any 2 k 2 N points fx l;k gklD1 R2 and

ˇZ 2
Y k
X ˇ
ˇ ˇ
R2 j D1 lD1
1 X (4.135)
˛C1 p
c" k .log k/2˛C" kD ˇ f jLp .R2 /k
ˇ2N2 0
ˇj 2f0;1g
for all f 2 Sp1 W .R2 /. This follows from Corollary 4.16.
4.5 Higher dimensions

In [T10, Section 5.3] we dealt with numerical integration in cubes
Qn D fx D .x1 ; : : : ; xn / 2 Rn W 0 < xl < 1g: (4.136)
We concentrated our considerations mainly on the squares Q2 in R2 , and the expansions
r
of functions f 2 Spq B.Q2 / in terms of Faber bases as described in Theorem 1.27. On
this basis we studied numerical integration with (1.6), (1.7) as typical assertions. In the
r
above Section 4.4 we extended these considerations from Spq B.Q2 / to corresponding
r
weighted spaces Spq B.R2 ; ˛/ in R2 . Theorem 4.14 and Corollary 4.16 are our main
results in this context, illustrated by the Examples 4.18, 4.19. On the other hand
we outlined in [T10, Section 5.3.2, pp. 236–240] how the assertions for numerical
integration in the square Q2 can be extended to cubes Qn , n > 2, in terms of related
r
spaces Spq B.Qn /. This is mainly a technical matter and we described in [T10] the
necessary modifications. One can do the same in the context of weighted spaces. We
do not go into detail but formulate the outcome. Let
n
Y
w ˛ .x/ D .1 C xj2 /˛=2 ; ˛ 2 R; x D .x1 ; : : : ; xn / 2 Rn ; (4.137)
j D1
r
be the n-dimensional counterpart of (1.58). Let Spq B.Rn ; ˛/ and Spr W .Rn ; ˛/ be
the n-dimensional versions of Definition 1.7 and (1.64). As in [T10, p. 236] we put
logn1 k D .log k/n1 with .logn1 k/~ D .log k/.n1/~ , 2 n 2 N, ~ 2 R. Then
one has the following counterpart of Theorem 4.5.
1 1 1
Theorem 4.20. Let 2 n 2 N. Let ˛ > 0, u 1, 0 p
u
< p
C ˛, 0 < q 1
and p1 < r < 1 C p1 . Then
r
id W Spq B.Rn ; ˛/ ,! Lu .Rn / (4.138)
is compact. Under the same additional conditions as in Theorem 4.5 one has (4.39),
(4.42), (4.43) with logn1 k in place of log k.
4.5 Higher dimensions 99
Next we extend Corollary 4.9 from n D 2 to n 2.

1 1 1
Corollary 4.21. Let 2 n 2 N. Let ˛ > 0, 1 < p < 1, u 1, and p
u
< p
C ˛.
Then
id W Sp1 W .Rn ; ˛/ ,! Lu .Rn / (4.139)
is compact. Under the same additional conditions as in Corollary 4.9 one has (4.97)
and (4.98) ." D 0 if 2 p D u, 0 < ˛ < 1/ with logn1 k in place of log k.
Remark 4.22. The step from n D 2 to 2 < n 2 N is a technical matter. It requires
some efforts but no decisive new ideas beyond [T10, Section 5.3.2, pp. 236–40]. This
applies also to Theorem 4.10 shifting the weight (4.137) from the source side to the
target side. Afterwards one can extend Section 4.4 from n D 2 to 2 < n 2 N.
Let
r
gklin .Spq B.Rn ; ˛//; r
gklin .Spq B.Rn //˛ ;
r
(4.140)
Intk .Spq B.Rn ; ˛//; r
Int k .Spq B.Rn //˛ ;
be the n-dimensional generalisations of the related numbers introduced in Defini-
tion 4.11. Similarly for the spaces Sp1 W .Rn ; ˛/ and Sp1 W .Rn /. Now one can extend
Theorem 4.14 from n D 2 to 2 n 2 N.
Theorem 4.23. Let 2 n 2 N. Let 1 p 1, ˛ > 1 p1 , p1 < r < 1 C p1 . Let
r
Spq B.Rn ; ˛/, Spq
r
B.Rn / be the above spaces. Under the same additional conditions
as in Theorem 4.14 one has (4.123), (4.125) with Rn in place of R2 and logn1 k in
place of log k.
In the same way one can extend Corollary 4.16 from n D 2 to 2 n 2 N.
Corollary 4.24. Let 2 n 2 N. Let 1 1 p1 . Let Sp1 W .Rn ; ˛/,
Sp1 W .Rn / be the related Sobolev spaces. Under the same additional conditions as in
Corollary 4.16 one has (4.128), (4.129) with Rn in place of R2 and logn1 k in place
of log k.
Example 4.25. In Section 4.4.3 we discussed some distinguished examples. It is now
quite obvious that one can extend these inequalities from n D 2 to n > 2 replacing R2
by Rn and log k by logn1 k. We restrict ourselves to an explicit formulation in case
of the Sobolev spaces Sp1 W .Rn /.
Let 2 n 2 N. If 2 p < 1 and ˛ > 2 p1 then there are a number c > 0 and
for any 2 k 2 N points fx l;k gklD1 Rn and numbers fal;k gklD1 C such that
ˇZ n
Y k
X ˇ
ˇ ˇ
Rn j D1 lD1
1 X (4.141)
2 p
c k 1 .logn1 k/ kD ˇ f jLp .Rn /k
ˇ2Nn 0
ˇj 2f0;1g
for all f 2 Sp1 W .Rn /. If 1 0 and for any 2 k 2 N points fx l;k gklD1 Rn and
ˇZ n
Y k
X ˇ
ˇ ˇ
Rn j D1 lD1
1 X (4.142)
˛C1 p
c" k .logn1 k/2˛C" kD ˇ f jLp .Rn /k
ˇ 2Nn0;
ˇj 2f0;1g
for all f 2 Sp1 W .Rn /.

Bibliography
[AlK06] F. Albiac and N. J. Kalton, Topics in Banach space theory. Graduate Texts in Math.
233, Springer, New York 2006. 45
[Bab60] K. I. Babenko, Approximation by trigonometric polynomials in a certain class of
periodic functions of several variables. Dokl. Akad. Nauk SSSR 132 (1960), 982–
985; Engl. transl.Soviet Math. Dokl. 1 (1960), 672–675. 8
[Cae98] A. M. Caetano, About approximation numbers in function spaces. J. Approx. Theory
94 (1998), 383–395. 13
[Dinh11] D. Dũng, B-spline quasi-interpolant representations and sampling recovery of func-
tions with mixed smoothness. J. Complexity 27 (2011), 541–567. 25, 26
[ET96] D. E. Edmunds and H. Triebel, Function spaces, entropy numbers, differential op-
erators. Cambridge Tracts in Math. 120, Cambridge University Press, Cambridge
1996. 6, 9, 11, 12, 13, 57, 70
[Fab09] G. Faber, Über stetige Funktionen. Math. Ann. 66 (1909), 81–94. 18, 45
[Gne11] M. Gnewuch, Weighted geometric discrepancies and numerical integration on re-
producing kernel Hilbert spaces. J. Complexity 28 (2012), 2–17. 28, 72
[Har95] D. Haroske, Approximation numbers in some weighted function spaces. J. Approx.
Theory 83 (1995), 104–136. 12, 13
[Har97] D. Haroske, Embeddings of some weighted function spaces on Rn ; entropy and
approximation numbers – a survey of some recent results. An. Univ. Craiova Ser.
Mat. Inform. 24 (1997), 1–44. 13
[HaT94a] D. Haroske and H. Triebel, Entropy numbers in weighted function spaces and eigen-
value distributions of some degenerate pseudodifferential operators I. Math. Nachr.
167 (1994), 131–156. 6, 11, 12
[HaT94b] D. Haroske and H. Triebel, Entropy numbers in weighted function spaces and eigen-
value distributions of some degenerate pseudodifferential operators II. Math. Nachr.
168 (1994), 109–137. 6, 11, 12
[HaT05] D. D. Haroske and H. Triebel, Wavelet bases and entropy numbers in weighted
function spaces. Math. Nachr. 278 (2005), 108–132. 11, 12, 58
[HaT08] D. D. Haroske and H. Triebel, Distributions, Sobolev spaces, elliptic equations.
EMS Textbk. Math., Eur. Math. Soc., Zürich 2008. 11, 66
[Kam96] A. Kamont, On hyperbolic summation and hyperbolic moduli of smoothness. Con-
str. Approx. 12 (1996), 111–125. 26
[Kuhn08] T. Kühn, Entropy numbers in sequence spaces with an application to weighted
function spaces. J. Approx. Theory 153 (2008), 40–52. 12
[KLSS06a] T. Kühn, H.-G. Leopold, W. Sickel, and L. Skrzypczak, Entropy numbers of em-
beddings of weighted Besov spaces. Constr. Approx. 23 (2006), 61–77. 11, 12
102 Bibliography
[KLSS06b] T. Kühn, H.-G. Leopold, W. Sickel, and L. Skrzypczak, Entropy numbers of embed-
dings of weighted Besov spaces II. Proc. Edinb. Math. Soc. (2) 49 (2006), 331–359.
12
[KLSS07] T. Kühn, H.-G. Leopold, W. Sickel, and L. Skrzypczak, Entropy numbers of em-
beddings of weighted Besov spaces III. Weights of logarithmic type. Math. Z. 255
(2007), 1–15. 12
[Nik62] S. M. Nikol’skij, Boundary properties of differentiable functions of several variables
(in Russian). Dokl. Akad. Nauk SSSR 146 (1962), 542–545. 8
[Nik63] S. M. Nikol’skij, On stable boundary values of differentiable functions of several
variables (in Russian). Mat. Sb. (N.S.) 61 (1963), 224–252. 8
[NoT06] E. Novak and H. Triebel, Function spaces in Lipschitz domains and optimal rates
of convergence for sampling. Constr. Approx. 23 (2006), 325–350. 14, 15, 36, 54
[NoW08] E. Novak and H. Woźniakowski, Tractability of multivariate problems. Vol. I: Linear
information. EMS Tracts Math. 6, Eur. Math. Soc., Zürich 2008. 14, 92
[NoW09] E. Novak and H. Woźniakowski, L2 discrepancy and multivariate integration. In
Analytic number theory, Cambridge University Press, Cambridge 2009, 359–388.
28, 72
[NoW10] E. Novak and H. Woźniakowski, Tractability of multivariate problems. Vol. II:
Standard information for functionals. EMS Tracts Math. 12, Eur. Math. Soc., Zürich
2010. 14, 28, 72, 92
[Pee67] J. Peetre, Sur les espaces de Besov. C. R. Acad. Sci. Paris Sér. A 264 (1967), 281–283.
56
[RuS96] T. Runst and W. Sickel, Sobolev spaces of fractional order, Nemytskij operators,
and nonlinear partial differential equations. de Gruyter Ser. Nonlinear Anal. Appl.
3, Walter de Gruyter & Co., Berlin 1996. 51
[Schm07] H.-J. Schmeisser, Recent developments in the theory of function spaces with domi-
nating mixed smoothness. In Nonlinear Analysis, Function Spaces and Applications,
Vol. 8, Proc. of the Spring School held in Prague, May 30–June 6, 2006, Inst. Math.
Acad. Sci. Czech Republic, Praha, 2007, 145–204. 8
http://dml.cz/handle/10338.dmlcz/702494
[ScS04] H.-J. Schmeisser and W. Sickel, Spaces of functions of mixed smoothness and
approximation from hyperbolic crosses. J. Approx. Theory 128 (2004), 115–150. 8,
90
[ST87] H.-J. Schmeisser and H. Triebel, Topics in Fourier analysis and function spaces.
John Wiley & Sons Ltd., Chichester 1987. 6, 8, 9, 20, 48, 90
[SiU07] W. Sickel and T. Ullrich, The Smolyak algorithm, sampling on sparse grids and
function spaces of dominating mixed smoothness. East J. Approx. 13 (2007), 387–
425. 25, 26
[SiU09] W. Sickel and T. Ullrich, Tensor products of Sobolev-Besov spaces and applications
to approximation from the hyperbolic cross. J. Approx. Theory 161 (2009), 748–786.
25, 26
Bibliography 103
[SiU11] W. Sickel and T. Ullrich, Spline interpolation on sparse grids. Appl. Anal. 90 (2011),
337–383. 25, 26, 59
[Skr05] L. Skrzypczak, On approximation numbers of Sobolev embeddings of weighted
function spaces. J. Approx. Theory 136 (2005), 91–107. 13
[SkV09] L. Skrzypczak and J. Vybíral. Corrigendum to the paper: ’On approximation num-
bers of Sobolev embeddings of weighted function spaces’ [J. Approx. Theory 136
(2005) 91–107]. J. Approx. Theory 156 (2009), 116–119. 13
[TWW88] J. F. Traub, G. W. Wasilkowski, and H. Woźniakowski, Information-based complex-
ity. Academic Press, Boston 1988. 15
[Tri78a] H. Triebel, On Besov-Hardy-Sobolev spaces in domains and regular elliptic bound-
ary value problems. The case 0 < p 1. Comm. Partial Differential Equations 3
(1978), 1083–1164. 34
[Tri78b] H. Triebel, On Haar bases in Besov spaces. Serdica 4 (1978), 330–343. 41
[T78] H. Triebel, Interpolation theory, function spaces, differential operators. North-
Holland Math. Library 18, North-Holland, Amsterdam 1978. 56
[T83] H. Triebel, Theory of function spaces. Monogr. Math. 78, Birkhäuser, Basel 1983.
4, 34
[T92] H. Triebel, Theory of function spaces II. Monogr. Math. 84, Birkhäuser, Basel 1992.
4, 5, 48, 66
[T01] H. Triebel, The structure of functions. Monogr. Math. 97, Birkhäuser, Basel 2001.
51
[T06] H. Triebel, Theory of function spaces III. Monogr. Math. 100, Birkhäuser, Basel
2006. 4, 5, 6, 7, 11, 12, 14, 15, 36, 51, 54, 58, 65
[T08] H. Triebel, Function spaces and wavelets on domains. EMS Tracts Math. 7, Eur.
Math. Soc., Zürich 2008. 6, 15, 32, 33, 34, 46, 47, 48
[T10] H. Triebel, Bases in function spaces, sampling, discrepancy, numerical integration.
EMS Tracts Math. 11, Eur. Math. Soc., Zürich 2010. v
[Ull08] T. Ullrich, Smolyak’s algorithm, sampling on sparse grids and Sobolev spaces of
dominating mixed smoothness. East J. Approx. 14 (2008), 1–38. 26
[Ull11] T. Ullrich, Function spaces with dominating mixed smoothness, characterizations
by differences. In preparation.
http://rauhut.ins.uni-bonn.de/TDiff06.pdf 26
[Vyb06] J. Vybiral, Function spaces with dominating mixed smoothness. Dissertationes
Math. (Rozprawy Mat.) 436 (2006), 3–73. 8
[Woj91] P. Wojtaszczyk, Banach spaces for analysts. Cambridge Stud. Adv. Math. 25, Cam-
bridge University Press, Cambridge 1991. 45
Symbols
Sets C s .Rn /, 4
s
I D .0; 1/ Fpq .Rn /, 4
C, 3 L.A; B/, 10
Ck , 14 Lp .R; ˇ/, 68
N, 3 L1 . ; w/, 16
N0 , 3 L1 .R2 ; w ˛ /, 93
Nn0 , 3 Lp .Rn /, 3
PkF , 21 Lp .Rn ; w/, 6
Q2 , 1 S.Rn /, 3
Qn , 7, 98 S 0 .Rn /, 3
r
R, 3 Spq B.R2 /, 7
Rn , 3 r
Spq F .R2 /, 7
UA , 10 Spr W .R2 /, 8
Z, 3 S r C .R2 /, 9, 97
Zn , 3 r
Spq A.R2 ; ˛/, 9
r
Spq A. /, 20
Spaces r
C
Spq B.R2 ; ˛/, 9
bpq .I /, 19
Spr W .R2 ; ˛/, 10
bpq .R; ˛/, 46
spq b.R2 ; ˛/, 80 Wpk .Rn /, 4
F
spq b.Q2 /, 21 Wpk .Rn ; w/, 6
s
Apq . /, 15
s Operators
Apq .Rn /, 5
b
' , F ', 3
Apq .Rn ; ˛/, 6
s
s ' _ , F 1 ', 3
Apq .Rn ; w/, 6
s id , 14
Bpq .Rn /, 4
s S Jf , 23
Bpq .Rn ; w/, 6
extL , 65
Bzpq
s
.I /, 32
s
Bpq .I /, 32 Numbers, relations
C0 .R/, 44 log D log2 , base 2
C0 .R2 /, 78 , v
C.Rn /, 13 ,!, 10
C. /, 13 ak , 11
106 Symbols
disck Bpq .I / , 31 Functions, functionals

s
D˛ , 3
disck Bpq .I / , 32
r
lh , 4
disck Spq B.Qn / , 27
ek , 11 lh;1 , 8
gk .id/, 14 l;l
h
,8
2
gklin .id/, 14 dkm .f /, 21, 78
gklin .G1 . //, gklin .G1 . /; w/, 16 disc , 31
s
gklin .Bpq .R; ˛//, 67 disc;A .x/, 27, 31
s hj m , 46, 79
gklin .Bpq .R/; ˛/, 71
r
gklin .Spq B.R2 ; ˛//, 93 hkm , 79
r
gklin .Spq B.R2 //˛ , 93 v0 ; v1 ; vj m , 18, 44
Int k .G1 . //, Intk .G1 . /; w/, 16 vkm , 20, 78
Int k .Bpqs
.R; ˛//, 67 vjkm , 49
s
Int k .Bpq .R/; ˛/, 71 vj m;l , 59
r w˛ .x/, 5
Int k .Spq B.R2 ; ˛//, 93
r w ˛ .x/, 9, 98
Int k .Spq B.R2 //˛ , 93
z ˛ .x/, 73
w
Index
basis, conditional, 45 space, Besov, classical, 5
basis, unconditional, 45 space, Besov, dominating mixed
basis, Faber, 81 smoothness, 9
basis, Haar, 79 space, dominating mixed
smoothness, 7, 9
extension, Hestenes, 65 space, Hölder–Zygmund, 4
space, Hölder–Zygmund, dominating
function, discrepancy, 27, 31 mixed smoothness, 9
space, Lebesgue, weighted, 68
map, information, 13
space, Schwartz, 3
number, approximation, 11 space, Sobolev, classical, 4
number, discrepancy, 27, 31 space, Sobolev, dominating mixed
number, entropy, 11 smoothness, 8
number, integral, 16, 67, 71, 93 space, Sobolev, fractional, 58
number, sampling, 14 space, Sobolev, weighted, 90
number, linear sampling, 14, 16, space, source, 13
67, 71, 94 spline, Faber, 59
system, Faber, 18, 21, 44
resolution, dyadic, 3, 7
restriction, 13, 15 transform, Fourier, 3

Faber Systems and Their Use in Sampling, Discrepancy, Numerical Integration

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Faber Systems and Their Use in Sampling, Discrepancy, Numerical Integration

Uploaded by

Copyright:

Available Formats

EMS Series of Lectures in Mathematics

Edited by Andrew Ranicki (University of Edinburgh, U.K.)

EMS Series of Lectures in Mathematics is a book series aimed at students, professional

Previously published in this series:

Faber Systems and

© 2012 European Mathematical Society

Typeset using the author’s TEX files: I. Zimmermann, Freiburg

This book is the continuation of [T10]. A corresponding more detailed description

It is my pleasure to thank Erich Novak for many stimulating discussions and

Jena, Winter 2011 Hans Triebel

List of Figures viii

1 Introduction, definitions, basic assertions 1

3 Spaces on the real line 43

4 Spaces on the plane 77

Then the embedding

1.2 Function spaces

with the usual modification if p D 1. As usual, Z is the collection of all integers;

We use the standard abbreviation

If ' 2 S.Rn / then

'0 .x/ D 1 if jxj 1 and '0 .y/ D 0 if jyj  3=2; (1.15)

(with the usual modification if q D 1).

(with the usual modification if q D 1).

Wpk .Rn / D Fp;2

are the classical Sobolev spaces usually equivalently normed by

.1h /.x/ D f .x C h/ f .x/; .lC1

where x 2 Rn , h 2 Rn , l 2 N, be the iterated differences in Rn . Let 0 < s <

kf jC s .Rn /km D sup jf .x/j C sup jhjs jm

jD w.x/j c w.x/ for all x 2 Rn (1.30)

w˛ .x/ D .1 C jxj2 /˛=2 ; ˛ 2 R; x 2 Rn : (1.32)

Definition 1.3. Let

(with the usual modification if q D 1).

(with the usual modification if q D 1).

be the iterated differences, l 2 N, h D .h1 ; h2 / 2 R2 . Let 0 < r < l 2 N and

w ˛ .x/ D .1 C x12 /˛=2 .1 C x22 /˛=2 ; ˛ 2 R; x D .x1 ; x2 / 2 R2 ; (1.58)

0 < p 1; 0 < q 1; r 2 R and ˛ 2 R (1.59)

with p < 1 for the F -spaces. Let w ˛ be as in (1.58). Then Spq

Then one has the counterpart

1.3 Numbers measuring compactness and approximation

Definition 1.9. Let A, B be quasi-Banach spaces and let T 2 L.A; B/.

(ii) Then for all k 2 N the k-th approximation number ak .T / of T is defined by

ak .T / D inffkT Lk W L 2 L.A; B/; rank L < kg: (1.70)

We illustrate the behaviour of entropy and approximation numbers for weighted

s > ; ı > 0; ˛ > 0; u > p ; (1.74)

Theorem 1.11. Let ˛ > 0, u  1, 0 p1 u1 < p1 C ˛n , s > 0 and 0 < q 1. Then

Figure 1. Weighted spaces.

is compact and one has

k 2 N, for the corresponding entropy and approximation numbers.

1.3.2 Sampling numbers. As usual, T W A ,! B means that T is a linear and bounded

gj 2 D 0 . / W .gj /.'/ D g.'/ for ' 2 D. /: (1.78)

Let C.Rn / be the collection of all complex-valued bounded continuous functions on

If is a bounded domain in Rn then C. / D C.Rn /j is the restriction of C.Rn / to

We always assume that the source space G1 . / is continuously embedded in C. /,

interpreted in the usual way: In each equivalence class of G1 . / there is a (uniquely

be an arbitrary map (also called method or algorithm). Hence,

One wishes to recover a given continuous function f 2 G1 . / in G2 . / by asking

gk .id/ D infŒ supfkf Sk f jG2 . /k W kf jG1 . /k 1g  (1.86)

Remark 1.14. This is an adapted version of a corresponding definition in [NoT06]

gk .id/ gklin .id/ and akC1 .id/ gklin .id/; k 2 N; (1.88)

Proposition 1.15. Let be either Rn or a bounded domain in Rn and let G1 . /,

1.3.3 Integral numbers. So far we introduced in Definition 1.13 sampling numbers

Intk .G1 . /; w/ gklin .G1 . ; w/; k 2 N: (1.105)

Proposition 1.21. Let D Qn D .0; 1/n .or a bounded Lipschitz domain in Rn /,

1.4 Background, motivations, aims, proposals

fv0 ; v1 ; vj m W j 2 N0 I m D 0; : : : ; 2j 1g; (1.109)

'0 .x/ D 1 if jxj 1 and '0 .y/ D 0 if jyj 3=2; (1.15)

.1h /.x/ D f .x C h/ f .x/; .lC1

kf jC s .Rn /km D sup jf .x/j C sup jhjs jm

s > ; ı > 0; ˛ > 0; u > p ; (1.74)

Theorem 1.11. Let ˛ > 0, u 1, 0 p1 u1 < p1 C ˛n , s > 0 and 0 < q 1. Then

gk .id/ D infŒ supfkf Sk f jG2 . /k W kf jG1 . /k 1g (1.86)

0 x 1, where 2h f are the usual second differences according to (1.26),

12 .22j 1 f /.2j m/ D f .2j m C 2j 1 / 12 f .2j m 12 f .2j m C 2j /:

function in IN D Œ0; 1. Then

0 < u; v 1; > 1=u and f .1/ D 0; (2.32)

We apply (2.33) with u D p 0 , v D q 0 , D 1 s > 1=u in (2.32) and f 0 D g 2

supp Kjl I l and jD ˛ Kjl .x/j 2j Cj j˛j ; j˛j L; (2.53)

jbj m .x/j 2j ; supp bj m 2j m C d.2j ; 2j /; (2.57)

c 2j.s1/ k discj jBpq