TheoremBase

Truncating the state by the radial retraction onto the ball of radius rho+1 gives a globally Lipschitz problem with a unique solution; a supremum argument with the a priori bound shows this solution never leaves the ball of radius rho, so it solves the original problem, and every solution of the original problem solves the truncated one.

Proof

We prove (i) and (ii); (iii) and (iv) are treated at the end. By Basic Facts about Intervals of the Real Line (v) and Basic Facts about Intervals of the Real Line (ii), for every c∈Rc\in\mathbb{R} with a<c≤ba<c\le b, [a,c][a,c] is an interval containing the two distinct points aa and cc, and [a,c]⊆[a,b][a,c]\subseteq[a,b]. (Rn,dE)(\mathbb{R}^{n},d_{E}) is a metric space by Rn\mathbb{R}^n with the Euclidean Distance Is a Complete Metric Space with Coordinatewise Convergence (i), with dE(u,v)=∥u−v∥d_{E}(u,v)=\lVert u-v\rVert by The Euclidean Distance on Rn\mathbb{R}^n (i), and dd denotes the product metric on R×Rn\mathbb{R}\times\mathbb{R}^{n}. Computations with real numbers below (sums, products, halving, minima, maxima and absolute values of differences) are carried out in the type of The Real Numbers as a Type (i), with differences, quotients and absolute values read there by Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (i), Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (ii) and Differences, Quotients and Absolute Values of Real Numbers, Read in the Type Real (iii). Let FF, ξ\xi and ρ\rho be as in (i).

Step 1: the truncated right-hand side. Let R=ρ+1R=\rho+1. Since ρ≥∥ξ∥≥0\rho\ge\lVert\xi\rVert\ge0 by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i), R>0R>0; choose LR∈RL_{R}\in\mathbb{R} with LR≥0L_{R}\ge0 as in the Lipschitz hypothesis of (i) for this RR, and let πR:Rn→Rn\pi_{R}:\mathbb{R}^{n}\to\mathbb{R}^{n} be the map of Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (i). Let P:[a,b]×Rn→R×RnP:[a,b]\times\mathbb{R}^{n}\to\mathbb{R}\times\mathbb{R}^{n} be the map (t,z)↦(t,πR(z))(t,z)\mapsto(t,\pi_{R}(z)) (which exists by Maps and Relations Given by Formulas (ii), with R×Rn\mathbb{R}\times\mathbb{R}^{n}, [a,b][a,b] and Rn\mathbb{R}^{n} for its bb, cc and dd); its values lie in [a,b]×Rn[a,b]\times\mathbb{R}^{n}.

PP is continuous on [a,b]×Rn[a,b]\times\mathbb{R}^{n}. Let (t0,z0)∈[a,b]×Rn(t_{0},z_{0})\in[a,b]\times\mathbb{R}^{n} and let ε>0\varepsilon>0 be real; let δ=ε/2\delta=\varepsilon/2. Let (t,z)∈[a,b]×Rn(t,z)\in[a,b]\times\mathbb{R}^{n} with d((t0,z0),(t,z))<δd\bigl((t_{0},z_{0}),(t,z)\bigr)<\delta. By The Product Metric is a Metric (iii), ∣t0−t∣<δ|t_{0}-t|<\delta and ∥z0−z∥=dE(z0,z)<δ\lVert z_{0}-z\rVert=d_{E}(z_{0},z)<\delta. By Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (iii), dE(πR(z0),πR(z))≤2∥z0−z∥<εd_{E}\bigl(\pi_{R}(z_{0}),\pi_{R}(z)\bigr)\le2\lVert z_{0}-z\rVert<\varepsilon, and ∣t0−t∣<ε|t_{0}-t|<\varepsilon; by Metric Space (iv) and The Product Metric is a Metric (iii), d(P(t,z),P(t0,z0))<εd\bigl(P(t,z),P(t_{0},z_{0})\bigr)<\varepsilon. So PP is continuous at (t0,z0)(t_{0},z_{0}) relative to [a,b]×Rn[a,b]\times\mathbb{R}^{n}, and continuous on [a,b]×Rn[a,b]\times\mathbb{R}^{n} by Continuous Map Between Metric Spaces (ii).

