Professional Documents
Culture Documents
5
49 (1997), 129{137 originalni nauqni rad
research paper
m(x; y).
P
The operator A is a Hilbert-Schmidt one if n>1 s2n (A) < +1.
AMS Subject Classication : 47B10
Supported by Ministry of Science and technology RS, grant number 04M01 through Mate-
maticki fakultet
129
130 M. Dostanic
operator A = ab m(x; y) dy satises the following equality
R
P
A Hilbert-Schmidt
RR
n>1 sn (A) = jm(x; y )j dx dy .
2 2
1. Results
p
Theorem 1. Let 0 =
5 17 .
4
a) If 0 < 6 0 , then
Z
dy = 2 () n cos
2
1
n jx yj
2 1 + O(n ) ;
1
where =
1 2 .
3
b) If 0 6 < 1, then
Z
dy = 2 () n cos
2
1
n jx yj
2 1 + O(n ) ;
1
where = 3 2 2 .
2
2 + 5 2
Z p !!
Theorem 2. n
1
1 ln jx yj dy = 2 1 + O ln n .
1 n n1=5
Consider the operator
Z
f 0 (t) dt;
Hf (x) = 1
1
1 x t
whose domain consists of the functions f satisfying the following conditions:
f 0 2 L1 ( 1; 1), Hf 2 L2 ( 1; 1), f ( 1) = f (1) = 0 [3] (the integral is taken in
the sense of principal value). This operator plays an important role in the theory
of thin airplane wing.
In [4] M. Kac heuristically deduced the formula
n (H ) = n
2 (1 + o(1)):
In [3] H. M. Hogan and L. A. Sahnovic gave a strong proof of this asymptotic for-
mula. Applying Theorem 2 we give an estimate of the remainder in the asymptotic
formula for n (H ).
Theorem 3. The following asymptotic formula holds:
n (H ) = n 1 + O(n 1=11 ) :
2
Eigenvalue asymptotics of some singular integral operators 131
Remark 1. Since the function
( ;
0 < 6 0 ;
1 2
3
7!
; 0 6 < 1;
3
2 2
2+5 22
attains its minimum when = 0 , Theorem 1 implies a more rough but unied
estimate for 0 < < 1, i.e.
!
Z 20 1
n
1
jx yj 1 2
dy = 2 () n cos 2 1 + O(n 3
) :
1
Remark 2. Part b) in Theorem 1 holds in the case 0 < < 1 but in the
interval (0; 0 ) the better estimate is given by a). That is the reason why these two
cases are separated.
2. Proofs
To prove the previous Theorems we need some Lemmas.
Lemma 1. If A and B are compact operators on a Hilbert space H such that
sn (A) = a n + O(n ); a > 0; < < + 1;
(1)
sn (B ) = O(n 1 ); 1 > + 1 ;
then sn (A + B ) = a n + O(n ).
Proof. Observe that from the assumptions of Lemma 1 it follows 1 > .
For n 2 N let k = k(n) = n 1 1, m = m(n) = n 1 ([x] denotes the
1
of the sum of two operators [2] it follows s(k+1)m+j (A + B ) 6 skm+j (A) + sm+1 (B )
and hence
n sn (A + B ) na 6
n skm+j (A) (km a+ j ) + n (km a+ j ) a
((k + 1)m + j ) + n sm+1 (B(2)):
The assumptions (1) and the properties of the sequences k(n), m(n) and j (n)
give
lim n skm+j (A) (km + j ) < +1; a
(3)
lim n sm+1 (B ) < +1;
132 M. Dostanic
and since 1 > +1 , we obtain lim n (km1+j) ((k+1)1m+j) < +1. Com-
bining (2) and (3) we get lim n sn (A + B ) na < +1. Since s(k+1)m+j (A) =
sn (A + B ) = an + O(n ).
Remark 3. The proof of the following statement is carried out in the same
way.
(a) If A and B are compact operators such that
sn (A) = an + O(n L(n)); sn (B ) = O(n 1 L(n))
and if L is a slowly varying function, L(x) ! +1 when x ! +1, < < + 1,
1 > =( + 1 ), then
sn (A + B ) = an + O(n L(n)):
(b) From Lemma 1 it follows: If A and B are compact operators such that
sn (A) = an ; a > 0; sn (B ) = O(n 1 ); 1 > ;
1
(1+ )
then sn (A + B ) = an + O n 1+ 1 .
R1
Lemma 2. Let T = 0
(x + y) 1
dy. If > 0, then
sn (T ) = o(n 1=2 ) (= O(n 1=2 )): (4)
If 0 < < 1, then
( 32 )
sn (T ) = O n : (5)
(Observe that for small (large) values of a better estimate is given by (4)
((5)), respectively.)
R R
Proof. From 01 01 (x + y)2 2 dx dy < +1 ( > 0) it follows that T is a
Hilbert-Schmidt operator and we have
sn (T ) = o(n 1=2 ) = O(n 1=2 ):
Let us now prove the asymptotic relation (5). Let > 0 be a xed number
( < 1). First, we prove
Z
sn (x + y) 1
dy 6 C n 1 (0 < < 1); (6)
0
Z x
Cf (x) = (x + y) 1 f (y) dy:
0
i.e.
C = (1 1 ) MJ ; (7)
where M : L2(0; ) ! L2 (0; ) is a linear operator dened by
Z x d Z x (x + t) 1 (t y) dt:
Mf (x) = H (x; y)f (y) dy and H (x; y) = dy
0 y
The function H can be represented in the form (for y > x)
H (x; y) = (2x) 1 (x y) + ( 1)y xy ;
1
Now, we prove that the integral operator with the kernel H (x; y)(x y) is
bounded on L2 (0; +1). ((x) = 0 for x < 0, (x) = 1 for x > 0). Since the function
H (x; y)(x y) is homogenous of order 1, according to the Hardy-Littlewood-
Polya inequality [6] it is enough to prove that k = 01 x 1=2 j(x 1)H (x; 1)j dx <
R
+1, i.e.
Z 1
k= x 1=2 j (2x) 1 (x 1) + ( 1)(x)j dx < +1:
1
Since 0 < < 1, from asymptotic behavior of the function when x ! 1 and
x ! +1 it follows that the previous integral converges. Therefore, we have
kM k 6 k: (8)
Having in mind that sn (J ) 6 const =n (const. does not depend on n and ),
from (7) and (8) and from the properties of singular values of the sum of two
operators it follows s2n (C ) 6 const =n , i.e. sn (C ) 6 const =n (const. does
not depend on n and ). From
Z
s2 n (x + y) 1
dy = s n (C + C ) 6 2sn (C ) 6 2 const n
2
0
operators dened by
Z 1 Z x
D0 f (x) = (1 ) (x + y) 2 f (y) dy; J 0 f (x) = f (t) dt:
Since D0 is a Hilbert-Schmidt operator we have
Z 1 Z 1
nsn (D0 ) 6 (1 )2
2
dx (x + y)2 4 dy;
p 0
and hence sn (D0 ) 6 const 1 = n (const. does not depend on n and ). Using
(10) and
1
s2n (A0 ) 6 sn (D0 ) sn (J 0 ) 6 const n3=2
(const. does not depend on n and ) we obtain (9).
Let P : L2 (0; 1) ! L2 (0; 1) be the orthoprojector dened by
P f (x) = [0;] (x)f (x)
(by S we denote the characteristic function of the set S ). Then
T = T (I P ) + (I P )TP + P TP
and we have s3n (T ) 6 sn (T (I P )) + sn ((I P )TP ) + sn (P TP ). Combining
this with (6) and (9) we obtain
1
s3n (T ) 6 2C2 n3=2 + C1 n
(C1 , C2 do not depend on n and ). This inequality holds for each 2 (0; 1).
3
Substituting = n 2 we get
( 32 )
s3n (T ) 6 (2C2 + C1 )n
( 32 )
and therefore sn (T ) = O n .
Eigenvalue asymptotics of some singular integral operators 135
Z p !
Lemma 3. sn
1
ln(x + y) dy = O ln n
0 n3=2 .
Proof. Let V : L2 (0; 1) ! L2 (0; 1) denote the operator dened by
Z 1
V f (x) = ln(x + y)f (y) dy:
0
1
R1
Since the operator 1
jx yj dy (0 < < 1) is positive, for 0 < < 1=2 we
1
obtain !
Z 2 1
n
1
jx yj 1 2
dy = 2 () n cos 2 1 + O(n ) :
3
(16)
1
where = 2 +35 222 .
2
Observe that for 0 < 6 0 (0 6 < 1) the better estimate is given by (16)
((17)), respectively.
Proof of Theorem 2. If G1 (t) = 1 K0(jtj) (K0 is Mc-Donald's function) then
Z 1
G1 (t)eit dt = (1 + 2 ) 1=2 :
1
It is well known that the function K0 decreases exponentially and
K0 (x) = ( ln x)A(x) + B (x); (18)
where A and B are even entire functions and A(0) = 1.
Eigenvalue asymptotics of some singular integral operators 137
Let 1
X
R(x; y) = (G1 (x y + 4n) G1 (x + y + 4n + 2)):
n= 1
By direct calculation we obtain
n2 2 1=2 ' (x)
Z
R(x; y)'n (y) dy = G^ 1 n
1
2 ' n (x) = 1 + 4 n
1
('n (x) = sin n(1+ x) , n 2 N), which implies that R 1 R(x; y ) dy is positive. Using
n
2
2 2
1 =2 p 3 =2
1