HOME

TheInfoList



OR:

The factorization of a linear partial differential operator (LPDO) is an important issue in the theory of integrability, due to the Laplace-Darboux transformations, which allow construction of integrable LPDEs.
Laplace Pierre-Simon, marquis de Laplace (; ; 23 March 1749 – 5 March 1827) was a French scholar and polymath whose work was important to the development of engineering, mathematics, statistics, physics, astronomy, and philosophy. He summariz ...
solved the factorization problem for a bivariate hyperbolic operator of the second order (see
Hyperbolic partial differential equation In mathematics, a hyperbolic partial differential equation of order n is a partial differential equation (PDE) that, roughly speaking, has a well-posed initial value problem for the first n-1 derivatives. More precisely, the Cauchy problem can ...
), constructing two Laplace invariants. Each
Laplace invariant In differential equations, the Laplace invariant of any of certain differential operators is a certain function of the coefficients and their derivatives. Consider a bivariate hyperbolic differential operator of the second order :\partial_x \, \p ...
is an explicit polynomial condition of factorization; coefficients of this polynomial are explicit functions of the coefficients of the initial LPDO. The polynomial conditions of factorization are called invariants because they have the same form for equivalent (i.e. self-adjoint) operators. Beals-Kartashova-factorization (also called BK-factorization) is a constructive procedure to factorize a bivariate operator of the arbitrary order and arbitrary form. Correspondingly, the factorization conditions in this case also have polynomial form, are invariants and coincide with Laplace invariants for bivariate hyperbolic operators of the second order. The factorization procedure is purely algebraic, the number of possible factorizations depending on the number of simple roots of the
Characteristic polynomial In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The ...
(also called symbol) of the initial LPDO and reduced LPDOs appearing at each factorization step. Below the factorization procedure is described for a bivariate operator of arbitrary form, of order 2 and 3. Explicit factorization formulas for an operator of the order n can be found in General invariants are defined in and invariant formulation of the Beals-Kartashova factorization is given in E. Kartashova, O. Rudenko. Invariant Form of BK-factorization and its Applications. Proc. GIFT-2006, pp.225-241, Eds.: J. Calmet, R. W. Tucker, Karlsruhe University Press (2006)
arXiv
/ref>


Beals-Kartashova Factorization


Operator of order 2

Consider an operator : \mathcal_2 = a_\partial_x^2 + a_\partial_x\partial_y + a_\partial_y^2+a_\partial_x+a_\partial_y+a_. with smooth coefficients and look for a factorization : \mathcal_2=(p_1\partial_x+p_2\partial_y+p_3)(p_4\partial_x+p_5\partial_y+p_6). Let us write down the equations on p_i explicitly, keeping in mind the rule of left composition, i.e. that : \partial_x (\alpha \partial_y) = \partial_x (\alpha) \partial_y + \alpha \partial_. Then in all cases : a_ = p_1p_4, : a_ = p_2p_4+p_1p_5, : a_ = p_2p_5, : a_ = \mathcal(p_4) + p_3p_4+p_1p_6, : a_ = \mathcal(p_5) + p_3p_5+p_2p_6, : a_ = \mathcal(p_6) + p_3p_6, where the notation \mathcal = p_1 \partial_x + p_2 \partial_y is used. Without loss of generality, a_\ne 0, i.e. p_1\ne 0, and it can be taken as 1, p_1 = 1. Now solution of the system of 6 equations on the variables : p_2, ... p_6 can be found in three steps. At the first step, the roots of a ''quadratic polynomial'' have to be found. At the second step, a linear system of ''two algebraic equations'' has to be solved. At the third step, ''one algebraic condition'' has to be checked. Step 1. Variables : p_2, p_4, p_5 can be found from the first three equations, : a_ = p_1p_4, : a_ = p_2p_4+p_1p_5, : a_ = p_2p_5. The (possible) solutions are then the functions of the roots of a quadratic polynomial: : \mathcal_2(-p_2) = a_(- p_2)^2 +a_(- p_2) +a_ = 0 Let \omega be a root of the polynomial \mathcal_2, then : p_1=1, : p_2=-\omega, : p_4=a_, : p_5=a_ \omega +a_, Step 2. Substitution of the results obtained at the first step, into the next two equations : a_ = \mathcal(p_4) + p_3p_4+p_1p_6, : a_ = \mathcal(p_5) + p_3p_5+p_2p_6, yields linear system of two algebraic equations: : a_ = \mathcal a_ +p_3 a_ +p_6, : a_ = \mathcal(a_+a_ \omega)+p_3( a_ + a_\omega)- \omega p_6., In particularly, if the root \omega is simple, i.e. : \mathcal_2'(\omega)=2a_\omega+a_\ne 0, then these equations have the unique solution: : p_3 = \frac , : p_6 =\frac. At this step, for each root of the polynomial \mathcal_2 a corresponding set of coefficients p_j is computed. Step 3. Check factorization condition (which is the last of the initial 6 equations) : a_ = \mathcal(p_6)+p_3p_6, written in the known variables p_j and \omega ): : a_ = \mathcal \left\+ \frac \times \frac If : l_2= a_ - \mathcal \left\+ \frac \times \frac =0, the operator \mathcal_2 is factorizable and explicit form for the factorization coefficients p_j is given above.