Let G=F∘P:[a,b]×Rn→RnG=F\circ P:[a,b]\times\mathbb{R}^{n}\to\mathbb{R}^{n}, so that G(t,z)=F(t,πR(z))G(t,z)=F(t,\pi_{R}(z)) (a map by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii), PP being a map into [a,b]×Rn[a,b]\times\mathbb{R}^{n} by Functions, Values of a Function, and Functions from One Class to Another (iii), as its values lie there). By Continuity of Identity Maps, Compositions and Reciprocals (ii), with (R×Rn,d)(\mathbb{R}\times\mathbb{R}^{n},d) in place of (X,dX)(X,d_{X}) and (Y,dY)(Y,d_{Y}), (Rn,dE)(\mathbb{R}^{n},d_{E}) in place of (Z,dZ)(Z,d_{Z}), [a,b]×Rn[a,b]\times\mathbb{R}^{n} in place of AA and BB, and PP and FF in place of ff and gg, GG is continuous on [a,b]×Rn[a,b]\times\mathbb{R}^{n}. For t∈[a,b]t\in[a,b] and z1,z2∈Rnz_{1},z_{2}\in\mathbb{R}^{n} we have ∥πR(z1)∥≤R\lVert\pi_{R}(z_{1})\rVert\le R and ∥πR(z2)∥≤R\lVert\pi_{R}(z_{2})\rVert\le R by Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (ii), so the choice of LRL_{R} and Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (iii) give

∥G(t,z1)−G(t,z2)∥≤LR ∥πR(z1)−πR(z2)∥≤2LR ∥z1−z2∥,\lVert G(t,z_{1})-G(t,z_{2})\rVert\le L_{R}\,\lVert\pi_{R}(z_{1})-\pi_{R}(z_{2})\rVert\le2L_{R}\,\lVert z_{1}-z_{2}\rVert ,

with 2LR≥02L_{R}\ge0. By The Picard–Lindelöf Theorem on a Closed Interval: Existence, Uniqueness and Continuous Dependence for Globally Lipschitz Systems (i), with GG and 2LR2L_{R} in place of FF and LL, the initial value problem with right-hand side GG and initial value ξ\xi has exactly one solution; let x:[a,b]→Rnx:[a,b]\to\mathbb{R}^{n} be this solution. By Solution of an Initial Value Problem on [a,c][a,c] (i), xx is differentiable, x′(t)=G(t,x(t))x'(t)=G(t,x(t)) for every t∈[a,b]t\in[a,b], and x(a)=ξx(a)=\xi; by Rules for Derivatives of Vector- and Matrix-Valued Maps (i), with [a,b][a,b] in place of II, xx is continuous at every t∈[a,b]t\in[a,b] relative to [a,b][a,b].

