Optimal recovery of operator sequences

arXiv:2110.08543v1 [math.FA] 16 Oct 2021

V. F. Babenko, N. V. Parfinovych, D. S. Skorokhodov

October 19, 2021

Abstract
In this paper we consider two recovery problems based on informa-
tion given with an error. First is the problem of optimal recovery of
the class WqT = {(t1 h1 , t2 h2 , . . .) ∈ ℓq : khkq 6 1}, where 1 ≤ q < ∞
and t1 > t2 > . . . > 0, in the space ℓq when in the capacity of inexact
information we know either the first n ∈ N elements of a sequence
with an error measured in the space of finite sequences ℓnr , 0 < r ≤ ∞,
or a sequence itself is known with an error measured in the space
ℓr . The second is the problem of optimal recovery of scalar prod-
T,S
ucts acting on Cartesian product Wp,q of classes WpT and WqS , where
1 < p, q < ∞, p1 + 1q = 1 and s1 ≥ s2 ≥ . . . ≥ 0, when in the capacity
of inexact information we know the first n coordinate-wise products
T,S
x1 y1 , x2 y2 , . . . , xn ym of the element x × y ∈ Wp,q with an error mea-
sured in the space ℓnr . We find exact solutions to above problems and
construct optimal methods of recovery. As an application of our re-
sults we consider the problem of optimal recovery of classes in Hilbert
spaces by Fourier coefficients known with an error measured in the
space ℓp with p > 2.

1 Introduction
Let X, Z be complex linear spaces, Y be a complex normed space, A : X → Y
be an operator, in general non-linear, with domain D(A), W ⊂ D(A) be some
class of elements. Denote by B(Z) the set of non-empty subsets of Z, and
let I : span W → B(Z) be a given mapping called information. When
saying that information about element x ∈ W is available we mean that
some element z ∈ I(x) is known. An arbitrary mapping Φ : Z → Y is called

1
method of recovery of operator A. Define the error of method of recovery Φ
of operator A on the set W given information I:

E(A, W, I, Φ) = sup sup kAx − Φ(z)kY . (1)

x∈W z∈I(x)

The quantity
E(A, W, I) = inf E(A, W, I, Φ) (2)
Φ:Z→Y

is called the error of optimal recovery of operator A on elements of class W

given information I. Method Φ∗ delivering inf in (2) (if any exists) is called
optimal.
The problem of recovery of linear operators in Hilbert spaces based on
exact information was studied in [14]. In case information mapping I has
the form Ix = i(x) + B, where i is a linear operator and B is a ball of some
radius defining information error, recovery problem (2) was considered in [12]
(see also [15]–[16]). Alternative approach to the study of optimal recovery
problems based on standard principles of convex optimization was proposed
in [10]. In [12] it was shown that among optimal methods of recovery there
exists a linear one, and in [10] explicit representations for optimal methods of
recovery were found in cases when the error of information is measured with
respect to the uniform metric. For a thorough overview of optimal recovery
and related problems we refer the reader to books [17, 16] and survey [1].
Remark that results of the present work supplement and generalize re-
sults of paper [10] on optimal recovery of functions and its derivatives and
paper [7].

2 Elementary lower estimate

Let us present a trivial yet effective lower estimate for the error of optimal
recovery (2). Denote by θZ the null element of space Z and let I be some
information mapping.

Lemma 1. Let θZ ∈ I(W ). Then

1
E(A, W, I) ≥ sup kAx − AykY .
2 x,y∈W :
θZ ∈Ix∩Iy

2
Proof. Indeed, for every method of recovery Φ : Z → Y ,

E(A, W, I, Φ) ≥ sup kAx − Φ (θZ )kY

x∈W :
θZ ∈Ix
 
1
≥ sup kAx − Φ (θZ )kY + sup kAy − Φ (θZ )kY 
2 x∈W : y∈W :
θZ ∈Ix θZ ∈Iy
1
≥ sup kAx − AykY .
2 x,y∈W :
θZ ∈Ix∩Iy

Taking inf over methods Φ we finish the proof.

From Lemma 1 we easily derive the following consequences.

cor 1. Let A be an odd operator, x̃ ∈ W be such that −x̃ ∈ W and θZ ∈

I(x̃) ∩ I(−x̃). Then
E(A, W, I) ≥ kAx̃kX .

cor 2. Let Y = C, R be a (complex) normed space, X = R × R∗ , W1 ⊂ R

and W2 ⊂ R∗ be given classes. Also, let A be the scalar product of elements
in R × R∗ , i.e. A(x, y) = hy, xi, x ∈ R and y ∈ R∗ . Assume that there exist
x̃1 ∈ W1 and x̃2 ∈ W2 such that either

−x̃1 ∈ W1 and θZ ∈ I (x̃1 , x̃2 ) ∩ I (−x̃1 , x̃2 )

or
−x̃2 ∈ W2 and θZ ∈ I (x̃1 , x̃2 ) ∩ I (x̃1 , −x̃2 ) .
Then
E (A, W1 × W2 , I) ≥ |hx̃2 , x̃1 i| .

Remark that similar and related lower estimates were established in many
papers (see, e.g., [10, 5]).

3 Optimal recovery of sequences

Let us present notations used in the rest of the paper. Let 1 ≤ p, q ≤ ∞, ℓq be
the standard space of sequences x = {xk }∞ k=1 , complex-valued in general, with
n
corresponding norm kxkq , and ℓq , n ∈ N, be the spaces of finite sequences.
Denote by θ the null element of ℓq and by θn the null element of ℓnq .

