A generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE
Erfan Shalchian

TL;DR
This paper extends the Picard-Lindelof theorem and the method of characteristics to a broader class of first-order PDE systems, providing a framework for existence and uniqueness of solutions under Lipschitz or $C^r$ conditions.
Contribution
It generalizes classical methods to nonlinear systems and hyperbolic quasilinear PDEs, introducing a discretization approach for constructing unique solutions.
Findings
Established local existence and uniqueness for generalized PDE systems.
Developed a discretization method to approximate solutions.
Discussed extensions to nonlinear and parameter-dependent systems.
Abstract
We generalize Picard-Lindelof theorem/ the method of characteristics to the following system of PDE: . With a Lipschitz or and initial condition , , we obtain a local unique Lipschitz or solution , respectively that satisfies the initial condition, , . To construct the solution we set bounds on the value of the solution by discretizing the domain of the solution along the direction perpendicular to the initial condition hyperplane. As the number of discretization hyperplanes is taken to infinity the upper and lower bounds of the solution approach each other, hence this gives a unique function for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Analytic and geometric function theory · Matrix Theory and Algorithms
A generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE
Erfan Shalchian111Full name: M. Erfan Shalchian T.
Department of Physics, University of Toronto, 60 St. George St., Toronto ON M5S 1A7, Canada
Department of Mathematics and Department of Physics, Sharif Institute of Technology, Azadi St., Tehran, Iran
[email protected],[email protected]
Abstract
We generalize Picard-Lindelof theorem/ the method of characteristics to the following system of PDE: . With a Lipschitz or and initial condition , , we obtain a local unique Lipschitz or solution , respectively that satisfies the initial condition, , . To construct the solution we set bounds on the value of the solution by discretizing the domain of the solution along the direction perpendicular to the initial condition hyperplane. As the number of discretization hyperplanes is taken to infinity the upper and lower bounds of the solution approach each other, hence this gives a unique function for the solution (). A locality condition is derived based on the constants of the problem. The dependence of , and on parameters, the generalization to nonlinear systems of PDE and the application to hyperbolic quasilinear systems of first order PDE in two independent variables is discussed.
keywords:
hyperbolic quasilinear systems of PDE , method of characteristics , Lipschitz continuity , upper and lower bounds
††journal: Journal of LaTeX Templates
Contents
-
2 An alternative proof of the Picard-Lindelof theorem of ODE
-
3 A generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE
-
4.1 Dependence of initial condition and coefficients on parameters
-
4.3 Application to hyperbolic quasilinear systems of first order PDE in two independent variables
1 Introduction and outline
The method of characteristics for solving a first order partial differential equation in an unknown function has been known to mathematicians in the past centuries, however, the generalization of this method to systems of first order PDE has remained unknown (e.g.[1]: Chapter VI, Section 7 it is stated that there is no analog of the method of characteristics for systems of first order PDE). In this work we will prove theorems, in particular Theorem 1.1 below, that will generalize the result obtained using the method of characteristics, typically applicable to one equation with one unknown function, to systems of first order PDE which the partial derivatives of each function appear in separate equations. Theorem 1.1 can also be considered as the generalization of the Picard-Lindelof theorem of ODE to PDE. The main result of this work proven is Section 3 is the following Theorem:
Theorem 1.1** (A generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE)**
Let , , be Lipschitz continuous or functions defined on the parallelpiped with and . And let the Lipschitz continuous or initial condition function for , and with be given. The following system of partial differential equations
[TABLE]
has a unique Lipschitz continuous 111By Lipschitz continuous solution we mean a Lipschitz continuous function that solves the system of PDE 1.1 at its differentiable points. By Rademacher theorem (for a proof refer to [4]) a Lipschitz continuous function is differentiable almost everywhere. or solution respectively, for , containing a neighbourhood of , with and reducing to the initial condition function on , for .
The proof of Theorem 1.1 is far from trivial. The main difficulty in generalizing the method of characteristics to the system of PDE of the type 1.1 is that the characteristic curves for each equation are distinct therefore it cannot be reduced to systems of ODE. One way to gain control over these characteristics is to set bounds on the value of the solution satisfying an initial condition and the characteristic curves which are distinct for each equation by discretizing the hyperplanes along the direction perpendicular to the initial condition hyperplane. If the bounds are set in an appropriate and optimal way it can be shown that in the limit that the number of discretization hyperplanes is taken to infinity the bounds for the value of the solution and the characteristic curves approach each other, hence this gives a unique function for the solution ().
It should be noted that there is a more general and abstract theorem in hyperbolic systems of partial differential equations that is related to the system of PDE of relation 1.1, however the conditions of that theorem, being a more general result are not as minimal as the conditions of Theorem 1.1. For example the differentiability assumptions of that theorem have to increase proportional to the number of independent variables used in the hyperbolic system of PDE in order for the solution to be a bounded ordinary function possessing finite derivatives to a certain order (for more details refer to [3], Chapter VI, Section 10). On the other hand the conditions of Theorem 1.1 are as minimal as they can be. Another interesting feature of Theorem 1.1 is the method which it is proven with, which is an elegant generalization of the method of characteristics, applicable to one equation with one unknown function, to the system of PDE of 1.1. The difference now is that there are many characteristics coming out of each point of the domain which the solution is being constructed on, therefore it is not possible to reduce it to systems of ODE. As described in the previous paragraph one way to gain control over these characteristics and the value of the solution, is to set bounds on them by discretizing the hyperplanes parallel to the initial condition hyperplane and later show that these bounds approach each other as the number of discretization hyperplanes goes to infinity. Also we derive explicit expressions for the locality condition and the Lipschitz constant of the solution of the PDE of Theorem 1.1 based on the constants of the problem as follows:
[TABLE]
and refer to the Lipschitz constants of the and functions on , respectively. is the step function. is the Lipschitz constant of the initial condition functions on . and refer to a bound for and on , respectively. The extent which, in general, the solution can be constructed in the direction above or below the initial condition hyperplane is given by the locality condition of 1.2: . Also with to make sure the domain and range of the solution lie within and , respectively. With in relation 1.3 being the Lipschitz constant of the solution along the hyperplanes parallel to the initial condition hyperplane, in relation 1.4 gives the total Lipschitz constant of the solution on its domain of construction.
One of the applications of Theorem 1.1 is in regard to hyperbolic quasilinear systems of first order PDE in two independent variables which, as an example, are used to describe the one dimensional space flow of fluids. These systems of PDE can be reduced to the PDE of Theorem 1.1 by differentiating the system, diagonalizing its coefficient matrix and performing a change of function variables, therefore Theorem 1.1 and the method which its solution is constructed (this is discussed in Section 3) offer an alternative way, which is more direct and convenient especially for finding a numerical solution, as compared to other methods, e.g. iteration methods [3], for constructing the solution of hyperbolic quasilinear systems of first order PDE in two independent variables.
In order to illustrate the main idea of proving Theorem 1.1 in a simpler context, in Section 2 we present an alternative proof of the Picard-Lindelof theorem of ODE by setting upper and lower bounds on the value of the solution of the system of ODE: , by discretizing the time interval into partitions at the ’th step
[TABLE]
and find a recursion relation for
[TABLE]
, a bounded constant, the Lipschitz constant of and as . After solving relation 1.6 we find therefore as , the upper and lower bounds for the solution in 1.5 approach each other, hence this gives a unique function for the solution to the system of ODE. We will see that this alternative way of proving the Picard-Lindelof theorem is more easily generalizable to the quasilinear system of PDE of 1.1. Setting upper and lower bounds on the value of the solution enables us to have more control over the possible range of values of the solution and the bounds at the ’th step of partitioning naturally fall within the bounds at the ’th step of partitioning, therefore with denoting the set of possible ranges of values for the solution on the time interval at the ’th step of partitioning by , these sets form a nested sequence , hence in order to show that this nested sequence converges to the graph of a unique function for solution we only need to show that at the ’th step of the partitioning the difference between the upper and lower bounds of the solution is of order . In the current methods which we make successive approximations to the solution without finding bounds for the solution, e.g. by making successive approximations to the solution from the integral equation of the system of ODE as in [1] or considering the discretization of the system of ODE as when solving it numerically, in order to show convergence to a solution the difference between the approximations to the solution at the ’th step and the ’th step have to be found and finally show that the sequence of approximations to the solution at the ’th step converges uniformly to a solution. In these methods when the existence of the solution is proven one is not sure about its uniqueness and therefore a uniqueness proof has to be presented separately. In the method described above which we set bounds on the value of the solution the proof of the existence of the solution is not separate from proving the uniqueness of the solution, since in order to demonstrate existence it has to be shown that the bounds set on the solution at the ’th step form a nested sequence and approach each other as which automatically shows uniqueness as well. This implies that this method is only applicable to when the conditions of the theorem are such that we obtain a unique solution (e.g. when in the system of ODE above is Lipschitz), and it cannot be applied to show the existence of a solution only (e.g. it cannot be applied to when is continuous).
In Section 3 we prove Theorem 1.1. We implement the same idea used in Section 2 and described in the paragraph after Theorem 1.1 to prove this result. A standard domain is defined as
[TABLE]
and the solution is constructed on this domain. and refer to a lower and upper bound for for on , respectively. is chosen small enough. Similarly an domain can be defined for below the initial condition hyperplane 333A list of equivalent definitions for when constructing the solution on the domain is given in A.. The domain between the initial condition hyperplane at in and the hyperplane in is divided into equal partitions for . The hyperplanes at in are denoted by for and . Upper and lower bound functions independent of the assumed solution are defined on : and such that if is a solution to 1.1 satisfying the initial condition then
[TABLE]
and . Next in order to find a similar recursion relation as 1.6 for , we need to introduce the Lipschitz constants of and and to show that as we need to show that these Lipschitz constants are bounded. This is done by finding a recursion relation for the Lipschitz constants in Section 3.1 and showing that they are locally (i.e. close enough to the initial condition hyperplane) bounded in Section 3.2. The recursion relation for , and a bound for the Lipschitz constants are given by
[TABLE]
with and . and are bounded constants. If the locality condition of 1.2 is satisfied, it can be shown that are bounded for all and , with their bound given by in relation 1.11.
In B it is shown in detail that the bounds for the solution at the step of partitioning of lie within the bounds of the step of partitioning. Therefore with denoting the set of possible ranges of values of the solution on at the step of partitioning by we have and for . Solving the recursion relation of 1.9 for we find hence converges to the graph of a unique function for the solution () as .
Finally in Section 3.3 it is shown that the obtained in the previous Subsections solves the system of PDE of Theorem 1.1 at its differentiable points subject to the initial condition. When the coefficients , and the initial condition are in order to prove that is on the hyperplanes the following functions are defined recursively
[TABLE]
the functions are defined such that for . A fixed is considered for and held fixed as . Based on the discussion above it is clear that the sequence of functions converges uniformly to on , furthermore it is shown that the sequence of their partial derivatives is bounded and equicontinuous, therefore there is a subsequence of their partial derivatives that converges uniformly. From this it is concluded that is on , this is then easily generalized to all hyperplanes parallel to the initial condition hyperplane in . Based on this fact it is then shown that solves the system of PDE of 1.1 subject to the initial condition and is on .
Note that relation 1.12 can be used to solve the system of PDE of 1.1 numerically on . One might attempt to show that the discretized functions in 1.12 converge to the solution of the PDE of Theorem 1.1. In this case one has to evaluate the difference between and and show that this difference is of order uniformly on for , this is also a possibility, however as mentioned earlier in the approach which we set bounds on the values of the solution things are more under control, therefore it is a more convenient and reliable method hence this will be the approach we consider in this work.
Section 4 discusses the generalizations and application of Theorem 1.1. In Subsection 4.1 it is shown that the Lipschitz or dependence of the initial condition and coefficients and on parameters is inherited to the solution, Subsection 4.2 discusses the generalization of Theorem 1.1 to non-linear systems of PDE and in Subsection 4.3 the application of Theorem 1.1 in regard to quasilinear hyperbolic first order systems of PDE in two independent variables is briefly discussed.
The generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE is a result concerning the classical theory of partial differential equations which has remained unknown in the past centuries. As far as the author is concerned this result, in the form stated in Theorem 1.1 with minimal differentiability assumptions and explicit expressions for the locality condition and the Lipschitz constant of the solution, is not approachable using known methods or theorems and the only way is by direct construction of the solution. Here our main focus will be on proving this result and briefly discuss some of its generalizations and application but leave further investigations for future works.
2 An alternative proof of the Picard-Lindelof theorem of ODE
In this Section we demonstrate the main idea in proving Theorem 1.1 in the simpler context of ordinary differential equations. Consider Picard-Lindelof theorem 444We make use of the maximum or infinity norm: and the 1-norm: throughout the paper.:
Theorem 2.1** (Picard-Lindelof theorem)**
Let ; continuous on a parallelepiped and Lipschitz continuous with respect to . Let be a bound for on R; . Then
[TABLE]
has a unique solution on .
The standard proofs of this theorem are textbook material [1]. Here we present an alternative way to prove this theorem.
Proof 1** (Alternative proof of Picard-Lindelof theorem)**
Lets assume the system of ODE 2.1 has a solution. We can integrate 2.1 for this solution to obtain
[TABLE]
to first approximation the maximum and minimum values of this solution at are given by
[TABLE]
where and denote the maximum and minimum values of in the region . Next we divide the interval in half. The maximum and minimum values of the solution at are given by
[TABLE]
where and are the maximum and minimum values of in , respectively. Now we use the bounds in (2.4) for the possible range of the solution at as a range of possible initial conditions at to find a better range of values for the solution at . This is given by
[TABLE]
where and are the maximum and minimum values of in , respectively. We continue this process by dividing the interval into equal intervals for and set bounds on the solution at for
[TABLE]
*with and and denoting the maximum and minimum values of in , respectively. From 2.6 it can be verified that the bounds for the solution at the step of the partitioning lie within the bounds at the step of the partitioning 555This can be seen as follows, with assuming , (note that this is true for ) we have to show , ,
\begin{split}y_{i,M}^{N+1,2k}=y_{i,M}^{N+1,2k-1}+M^{N+1,2k}_{f_{i}}{\alpha\over 2^{N+1}}=y_{i,M}^{N+1,2k-2}+{1\over 2}\left(M^{N+1,2k-1}_{f_{i}}+M^{N+1,2k}_{f_{i}}\right){\alpha\over 2^{N}}\end{split}
(2.7)
, since and and by assumption , therefore this proves , the proof of is similar. It is clear that since by assumption and and since and similarly hence their range is a subset of the range of and their range is also clearly a subset of the range of ., therefore with defining we have, and clearly based on how is defined we have for , hence if we show that as , for it can be concluded that the regions will shrink to a graph of a unique function for the solution to 2.1. To show this consider the following recursion relation*
[TABLE]
by assumption the function satisfies the Lipschitz condition in its coordinates and being a continuous function defined on the compact region it assumes its maximum and minimum values and at certain points in therefore we have
[TABLE]
with being the Lipschitz constant of the function with respect to . Since the function is continuous and it is defined on a compact set it is uniformly continuous therefore for any there is a (independent of ) such that if , . Now we can choose large enough such that . This defines the used in relation 2.9. Using 2.9 we can derive an upperbound for 2.8
[TABLE]
with . From 2.10 we have
[TABLE]
with and . Solving 2.11 with noting that we find
[TABLE]
From 1 it can be easily seen that as , for any hence converges to a graph of a unique function for the solution () on . It can be shown that indeed solves 2.1:
[TABLE]
with as . The second equality follows from 2.11, for , , 666 can also be considered negative. Although relation 2.11 was derived by assuming we are moving in the positive time direction, clearly it is equivalently valid for when moving in the negative time direction (e.g. for when constructing the solution on with ). , , with considering as the initial condition at and noting that and . It is clear that with a similar procedure we can construct a unique solution on . \qed
3 A generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE
In this Section we will apply the idea used in the previous Section for proving the Picard-Lindelof theorem to prove the theorem below.
Theorem 3.1** (A generalization of Picard-Lindelof theorem/ the method of characteristics to systems of PDE)**
Let , , be Lipschitz continuous or functions defined on the parallelpiped with and . And let the Lipschitz continuous or initial condition function for , and with be given. The following system of partial differential equations
[TABLE]
has a unique Lipschitz continuous 777By Lipschitz continuous solution we mean a Lipschitz continuous function that solves the system of PDE 3.1 at its differentiable points. By Rademacher theorem a Lipschitz continuous function is differentiable almost everywhere. or solution respectively, for , containing a neighbourhood of , with and reducing to the initial condition function on , for .
Proof 2
In a similar approach as the alternative proof of the Picard-Lindelof theorem presented in the previous Section we assume a solution exists and find bounds for this solution by dividing the domain along the direction into equal partitions and later show that these bounds approach each other as the number of partitions goes to infinity.
First we define a standard domain to construct the solution on. Let be a bound for on and . Let and denote an upper and lower bound for for on , respectively. We define the plus standard domain
[TABLE]
*with chosen sufficiently small as to satisfy the following conditions: i) a locality criteria (the first relation of 3.47) to be derived in Subsection 3.2, ii) , iii) to ensure the inequalities for in the definition of 3.2 are satisfied. Similarly an domain can be defined for below the hyperplane 888A list of equivalent definitions for when constructing the solution on the domain can be found in A.. The standard domain is defined in a way as to ensure the following two properties. If a solution to 3.1 on exists satisfying the initial condition then:
i) .
ii) Each characteristic curve of this solution lies within and connects with a point in the initial condition domain .*
In what follows we will construct a unique solution to 3.1 on that satisfies the initial condition. We will be using lots of notations and definitions. For a after integrating 3.1 based on an assumed solution on that satisfies the initial condition we obtain the following integral and characteristic equations:
[TABLE]
note that the parameter of the characteristic equations t, is the same as the coordinate. Next we divide along the direction into for equal partitions and find upper and lower bounds for the value of the assumed solution at the intersection of these partitions in , we have
[TABLE]
* for . form upper and lower bounds for the value of the solution on . , , and for will be defined below. The bounds of relation 3.4 can be understood better in terms of the first relation of 3.3. Writing this relation for as the final point and as the initial point we have*
[TABLE]
note that for and for . The bounds of relation 3.4 are such that and for . Next we give precise definitions for these bounds. We first define , , and for :
[TABLE]
with and for given by
[TABLE]
for when the characteristic curves of the assumed solution pass through a for , i.e. , is defined in a way as to ensure that for and is defined in a way as to ensure that for . and for are given by
[TABLE]
with and having similar definitions as and in relation 3.6 respectively with replaced by
[TABLE]
From the definitions above it can be verified that the bounds of relation 3.4 for the assumed solution are correct. For example the maximum of at a point consists of the maximum value of in a region of which the characteristic curve of passing through this region has the possibility of passing through , this region of is given by defined in 2 and the maximum value is given by , plus the maximum value which can change when its characteristic curve passing through reaches , this is given by .
Also it can be verified that the bounds for the solution at the step of the partitioning lie within the bounds of the step. This is discussed in detail in B, therefore with defining we have . From the definitions and relations above it is clear that the graph of the assumed solution on lies within the set at the step of partitioning, for , therefore in order to show that converges to the graph of a unique function for the solution () we only need to show that as .
For this we will try to find a similar recursion relation as in 2.11 for , . Starting from 3.4 we have
[TABLE]
an upper bound for is given by
[TABLE]
with a Lipschitz constant for the functions and the expression in brackets corresponds to an upperbound for the distance between any two points defined in LABEL:eq:3.6. We also need to find an upper bound for in 3.11. For this we will assume the functions and are Lipschitz with Lipschitz constant . We will show this to be true and derive a recursion relation for the Lipschitz constants in Subsection 3.1. We have
[TABLE]
with and denoting the points in which and assume their maximum and minimum values in , respectively. Combining 3.11 and 3.12 we have
[TABLE]
with an upper bound for the following quantity
[TABLE]
note that based on 3.14, we can take since we defined . Similarly we can obtain a bound for in 3.10
[TABLE]
with and denoting the points in which and assume their maximum and minimum values in , respectively. Similar to 3.13 we can obtain a bound for . We have
[TABLE]
with a Lipschitz constant for the functions. Now using 3.13, 2 and 3.16 we can find a bound for 3.10, we have
[TABLE]
In Subsection 3.1 we will derive a recursion relation for the Lipschitz constants and in Subsection 3.2 we will show that they are locally (i.e. for a sufficiently small ) bounded. With knowing this we can write 2 as
[TABLE]
with and being constants which bound the following quantities
[TABLE]
3.18* is the recursion relation similar to 2.11 we were looking for. For completeness we include the recursion relation for the Lipschitz constants to be derived in Subsection 3.1, the locality criteria for and a bound for the Lipschitz constants , to be derived in Subsection 3.2, and a Lipschitz constant for the unique function for the solution () to Theorem 3.1 to be derived below, here*
[TABLE]
Relations 2 constitute the main relations of Theorem 3.1. refers to the Lipschitz constant of the initial condition function and the step function.
With knowing that the Lipschitz constants are locally bounded we can use the first relation in 2 to show that as similar to the steps in relation 1
[TABLE]
from relation 2 it is clear that as , hence converges to the graph of a unique function for the solution () to Theorem 3.1. We will prove in Subsection 3.3 that indeed solves the PDE of Theorem 3.1 subject to the initial condition. Before moving on to the next Subsection we show that is also Lipschitz in the direction. in relation 2 can be considered as the Lipschitz constant of along the hyperplanes in for . Consider and for and held fixed as and for . It can be easily seen that a bound for the difference for and is , with being a bound for on and the unit vector in the direction, hence can be considered as a Lipschitz constant for in the direction. Therefore
[TABLE]
is a Lipschitz constant for on (or ). Note that relations of 2 are equivalently valid for when constructing the solution on the domain with being the extent which, in general, the solution can be constructed below the initial condition hyperplane . A list of the equivalent of the definitions used in this Section for when constructing the solution on the domain is given in A.
3.1 A recursion relation for the Lipschitz constants
In this Subsection we will obtain a recursion relation for the Lipschitz constants of the functions . A similar result will be reached if we work with the functions . Let , with being the Lipschitz constant of the initial condition functions . Take two separate points . With assuming is known we would like to find an expression for
[TABLE]
For this we will make use of the following Lemma:
Lemma 1
Let be a Lipschitz continuous function with Lipschitz constant for the 1-norm. be compact sets and consider with the following characteristics:
[TABLE]
then we have the following relations: and . Where and denote the maximum and minimum values of in for , respectively.
Proof 3
By the assumption of compactness of and continuity of there exists such that for . By assumption of the lemma there is a such that so we have and since we have : and similarly it can be concluded which proves . Similarly it can be concluded that .
Note:* Consider . Then has the characteristics of the distance in Lemma 1 with respect to the subsets and .*
From 3.4
[TABLE]
assuming has the characteristics of the distance in Lemma 1 for the two sets and we have
[TABLE]
based on the definitions of for in 2 and the Note after Lemma 1 we can find an expression for
[TABLE]
a bound for or is given by
[TABLE]
with having the characteristics of the distance in Lemma 1 for the two sets and . Based on the definitions of for in LABEL:eq:3.6 and the Note after Lemma 1 we can find an expression for
[TABLE]
a bound for or is given by
[TABLE]
from the definitions of 3.6 and LABEL:eq:3.6 it can be verified that has the characteristics of the distance in Lemma 1 for the two sets and .
From 3.28 and 3.29, is given by
[TABLE]
and from 3.26 and 3.27 is given by
[TABLE]
Similarly a bound for is given by
[TABLE]
From 3.25, 3.30, 3.31 and 3.32 we obtain a bound for 3.24
[TABLE]
Comparing 3.23 and 3.33 we find an expression for
[TABLE]
3.2 Local boundedness of
The nonlinear term in 3.34 is the term that can lead to an unbounded increase of the Lipschitz constants , but if the coefficient of this term is small enough we expect to be able to show that the Lipschitz constants are bounded. We first rewrite 3.34 in a simpler form
[TABLE]
For convenience we have suppressed the index in . Note that for , but for and a sufficiently large , with as . The first few terms of the sequence read
[TABLE]
From 3.35 and 3.36 it is clear that is a polynomial of degree in
[TABLE]
with a polynomial in . To show the local boundedness of we need to find a bound for the coefficients . For this insert from relation 3.37 into relation 3.35 to obtain
[TABLE]
summation over is implicit. From 3.38 a recursion relation for the coefficients can be derived
[TABLE]
In what follows we will show that the coefficients are bounded by the inequalities below
[TABLE]
one might be able to improve the bounds in 3.40 and accordingly improve the bounds of relation 3.47 by a more careful study of the coefficients . But these bounds suffice to capture the main features of a locality condition for .
From relation 3.35 and 3.36 it can be verified that and , satisfying the inequalities of 3.40. So assuming holds for lets try to prove for and for . Applying this to 3.39 we have
[TABLE]
so in both cases we obtain
[TABLE]
applying this inequality to we obtain
[TABLE]
note that for . We also used the fact that for , , and in the above relation.
Similarly if we assume holds for , it is possible to prove that for and . Applying this to 3.39 for both even and odd cases we obtain
[TABLE]
applying this inequality to we have
[TABLE]
we used the fact that ,, and for in the above relation. Hence the inequalities of 3.40 are proven. Applying 3.40 to 3.37 for we find
[TABLE]
with the Lipschitz constant of the initial condition function . We used in the above relations and assumed in the first relation and in the second relation of 3.46. From these assumptions and 3.46 we can find a locality condition for and a bound for the Lipschitz constants 999We have dropped the factor on the righthand side of the second relation of 3.46 as for . But now since is an increasing function of and the second relation of 3.47 is true in the limit of then it must be true for all . To see how is an increasing function of consider from 3.34 with . It suffices to show for . Note that , therefore lets assume and try to prove . We have and . This proves .
[TABLE]
with the step function.
3.3 Unique function for solution () solves Theorem 3.1
In this Subsection we will show that the obtained in the previous Subsections is the solution of the system of PDE of Theorem 3.1. With the Lipschitz condition for the initial condition and the coefficients and , is Lipschitz. Due to Radamechar theorem it is differentiable almost everywhere. Here we will show that solves the system of PDE at its differentiable points. Consider two hyperplanes in : and for . Define the function for and
[TABLE]
* is the unit -vector in the direction. Similar to before we can take as the initial condition hyperplane and as the final hyperplane, but we will not partition the space in between, instead we take the limit . Based on how is defined it can be seen to lie within the upper and lower bounds for the solution101010e.g. it can be verified that , therefore and hence and .: . Using the first relation of (2) with , , and noting that , we have*
[TABLE]
since also lies within the upper and lower bounds for the solution , based on relation 3.49 we have . Therefore
[TABLE]
with as and we used the fact that is differentiable at . Note that is a fixed point and is varied as . Another point to consider here is that we only used the fact that is differentiable on and did not need to assume it is differentiable in the direction in 3.3. Dividing relation 3.3 by and taking the limit we find
[TABLE]
This shows that solves the PDE of relation 3.1 at its differentiable points subject to the initial condition 111111Although the construction of was done by moving in the positive direction it is clear that with similar methods it is possible to start from an initial condition hyperplane and construct the solution in the negative direction (c.f. A). Therefore the discussion here is equivalently valid for when making the replacement for and evaluating the derivative of in the negative direction..
Next we will show that if the initial condition and the coefficients and are then is . We first show that is on . We will make use of the following two theorems in mathematical analysis **[2]**:
Arzela-Ascoli theorem: Any bounded equicontinuous sequence of functions in has a uniformly convergent subsequence. 2. 2.
Theorem: The uniform limit of a sequence of functions in is provided that the sequence of its partial derivatives also converges uniformly and the partial derivative of the uniform limit function is the same as the uniform limit of the partial derivative.
Consider the collection of functions defined recursively as follows
[TABLE]
from the way the functions are defined it can be seen 121212A similar reasoning as the footnote of the previous page holds here: , therefore and hence and .
[TABLE]
we consider a fixed (for ) at with held fixed as . To show that is differentiable on we have to show the following:
Uniform convergence of the sequence of functions on . 2. 2.
Uniform convergence of the sequence (or at least a subsequence) of the partial derivatives on .
To show the uniform convergence of a subsequence of the partial derivatives it suffices to show the following:
- 2.1
Boundedness of the sequence of partial derivatives . 2. 2.2
Equicontinuity of the sequence of partial derivatives .
The first statement follows from relation 3.53 and the fact that as the upper and lower bounds approach each other uniformly on as shown in 2. To show statements and we take the partial derivative of **3.3131313For brevity we have used the symbol .**
[TABLE]
with and in the above relation. Summation over and is implicit. To show the boundedness of the sequence of derivatives we assume a bound is known for the partial derivatives of for and look for . From 3.3 we can find such recursion relation
[TABLE]
where and are Lipschitz constants for and which bound , and , respectively, for . Relation 3.55 is exactly similar to relation 3.34 obtained previously for the Lipschitz constants . This proves that the sequence is bounded (locally in ). To prove we have to show that the sequence is equicontinuous. The assumption for the initial condition and the coefficients and implies that is continuous and since they are defined on a compact set they are uniformly continuous, therefore we only have to show that for a there is a common , independent of , such that if , for .
Taking the functions as known, for an choose such that if for and for with given by 2, then
[TABLE]
. For these and lets see which and we will obtain for . For this lets evaluate using the right hand side of 3.3 for and . Note that the difference of the product of any number of terms can be written in terms of the difference of each of the terms multiplied by other terms, for example
[TABLE]
for , . Therefore the difference of the right hand side of 3.3 can be written in terms of the difference of each of the terms at their corresponding two distinct points multiplied by other terms which are bounded. Their two distinct points are either and or and or and . A bound for the difference between these points are or or . Assuming (note that with this assumption and ) and using 3.3 we can find a bound for
[TABLE]
*with a bounded constant. Therefore the and obtained for 141414Note that for the and obtained, relation 3.3 for the derivatives of and is also satisfied: , since and . * in terms of and and eventually in terms of and are as follows
[TABLE]
for we have
[TABLE]
where , . Therefore for a , we can choose small enough such that 3.60 is satisfied: . For this has to be chosen such that
[TABLE]
for the of 3.3 the independent is given by 3.61: . This shows that the sequence is equicontinuous and therefore statement 2.2 is proven. Therefore there exists a subsequence of for that converges uniformly and since the sequence of converges uniformly to on this shows that exists and is continuous in the direction of the variables for on . Since the hyperplanes are dense in this easily generalizes to all hyperplanes parallel to the initial condition hyperplane in (e.g. by varying ). Next we show that is continuous in the direction. Consider and for , defined at the beginning of Subsection 3.3, as the initial condition and final hyperplane, respectively. We discretize the space in between along the direction similar to before. Consider 3.3 with replaced by and and corresponding to and , respectively, with noting that all the terms have a bounded behaviour as the recursion relation can be written as with and terms of order , therefore upon solving this relation for () in terms of (), we find , with , and terms of order . From there is a subsequence (e.g. ) that converges uniformly to , therefore 151515 and , these limits are well defined. To see this consider , as noted converges to . converges to the point in which the characteristic curve of the solution passing through passes through in , therefore the term also has a well defined limit as .
[TABLE]
we already proved that is continuous in the direction of the variables on , therefore upon taking the limit in 3.3 (note that for , is a fixed point) it can be concluded that is continuous in the direction161616As previously noted although the construction of was done by moving in the positive direction it is clear that with similar methods it is possible to start from an initial condition hyperplane and construct the solution in the negative direction (c.f. A). Therefore the discussion in this page is equivalently valid for when making the replacement for and showing the continuity of in the negative direction.. From 3.3 and 3.51 it follows that solves the system of PDE of 3.1 subject to the initial condition for all and that exists and is continuous. Similarly with assuming that the initial condition and the coefficients and are for we can show that the solution is . For this consider the partial derivatives of 3.3, by similar methods it can be shown that the sequence of a partial derivative of is bounded and equicontinuous and with a subsequence of its lower derivative converging uniformly, it can be concluded that the partial derivative of in the directions exists and is continuous in the directions for , also similar to the argument above it can be concluded that the partial derivative in the directions is continuous in the direction. Then using 3.51 it can be shown that all partial derivatives in the direction for exist and are continuous.
Note that with the Lipschitz or assumption on the coefficients and the initial condition we obtain a Lipschitz or solution, respectively but the characteristic curves and the solution along these curves will be with Lipschitz continuous derivative and , respectively as can be seen from relation 3.3.
*Although the solution was constructed on by a similar procedure we can define an domain and construct a unique solution there (c.f. A), it is also possible to extend the domain of the solution to a larger one by applying the same procedure on regions near the boundaries of the domain . Further proceedings in the positive or negative direction, depending on the specific problem considered, might lead to regions of overlapping characteristics or an unbounded increase of the solution or its derivatives which would limit the domain with a well defined unique solution. Nevertheless we would expect there to exist a maximal domain with a unique well defined solution. For instance consider the union of all domains which a unique well defined solution exists with unique characteristics connecting the points of the domain to the initial condition domain. Other regions of the domain are regions which no solution, that is related to the initial condition, exists, i.e. there is no characteristic connecting that region to the initial condition domain, or multiple solutions exist with multiple characteristics connecting a point in that region to the initial condition domain. *\qed
4 Generalizations and application of Theorem 3.1
4.1 Dependence of initial condition and coefficients on parameters
In this Subsection we consider the dependence of the initial condition and coefficients and on parameters and show that their Lipschitz or dependence on the parameters is inherited to the solution. The Proposition is as follows:
Proposition 4.1
Consider extending the definition of , and of Theorem 3.1 to , and with , with , and defined in Theorem 3.1. Let , and be Lipschitz or with , and , also let with . Then the following system of partial differential equations:
[TABLE]
has a unique Lipschitz continuous or solution respectively, for , containing a neighbourhood of , with defined in Theorem 3.1 and reducing to the initial condition function on , for .
The construction of which was done in Section 3 can similarly be done here for a fixed (or in other words for a spectator argument) by replacing the constants of the problem
[TABLE]
and accordingly relation 2 and the relations in Section 3 that involve these constants would be modified in this way.
To show that is Lipschitz with respect to its argument consider the sequence of functions in 3.3. Now with the initial condition and coefficients depending on the parameter the recursion relation picks up a dependence
[TABLE]
The sequence of converges uniformly to on for fixed as and as can be seen from relation 2 after applying 4.2. Therefore if it is shown that has a bounded Lipschitz constant with respect to , this implies that is Lipschitz with respect to on all which then easily generalizes to all points in the domain (e.g. by varying ) . Lets assume is Lipschitz with Lipschitz constant and try to find the Lipschitz constant of . Consider two different points . We would like to find such that . First lets evaluate the difference between each of the terms in 4.1
[TABLE]
using the above relations we can find a bound for
[TABLE]
from 4.1 we obtain a similar recursion relation as 3.34 (but with 4.2 applied) for the Lipschitz constants
[TABLE]
This shows that the sequence of Lipschitz constants is locally bounded for all and , therefore is also Lipschitz with respect to its parametric dependence with being its Lipschitz constant on (or ). Next we show that is with respect to the and space. First we show this on the hyperplanes . For this it suffices to show Statements , and in Subsection 3.3 for the sequence with held fixed. Statement 1 was discussed below relation 4.1: the uniform convergence of to as follows from relation 2 after applying 4.2. and are locally bounded for all since the Lipschitz constant of obeys relation 4.7, hence this shows Statement . To show Statement take the partial derivative of 4.1 with respect to and
[TABLE]
summation over and is implicit. Showing that the sequences and are equicontinuous is similar to how this was done for the partial derivatives in Subsection 3.3 as the structure of the recursion relation is the same, therefore by similar arguments starting from the paragraph below relation 3.3 until a few sentences after relation 3.3 we can conclude that and () exist and are continuous with respect to the and space. Also with similar arguments as in the paragraph below relation 3.3 we can conclude that with a assumption on , and , will be with respect to and .
4.2 Generalization to nonlinear systems of PDE
In this Subsection we will generalize the result of Section 3 to nonlinear systems of PDE. For this we need to conjecture the following for a linear homogeneous first order system of PDE that will be derived later in this Subsection.
Conjecture 1
The following linear homogeneous first order system of PDE:
[TABLE]
with and , matrices defined on , can have at most one solution locally that satisfies a initial condition , , , with and defined similar to Theorem 3.1.
Note: If the matrices in 4.9 are symmetric the above conjecture is true according to [3].
The nonlinear system of PDE that is reducible to the system of PDE of Theorem 3.1 by differentiation is 171717The derivation presented here is similar to the one in [1] except that it is for a system of PDE.:
[TABLE]
we assume is defined with , the points and will be defined below. The initial condition is given by and we demand that the functions solving 4.10 reduce to for and . , , and are defined similar to Theorem 3.1. With the assumption on and the initial condition we will obtain a solution. In order for the existence of a solution to 4.10 that reduces to the initial condition on to be possible the functions for must exist which satisfy the following relations:
[TABLE]
is from 4.12, therefore due to the implicit function theorem will also be 181818It is usually assumed that relations 4.11 - 4.13 hold for a point which then due to the implicit function theorem it can be inferred that they hold locally in a neighbourhood of . Since we want the solution to reduce to the initial condition on we have assumed that 4.11 - 4.13 hold on .. and are such that . Differentiating 4.10 with respect to we have
[TABLE]
summation over and is implicit. We have commuted the order of the partial derivatives and replaced . From 4.13 it is clear that in a neighbourhood of the set of points for , therefore upon dividing 4.14 by we obtain a system of PDE similar to relation 3.1 which then a unique solution and can be constructed locally that would reduce to and for similar to the way it was done in Section 3. With the assumption on the initial condition and in 4.10, the coefficients and the initial condition in 4.14 will be and therefore we obtain a solution to 4.14.
Now it is possible to show that the of 4.14 solve the system of PDE of 4.10 and are assuming Conjecture 1 holds. For this we introduce new coordinate systems corresponding to the initial condition hyperplane and the parameter of the characteristic equations of 4.14. We denote these by and . By the theory of ordinary differential equations the map is . To show that solves 4.10 we need to show the following equations:
[TABLE]
from 4.11 it is clear that 4.15 and from 4.12 and the second equation of 4.14 it is clear that 4.16 are true on the initial condition hyperplane . We need to show that they hold locally near the initial condition hyperplane. Showing 4.16 is equivalent to showing . In the coordinate system of the initial condition hyperplane and the characteristic parameter this is equivalent to the following relations:
[TABLE]
4.18 is automatically satisfied from the second equation of 4.14 and the characteristic relation . 4.17 and 4.15 need to be shown. For this we take a derivative with respect to of these equations. We have
[TABLE]
[TABLE]
summation over and is implicit. The change of the order of the partial derivatives are allowed since and are (If we had started with a assumption on the and the initial condition functions , and the of 4.14 would have been as a function of but the change of the order of the partial derivatives in 4.2 would still be allowed since and are ). We also used the fact that the inverse map is differentiable, in particular , in the above relations, this follows from the fact that the map is and we know that near the initial condition hyperplane since at the initial condition hyperplane the coordinates are the same as and for . Considering everything as a function of with and rewriting in terms of partial derivatives with respect to and noting that , we obtain
[TABLE]
. Considering the coefficients of , and as known functions of , which based on the assumptions of the theorem are , it can be seen that the functions and satisfy a linear homogeneous first order partial differential equation191919In order for to satisfy a linear system of PDE, should be at least two times differentiable, this is the main reason the coefficients and the initial condition in 4.10 were assumed so that the solution of 4.14 and in particular would be . We do not rule out the possibility of improving this differentiability assumption. For example with a assumption on the coefficients and , 4.2 and 4.2 are still valid as the change of the order of partial derivatives is still allowed as mentioned in the sentences below equation 4.2. In this case 4.2 and 4.2 are linear homogeneous partial differential equations for and in different coordinate systems(!) with coefficients that are at least continuous and it obviously has a solution of zero based on an initial condition of zero. If this can be defined properly and a similar conjecture as Conjecture 1 holds for it then it is possible to start with a assumption on and . A more optimum differentiability assumption is that we start with a assumption with Lipschitz continuous derivatives on and , in this case if we assume there is a solution with Lipschitz continuous derivatives to 4.10 then this solution will inevitably be given by the unique Lipschitz solution to 4.14. In this case it might be possible to show that this Lipschitz solution solves 4.10 near as this is true for when we only have one equation with one unknown function (when ) in 4.10 as stated in [1]. in the form of relation 4.9 202020With near after dividing 4.21 by we obtain a similar form as 4.9. Note that the term in the second relation of 4.21 can be eliminated by multiplying the first relation of 4.21 by and adding it to the second relation of 4.21., and since they vanish on the initial condition hyperplane , assuming Conjecture 1 holds, they should also vanish near the initial condition hyperplane 2121214.21 clearly has a solution of zero based on an initial condition of zero. We might ask the question as to whether this is a unique solution. Here we will try to argue in favour of a unique solution. Having another solution other than zero would lead to some unsatisfactory results. For example if we have a non-zero solution then a constant multiple of that solution would also be a solution based on an initial condition of zero and this generates an infinite family of solutions. Or considering the discretization of the system of PDE of 4.21 the values of the discretized solution obtained at each discretized hyperplane parallel to the initial condition hyperplane would all be zero, therefore it seems that a non-trivial solution cannot be captured by the discretization of the system of PDE of 4.21. Also from [3] it is known that when the matrices are symmetric, 4.9 can have at most one solution. Therefore it seems plausible to conjecture that Conjecture 1 holds for general matrices and accordingly the linear homogeneous first order system of PDE of 4.21 would admit at most one solution locally based on an initial condition of zero.. Therefore 4.15 and relations 4.17 and 4.18 (or equivalently 4.16) are valid near . This shows that of 4.14 solves the system of PDE of 4.10 near and since is , would be . It is also possible to combine the results of Subsections 4.1 and 4.2 easily by extending the definition of the initial condition and functions of 4.10 to have a parametric dependence on a compact parameter space. With assuming the conditions and assumptions in this Subsection hold for any fixed (or in other words for any spectator argument) in the compact parameter space the discussion of this Subsection is similarly valid without any change. The only point to note is that with a assumption on the initial condition and the functions , the solutions obtained for the system of PDE of 4.14 will be with respect to the and space, therefore and () will be with respect to the and space.
At the end of this Subsection we note that the initial condition can also be defined on an arbitrary hypersurface instead of a hyperplane. In this case it is possible to reduce the problem to one that is defined on a hyperplane by a change of variables. Consider the following hypersurface , for , and has rank . We demand that the functions solving 4.10 reduce to on this hypersurface for some set of initial condition functions . Since the rank of is at any point there exists rows of the matrix that are linearly independent. Without loss of generality we take the first rows to be linearly independent. Therefore we can change coordinates from to near . Since () near the inverse map is also . Next we change coordinates from to with and in this new coordinate system the hypersurface near is given by . Note that the functions of 4.10 and the initial condition functions remain in this new coordinate system, , .
4.3 Application to hyperbolic quasilinear systems of first order PDE in two independent variables
In this Subsection we will show that a hyperbolic quasilinear system of first order PDE in two independent variables can be reduced to the system of PDE of Theorem 3.1. Consider the following hyperbolic quasilinear system of first order PDE in two independent variables and
[TABLE]
and are and matrices, respectively, with Lipschitz continuous derivatives defined on with , for , and defined similar to Theorem 3.1. It is assumed that has real eigenvalues which form a diagonal matrix and linearly independent left eigenvectors which form a matrix with determinant one, and are also considered with Lipschitz continuous derivatives 222222For when the eigenvalues are distinct this follows from the fact that is with Lipschitz continuous derivatives.. Furthermore we demand that the functions reduce to a set of initial condition functions on , for , being with Lipschitz continuous derivatives and , for , defined similar to Theorem 3.1.
To reduce the system of PDE above to the form of Theorem 3.1 take the derivative of 4.22 with respect to
[TABLE]
summation over is implicit, we have changed the order of the partial derivatives 232323The change of the order of derivatives is allowed almost everywhere since based on the differentiability assumptions on , and , the partial derivative of the solution, , will be Lipschitz and therefore is differentiable almost everywhere. and replaced for and . Next multiply 4.23 by and define the new function variables , we have
[TABLE]
and the PDE for is given by
[TABLE]
(or is also a valid choice instead of 4.25) the system of PDE of 4.24 and 4.25, in terms of the functions and (with ), has the form of Theorem 3.1 with coefficients and initial condition that are Lipschitz. The initial condition is given by , and for . From [3] it is known that 4.22 has a local unique solution with Lipschitz continuous derivatives that satisfies the initial condition, therefore it is clear that this solution is given by the local unique Lipschitz solution of 4.24 and 4.25: and . This shows that Theorem 3.1 gives an alternative way, which is more direct and convenient especially for finding a numerical solution (e.g. The discretized form of the solution can be obtained by considering relation 3.3 for the system of PDE of 4.24 and 4.25), as compared to other methods, e.g. iteration methods [3], for the construction of the solution of hyperbolic quasilinear systems of first order PDE in two independent variables.
Appendix A
In this Appendix we will list the equivalent definitions and relations of Section 3 for when constructing a solution on the domain. The domain is defined as
[TABLE]
and satisfies the 3 conditions listed below relation 3.2. and , similar to before, refer to an upper and lower bound for for on P, respectively. Relation 3.4 is modified to
[TABLE]
for . . , , and for are given by
[TABLE]
and for are given by
[TABLE]
and for given by
[TABLE]
and and given by
[TABLE]
Relation 3.3 is modified to
[TABLE]
Relations 3.19 and 2 are equivalently valid with being the extent which, in general, the solution can be constructed below the initial condition hyperplane and a bound for for and being the Lipschitz constant of or defined in A on .
Appendix B
In this Appendix we will show in detail that the bounds set for the solution in Section 3 at the step of the partitioning lie within the bounds of the step of the partitioning. for in Section 3 was defined such that if is a solution to the system of PDE 3.1 subject to the initial condition and its characteristic curves for pass through the point , with , then for , therefore with defining we have , , i.e. the graph of the solution on is a subset of . Here we will show that .
Lets assume (i): and for (note that this is true for ) and try to prove (ii): and for .
Here we show , the proof of is similar. Based on the definitions in Section 3
[TABLE]
, and are the points which , and assume their maximum values in , and respectively. It can be shown that therefore from the assumption , it follows that . Also it can be shown that and therefore and , this proves .
To complete the proof we have to show , and . Take () , it is clear that and from their definitions given by LABEL:eq:3.6, also lets review the definitions of , and
[TABLE]
from B it is clear that , since and and by assumption (i) and the fact that . Now because this shows that . Also since and
[TABLE]
the last inequalities in the above relation follow from the fact that . From B.3 it can be concluded that and since B.3 holds for all , therefore this shows .
To show , lets review their definitions
[TABLE]
and is given by
[TABLE]
for adding the inequalities in B.5 and in the first relation of B we can conclude that if then
[TABLE]
as previously shown , therefore
[TABLE]
this shows . From the discussion above it is clear that .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Hartman, Philip. ”Ordinary differential equations, Classics in Applied Mathematics, vol. 38, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2002, Corrected reprint of the second (1982) edition.”
- 2[2] Pugh, Charles Chapman, and C. C. Pugh. Real mathematical analysis. Vol. 2011. New York/Heidelberg/Berlin: Springer, 2002.
- 3[3] Courant, Richard, and David Hilbert. ”Methods of Mathematical Physics. Volume II, Partial Differential Equations, R. Courant.” (1962).
- 4[4] Heinonen, Juha. Lectures on Lipschitz analysis. No. 100. University of Jyv skyl , 2005.