Operator of order 3

Consider an operator : \mathcal_3=\sum_a_\partial_x^j\partial_y^k =a_\partial_x^3 + a_\partial_x^2 \partial_y + a_\partial_x \partial_y^2 +a_\partial_y^3 + a_\partial_x^2+a_\partial_x\partial_y+a_\partial_y^2+a_\partial_x+a_\partial_y+a_. with smooth coefficients and look for a factorization : \mathcal_3=(p_1\partial_x+p_2\partial_y+p_3)(p_4 \partial_x^2 +p_5 \partial_x\partial_y + p_6 \partial_y^2 + p_7 \partial_x + p_8 \partial_y + p_9). Similar to the case of the operator \mathcal_2, the conditions of factorization are described by the following system: : a_ = p_1p_4, : a_ = p_2p_4+p_1p_5, : a_ = p_2p_5+p_1p_6, : a_ = p_2p_6, : a_ = \mathcal(p_4)+p_3p_4+p_1p_7, : a_ = \mathcal(p_5)+p_3p_5+p_2p_7+p_1p_8, : a_ = \mathcal(p_6)+p_3p_6+p_2p_8, : a_ = \mathcal(p_7)+p_3p_7+p_1p_9, : a_ = \mathcal(p_8)+p_3p_8+p_2p_9, : a_ = \mathcal(p_9)+p_3p_9, with \mathcal = p_1 \partial_x + p_2 \partial_y, and again a_\ne 0, i.e. p_1=1, and three-step procedure yields: At the first step, the roots of a ''cubic polynomial'' : \mathcal_3(-p_2):= a_(-p_2)^3 +a_(- p_2)^2 + a_(-p_2)+a_=0. have to be found. Again \omega denotes a root and first four coefficients are : p_1=1, :p_2=-\omega, :p_4=a_, :p_5=a_ \omega+a_, :p_6=a_\omega^2+a_\omega+a_. At the second step, a linear system of ''three algebraic equations'' has to be solved: : a_-\mathcal a_ = p_3 a_ +p_7, : a_-\mathcal(a_ \omega + a_) = p_3(a_\omega+a_)- \omega p_7+p_8, : a_-\mathcal(a_\omega^2+a_\omega+a_)= p_3 (a_\omega^2+a_\omega+a_)-\omega p_8. At the third step, ''two algebraic conditions'' have to be checked.


Operator of order n


Invariant Formulation

Definition The operators \mathcal , \tilde are called equivalent if there is a gauge transformation that takes one to the other: : \tilde g= e^\mathcal (e^g). BK-factorization is then pure algebraic procedure which allows to construct explicitly a factorization of an arbitrary order LPDO \tilde in the form : \mathcal=\sum_a_\partial_x^j\partial_y^k=\mathcal\circ \sum_p_\partial_x^j\partial_y^k with first-order operator \mathcal=\partial_x-\omega\partial_y+p where \omega is an arbitrary simple root of the characteristic polynomial : \mathcal(t)=\sum^n_a_t^, \quad \mathcal(\omega)=0. Factorization is possible then for each simple root \tilde iff for n=2 \ \ \rightarrow l_2=0, for n=3 \ \ \rightarrow l_3=0, l_=0, for n=4 \ \ \rightarrow l_4=0, l_=0, l_=0, and so on. All functions l_2, l_3, l_, l_4, l_, \ \ l_, ... are known functions, for instance, : l_2= a_ - \mathcal(p_6)+p_3p_6, : l_3= a_ - \mathcal(p_9)+p_3p_9, : l_ = a_ - \mathcal(p_8)+p_3p_8+p_2p_9, and so on. Theorem All functions :l_2= a_ - \mathcal(p_6)+p_3p_6, l_3= a_ - \mathcal(p_9)+p_3p_9, l_, .... are invariants under gauge transformations. Definition Invariants l_2= a_ - \mathcal(p_6)+p_3p_6, l_3= a_ - \mathcal(p_9)+p_3p_9, l_, .... . are called generalized invariants of a bivariate operator of arbitrary order. In particular case of the bivariate hyperbolic operator its generalized invariants coincide with Laplace invariants (see
Laplace invariant In differential equations, the Laplace invariant of any of certain differential operators is a certain function of the coefficients and their derivatives. Consider a bivariate hyperbolic differential operator of the second order :\partial_x \, \p ...
). Corollary If an operator \tilde is factorizable, then all operators equivalent to it, are also factorizable. Equivalent operators are easy to compute: : e^ \partial_x e^= \partial_x+\varphi_x, \quad e^\partial_y e^= \partial_y+\varphi_y, : e^ \partial_x \partial_y e^= e^ \partial_x e^ e^ \partial_y e^=(\partial_x+\varphi_x) \circ (\partial_y+\varphi_y) and so on. Some example are given below: : A_1=\partial_x \partial_y + x\partial_x + 1= \partial_x(\partial_y+x), \quad l_2(A_1)=1-1-0=0; :A_2=\partial_x \partial_y + x\partial_x + \partial_y +x + 1, \quad A_2=e^A_1e^;\quad l_2(A_2)=(x+1)-1-x=0; :A_3=\partial_x \partial_y + 2x\partial_x + (y+1)\partial_y +2(xy +x+1), \quad A_3=e^A_2e^; \quad l_2(A_3)=2(x+1+xy)-2-2x(y+1)=0; :A_4=\partial_x \partial_y +x\partial_x + (\cos x +1) \partial_y + x \cos x +x +1, \quad A_4=e^A_2e^; \quad l_2(A_4)=0.