3
 For a given non-increasing sequence t = {tk }∞
k=1 of non-negative numbers,
consider bounded operator T : ℓq → ℓq defined as follows
T h := {tk hk }∞
k=1 , h ∈ ℓq ,
and the class
WqT := {x = T h : h ∈ ℓq , khkq ≤ 1}.
In this section we will study the problem of optimal recovery of identity
operator A = idX on the class WqT , also called the problem of optimal recov-
ery of class WqT , when information mapping I is given in one of the following
forms:
1. Ix = Iεn x = (x1 , . . . , xn ) + B [ε1 ] × B [εn ], where n ∈ N, ε1 , . . . , εn ≥ 0
and B[εj ] = [−εj , εj ];
n
x = (x1 , . . . , xn ) + B ε, ℓnp , where n ∈ N, ε ≥ 0 and B ε, ℓnp
   
2. Ix = Iε,p
is the ball of radius ε in the space ℓnp centered at θn ;
3. Ix = Iε,p x = x + B [ε, ℓp ], where ε ≥ 0 and B [ε, ℓp ] is the ball of radius
ε in the space ℓp centered at θ.
To simplify further notations, we set
E(W, I) := E(idX , W, I), E(W, I, Φ) := E(idX , W, I, Φ),
and, for m ∈ N and q < ∞, introduce the method of recovery Φ∗m : ℓp → ℓq :
tqm+1 tqm+1
     
∗
Φm (a) = a1 1 − q , . . . , am 1 − q , 0, . . . , a ∈ ℓp ,
t1 tm
that would be optimal in manyPsituations. Also, we set Φ∗0 (a) := θ, a ∈ ℓp .
In what follows we define 0k=1 ak := 0 for numeric ak ’s. In addition,
for simplicity we assume that tk > 0 for every k ∈ N. Results in this paper
remain true in the case when tk can attain zero value with the substitution
of 1/tk with +∞ and ts /tk , s ≥ k with 1.

3.1 Information mapping Iε̄n (x) = (x1, . . . , xn) + B[ε1] ×

. . . × B[εn]
Theorem 1. Let n ∈ N, 1 ≤ q < ∞ and ε1 , . . . , εn ≥ 0. If
n
X εq k
1− ≥ 0,
k=1
tqk

4
we set m = n. Otherwise we choose m ∈ Z+ , m ≤ n, to be such that
m m+1
X εq k
X εqk
1− q ≥0 and 1− < 0.
t
k=1 k k=1
tqk
Then
m 
!1/q
tqm+1
X 
E WqT , Iε̄ = E WqT , Iε̄n , Φ∗m =
n
tqm+1 εqk



+ 1− q .
k=1
tk
Proof. Using convexity inequality, relations |xk − ak | ≤ εk , k = 1, . . . , n, and
monotony of the sequence t, we obtain that, for x = T h ∈ WqT and a ∈ Iε̄n (x),
m  q
tqm+1 
X  X∞
q
|xk |q
∗

kx − Φm (a)kq = xk − ak 1 − tq

 +
k=1 k k=m+1
m  q  q q ∞
 1 − tm+1 tm+1 
X X q
= q (x k − a k ) + q x k + tk |hk |q
k=1
 tk tk 
k=m+1
m  q  q  ∞
X tm+1 q tm+1 q q
X
≤ 1− q |xk − ak | + q |xk | + tm+1 |hk |q
tk tk
k=1 k=m+1
m  q  m ∞
X tm+1 q
X q
q q
X
= 1− q |xk − ak | + tm+1 |hk | + tm+1 |hk |q
k=1
tk k=1 k=m+1
m  q 
X t
≤ 1 − m+1 q εqk + tqm+1 .
k=1
tk
To obtain the lower estimate, we choose
m
!1/q
εk X εq k
uk := , k = 1, . . . , m, and um+1 := 1− ,
tk k=1
tqk
and consider h = (u1 , . . . , um+1 , . . .) ∈ lq . It is clear that T h∗ ∈ WqT , as
∗

kh∗ kq ≤ 1. Furthermore, by the choice of number m we have that θ ∈

Iε̄n (T h∗ ). Hence, by Corollary 1,
m
n q
X
∗ q
T
tqk uqk + tqm+1 uqm+1



E Wq , Iε̄ ≥ kT h kq =
k=1
m m
! m
εqk tqm+1
X X X  
= εqk + tqm+1 1− = tqm+1 + εqk 1− q ,
k=1
tq
k=1 k k=1
tk

5
which finishes the proof.

n
 
3.2 Information mapping Iε,p (x) = (x1, . . . , xn) + B ε, ℓnp
We consider three cases separately: p = ∞, p ≤ q and p > q.

3.2.1 Case p = ∞
Setting ε1 = . . . = εn = ε, we obtain from Theorem 1 the following corollary.

Theorem 2. Let n ∈ N, 1 ≤ q < ∞ and ε ≥ 0. If

n
X 1
1 − εq q ≥ 0
t
k=1 k

then we set m = n. Otherwise we choose m ∈ Z+ , m ≤ n, to be such that

m m+1
X 1 q q
X 1
1−ε ≥0 and 1−ε < 0.
tq
k=1 k k=1
tqk

Then
m  q !1/q
X t
E WqT , Iε,∞
n
= E WqT , Iε,∞
n
tqm+1 + εq 1 − m+1



, Φ∗m = .
k=1
tqk