Step 2: where xx stays in the ball, it solves the original problem. Let c∈Rc\in\mathbb{R} with a<c≤ba<c\le b be such that ∥x(t)∥≤R\lVert x(t)\rVert\le R for every t∈[a,c]t\in[a,c]. We show that the restriction y=x∣[a,c]:[a,c]→Rny=x|_{[a,c]}:[a,c]\to\mathbb{R}^{n} (a map by Domains and Restrictions of Maps (ii), with y(t)=x(t)y(t)=x(t) for t∈[a,c]t\in[a,c] by Domains and Restrictions of Maps (iii)) is a solution on [a,c][a,c] of the initial value problem with right-hand side FF and initial value ξ\xi; consequently, by the a priori hypothesis of (i), ∥x(t)∥=∥y(t)∥≤ρ\lVert x(t)\rVert=\lVert y(t)\rVert\le\rho for every t∈[a,c]t\in[a,c]. Let t∈[a,c]t\in[a,c] and k∈[n]k\in[n]. The component map yky_{k} of Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i) is the restriction xk∣[a,c]x_{k}|_{[a,c]} of the component map xkx_{k} (the two maps [a,c]→R[a,c]\to\mathbb{R} have the same values by Domains and Restrictions of Maps (iii), so they are equal by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iv)); since xkx_{k} is differentiable at tt relative to [a,b][a,b] by Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i), Restriction Stability of Continuity and of the Derivative (ii), with [a,b][a,b] and [a,c][a,c] in place of II and JJ and xkx_{k} in place of ff, shows that yky_{k} is differentiable at tt relative to [a,c][a,c] with yk′(t)=xk′(t)y_{k}'(t)=x_{k}'(t). Hence, by Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i) and Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iii), yy is differentiable at tt with y′(t)=x′(t)y'(t)=x'(t). As ∥x(t)∥≤R\lVert x(t)\rVert\le R, Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (ii) gives πR(x(t))=x(t)\pi_{R}(x(t))=x(t), so

y′(t)=x′(t)=G(t,x(t))=F(t,πR(x(t)))=F(t,y(t)).y'(t)=x'(t)=G\bigl(t,x(t)\bigr)=F\bigl(t,\pi_{R}(x(t))\bigr)=F\bigl(t,y(t)\bigr).

Thus yy is differentiable (Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (iii)), and y(a)=x(a)=ξy(a)=x(a)=\xi; by Solution of an Initial Value Problem on [a,c][a,c] (i), yy is a solution on [a,c][a,c] as claimed.

Step 3: xx stays in the ball. Let SS be the set of c∈[a,b]c\in[a,b] with a<ca<c and ∥x(t)∥≤R\lVert x(t)\rVert\le R for every t∈[a,c]t\in[a,c] (a set by Sets and Maps: Ordinary Notation (iii): the condition on cc is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), with aa, RR, xx, the order ≤\le and the strict order << of R\mathbb{R} and the map u↦∥u∥u\mapsto\lVert u\rVert of The Summation Map on Real-Valued Maps over a Finite Set, and the Dot Product, Euclidean Norm and Euclidean Distance as Maps (iii) as parameters).

SS is nonempty. By continuity of xx at aa (Continuous Map Between Metric Spaces (i), with ε=1\varepsilon=1), choose a real δ0>0\delta_{0}>0 such that every t∈[a,b]t\in[a,b] with ∣a−t∣<δ0|a-t|<\delta_{0} satisfies ∥x(t)−x(a)∥<1\lVert x(t)-x(a)\rVert<1. Let c0c_{0} be the smaller of a+δ0/2a+\delta_{0}/2 and bb; then a<c0≤ba<c_{0}\le b, and every t∈[a,c0]t\in[a,c_{0}] satisfies ∣a−t∣≤δ0/2<δ0|a-t|\le\delta_{0}/2<\delta_{0}, hence, by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi),

∥x(t)∥≤∥x(a)∥+∥x(t)−x(a)∥<∥ξ∥+1≤ρ+1=R.\lVert x(t)\rVert\le\lVert x(a)\rVert+\lVert x(t)-x(a)\rVert<\lVert\xi\rVert+1\le\rho+1=R .

So c0∈Sc_{0}\in S.

The supremum. SS is a subset of R\mathbb{R}, nonempty, and bounded above by bb (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (i)), so it has a supremum c∗=sup⁡Sc^{*}=\sup S by The Real Numbers Form an Ordered Field in Which Every Nonempty Set Bounded Above Has a Supremum (ii). By Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv), c∗c^{*} is an upper bound of SS and c∗≤bc^{*}\le b; as c0∈Sc_{0}\in S, a<c0≤c∗≤ba<c_{0}\le c^{*}\le b.

