Professional Documents
Culture Documents
1
bn = pn , n = 0, 1, . . . , N 1.
2
Then the above system can be written in the form
a n = an (bn+1 bn ), b n = 2(a2 a2 ),
(1)
n
n1
n = 0, 1, . . . , N 1,
with the boundary conditions
a1 = aN 1 = 0.
(2)
If we define the N N matrices J and A by
b0 a0 0 0
0
0
a0 b1 a1 0
0
0
0
0
0 a1 b2 0
. . . .
..
..
..
J =
(3)
.
.
. ,
.. .. .. . .
0 0 0 ... b
N 3 aN 3
0 0 0 aN 3 bN 2 aN 2
0 0 0 0 aN 2 bN 1
0 a0 0 0
0
0
a0 0 a1 0
0
0
0
0
0 a1 0 0
. .
.. . .
..
..
..
, (4)
A=
.
.
.
.
.
.. ..
0 0
0 . . . 0 aN 3
0
0 0
0 aN 3
0
aN 2
0 0
0 0
aN 2
0
then the system (1) with the boundary conditions (2) is
equivalent to the Lax equation
d
J = [J, A] = JA AJ.
(5)
dt
The system (1), (2) is considered subject to the initial
conditions
an (0) = a0n , bn (0) = b0n , n = 0, 1, . . . , N 1, (6)
where a0n , b0n are given complex numbers such that a0n 6= 0
(n = 0, 1, . . . , N 2), a0N 1 = 0.
b0 a0 0 0
0
0
a0 b1 a1 0
0
0
0
0
0 a1 b2 0
. . . .
..
..
..
(7)
J =
.
.
. ,
.. .. .. . .
0 0 0 ... b
0
N 3 aN 3
0 0 0 aN 3 bN 2 aN 2
0 0 0 0 aN 2 bN 1
where for each n, an and bn are arbitrary complex numbers
such that an is different from zero:
an , bn C, an 6= 0.
(8)
If the entries of the matrix J are real, then the eigenvalues
of J are real and simple. However, if the matrix J is
complex, then its eigenvalues may be nonreal and multiple.
Let R() = (J I)1 be the resolvent of the matrix J
(by I we denote the identity matrix of needed dimension)
and e0 be the N -dimensional vector with the components
1, 0, . . . , 0. The rational function
w() = ((R()e0 , e0 ) = (I J)1 e0 , e0
(9)
we call the resolvent function of the matrix J.
Denote by 1 , . . . , p all the distinct eigenvalues of the matrix J and by m1 , . . . , mp their multiplicities, respectively,
as the roots of the characteristic polynomial det(J I), so
that 1 p N and m1 +. . .+mp = N. We can decompose
the rational function w() into partial fractions to get
p X
mk
X
kj
w() =
,
(10)
(
k )j
j=1
k=1
Q1 () = 1, Q0 () = 0.
(14)
For each n 0, Pn () is a polynomial of degree n and is
called a polynomial of first kind and Qn () is a polynomial
of degree n 1 and is known as a polynomial of second
kind. The equality
det (J I) = (1)N a0 a1 aN 2 PN ()
(15)
holds so that the eigenvalues of the matrix J coincide with
the zeros of the polynomial PN ().
In [16] it is shown that the entries Rnm () of the matrix
R() = (J I)1 (resolvent of J) are of the form
Pn ()[Qm () + M ()Pm ()], n m,
Rnm () =
Pm ()[Qn () + M ()Pn ()], m n,
where n, m {0, 1, . . . , N 1} and
QN ()
M () =
.
PN ()
Therefore according to (9) and using initial conditions
(13), (14), we get
QN ()
.
(16)
w() = R00 () = M () =
PN ()
Denote by 1 , . . . , p all the distinct roots of the polynomial PN () (which coincide by (15) with the eigenvalues
of the matrix J) and by m1 , . . . , mp their multiplicities,
respectively:
PN () = c( 1 )m1 ( p )mp ,
where c is a constant. We have 1 p N and m1 + . . . +
mp = N. Therefore by (16) decomposition (10) can be
obtained by rewriting the rational function QN ()/PN ()
as the sum of partial fractions.
We can also get another convenient representation for the
resolvent function as follows. If we delete the first row and
the first column of the matrix J given in (7), then we get
the new matrix
(1) (1)
b0 a0
0 0
0
0
(1)
(1)
0 a1 b2 0
0
0
.
..
.. . .
..
..
..
J (1) = ..
,
.
.
.
.
.
.
(1)
(1)
0
0
0 . . . bN 4 aN 4 0
(1)
(1)
(1)
0
0 aN 4 bN 3 aN 3
0
(1)
(1)
0
0
0 0 aN 3 bN 2
where
a(1)
n {0, 1, . . . , N 3},
n = an+1 ,
b(1)
n {0, 1, . . . , N 2}.
n = bn+1 ,
(1)
The matrix J
is called the first truncated matrix (with
respect to the matrix J).
Theorem 2. The equality
det(J (1) I)
w() =
det(J I)
holds.
Proof. Let us denote the polynomials of the first and the
(1)
second kinds, corresponding to the matrix J (1) , by Pn ()
(1)
and Qn (), respectively. It is easily seen that
Pn(1) () = a0 Qn+1 (),
(17)
1
{( b0 )Qn+1 () Pn+1 ()},
a0
n {0, 1, . . . , N 1}.
Indeed, both sides of each of these equalities are solutions
of the same difference equation
Q(1)
n () =
(1)
(1)
an1 yn1 + b(1)
n yn + an yn+1 = yn ,
(1)
n {0, 1, . . . , N 2}, aN 2 = 1,
and the sides coincide for n = 1 and n = 0. Therefore the
equalities hold by the uniqueness theorem for solutions.
Consequently, taking into account (15) for the matrix J (1)
instead of J and using (17), we find
det(J (1) I)
(1) (1)
(1)
(1)
= (1)N 1 a0 a1 aN 3 PN 1 ()
= (1)N 1 a1 aN 2 a0 QN ().
Comparing this with (15), we get
det(J (1) I)
QN ()
=
PN ()
det(J I)
so that the statement of the theorem follows by (16).
The inverse problem is stated as follows:
(i) To see if it is possible to reconstruct the matrix J,
given its spectral data (11). If it is possible, to describe
the reconstruction procedure.
(ii) To find the necessary and sufficient conditions for a
given collection (11) to be spectral data for some matrix
J of the form (7) with entries belonging to the class (8).
This problem was solved recently by the author in [16] and
the following results were established.
Given the collection (11) define the numbers
p X
mk
X
l
sl =
kj lj+1
,
(18)
k
j
1
k=1 j=1
l
l
where j1
is a binomial coefficient and we put j1
=0
if j 1 > l. Using the numbers sl let us introduce the
determinants
s0 s1 sn
s1 s2 sn+1
Dn = ..
(19)
.. . .
. , n = 0, 1, . . . , N.
. ..
.
.
s s
s
n
n+1
2n
(20)
1
bn = n Dn1 n1 Dn1
,
(21)
n {0, 1, . . . , N 1}, 1 = 0, 0 = s1 ,
where Dn is defined by (19) and (18), and n is the determinant obtained from the determinant Dn by replacing in
Dn the last column by the column with the components
sn+1 , sn+2 , . . . , s2n+1 .
Remark 4. It follows from the above solution of the inverse
problem that the matrix (7) is not uniquely restored from
the spectral data. This is linked with the fact that the
an are determined from (20) uniquely up to a sign. To
ensure that the inverse problem is uniquely solvable, we
have to specify additionally a sequence of signs + and .
Namely, let {1 , 2 , . . . , N 1 } be a given finite sequence,
where for each n {1, 2, . . . , N 1} the n is + or .
We have 2N 1 such different sequences. Now to determine
an uniquely from (20) for n {0, 1, . . . , N 2} we can
choose the sign n when extracting the square root. In
this way we get precisely 2N 1 distinct Jacobi matrices
possessing the same spectral data. The inverse problem is
solved uniquely from the data consisting of the spectral
data and a sequence {1 , 2 , . . . , N 1 } of signs + and .
X(t)
= A(t)X(t),
(23)
X(0) = I.
(24)
Such solution X(t) exists and is unique. From the Liouville
formula
Z t
det X(t) = exp
trA( )d
0
S(t) 0
where
Z
1
S(t) =
w(z; 0)e2zt dz
(26)
2i
in which is any closed contour that encloses all the
eigenvalues of the matrix J(0).
w(; t) =
p
X
e2k t
k=1
mk
X
kj (0)
j=1
(2t)j1
.
(j 1)!
(28)
(29)
k=1
Further,
1
2i
e2zt
1
dz =
(z k )j
2i
Z
k
e2zt
dz
(z k )j
(2t)j1 2k t
e
.
(j 1)!
Therefore for S(t) we have the formula (28).
=
k
e2t X X
kj (0)
kj (t)
=
( k )j
S(t)
(
k )j
k=1 j=1
Z t
2
l)
l
Z
ml
1 1 X
e2t d
.
=
lj (0)
js+1
2i S(t) j=1
l ( l )
We have used the fact that the integral of the second term
of the right side of (30) gave zero because of the analyticity
of that term with respect to . Hence
ml
e2l t X
(2t)js
ls (t) =
lj (0)
(31)
S(t) j=s
(j s)!
because
d
1 if j = s,
=
js+1
0 if j 6= s,
l ( l )
Z
0
if j < s,
1
e2t d
js
(2t)
=
2
t
l
e
if j s.
2i l ( l )js+1
(j s)!
Now, (31) means that (27) holds.
1
2i
(34)
with respect to a0 , b0 , and b1 . Let us take initial conditions
in the form
a0 (0) = ic, b0 (0) = 0 + c, b1 (0) = 0 c,
0
c
ic
0 + 1 + 2ct
1 + 2ct
J(t) =
.
c
ic
0
1 + 2ct
1 + 2ct
Hence the desired solution is
ic
c
a0 (t) =
, b0 (t) = 0 +
,
1 + 2ct
1 + 2ct
c
b1 (t) = 0
.
1 + 2ct
2. Now we take for system (34) initial conditions in the
form
p
a0 (0) = c(1 c), b0 (0) = 1 c, b1 (0) = c,
where c is an arbitrary complex number such that c 6= 0
and c 6= 1. We have
p
1
c
c(1 c)
J(0) = p
.
c(1 c)
c
Hence
det(J(0) I) = ( 1),
w(; 0) =
c
1c
= +
.
1
Therefore = 0 and = 1 are the eigenvalues of J(0) and
the spectral data of J(0) is the collection
{1 = 0, 2 = 1, 11 (0) = c, 21 (0) = 1 c}.
By (27), (28) we find
(1 c)e2t
c
, 21 (t) =
2t
c + (1 c)e
c + (1 c)e2t
Solving the inverse spectral problem we get that the
desired solution is
p
et c(1 c)
(1 c)e2t
a0 (t) =
,
b
(t)
=
,
0
c + (1 c)e2t
c + (1 c)e2t
c
b1 (t) =
.
c + (1 c)e2t
11 (t) =
REFERENCES
[1] M. Toda, Waves in nonlinear lattice, Progr. Theoret.
Phys Suppl. 45 (1970) 174200.
[2] M. Henon, Integrals of the Toda lattice, Phys. Rev. B
9 (1974) 19211923.
[3] H. Flaschka, The Toda lattice, I, Phys. Rev. B 9 (1974)
19241925.
[4] Flaschka H. The Toda lattice, II, Progr. Theoret. Phys.
1974;51:703716.
[5] S. V. Manakov, Complete integrability and stochastization in discrete dynamic media, Zh. Exper. Teor. Fiz.
67 (1974) 543555. English translation in Soviet PhysicsJETP 40 (1975) 269274.
[6] M. Kac and P. van Moerbeke, On an explicitly soluble
system of nonlinear differential equations related to certain
Toda lattices, Adv. Math. 16 (1975) 160169.
[7] J. Moser, Three integrable Hamiltonian systems connected with isospectral deformations, Adv. Math. 16
(1975) 197220.
[8] M. Toda, Theory of nonlinear lattices, Springer, New
York, 1981.
[9] Yu. M. Berezanskii, The integration of semi-infinite
Toda chain by means of inverse spectral problem, Rep.
Math. Phys. 24 (1986) 2147.
[10] G. Teschl, Jacobi operators and completely integrable
nonlinear lattices, Math surveys monographs, vol. 72.
Amer Math Soc Providence (RI); 2000.
[11] A. I. Aptekarev and A. Branquinbo, Pade approximants and complex high order Toda lattices, J. Comput.
Appl. Math. 155 (2003) 231237.
[12] Yu. M. Berezanskii and A. A. Mokhonko, Integration
of some differential-difference nonlinear equations using
the spectral theory of normal block Jacobi matrices, Functional Anal. Appl. 42 (2008) 118.
[13] A. Huseynov, On solutions of a nonlinear boundary
value problem for difference equations, Transactions Natl.
Acad. Sci. Azerb. Ser. Phys-Tech. Math. Sci. 28(4) (2008)
4350.
[14] H. Bereketoglu and A. Huseynov, Boundary value
problems for nonlinear second-order difference equations
with impulse, Appl. Math. Mech. (English Ed.) 30 (2009)
10451054.
[15] A. Huseynov, Positive solutions for nonlinear secondorder differernce equations with impulse, Dynamics of
Continuous, Discrete and Impulsive Systems, Series A:
Mathematical Analysis 17 (2010) 115132.
[16] G. Sh. Guseinov, Inverse spectral problems for tridiagonal N by N complex Hamiltonians, Symmetry, Integrability and Geometry: Methods and Applications (SIGMA),
5 (2009), Paper 018, 28 pages.