3.2.2 Case 0 < p ≤ q

Theorem 3. Let n ∈ N, 1 ≤ q < ∞ and 0 < p ≤ q. If ε ∈ [0, t1 ] then
1/q
tqn+1
 
q
WqT , Iε,p
n
WqT , Iε,p
n q



E =E , Φ∗n
= tn+1 + ε 1 − q ,
t1



and if ε > t1 then E WqT , Iε,p
n
= E WqT , Iε,p
n
, Φ∗0 = t1 .

Proof. First, consider the case ε ∈ [0, t1 ]. For x = T h ∈ WqT , khkq ≤ 1, and

6
 n
a ∈ Iε,p (x), we have
n 
tqn+1 q
X   X∞
Φ∗n (a)kqq |xk |q

kx − = xk − ak 1 − tq  +

k=1 k k=n+1
n  q  q q ∞
 1 − tn+1 t
X X
(xk − ak ) + n+1 tqk |hk |q

= q q xk  +

k=1
 t k t k k=n+1
n  q  q  ∞
X tn+1 q tn+1 q q
X
≤ 1 − q |xk − ak | + q |xk | + tn+1 |hk |q
k=1
t k t k k=n+1
n  q  ∞
X t
q/p X
= 1 − n+1 q |xk − ak |p + tqn+1 |hk |q
k=1
tk k=1
n
! q/p
tqn+1 tqn+1
  X  
q
≤ 1− q |xk − ak | p
+ tn+1 ≤ 1 − q εq + tqn+1 .
t1 k=1
t1

Now, we establish the lower estimate for E WqT , Iε,p n

. Let u1 and un+1
q q
be such that t1 u1 = ε and u1 + un+1 = 1, i.e. u1 = ε/t1 and uqn+1 = 1 − εq /tq1 .
n
Set h∗ := (u1 , 0, . . . , 0, un+1, 0, . . .). Obviously, khkq ≤ 1 and θ ∈ Iε,p (T h∗ ).
Then by Corollary 1,


q
E WqT , Iε,p n
≥ kT h∗ kqq = tq1 uq1 + tqn+1 uqn+1
εq tqn+1
   
q q q q
= ε + tn+1 1 − q = tn+1 + ε 1 − q .
t1 t1

Finally, consider the case ε > t1 . For x = T h ∈ WqT and a ∈ Iε,p n

(x), we
have ∞ ∞
q
X q
X
∗ q
kx − Φ0 (a)kq = kT hkq = q q
tn |hn | ≤ t1 |hn |q ≤ tq1 .
n=1 n=1
n
Taking h := (1, 0, . . .), it is clear that θ ∈
∗
Iε,p (T h∗ ) and by Corollary 1,

E WqT , Iε,p
n


≥ kT h∗ kq = t1 .

Theorem is proved.

7
3.2.3 Case 1 ≤ q < p < ∞
This case is the most technical case. We introduce some preliminary nota-
tions. For m = 1, . . . , n, define
p
tq
  p−q
δj,m := 1 − m+1 , j = 1, . . . , m − 1,
tqj

and set c1 := t1 and, for m ≥ 2,

m
!1/p m q/p
!−1/q
X X δj,m
cm := δj,m . (3)
j=1 j=1
tqj

p
ξtqm +(1−ξ)tqm+1
  p−q
The sequence {cm }nm=1
is non-increasing. Indeed, let δj,m (ξ) := 1 − tqj
and consider the function
m
!1/p m q/p !−1/q
X X δj,m (ξ)
g(ξ) := δj,m (ξ) , ξ ∈ [0, 1].
j=1 j=1
tqj

Differentiating g and applying the Cauchy-Swartz inequality we have

m
! p1 −1 m q/p !−1/q−1
q q X δj,m (ξ)
t − t X
g ′ (ξ) = m+1 m
δj,m(ξ) q ×
p−q j=1 j=1
tj
 2 !
q/p 2q/p−1
m
! m
! m
X δj,m (ξ) X X δj,m (ξ)
× q − δj,m (ξ) 2q
≥0
j=1
tj j=1 j=1
tj

Hence, cm+1 = g(0) ≤ g(1) = cm .

For convenience, for λ ∈ [0, 1] denote tqm,λ := (1 − λ)tqm+1 + λtqm .

Theorem 4. Let n ∈ N and 1 ≤ q < p < ∞.

1. If ε ≤ cn then
 ! p−q 1/q
p
n 
tqn+1 p−q
 p
X
E WqT , Iε,p
n
= E WqT , Iε,p
n
, Φ∗n = tqn+1 + εq



1− q  ;
j=1
tj

8
 2. If ε ∈ (cn , c1 ] then there exist m ∈ {1, . . . , n − 1} such that ε ∈
(cm+1 , cm ] and λ = λ(ε) ∈ [0, 1) such that
q −1/q
tqm,λ
   p−q
 p ! p1
m 
X tqm,λ p−q m 1− tqj
X
ε= 1− . (4)

tqj tqj
 
j=1 j=1

Then
 p ! p−q 1/q
m 
tqm,λ p−q
 p
X
E WqT , Iε,p
n
= E WqT , Iε,p
n
, Φ∗m,λ = tqm,λ + εq ·



1− q  ,
j=1
tj

where
tqm,λ tqm,λ
     
Φ∗m,λ (a) = a1 1 − q , . . . , am 1 − q , 0, . . . , a ∈ ℓp .
t1 tm