∥x(t)∥≤ρ\lVert x(t)\rVert\le\rho for every t∈[a,c∗)t\in[a,c^{*}). Let a≤t<c∗a\le t<c^{*}. By Arbitrary Positive Slack, and Approximation of Suprema and Infima, in the Real Numbers (iv) there is c∈Sc\in S with t<ct<c; then t∈[a,c]t\in[a,c], and Step 2, applied to cc, gives ∥x(t)∥≤ρ\lVert x(t)\rVert\le\rho.

∥x(c∗)∥≤ρ\lVert x(c^{*})\rVert\le\rho. Let ε>0\varepsilon>0 be real. By continuity of xx at c∗c^{*} (Continuous Map Between Metric Spaces (i)), choose a real δ>0\delta>0 such that every t∈[a,b]t\in[a,b] with ∣c∗−t∣<δ|c^{*}-t|<\delta satisfies ∥x(t)−x(c∗)∥<ε\lVert x(t)-x(c^{*})\rVert<\varepsilon. Let tt be the larger of aa and c∗−δ/2c^{*}-\delta/2; then a≤t<c∗a\le t<c^{*}, as a<c∗a<c^{*}, and ∣c∗−t∣≤δ/2<δ|c^{*}-t|\le\delta/2<\delta. By the previous paragraph and Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v),

∥x(c∗)∥≤∥x(t)∥+∥x(c∗)−x(t)∥<ρ+ε.\lVert x(c^{*})\rVert\le\lVert x(t)\rVert+\lVert x(c^{*})-x(t)\rVert<\rho+\varepsilon .

As ε>0\varepsilon>0 was arbitrary, ∥x(c∗)∥≤ρ\lVert x(c^{*})\rVert\le\rho by Arbitrary Positive Slack, and Approximation of Suprema and Infima, in the Real Numbers (i). Hence ∥x(t)∥≤ρ\lVert x(t)\rVert\le\rho for every t∈[a,c∗]t\in[a,c^{*}].

c∗=bc^{*}=b. Suppose c∗<bc^{*}<b. By continuity of xx at c∗c^{*} with ε=1\varepsilon=1, choose a real δ1>0\delta_{1}>0 such that every t∈[a,b]t\in[a,b] with ∣c∗−t∣<δ1|c^{*}-t|<\delta_{1} satisfies ∥x(t)−x(c∗)∥<1\lVert x(t)-x(c^{*})\rVert<1, and let c1c_{1} be the smaller of c∗+δ1/2c^{*}+\delta_{1}/2 and bb, so that c∗<c1≤bc^{*}<c_{1}\le b. Let t∈[a,c1]t\in[a,c_{1}]. If t≤c∗t\le c^{*}, then ∥x(t)∥≤ρ<R\lVert x(t)\rVert\le\rho<R. If c∗<tc^{*}<t, then ∣c∗−t∣≤δ1/2<δ1|c^{*}-t|\le\delta_{1}/2<\delta_{1}, and by Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi)

∥x(t)∥≤∥x(c∗)∥+∥x(t)−x(c∗)∥<ρ+1=R.\lVert x(t)\rVert\le\lVert x(c^{*})\rVert+\lVert x(t)-x(c^{*})\rVert<\rho+1=R .

So c1∈Sc_{1}\in S, and c1≤c∗c_{1}\le c^{*} as c∗c^{*} is an upper bound of SS, contradicting c∗<c1c^{*}<c_{1}. Hence c∗=bc^{*}=b, and ∥x(t)∥≤ρ\lVert x(t)\rVert\le\rho for every t∈[a,b]t\in[a,b].

Step 4: existence and the bound. By Step 3, ∥x(t)∥≤ρ≤R\lVert x(t)\rVert\le\rho\le R for every t∈[a,b]t\in[a,b], so Step 2 applies with c=bc=b: x=x∣[a,b]x=x|_{[a,b]} (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol (iii)) is a solution of the initial value problem with right-hand side FF and initial value ξ\xi, and ∥x(t)∥≤ρ\lVert x(t)\rVert\le\rho for every t∈[a,b]t\in[a,b].

