40 Exact Solutions and Invariant Subspaces
Proposition 1.47
Subspace
(1.123)
is invariant under the operator
(1.111)
iff
P( p
m
, p
l
) = 0
for all pairs
( p
m
, p
l
)
such that
p
m
+ p
l
∈
. (1.124)
Proof. Taking arbitrary
u =
(i)
C
i
e
p
i
x
∈ W
n
(1.125)
and plugging into (1.111) yields
F[u] =
(i, j )
(m,l)
a
i, j
p
i
m
p
j
l
C
m
C
l
e
(p
m
+p
l
)x
≡
(m,l)
P( p
m
, p
l
)C
m
C
l
e
(p
m
+p
l
)x
.
(1.126)
Since {C
i
} are independent, it follows from (1.126) that the coefficients of e
(p
m
+p
l
)x
must vanish for any p
m
+ p
l
∈
.
Dealing with invariant subspaces, in this proof, we do not take into account a pos-
sible correlation of similar terms in (1.126) that can give rise to cancellation of some
of the terms. Actually, for arbitrary values of expansion coefficients {C
i
} involved,
this is not possible. Assuming existence of some algebraic relations between expan-
sion coefficients {C
i
}, meaning partial invariance of W
n
, this topic will be under
scrutiny in Section 7.1. Evidently, the linear system (1.124) on coefficients {a
i, j
}
means existence of an infinite number of quadratic (non-integrable)PDEs with solu-
tions on exponential subspaces W
n
of arbitrary finite dimension n (e.g., soliton-type
solutions).
Corollary 1.48 Given an arbitrarily large integer l > 1, there exists a polynomial
operator (1.111) of the order k large enough, admitting at least l exponential invari-
ant subspaces W
n
, (1.123), of any dimension n = 1, 2, ..., l.
The corresponding first-order evolution PDEs
u
t
= F[u] ≡
(i, j )
a
i, j
D
i
x
uD
j
x
u on W
n
(1.127)
are n-dimensional DSs. The second-order PDEs, u
tt
= F[u]onW
n
,are2nth-order
DSs. Such classes of PDEs can be treated as intermediate relative to known inte-
grable equations admitting infinitely many (partially) invariant subspaces.
Let us return to systems (1.124). The general operator (1.111) contains
(k+1)(k+2)
2
free coefficients {a
i, j
}. So the system (1.124) cannot have more than
(k+1)(k+2)
2
− 1
linearly independent equations to generate such nontrivial operators. The total num-
berofelementsin
(its cardinal number) satisfies !
≤
(k+1)(k+2)
2
− 1. In an
example below, we illustrate solvability of such systems in a particular setting.
Example 1.49 (Operators with monomials of the same total order) Consider op-
erators (1.86) that contain
k
2
+ 1 unknown coefficients {a
i, j
}. Without loss of gen-
erality, we assume that k is even and !
= s =
k
2
. By ( p
l
1
, p
m
1
), ..., ( p
l
s
, p
m
s
),
we denote the pairs of exponents such that p
l
j
+ p
m
j
∈
for all j = 1, ..., s.The
system (1.124) is then composed of precisely s equations,
a
0,k
1
2
p
k
l
j
+ p
k
m
j
+ a
1,k−1
1
2
p
k−1
l
j
p
m
j
+ p
l
j
p
k−1
m
j
+ ...
+a
k
2
,
k
2
p
k
2
l
j
p
k
2
m
j
= 0forj = 1, ..., s.
(1.128)
© 2007 by Taylor & Francis Group, LLC