Transpose

Factorization of an operator is the first step on the way of solving corresponding equation. But for solution we need right factors and BK-factorization constructs left factors which are easy to construct. On the other hand, the existence of a certain right factor of a LPDO is equivalent to the existence of a corresponding left factor of the transpose of that operator. Definition The transpose \mathcal^t of an operator \mathcal=\sum a_\partial^,\qquad \partial^=\partial_1^\cdots\partial_n^. is defined as \mathcal^t u = \sum (-1)^\partial^\alpha(a_\alpha u). and the identity \partial^\gamma(uv)=\sum \binom\gamma\alpha \partial^\alpha u,\partial^v implies that \mathcal^t=\sum (-1)^\binom\alpha (\partial^\beta a_)\partial^\alpha. Now the coefficients are \mathcal^t=\sum \tilde_ \partial^, \tilde_=\sum (-1)^ \binom\partial^\beta(a_). with a standard convention for binomial coefficients in several variables (see
Binomial coefficient In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the t ...
), e.g. in two variables : \binom\alpha\beta=\binom=\binom\,\binom. In particular, for the operator \mathcal_2 the coefficients are \tilde_=a_,\quad j+k=2; \tilde_=-a_+2\partial_x a_+\partial_y a_, \tilde_=-a_+\partial_x a_+2\partial_y a_, : \tilde_=a_-\partial_x a_-\partial_y a_+\partial_x^2 a_+\partial_x \partial_x a_+\partial_y^2 a_. For instance, the operator : \partial_-\partial_+y\partial_x+x\partial_y+\frac(y^2-x^2)-1 is factorizable as : \big partial_x+\partial_y+\tfrac12(y-x)\big,\big ..\big/math> and its transpose \mathcal{A}_1^t is factorizable then as \big ..\big,\big partial_x-\partial_y+\tfrac12(y+x)\big


See also

*
Partial derivative In mathematics, a partial derivative of a function of several variables is its derivative with respect to one of those variables, with the others held constant (as opposed to the total derivative, in which all variables are allowed to vary). Pa ...
*
Invariant (mathematics) In mathematics, an invariant is a property of a mathematical object (or a class of mathematical objects) which remains unchanged after operations or transformations of a certain type are applied to the objects. The particular class of object ...
*
Invariant theory Invariant theory is a branch of abstract algebra dealing with actions of groups on algebraic varieties, such as vector spaces, from the point of view of their effect on functions. Classically, the theory dealt with the question of explicit descri ...
*
Characteristic polynomial In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The ...


Notes


References

* J. Weiss. Bäcklund transformation and the Painlevé property

J. Math. Phys. 27, 1293-1305 (1986). * R. Beals, E. Kartashova. Constructively factoring linear partial differential operators in two variables
Theor. Math. Phys. 145(2), pp. 1510-1523 (2005)
* E. Kartashova. A Hierarchy of Generalized Invariants for Linear Partial Differential Operators
Theor. Math. Phys. 147(3), pp. 839-846 (2006)
* E. Kartashova, O. Rudenko. Invariant Form of BK-factorization and its Applications. Proc. GIFT-2006, pp.225-241, Eds.: J. Calmet, R. W. Tucker, Karlsruhe University Press (2006)
arXiv
Multivariable calculus Differential operators Partial differential equations