Step 5: uniqueness. Let yy be a solution of the initial value problem with right-hand side FF and initial value ξ\xi. By the a priori hypothesis of (i) with c=bc=b, ∥y(t)∥≤ρ≤R\lVert y(t)\rVert\le\rho\le R for every t∈[a,b]t\in[a,b], so πR(y(t))=y(t)\pi_{R}(y(t))=y(t) by Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (ii). By Solution of an Initial Value Problem on [a,c][a,c] (i), yy is differentiable, y(a)=ξy(a)=\xi, and for every t∈[a,b]t\in[a,b]

y′(t)=F(t,y(t))=F(t,πR(y(t)))=G(t,y(t));y'(t)=F\bigl(t,y(t)\bigr)=F\bigl(t,\pi_{R}(y(t))\bigr)=G\bigl(t,y(t)\bigr);

so yy is a solution of the initial value problem with right-hand side GG and initial value ξ\xi, by Solution of an Initial Value Problem on [a,c][a,c] (i), and y=xy=x by the uniqueness in The Picard–Lindelöf Theorem on a Closed Interval: Existence, Uniqueness and Continuous Dependence for Globally Lipschitz Systems (i). With Step 4 this proves (i); and as the solution of (i) is xx, Step 4 proves (ii).

Proof of (iii) and (iv). The argument above applies word for word, with Mp×q(R)\mathcal{M}_{p\times q}(\mathbb{R}), dp×qd_{p\times q}, the operator norm, Ξ\Xi, the map ΠR\Pi_{R} of Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (i), the entry maps and the indices i∈[p]i\in[p], j∈[q]j\in[q], The Initial Value Problem for a First-Order System of Ordinary Differential Equations (ii) and Solution of an Initial Value Problem on [a,c][a,c] (ii) in place of Rn\mathbb{R}^{n}, dEd_{E}, the Euclidean norm, ξ\xi, πR\pi_{R}, the component maps and the index k∈[n]k\in[n], The Initial Value Problem for a First-Order System of Ordinary Differential Equations (i) and Solution of an Initial Value Problem on [a,c][a,c] (i); using that (Mp×q(R),dp×q)(\mathcal{M}_{p\times q}(\mathbb{R}),d_{p\times q}) is a metric space by The Real Matrices with the Operator-Norm Distance Form a Complete Metric Space with Entrywise Convergence (i), with dp×q(A,B)=∥A−B∥d_{p\times q}(A,B)=\lVert A-B\rVert by The Distance between Real Matrices (i); the operator norm as a map Mp×q(R)→R\mathcal{M}_{p\times q}(\mathbb{R})\to\mathbb{R} by The Operator Norm of a Real Matrix (i) in place of the map of The Summation Map on Real-Valued Maps over a Finite Set, and the Dot Product, Euclidean Norm and Euclidean Distance as Maps (iii); Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (i), Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (vi) and Rules for the Operator Norm: Bound, Least Constant, Definiteness, Homogeneity, Triangle Inequality and Products (v) in place of Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (i), Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (vi) and Properties of the Euclidean Norm on Rn\mathbb{R}^n: Square, Distance, Vanishing, Coordinate Bounds, Homogeneity, Triangle Inequalities and Expansion of a Square (v); Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (ii) and Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (iii) in place of Derivative of a Vector-Valued or Matrix-Valued Map on an Interval (i) and Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations (iii); the matrix halves of Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (ii), Radial Retraction onto a Closed Ball in ℝⁿ and in the Real Matrices (iii) and Rules for Derivatives of Vector- and Matrix-Valued Maps (i); and The Picard–Lindelöf Theorem on a Closed Interval: Existence, Uniqueness and Continuous Dependence for Globally Lipschitz Systems (iii) in place of The Picard–Lindelöf Theorem on a Closed Interval: Existence, Uniqueness and Continuous Dependence for Globally Lipschitz Systems (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…