3. If ε > c1 then E WqT , Iε,p

n
= E WqT , Iε,p
n



, Φ∗0 = t1 .

Proof. Let m ∈ {0, . . . , n}, λ ∈ [0, 1] and Φ be either Φ∗n , or Φ∗0 , or Φ∗m,λ . For
x ∈ WqT and a ∈ Iε,p
n
(x),
m 
tqm,λ tqm,λ q ∞
 
X X
Φ(a)kqq |xk |q

kx − ≤  1 − tq
 (xk − ak ) + q xk  +
k=1 k tk k=m+1
m q m ∞
tm,λ
X   X q X q
≤ 1− q |xk − ak |q + tm,λ |hk |q + tk |hk |q .
k=1
tk k=1 k=m+1

Using the Hölder inequality with parameters p/(p − q) and p/q to estimate
the first term and inequality tqk ≤ tqm,λ , k = m + 1, m + 2, . . ., we obtain

 p )1−q/p (X )q/p
tqm,λ p−q
( m  m ∞
X X
kx − Φ(a)kqq ≤ 1− q |xk − ak |p + tqm,λ hqk
k=1
tk k=1 k=1
p )1−q/p
tqm,λ p−q
( m  
X
≤ 1− q εq + tqm,λ ,
k=1
tk

9
which proves the estimate from above.
Now, we turn to the proof of the lower estimate. First, let ε ≤ cn , and
define
1/p n
!−1/p n
!1/q
ε δj,n X X
uj := δj,n , j = 1, . . . , n, and un+1 := 1 − uqj .
tj j=1 j=1

Consider h∗ := (u1 , . . . , un+1 , 0, . . .). Evidently, un+1 is well-defined as

n n
!−q/p n q/p
X X X δj,n εq
uqj =ε q
δj,n = ≤ 1,
j=1 j=1 j=1
tqj cqn

n
Pn p p
kh∗ kq = 1 and θ ∈ Iε,p (T h∗ ) as j=1 tj hj = εp . Hence, by Corollary 1,


q
E WqT , Iε,p
n
≥ kT h∗ kqq
n n
!−q/p n q/p n
!−q/p
X q/p
X X δj,n X
= εq δj,n δj,n + tqn+1 − tqn+1 εq q δj,n
j=1 j=1 j=1
tj j=1
n
!−q/p n
tqn+1
 
q/p
X X
=ε q
δj,n δj,n 1− q + tqn+1
j=1 j=1
tj
n   p ! p−q
tq
p
X p−q
= tqn+1 +ε · q
1 − n+1 .
j=1
tqj

Next, let m ∈ {1, 2, . . . , n − 1} be such that cm+1 < ε ≤ cm and λ = λε ∈

[0, 1) be defined by (4). Set

1/p m
!−1/p
εδj,m (λ) X
uj := δj,m (λ) , j = 1, . . . , m,
tj j=1

n
and consider h∗ = (u1 , . . . , um, 0, . . .). Clearly, khkq = 1 and θ ∈ Iε,p (T h∗ ).
Using Corollary 1, we obtain the desired lower estimate for E WqT , Iε,p n


.
Finally, let ε > c1 . Consider h := (1, 0, 0, . .
.). Since c1 = t1 , we have
∗
n
θ ∈ Iε,p (T h∗ ). Hence, by Corollary 1, E WqT , Iε,p n
≥ kT h∗ kq = tq1 .

10
3.3 Information mapping I(x) = Iε,p (x) := x + B [ε, ℓp ]
As a limiting case from Theorem 2, 3 and 4 we can obtain the following
corollaries.

Theorem 5. Let 1 ≤ q < ∞ and ε ≥ 0. Choose m ∈ Z+ to be such that

m m+1
X 1 X 1
1 − εq q ≥ 0 and 1 − εq < 0.
t
k=1 k k=1
tqk

Then
m  !1/q
X tqm+1
WqT , Iε,∞ WqT , Iε,∞, Φ∗m tqm+1 q



E =E = +ε 1− q .
k=1
tk

Theorem
6. Let 1 ≤ q <
∞ and 0 < p ≤ q. If 0 ≤ ε ≤ t1 then

E WqT , Iε,p = E WqT , Iε,p, id = ε, and if ε > t1 then E WqT , Iε,p =
E WqT , Iε,p , Φ∗0 = t1 .

Define the sequence {cn }∞n=1 using formulas (3). It is not difficult to verify
∞
that {cn }n=1 is non-increasing and tend to 0 as n → ∞.

Theorem 7. Let 1 ≤ q < p < ∞. If ε ∈ (0, c1 ] then there exists m ∈ N such

that ε ∈ (cm+1 , cm ] and λ = λ(ε) ∈ [0, 1) such that
q −1/q
tqm,λ
   p−q
p !1/p
m 
X tqm,λ p−q
 Xm 1− tqj
ε= 1− . (5)
 
tqj tqj
 
j=1 j=1

Then
 p ! p−q 1/q
m 
tqm,λ p−q p
X 
E WqT , Iε,p = E WqT , Iε,p , Φ∗m,λ = tqm,λ + εq ·



1− q  .
j=1
tj

where the method Φ∗m,λ is defined in Theorem 3. Otherwise, if ε > c1 then

E WqT , Iε,p = E WqT , Iε,p , Φ∗0 = t1 .

11
4 Recovery of scalar products
Following [3] (see also [4, 6, 7]), let us consider the problem of optimal re-
covery of scalar product. Let 1 ≤ p, q ≤ ∞ and given operators T : ℓp → ℓp
and S : ℓq → ℓq be defined as follows: for fixed non-increasing sequences
t = {tk }∞
k=1 and s = {sk }k=1 ,
∞

T h := {tk hk }∞
k=1 , h ∈ ℓp , and Sg := {sk gk }∞
k=1 , g ∈ ℓq .

Consider classes of sequences

WpT := {x = T h : h ∈ ℓp , khkp ≤ 1} ,
WqS := {y = T g : g ∈ ℓq , kgkq ≤ 1} .

and define the scalar product A = h·, ·i : ℓp × ℓq → C as usually:

∞
X
hx, yi = xk yk , x ∈ ℓp , y ∈ ℓq .
k=1

For brevity, we denote hx, yin := nk=1 xk yk .

P
In this section we will consider the problem of optimal recovery of scalar
T,S
product operator A on the class Wp,q := WpT × WqS , when information
mapping I is given in one of the following forms:

1. I(x, y) = Jε̄n (x, y) = {(a, b) ∈ Cn × Cn : ∀k = 1, ..., n ⇒ |xk yk − ak bk | ≤ εk },

where n ∈ N and ε1 , . . . , εn ≥ 0;
n o
n
2. I(x, y) = Jε,r (x, y) = (a, b) ∈ Cn × Cn : khx, yin − ha, bin kℓn ≤ ε ,
r
where n ∈ N and 1 ≤ r ≤ ∞.

Finally, for m ∈ N, we define methods of recovery Ψ∗m : Cn × Cn → C:

m  
X tm+1 sm+1
Ψ∗m (a, b) = ak bk 1 − , a, b ∈ Cn ,
k=1
tk sk

that will be optimal in many situations and set Ψ∗0 (a, b) := 0.

12
4.1 Information mapping Jε̄n
Theorem 8. Let n ∈ N, 1 < p < ∞, q = p/(p − 1), ε1 , . . . , εn ≥ 0 and
ε̄ = (ε1 , . . . , εn ). If
n
X εk
1− ≥0
k=1
tk sk

we set m = n. Otherwise we choose m ∈ Z+ , m ≤ n, to be such that

m m
X εk X εk εm+1
1− ≥0 and 1− − < 0.
k=1
tk sk k=1
tk sk tm+1 sm+1

Then
m  
T,S
X tm+1 sm+1
, Jε̄n T,S
, Jε̄n , Ψ∗m



E A, Wp,q =E A, Wp,q = tm+1 sm+1 + εk 1− .
k=1
tk sk

Proof. Using the triangle inequality, relations |xk yk − ak bk | ≤ εk , k = 1, . . . , n,

and monotony of sequences t and s, we obtain that, for (x, y) = (T h, Sg) ∈
T,S
Wp,q and (a, b) ∈ Jε̄n (x, y),
 
∞ m 
X X tm+1 s m+1
|hx, yi − Ψ∗m (a, b)| =  xk yk − ak bk 1 −
 
tk sk

 
k=1 k=1
m   m ∞
X tm+1 sm+1 X tm+1 sm+1 X
≤ 1− |xk yk − ak bk | + |xk yk | + |xk yk |
k=1
tk sk k=1
tk sk k=m+1
m   m ∞
X tm+1 sm+1 X X
≤ 1− εk + tm+1 sm+1 |hk gk | + tk sk |hk gk |
tk sk
k=1 k=1 k=m+1
m   ∞
X tm+1 sm+1 X
≤ 1− εk + tm+1 sm+1 |hk gk |
k=1
tk sk
k=1
m  
X tm+1 sm+1
≤ tm+1 sm+1 + 1− εk ,
k=1
tk sk

which proves the upper estimate.

13
 To establish the lower estimate, we set
 1/p  1/q
εk εk
uk := , vk := , k = 1, . . . , m, (6)
tk sk tk sk
m
!1/p m
!1/q
X εk X εk
um+1 = 1 − , vm+1 = 1 − , (7)
k=1
tk sk k=1
tk sk

and consider u∗ = (u1 , . . . , um+1 , 0, . . .) and v ∗ = (v1 , . . . , vm+1 , 0, . . .). It is

T,S
clear that (T u∗ , Sv ∗) ∈ Wp,q and θ ∈ Jε̄n (T u∗ , Sv ∗ ) ∩ Jε̄n (−T u∗ , Sv ∗) due to
the choice of number m. Hence, by Corollary 2,
m m
!
T,S
X X ε k
, Jε̄n ≥ |hT u∗ , Sv ∗i| =


E A, Wp,q tk sk uk vk + tm+1 sm+1 1 −
k=1 k=1
t s
k k
m  
X tm+1 sm+1
= tm+1 sm+1 + 1− εk .
k=1
tk sk

This proves the sharpness of the upper estimate. Theorem is proved.

n
4.2 Information mapping Jε,r
We consider three cases separately: r = ∞, 0 < r ≤ 1 and 1 < r < ∞.

4.2.1 Case r = ∞
Setting ε1 = . . . = εn = ε, we obtain the following corollary from Theorem 8.
Theorem 9. Let n ∈ N, 1 < p < ∞, q = p/(p − 1) and ε ≥ 0. If
n
X 1
1−ε ≥ 0,
k=1
tk sk

we set n = m. Otherwise we choose m ∈ Z+ , m ≤ n, to be such that

m m+1
X 1 X 1
1−ε ≥0 and 1−ε < 0.
k=1
tk sk k=1
tk sk

Then
m  
T,S n

T,S n

X tm+1 sm+1
E A, Wp,q , Jε,∞ =E A, Wp,q , Jε,∞ , Ψ∗m = tm+1 sm+1 +ε 1− .
k=1
tk sk

14
4.2.2 Case 0 < r ≤ 1
Theorem 10. Let n ∈ N, 1 < p < ∞, q = p/(p − 1) and r ∈ (0, 1]. If
ε ≤ t1 s1 then
 
T,S n

T,S n ∗

tn+1 sn+1
E A, Wp,q , Jε,r = E A, Wp,q , Jε,r , Ψn = tn+1 sn+1 + ε 1 − ,
t1 s1
T,S n T,S n



and if ε > t1 s1 then E A, Wp,q , Jε,r = E A, Wp,q , Jε,r , Ψ∗0 = t1 s1 .
T,S
Proof. First, we consider the case ε ≤ t1 s1 . Let (x, y) = (T h, Sg) ∈ Wp,q
n
and (a, b) ∈ Jε,r (x, y). Similarly to the proof of Theorem 8 in the case m = n
we obtain
n   ∞
∗
X tn+1 sn+1 X
|hx, yi − Ψn (a, b)| ≤ 1− |xk yk − ak bk | + tn+1 sn+1 hk gk .
k=1
t k sk
k=1
(8)
1/r 1/r 1/r
Using the Hölder inequality and inequality ε1 +. . .+εn ≤ (ε1 + . . . + εn ) ,
we have
  n
∗ tn+1 sn+1 X
|hx, yi − Ψn (a, b)| ≤ max 1 − |xk yk − ak bk | + tn+1 sn+1 khkp kgkq
k=1,n tk sk
  k=1
tn+1 sn+1
≤ 1− ε + tn+1 sn+1 .
t1 s1

The upper estimate is proved.

Now, we establish the lower estimate. Let
 1/p  1/p  1/q  1/q
ε ε ε ε
u1 = , un+1 = 1− , v1 = , vn+1 = 1− ,
s1 t1 t1 s1 s1 t1 t1 s1

and consider elements u∗ = (u1 , 0, . . . , 0, un+1, 0, . . .), v ∗ = (u1 , 0, . . . , 0, un+1, 0, . . .).

T,S n n
Obviously, (T u∗ , Sv ∗ ) ∈ Wp,q and (θ, θ) ∈ Jε,r (T u∗ , Sv ∗ ) ∩ Jε,r (−T u∗ , Sv ∗ ).
Then by Corollary 2,
 
T,S n

∗ ∗ ε ε
E A, Wp,q , Jε,r ≥ |hT u , Sv i| = t1 s1 · + tn+1 sn+1 · 1 −
t1 s1 t1 s1
 
tn+1 sn+1
= 1− ε + tn+1 sn+1 ,
t1 s1

15
which finishes the proof of the desired estimate.
T,S
Next, we let ε > t1 s1 . For (x, y) = (T h, Sg) ∈ Wp,q , and (a, b) ∈
n
Jε,r (x, y), we have
∞
X
|hx, yi − Ψ∗0 (a, b)| = | hx, yi | ≤ tk sk |hk gk | ≤ t1 s1 khkp kgkq ≤ t1 s1 .
k=1

n n
Taking u∗ = v ∗ = (1, 0, ...), it is clear that (θ, θ) ∈ Jε,r (T u∗ , Sv ∗)∩Jε,r (−T u∗ , Sv ∗ ).
By Corollary 2,
T,S n


E A, Wp,q , Jε,r ≥ |(T u∗, Sv ∗ )| = t1 s1 .

The theorem is proved.

4.2.3 Case 1 < r < ∞

First, we introduce some preliminary notations. For m = 1, . . . , n, we define
 1
 r−1
tm+1 sm+1
τj,m := 1− , j = 1, . . . , m − 1,
tj sj

and set d1 := t1 s1 and, for m ≥ 2,

m
!1/r m
!−1
X
r
X τj,m
dm := τj,m .
j=1 j=1
tj sj

The sequence {dm }nm=1 is non-increasing, which can be verified using the
arguments similar to those applied to prove monotony of sequence {cm }nm=1
in subsection 3.2.3. In addition, for convenience, for λ ∈ [0, 1], we denote

tm,λ := (1 − λ)tm+1 + λtm and sm,λ := (1 − λ)sm+1 + λsm .

Theorem 11. Let n ∈ N, 1 < p < ∞, q = p/(p − 1) and 1 < r < ∞.

1. If ε ≤ dn+1 then

n   r
! r−1
r
T,S n

T,S n ∗

X tn+1 sn+1 r−1
E A, Wp,q , Jε,r = E A, Wp,q , Jε,r , Ψn = tn+1 sn+1 +ε· 1− .
j=1
tj sj

16
 2. If ε ∈ (dn , d1 ] then there exist m ∈ {1, . . . , n − 1} such that ε ∈
(dm+1 , dm ] and λ = λ(ε) ∈ [0, 1) such that
  1 −1
 r−1
r
!1/r tm,λ sm,λ
m 
X tm,λ sm,λ
 r−1 Xm 1− tj sj
ε= 1− . (9)
 
tj sj tj sj
 
j=1 j=1

Then
m  r
 r−1 ! r−1
r
T,S n

T,S n

X tm,λ sm,λ
E A, Wp,q , Jε,r = E A, Wp,q , Jε,r , Ψ∗m,λ = tm,λ sm,λ +ε 1− ,
j=1
tj sj

where
m  
X tm,λ sm,λ
Ψ∗m,λ (a, b) = aj bj 1− , a, b ∈ ℓr .
j=1
tj sj

T,S n

T,S n


3. If ε > d1 then E A, Wp,q , Jε,r = E A, Wp,q , Jε,r , Ψ∗0 = t1 s1 .
Proof. Let m ∈ {0, . . . , n}, λ ∈ [0, 1] and Ψ be either Ψ∗n or Ψ∗0 , or Ψ∗m,λ . Us-
r
ing the Hölder inequality with parameters r and r−1 , for (x, y) = (T h, Sg) ∈
T,S n
Wp,q and (a, b) ∈ Jε,r (x, y), we have
m   m ∞
X tm,λ sm,λ X xj yj X
|hx, yi − Ψ (a, b)| ≤ 1− |xj yj − aj bj | + tm,λ sm,λ + xj yj
j=1
tj s j j=1
tj s j j=m+1
r−1
r
m   ! r
X tm,λ sm,λ r−1
≤ tm,λ sm,λ + ε 1− ,
j=1
tj sj

which proves the upper estimate.

Now, we turn to the proof of the lower estimate. We let ε ≤ dn , and, for
j = 1, . . . , n, set
 1/p Xn
!− rp1  1/q Xn
!− rq1
ετj,n r ετj,n r
uj = τk,n , vj = τk,n ,
tj sj k=1
t s
j j
k=1

1/p 1/q
un+1 := (1 − up1 − . . . − upn ) , and vn+1 := (1 − v1q − . . . − vnq ) . In addi-
tion, we define u∗ = (u1 , . . . , un , un+1, 0, . . .) and v ∗ := (v1 , . . . , vn , vn+1 , 0, . . .).

17
By the choice of ε, numbers un+1 and vn+1 are well defined and, hence,
T,S
(T u∗, Sv ∗ ) ∈ Wp,q . Also,
n n
T uj · Svj∗ r =
X X
|tj sj uj vj |r = εr ,
 ∗ 

j=1 j=1

n n
yielding that (θ, θ) ∈ Jε,r (T u∗ , Sv ∗ ) ∩ Jε,r (−T u∗ , Sv ∗ ). By Corollary 2,
T,S n


E A, Wp,q , Jε,r ≥ |(T u∗ , Sv ∗)|
n n
!−1/r n n
!−1/r
X X
r
X t s τ
n+1 n+1 j,n
X
r
=ε τj,n τj,n + tn+1 sn+1 − ε τj,n
j=1 j=1 j=1
t s
j j j=1
r−1
r
n   ! r
X tn+1 sn+1 r−1
= tn+1 sn+1 + ε 1− ,
j=1
tj sj

which proves the desired lower estimate.

Next, let m ∈ {1, . . . , n − 1} be such that dm+1 < ε ≤ dm and λ = λε ∈
[0, 1) be defined by (9). Set
 1/p m
!− rp1  1/q m
!− rq1
ετj X ετj X
uj := τkr and vj := τkr ,
tj sj k=1
tj sj k=1

and define u∗ := (u1 , . . . , um , 0, . . .) and v ∗ := (v1 , . . . , vm , 0, . . .). It is not

n n
difficult to verify that (θ, θ) ∈ Jε,r (T u∗ , Sv ∗ ) ∩ Jε,r (−T u∗ , Sv ∗ ). Using Corol-
T,S n


lary 2 we obtain the desired estimate for E A, Wp,q , Jε,r .
Finally, let ε > t1 s1 . Consider u = v = (1, 0, . . .). Since d1 = t1 s1 ,
∗ ∗
n n
we have (θ, θ) ∈ Jε,r (T u∗, Sv ∗ ) ∩ Jε,r (−T u∗ , Sv ∗). Hence, by Corollary 2,
T,S n


E A, Wp,q , Jε,r ≥ |hT u∗ , Sv ∗i| = t1 s1 .

4.3 Applications
Let H be a complex Hilbert space with orthonormal basis {ϕn }∞ n=1 , {tk }k=1
∞

be a non-increasing sequence; T : ℓ2 → ℓ2 be an operator mapping sequence

x = (x1 , x2 , . . .) into sequence T x = (t1 x1 , t2 x2 , . . .). Consider the class
( ∞ ∞
)
X X
W T := x = tn cn ϕn : |cn |2 ≤ 1 ,
n=1 n=1

18
and information
P∞ operator Ip,ε : H → ℓp , with 2 < p ≤ ∞, mapping an
element x = n=1 xn ϕn into the set Ip,ε x = (x1 , x2 , . . .) + B[ε, ℓp ] ∈ ℓp . Due
to isomorphism between ℓ2 and H, under notations of Section 3 we have
E W T , Iε,p = E W2T , Iε,p

∞


. (10)
Moreover, methods of recovery Fm,λ
∗
:= A ◦ Φ∗m,λ are optimal, whereP∞A : ℓ2 →
H is the natural isomorphism between ℓ2 and H: A (x1 , x2 , . . .) = n=1 xn ϕn .
Remark that Fm,λ are triangular methods of recovery that play an important
role in the theory of ill-posed problems (see, e.g. [11, Theorem 2.1] and
references therein).
Consider an important case when tn = n−µ , n ∈ N, with some fixed
µ > 0. It corresponds e.g., to the space H = L2 (T) of square integrable
functions defined on a period and the class W T = W2µ (T) of functions having
L2 -bounded Weyl derivative of order µ. Using equality (10) and Theorems 7
and 5, we obtain
 1/2  1/2 λ
−λ T

α+β β µ
lim+ ε E W , Iε,p = 1/p
, λ= ,
ε→0 β α µ + 1/2 − 1/p
where
   
1 2p − 2 1 1 2p − 2 1
α= B , , β= B ,2+ ,
2µ p 2µ 2µ p 2µ
and B(α, β) is the Euler beta function. Indeed, in case 2 < p < ∞, by
selecting n = nε ∈ N and λ ∈ [0, 1) such that equation (5) is satisfied, we
can easily verify that
 1/2 µ/λ
µ/λ µ/λ 1/p −1/2 −µ/λ −µ β
lim+ nε cnε = lim+ nε cnε +1 = α β and lim+ ε nε = .
ε→0 ε→0 ε→0 α1/p
Similar arguments are applicable for p = ∞, in which case 1/p should be
replaced with 0.

References
[1] Arestov V. V. Approximation of unbounded operators by
bounded ones, and related extremal problems //Russian
Math. Surveys. – 1996. – V 51, No. 6. – P. 1093–1126. –
https://doi.org/10.1070/RM1996v051n06ABEH003001.

19
 [2] Babenko V. F. On the best use of linear functional for approximation of
bilinear ones //Researches in Mathematics. – Dnepropetrovsk. – 1979.
– P. 3–5.

[3] Babenko V. F. Extremal problems of Approximation Theory and asym-

metric norms //Diss. Doct. Thesis in Physical and Mathematical Sci-
ences, DSU, – Dnepropetrovsk. – 1987.

[4] Babenko V. F. Approximate computation of scalar prod-

ucts //Ukr. Math. J. – 1988. – V. 40. – P. 11–16. –
https://doi.org/10.1007/BF01056438.

[5] Babenko V. F., Babenko Yu. V., Parfinovych N. V., Sko-

rokhodov D. S. Optimal recovery of integral operators and its
applications //J. Complexity. – 2016. – V. 35. – P. 102–123. –
https://doi.org/10.1016/j.jco.2016.02.004.

[6] Babenko V. F., Gunko M. S., Rudenko A. A. On optimal recov-

ery of bilinear functional by linear information //Researches in
Mathematics. – Dnipropetrovsk. – 2012. – Vol. 17. – P. 11–17. –
https://doi.org/10.15421/24122001

[7] Babenko V. F., Gunko M. S., Parfinovych N. V., Optimal Recovery of

Elements of a Hilbert Space and their Scalar Products According to the
Fourier Coefficients Known with Errors //Ukr. Math. J. – 2020. – V. 72.
– P. 853–870. – https://doi.org/10.1007/s11253-020-01828-4.

[8] Babenko V. F., Rudenko A. A. Optimal recovery of convolutions and

scalar products of functions from various classes //Ukr. Math. J. – 1991.
– V. 43. – P. 1214–1219. – https://doi.org/10.1007/BF01061804.

[9] Babenko V. F., Rudenko A. A. On the optimal renewal of bilinear func-

tionals in linear Normed spaces //Ukr. Math. J. – 1997. – V. 49. –
P. 925–929. – https://doi.org/10.1007/BF02513432.

[10] Magaril-Il’yaev G. G., Osipenko K. Yu. Optimal recovery of functions

and their derivatives from Fourier coefficients prescribed with an er-
ror //Sbornik: Mathematics. – 2002. – V. 193, No. 3. – P. 387–407. –
https://doi.org/10.1070/SM2002v193n03ABEH000637.

20
[11] Mathé P., Pereverzev S. V. Stable Summation of Orthogonal Series with
Noisy Coefficients //J. Approx. Theory. – 2002. – V. 118, No. 1. – P. 66–
80. – https://doi.org/10.1006/jath.2002.3710.

[12] Melkman A. A., Micchelli C. A. Optimal estimation of linear op-

erators in Hilbert spaces from inaccurate data //SIAM Journal
on Numerical Analysis. – 1979. – V 16, No. 1. – P. 87–105. –
https://doi.org/10.1137/0716007.

[13] Micchelli C. A. Optimal estimation of linear operators from inaccurate

data: A second look //Numer Algor. – 1993. – V. 5. – P. 375–390. –
https://doi.org/10.1007/BF02109419.

[14] Micchelli C. A., Rivlin T. J. A Survey of Optimal Recovery //In: Mic-

chelli C.A., Rivlin T.J. (eds) Optimal Estimation in Approximation The-
ory. The IBM Research Symposia Series. – 1977. – Springer, Boston,
MA. – P. 1–54. – https://doi.org/10.1007/978-1-4684-2388-4 1.

[15] Micchelli C. A., Rivlin T. J. Lectures on optimal recovery //In:

Turner P. R. (eds) Numerical Analysis Lancaster 1984. Lecture Notes
in Mathematics, vol 1129. – 1985. – Springer, Berlin, Heidelberg. –
https://doi.org/10.1007/BFb0075157.

[16] Plaskota L. Noisy information and computational complexity

//Cambridge Univ. Press, Cambridge. – 1996. – xii+308 p. –
https://doi.org/10.1017/CBO9780511600814.

[17] Traub J. F., Wasilkowski G. W., Wozniakowski H. Information-based

complexity // Academic Press, Boston, San Diego, and New York. –
1988. – xiii + 523 p.

21