 DifferentialThomas/Ranking - Maple Help

DifferentialThomas

 Ranking
 constructs a ranking for the dependent and independent variables used by all the DifferentialThomas commands Calling Sequence Ranking ([...], [...]) Parameters

 [...] - the first list is a list of independent variables - it can be a plain list, say as in [x, y, z], or has sublists in say [[[x], [y]], in which case it implies on an elimination ranking with respect to the independent variables [...] - the second list is a list of dependent variables - as in the case of the first list, it can also be a plain list, say as in [f, g, h], or has sublists in say [[[f, g], [h]], in which case it implies on an elimination ranking with respect to the dependent variables NOTE - The concept of ranking in DifferentialThomas is the same one explained in the help page of PDEtools:-casesplit (see Optional arguments) Description

 • The function call Ranking ([...], [...]) constructs and ranking for the dependent and independent variables. The concept of ranking in DifferentialThomas is the same one explained in the help page of PDEtools:-casesplit (see Optional arguments)
 • Each dependent variable indicated in the second list can be entered as a function's name, say $f$, or with its dependency explicit, say, as $f\left(x,y\right)$, and can depend on all or just some of the independent variables specified in the first list (the independent variables), even on none of them, in which case if you enter it as a function use $f\left(\right)$.
 • Passing the dependent variables to Ranking in function notation is relevant only when some of the dependent variables do not depend on all the independent variables specified in the first list of independent variables.
 • Besides setting the ranking used by all the DifferentialThomas commands, the output of Ranking is a copy of the ranking set. This is useful, for instance, to use this returned ranking as an extra argument to most of the DifferentialThomas commands, so that they compute with any particular desired ranking, regardless of what is the last ranking set with Ranking. For example by calling Ranking several times with different rankings and assigning the outputs, then calling ThomasDecomposition with each of these rankings to compare results. NOTE: nonlinear problems are rather sensitive to the ranking, sometimes changing the ranking transform a problem that seems unsolvable in practice into one that is fully solvable, and there is no conclusive way to determine in advance which ranking better serves the purpose of decoupling the nonlinear system. Rankings

 • Together, the lists of independent and dependent variables provide the ranking of R, that is, an ordering for the derivatives of the dependent variables with respect to the independent variables. In brief, the elements in the second list (dependent variables or sublists of them) are ranked between each other using an elimination raking and those within a sublist are ranked used an orderly ranking.
 • An elimination ranking is one where derivatives of leftmost dependent variables, or of all the dependent variables in a leftmost sublist within blocks, rank higher than derivatives of variables to their right. An orderly ranking is one where derivatives of higher differential order rank higher than derivatives of lower differential order, and if the order is the same, then derivatives of leftmost variables rank higher. Hence for example if the ranking passed consists of these two lists, [x,t], [u, [v, w]]
 > $\mathrm{ring}≔\mathrm{DifferentialThomas}:-\mathrm{Ranking}\left(\left[x,t\right],\left[u,\left[v,w\right]\right]\right):$
 the list of second and first order derivatives rank according to $\left[{u}_{x,x},{u}_{x,t},{u}_{t,t},{u}_{x},{u}_{t},{v}_{x,x},{v}_{x,t},{v}_{t,t},{w}_{x,x},{w}_{x,t},{w}_{t,t},{v}_{x},{v}_{t},{w}_{x},{w}_{t}\right]$ (see also DifferentialAlgebra:-Tools:-SortByRank)
 • When a system of differential polynomials is handled by DifferentialThomas commands, rankings are typically used to decide which functions and derivatives are expressed in terms of which other ones. When the system is nonlinear and handled by ThomasDecomposition, taking into account the ranking will also frequently result in a splitting of the system into cases (simple differential systems), that then naturally depend on the ordering of variables within the ranking. Typical useful rankings

 • When simplifying a DE system with respect to its integrability conditions one obtains a kind of normal form for the system, expressed with the lowest possible differential order, and automatically detects if the system is inconsistent (has no solution). For this purpose use an orderly ranking, for instance indicating the list of dependent variables as [[u, v, w]].
 • When solving a coupled ODE system, to perform a chain resolution one needs the system in triangularized form, that is, containing one subsystem that involves only one variable, say $w$, that subsystem is part of a larger subsystem that involves two variables, say $v$ and $w$, and in turn that is part of the whole system that involves the three variables $u$, $v$ and $w$. To accomplish this triangularized form equivalent to having decoupled the system use an elimination ranking passing the list of dependent variables as [u, v, w].
 • When studying a coupled ordinary differential equation (ODE) system, to express the differential equations for one variable, say, $u$, in terms of the other variables, say $v$ and $w$, use a mixed ranking passing [u, [v, w]].
 • When solving a coupled partial differential equation (PDE) system, it is interesting to compute first the ODEs satisfied by the solutions of the system. For this purpose use a lexicographic ranking by enclosing the independent variables within lists to form an elimination ranking with respect to the independent variables, for example as in [[x], [y], [z]] or [[x, y], z].
 • For further information on rankings see the Optional arguments section of PDEtools:-casesplit and the Rankings section of the DifferentialAlgebra Glossary.
 • This command is part of the DifferentialThomas package. It can be called using the form Ranking(...) after executing the command with(DifferentialThomas). It can also be directly called using the form DifferentialThomas[Ranking](...). Examples

 > $\mathrm{with}\left(\mathrm{DifferentialThomas}\right)$
 $\left[{\mathrm{ComplementOfDecomposition}}{,}{\mathrm{Equations}}{,}{\mathrm{Inequations}}{,}{\mathrm{IntersectDecompositions}}{,}{\mathrm{LinearCombination}}{,}{\mathrm{NormalForm}}{,}{\mathrm{PowerSeriesSolution}}{,}{\mathrm{Ranking}}{,}{\mathrm{ReducedForm}}{,}{\mathrm{ThomasDecomposition}}{,}{\mathrm{Tools}}\right]$ (1)

Prior to any computations with the DifferentialThomas package, the appropriate differential indeterminates (dependent variables) and derivation variables (independent variables) with the ranking for them must be defined with the command Ranking as shown in the following examples. Detection of inconsistencies in a differential system: orderly rankings

 Consider the 3 following equations.
 > $\mathrm{p1}≔\mathrm{diff}\left(u\left(x,y\right),x\right)+v\left(x,y\right)-y$
 ${\mathrm{p1}}{≔}\frac{{\partial }}{{\partial }{x}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{u}{}\left({x}{,}{y}\right){+}{v}{}\left({x}{,}{y}\right){-}{y}$ (2)
 > $\mathrm{p2}≔\mathrm{diff}\left(u\left(x,y\right),y\right)+v\left(x,y\right)$
 ${\mathrm{p2}}{≔}\frac{{\partial }}{{\partial }{y}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{u}{}\left({x}{,}{y}\right){+}{v}{}\left({x}{,}{y}\right)$ (3)
 > $\mathrm{p3}≔\mathrm{diff}\left(v\left(x,y\right),x\right)-\mathrm{diff}\left(v\left(x,y\right),y\right)$
 ${\mathrm{p3}}{≔}\frac{{\partial }}{{\partial }{x}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{v}{}\left({x}{,}{y}\right){-}\frac{{\partial }}{{\partial }{y}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{v}{}\left({x}{,}{y}\right)$ (4)
 Before any manipulation of these equations, indicate the dependent and independent variables, and an ordering (ranking) for them variables all inside a list within a list, as in $\left[\left[u,v\right]\right]$
 > $R≔\mathrm{Ranking}\left(\left[x,y\right],\left[\left[u,v\right]\right]\right)$
 ${R}{≔}{\mathrm{ranking}}$ (5)
 Call now the ThomasDecomposition to simplify the system taking into account all the integrability conditions implied in it (note you can pass the ranking R as a second argument, or omit it completely in which case the last ranking computed using Ranking will be used)
 > $\mathrm{ThomasDecomposition}\left(\left[\mathrm{p1},\mathrm{p2},\mathrm{p3}\right]\right)$
 $\left[\right]$ (6)
 This result indicates that the system bears a contradiction; $\mathrm{p1}$, $\mathrm{p2}$, and $\mathrm{p3}$ have no common solution, the system is inconsistent; see details in the Examples section of ThomasDecomposition. Solving ordinary differential systems: elimination ranking

 To perform a chain resolution of a system of ordinary differential equations, use an elimination ranking. Consider the differential system defined by the following set $S$ of differential polynomials in the unknown functions $x\left(t\right),y\left(t\right),z\left(t\right)$.
 > $S≔\left[\mathrm{diff}\left(x\left(t\right),t\right)-x\left(t\right)\left(x\left(t\right)+y\left(t\right)\right),\mathrm{diff}\left(y\left(t\right),t\right)+y\left(t\right)\left(x\left(t\right)+y\left(t\right)\right),{\mathrm{diff}\left(x\left(t\right),t\right)}^{2}+{\mathrm{diff}\left(y\left(t\right),t\right)}^{2}+{\mathrm{diff}\left(z\left(t\right),t\right)}^{2}-1\right]$
 ${S}{≔}\left[\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right){-}{x}{}\left({t}\right){}\left({x}{}\left({t}\right){+}{y}{}\left({t}\right)\right){,}\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{y}{}\left({t}\right){+}{y}{}\left({t}\right){}\left({x}{}\left({t}\right){+}{y}{}\left({t}\right)\right){,}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right)\right)}^{{2}}{+}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{y}{}\left({t}\right)\right)}^{{2}}{+}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{z}{}\left({t}\right)\right)}^{{2}}{-}{1}\right]$ (7)
 Using an elimination ranking where $z\left(t\right)>y\left(t\right)>x\left(t\right)$, you rewrite the system in such a way that there is one equation in $x\left(t\right)$ alone, an equation determining $y\left(t\right)$ in terms of $x\left(t\right)$, and finally an equation determining $z\left(t\right)$ in terms of $y\left(t\right)$ and $x\left(t\right)$. To achieve this elimination use an elimination ranking, that is one where all the dependent variables are enclosed in a list in equal footing, and first the variables that you want to be expressed in terms of the next ones, so as in $\left[z,y,x\right]$.
 > $R≔\mathrm{Ranking}\left(\left[t\right],\left[z,y,x\right]\right):$
 > $G≔\mathrm{ThomasDecomposition}\left(S,R\right)$
 ${G}{≔}\left[{\mathrm{DifferentialSystem}}{,}{\mathrm{DifferentialSystem}}{,}{\mathrm{DifferentialSystem}}\right]$ (8)
 In the result above we see three cases. The equations of the three cases satisfying this elimination ranking mentioned are
 > $\mathrm{Equations}\left(G\left[1\right]\right)$
 $\left[{2}{}{{x}{}\left({t}\right)}^{{4}}{}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right)\right)}^{{2}}{+}{{x}{}\left({t}\right)}^{{4}}{}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{z}{}\left({t}\right)\right)}^{{2}}{-}{2}{}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right)\right)}^{{3}}{}{{x}{}\left({t}\right)}^{{2}}{-}{{x}{}\left({t}\right)}^{{4}}{+}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right)\right)}^{{4}}{,}{{x}{}\left({t}\right)}^{{2}}{+}{x}{}\left({t}\right){}{y}{}\left({t}\right){-}\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right){,}{2}{}\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right)\right){}{x}{}\left({t}\right){-}\frac{{{ⅆ}}^{{2}}}{{ⅆ}{{t}}^{{2}}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{x}{}\left({t}\right)\right]$ (9)
 > $\mathrm{Equations}\left(G\left[2\right]\right)$
 $\left[{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{z}{}\left({t}\right)\right)}^{{2}}{-}{1}{,}{x}{}\left({t}\right){+}{y}{}\left({t}\right){,}{8}{}{{x}{}\left({t}\right)}^{{8}}{-}{13}{}{{x}{}\left({t}\right)}^{{4}}{+}{16}\right]$ (10)
 > $\mathrm{Equations}\left(G\left[3\right]\right)$
 $\left[{{y}{}\left({t}\right)}^{{4}}{+}{\left(\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{z}{}\left({t}\right)\right)}^{{2}}{-}{1}{,}{{y}{}\left({t}\right)}^{{2}}{+}\frac{{ⅆ}}{{ⅆ}{t}}\phantom{\rule[-0.0ex]{0.4em}{0.0ex}}{y}{}\left({t}\right){,}{x}{}\left({t}\right)\right]$ (11)

Note that the equations are returned without isolating the highest-ranked derivative (this is different from the similar command DifferentialAlgebra:-Equations)

For more details see ThomasDecomposition