Halasz G., Lovasz L., Simonovits M., Sos V.T. (редакторы). Пол Эрдос и его математика, издание 1 (Springer, 2002), Halasz G., Lovasz L., Simonovits M., Sos V.T. (eds.) Paul Erdos and his mathematics, vol.1 (Springer, 2002)(KA)(600dpi)(T)(734s).djvu:

Halasz G., Lovasz L., Simonovits M., Sos V.T. (редакторы). Пол Эрдос и его математика, издание 1 (Springer, 2002)

Halasz G., Lovasz L., Simonovits M., Sos V.T. (eds.) Paul Erdos and his mathematics, vol.1 (Springer, 2002)(KA)(600dpi)(T)(734s).djvu

Size 7.8Mb
Date Jan 27, 2006

Cites: They also
connect different parts of analysis by using the methods of real function
theory, harmonic analysis and functional analysis...
If f : G-+B is such that \f{x + y) - f(x) - f{y)\ < К for every x,y E G
with a nonnegative constant К then there is a homomorphism H from G
into the additive group of В such that \f - H\ <K everywhere on G...
Finally,
Gajda [20] proved the theorem for Banach valued functions in every locally
compact group...
In other words, let G be the set of all sequences (ai,a2,...) such that
di E {0,1} for every t, and щ = 0 for all but finitely many i...
A function belongs to Po№ if it is continuous at
the points of an everywhere dense subset of X...
Let p be a polynomial such that p(i) = f(i) for i = 0,1,2; p(l/2) >
/A/2); and pC/2) < /C/2)...
It follows
from (i) that for every /, the set {h : A^f E 0} is always a subgroup of
G, and thus every element of "KiT^Q) is covered by a group belonging to
ЩР) Q)- That is, in the case of G = T we are dealing with small subgroups
of T...
In [36] it is
shown that ЩЬ^ С*) equals the family of finite subsets of T П Q;
(8)
оо)с(^), and H(Lp,Loo) = (i^) @<p<oo)...
Suppose we can prove that g = g\ + H + 5, where
Pi is measurable, H is additive and the differences of S are null...
However, the class of those functions which
are of bounded variation in every finite interval has the difference property
by a theorem of De Bruijn [6, Theorem 6.1]...
We remark that
the class of bounded derivatives does not have the difference property (take
log(#2 + 1))...
Since
/(пя) -n/(s) = £ [/(is) -f(x) -/((i - l)s)],
we obtain | /(пя) — nf(x)\ < пф(х) for every x E G and n 6 N...
The
point at which the walk hits the second path tends to be in the "middle"
of the second path and hence locally at the hitting point the second path
looks like the union of two random walks...
While interpolation polynomials (and more generally, even interpolating
rational functions) were widely used in the nineteenth century, there was not
much rigorous analysis of their convergence...
Since the first term in the right-hand side of A1) is bounded by 2e2 f*x w,
the proof is complete...
Convergence in Lp Norms
When one looks at the complexity of some of the proofs that Lagrange
interpolation converges in norms other than the L<i norm, one is tempted to
paraphrase Kronecker and say "God created L<i and man created all else"...
Once we have B1), we are basically done, since the
convergence of the Gauss quadrature rule on Riemann integrable / shows
that
l/p
At this stage, we obtain for every / € C[— 1,1],
Here C3 and C4 are independent of n, but depend on /...
These were subsequently used (together with bounds of Bad-
koy for orthogonal polynomials and other new ideas) by G...
(iv) Complex Methods, including the use of subharmonicity of |P|P, for P
a polynomial, and Carleson measures, which enable one to pass from
integral estimates in the upper half plane to estimates on the real line...
The author believes that this result and its extensions in [54], can be used to
unify a lot of mean convergence results on Lagrange interpolation...
We apply Lemma 2 with Л = {p + 2 : p < x}, z = я\ f2 =
xl/2(logx)-c, X = liz, V = P\ {2}, u{p) = ^j...
Here and in what follows we use the widely accepted terminology
and notation presented in the P...
The convergence problem in the space D
for processes
B.6) Zn(t) := e-e<*»
k<z(t)
where £&, A; > 1 are i.r.vs, a(u), /3(u) denote some normalizing sequences,
and z(t) = zn(i) is a time index function, has been investigated...