Math 2.0

Ordinary differential equations Proof

Proof that C^1 vector fields satisfy the Picard–Lindelöf hypotheses

Builds on Picard–Lindelöf hypothesesLipschitz conditionOpen ballHeine–Borel theoremContinuous real function on a compact set attains its boundsCauchy–Schwarz inequalityMean value inequality

Proof

Here ∥⋅∥\norm{\cdot} is the Euclidean norm, and Df(z)Df(z) is the Jacobian matrix of ff at zz. Its entries ∂fi/∂xj\partial f_i / \partial x_j are continuous on UU, since ff is continuously differentiable.

  1. Since UU is open, there is r>0r > 0 such that the open ball of radius rr around x0x_0 lies in UU. Let a=r/2>0a = r/2 > 0.
  2. The closed ball B={x:∥x−x0∥≤a}B = \set{x : \norm{x - x_0} \le a} lies in that open ball, so B⊆UB \subseteq U. It is closed, bounded and nonempty, so it is compact by the Heine–Borel theorem.
  3. The function z↦∥f(z)∥z \mapsto \norm{f(z)} is continuous on UU. By the extreme value theorem on compact sets, it has a maximum L≥0L \ge 0 on BB. So ∥f(x)∥≤L\norm{f(x)} \le L for x∈Bx \in B.
  4. The function z↦(∑i,j(∂fi/∂xj(z))2)1/2z \mapsto \left(\sum_{i, j} \left(\partial f_i / \partial x_j (z)\right)^2\right)^{1/2} is continuous on UU. Let K≥0K \ge 0 be its maximum on BB.
  5. Let z∈Bz \in B and h∈ℝnh \in \R^n. Entry ii of Df(z)hDf(z) h is the dot product of row ii of Df(z)Df(z) with hh. The Cauchy–Schwarz inequality bounds it, and summing the squares gives ∥Df(z)h∥≤K∥h∥\norm{Df(z) h} \le K \norm{h}.
  6. So the operator norm of Df(z)Df(z) is at most KK for each z∈Bz \in B.
  7. Let x,y∈Bx, y \in B and 0≤s≤10 \le s \le 1. Then ∥x+s(y−x)−x0∥≤(1−s)∥x−x0∥+s∥y−x0∥≤a\norm{x + s(y - x) - x_0} \le (1 - s) \norm{x - x_0} + s \norm{y - x_0} \le a. So the segment [x,y][x, y] lies in B⊆UB \subseteq U.
  8. By the mean value inequality and step 6, ∥f(y)−f(x)∥≤K∥y−x∥\norm{f(y) - f(x)} \le K \norm{y - x} for all x,y∈Bx, y \in B.
  9. Let ε=a/(L+1)>0\varepsilon = a/(L + 1) > 0 and J=[t0−ε,t0+ε]J = [t_0 - \varepsilon, t_0 + \varepsilon]. Let g:J×ℝn→ℝng : J \times \R^n \to \R^n be any function with g(t,x)=f(x)g(t, x) = f(x) for t∈Jt \in J and x∈Bx \in B.
  10. Condition (1) of the Picard–Lindelöf hypotheses: for each t∈Jt \in J, x↦g(t,x)=f(x)x \mapsto g(t, x) = f(x) is KK-Lipschitz on BB, by step 8.
  11. Condition (2): for each x∈Bx \in B, t↦g(t,x)=f(x)t \mapsto g(t, x) = f(x) is constant, hence continuous on JJ.
  12. Condition (3): ∥g(t,x)∥=∥f(x)∥≤L\norm{g(t, x)} = \norm{f(x)} \le L for t∈Jt \in J and x∈Bx \in B, by step 3.
  13. Condition (4): here max⁡(tmax⁡−t0,t0−tmin⁡)=ε\max(t_{\max} - t_0, t_0 - t_{\min}) = \varepsilon, and Lε=La/(L+1)≤aL \varepsilon = L a/(L + 1) \le a.
  14. So gg satisfies the hypotheses at (t0,x0)(t_0, x_0) on JJ with the constants a,L,Ka, L, K.

Idea

A small closed ball around x0x_0 is compact. On it, the continuous functions ∥f∥\norm{f} and ∥Df∥\norm{Df} are bounded, which gives the bound LL and, through the mean value inequality, the Lipschitz constant KK. A short time interval then keeps Lε≤aL \varepsilon \le a.

Reading path

To understand this page from the ground up, read these 318 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, Proof of Rolle's theorem, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof that open sets are the sets that are neighbourhoods of all their points, Proof of the commutativity of addition by induction, Proof of the Lebesgue number lemma by a finite cover of balls, Proof of the epsilon-delta form of continuity, Proof of the triangle inequality for norms, Proof that a complex number times its conjugate is the square of its modulus, Proof of the Cauchy–Schwarz inequality, Proof of the Heine–Borel theorem by sequential compactness, Proof that there is a natural number n with 1/n below any positive epsilon, Proof of the chain rule in several variables, Proof of the derivative as a little-o approximation, Proof of the equality of complex numbers, Proof that a linear map between normed spaces is continuous if and only if it is bounded, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of continuity via closed sets, Proof of the double negation law by a truth table, Proof of the extreme value theorem by the Bolzano–Weierstrass theorem, Proof that compact subsets of a metric space are bounded, Proof that compactness and sequential compactness agree in metric spaces, Proof that subsequences of a convergent sequence converge to the same limit, Proof of the uniqueness of limits, Proof that the coordinate map is a linear isomorphism, Proof of strong induction from ordinary induction, Proof that linear maps on finite-dimensional normed spaces are continuous, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of the existence of square roots of nonnegative reals, Proof of the chain rule for a composition with a curve, Proof of the linearity of differentiation, Proof that a continuous image of a compact set is compact, Proof that compact subsets of a Hausdorff space are closed, Proof that the composition of continuous maps is continuous, Proof of epsilon-delta continuity at a point in metric spaces, Proof of the sequential characterization of limits, Proof of the description of the open sets of a metric space, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that compactness of a subset can be tested with open sets of the ambient space, Proof of the existence of the infimum by negation, Proof of the equivalence of norms in finite dimension by compactness of the unit sphere, Proof that every spanning set contains a basis, by Zorn's lemma, Proof of Fermat's theorem on stationary points, Proof that limits preserve non-strict inequalities, Proof that closed sets contain their limits, Proof of Zorn's lemma, Proof that metric spaces are Hausdorff, Proof of the sequence characterisation of uniform continuity, Proof of the epsilon-delta form of the limit of a function, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof of the Archimedean property in an Archimedean ordered field, Proof that a continuous real function on a compact set attains its bounds, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof that continuity is equivalent to sequential continuity, Proof that open balls are open, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof that Lipschitz maps are uniformly continuous, Proof that a set is open if and only if its complement is closed, Proof of the mean value theorem from Rolle's theorem, Proof of continuity via open sets in metric spaces, Proof of the mean value inequality, Proof of the constant multiple rule.

  1. Basis concept
  2. Complex numbers object
  3. Complex numbers as pairs of reals concept
  4. Construction of the reals from Cauchy sequences concept
  5. Coordinate space object
  6. Coordinate vector concept
  7. Definition by recursion concept
  8. Differential equation concept
  9. Element definition
  10. Euclidean metric example
  11. Euclidean space object
  12. Extended real number line object
  13. Function concept
  14. Function composition concept
  15. Imaginary unit object
  16. Inner product concept
  17. Inner product space concept
  18. Integers object
  19. Interval concept
  20. Limit point of a set definition
  21. Linear isomorphism concept
  22. Linear map concept
  23. Local maximum definition
  24. Mathematical induction concept
  25. Natural numbers object
  26. Norm concept
  27. Norm induced by an inner product concept
  28. Ordered field definition
  29. Peano axioms concept
  30. Proof of Zorn's lemma proof
  31. Proposition concept
  32. Rational numbers object
  33. Real numbers object
  34. Sequence definition
  35. Set bounded above definition
  36. Vector space definition
  37. p-metric on R^n example
  38. Real and imaginary parts definition
  39. Set definition
  40. Ordinary differential equation definition
  41. Fréchet derivative definition
  42. Total derivative concept
  43. Function of several variables concept
  44. Vector-valued function concept
  45. Lipschitz condition definition
  46. Ring of integers statement
  47. Limit of a function definition
  48. Local minimum definition
  49. Successor function definition
  50. Archimedean ordered field definition
  51. Conjunction definition
  52. Disjunction definition
  53. Implication definition
  54. Negation definition
  55. Predicate definition
  56. The reals form a field statement
  57. Real sequence definition
  58. Subsequence definition
  59. Infimum definition
  60. Supremum definition
  61. Inner product definition
  62. Linear combination definition
  63. Linear map definition
  64. Linear subspace definition
  65. Norm definition
  66. p-norm on R^n example
  67. Complex conjugate definition
  68. Empty set object
  69. Family of sets definition
  70. Ordered pair definition
  71. Differentiable function of several variables concept
  72. Partial derivative concept
  73. Intersection definition
  74. Limit of a function of several variables concept
  75. Union definition
  76. Parametrised curve concept
  77. Continuity at a point definition
  78. Derivative definition
  79. Solution of an ordinary differential equation definition
  80. Addition of natural numbers definition
  81. Biconditional definition
  82. Truth table concept
  83. Modus ponens concept
  84. Existential quantifier definition
  85. Universal quantifier definition
  86. Bounded sequence definition
  87. Limit of a sequence definition
  88. Monotone sequence definition
  89. Proof of the Archimedean property in an Archimedean ordered field proof
  90. The rationals form a field statement
  91. The successor function is injective statement
  92. Zero is not a successor statement
  93. Inner product space definition
  94. Linear independence definition
  95. Composition of linear maps definition
  96. Linear isomorphism definition
  97. Linear span definition
  98. Normed vector space definition
  99. Completeness axiom statement
  100. Cartesian product definition
  101. Proof of the equality of complex numbers proof
  102. Gradient concept
  103. Initial value problem definition
  104. Differentiable function of several variables definition
  105. Union of a family of sets definition
  106. Continuous function definition
  107. Subset definition
  108. Differentiable function definition
  109. Proof of the commutativity of addition by induction proof
  110. Mathematical proof concept
  111. Archimedean property statement
  112. Proof of the derivative as a little-o approximation proof
  113. Propositional logic concept
  114. Uniqueness quantifier definition
  115. Order on the natural numbers definition
  116. Convergent sequence definition
  117. Sequential continuity definition
  118. The rationals form an ordered field statement
  119. Norm induced by an inner product definition
  120. Spanning set definition
  121. Equality of complex numbers statement
  122. Binary relation definition
  123. Universal set definition
  124. Topological space definition
  125. Picard–Lindelöf hypotheses definition
  126. Derivative as a little-o approximation statement
  127. Order on the reals definition
  128. Tautology definition
  129. Commutativity of addition statement
  130. Proof of strong induction from ordinary induction proof
  131. Finite-dimensional vector space definition
  132. Basis definition
  133. Antisymmetric relation definition
  134. Reflexive relation definition
  135. Transitive relation definition
  136. Sequential compactness definition
  137. Subspace topology definition
  138. Complement definition
  139. Interval definition
  140. Function definition
  141. Coordinate vector definition
  142. Logical equivalence definition
  143. Strong induction statement
  144. Preorder definition
  145. Choice function definition
  146. Codomain definition
  147. Function composition definition
  148. Identity function definition
  149. Image of a set definition
  150. Injective function definition
  151. Preimage of a set definition
  152. Proof of the epsilon-delta form of the limit of a function proof
  153. Proof of the epsilon-delta form of continuity proof
  154. Metric space definition
  155. Proof of the well-ordering principle from strong induction proof
  156. Proof of the double negation law by a truth table proof
  157. Partial order definition
  158. Left inverse definition
  159. Right inverse definition
  160. Axiom of choice statement
  161. Surjective function definition
  162. Epsilon-delta definition of a limit statement
  163. Epsilon-delta definition of continuity statement
  164. Closed ball definition
  165. Convergence of a sequence in a metric space definition
  166. Lipschitz map definition
  167. Open ball definition
  168. Triangle inequality for a metric statement
  169. Double negation law statement
  170. Diameter of a set definition
  171. Well-ordering principle statement
  172. Maximal element definition
  173. Total order definition
  174. Upper bound definition
  175. Bijective function definition
  176. Metric topology definition
  177. Bounded set definition
  178. Proof by contradiction concept
  179. Proof that every sequence has a monotone subsequence, by peaks proof
  180. Chain definition
  181. Open set definition
  182. Proof that a function is bijective iff it has a two-sided inverse proof
  183. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  184. Every sequence has a monotone subsequence statement
  185. Bijective iff it has a two-sided inverse statement
  186. Hausdorff space definition
  187. Closed set definition
  188. Open cover definition
  189. Proof that open sets are the sets that are neighbourhoods of all their points proof
  190. Continuous map of topological spaces definition
  191. Equivalent metrics definition
  192. Proof of the description of the open sets of a metric space proof
  193. Zorn's lemma statement
  194. The reals form an ordered field statement
  195. Proof that a set is open if and only if its complement is closed proof
  196. Compact space definition
  197. Open sets characterised by neighbourhoods statement
  198. Proof that the composition of continuous maps is continuous proof
  199. Equivalent norms definition
  200. Open sets of a metric space statement
  201. Proof that the coordinate map is a linear isomorphism proof
  202. Absolute value definition
  203. Proof that every spanning set contains a basis, by Zorn's lemma proof
  204. Proof of the approximation property of the supremum proof
  205. Proof of the existence of the infimum by negation proof
  206. Proof of the existence of square roots of nonnegative reals proof
  207. Complement of an open set is closed statement
  208. Compact set definition
  209. Composition of continuous maps is continuous statement
  210. Continuity at a point of a topological space definition
  211. Continuous linear map definition
  212. Proof that closed sets contain their limits proof
  213. Proof of the triangle inequality for real numbers proof
  214. Proof that the absolute value is multiplicative proof
  215. Proof that open balls are open proof
  216. Every spanning set contains a basis statement
  217. Proof of the epsilon-N definition of the limit of a sequence proof
  218. Isomorphism with the coordinate space statement
  219. Approximation property of the supremum statement
  220. Existence of the infimum statement
  221. Existence of square roots of nonnegative reals statement
  222. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  223. Proof of continuity via closed sets proof
  224. Closed sets contain their limits statement
  225. Triangle inequality statement
  226. Absolute value is multiplicative statement
  227. Open balls are open statement
  228. Square root definition
  229. Epsilon-N definition of the limit of a sequence statement
  230. Proof that the reals are Archimedean from the completeness axiom proof
  231. Compactness via open covers statement
  232. Modulus of a complex number definition
  233. Continuity via closed sets statement
  234. Proof of the limit of a sum of sequences proof
  235. Proof of the uniqueness of limits proof
  236. Proof of epsilon-delta continuity at a point in metric spaces proof
  237. Proof of continuity via open sets in metric spaces proof
  238. Proof that limits preserve non-strict inequalities proof
  239. Proof of the Lebesgue number lemma by a finite cover of balls proof
  240. Proof of the squeeze theorem for sequences proof
  241. Proof that metric spaces are Hausdorff proof
  242. Proof that convergent sequences are bounded proof
  243. The reals are Archimedean statement
  244. Proof that subsequences of a convergent sequence converge to the same limit proof
  245. Proof of the monotone convergence theorem for sequences proof
  246. Proof that compact subsets of a Hausdorff space are closed proof
  247. Proof that a complex number times its conjugate is the square of its modulus proof
  248. Proof that a continuous image of a compact set is compact proof
  249. Epsilon-delta continuity in metric spaces statement
  250. Proof that compact subsets of a metric space are bounded proof
  251. Lebesgue number lemma statement
  252. Metric spaces are Hausdorff statement
  253. Proof that compactness and sequential compactness agree in metric spaces proof
  254. Limit of a sum of sequences statement
  255. Proof of the sequence characterisation of uniform continuity proof
  256. Uniqueness of limits statement
  257. Limits preserve non-strict inequalities statement
  258. Proof of the triangle inequality for norms proof
  259. Convergent sequences are bounded statement
  260. Squeeze theorem statement
  261. Subsequences of a convergent sequence converge to the same limit statement
  262. Proof that there is a natural number n with 1/n below any positive epsilon proof
  263. Monotone convergence theorem for sequences statement
  264. A complex number times its conjugate statement
  265. Compact subsets of a Hausdorff space are closed statement
  266. Continuous image of a compact set is compact statement
  267. Compactness and sequential compactness agree in metric spaces statement
  268. Compact subsets of a metric space are bounded statement
  269. Continuity via open sets statement
  270. Proof of the limit of a product of sequences proof
  271. Epsilon-delta uniform continuity statement
  272. There is a natural number n with 1/n below any positive epsilon statement
  273. Proof that a decreasing sequence bounded below converges proof
  274. Triangle inequality for norms statement
  275. Proof that a linear map between normed spaces is continuous if and only if it is bounded proof
  276. Proof that Lipschitz maps are uniformly continuous proof
  277. Proof of the sequential characterization of limits proof
  278. Proof that continuity is equivalent to sequential continuity proof
  279. Proof of the Cauchy–Schwarz inequality proof
  280. Decreasing sequence bounded below converges statement
  281. Limit of a product of sequences statement
  282. Lipschitz maps are uniformly continuous statement
  283. Continuity is equivalent to sequential continuity statement
  284. Sequential characterization of limits statement
  285. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  286. Cauchy–Schwarz inequality statement
  287. Bounded linear maps are continuous statement
  288. Proof of the linearity of differentiation proof
  289. Bolzano–Weierstrass theorem statement
  290. Linearity of differentiation statement
  291. Proof of the Heine–Borel theorem by sequential compactness proof
  292. Operator norm definition
  293. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  294. Proof of the constant multiple rule proof
  295. Heine–Borel theorem statement
  296. Boundedness theorem statement
  297. Constant multiple rule statement
  298. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  299. Proof that a continuous real function on a compact set attains its bounds proof
  300. Extreme value theorem statement
  301. Continuous real function on a compact set attains its bounds statement
  302. Proof of Fermat's theorem on stationary points proof
  303. Proof of the equivalence of norms in finite dimension by compactness of the unit sphere proof
  304. Fermat's theorem on stationary points statement
  305. Equivalence of norms in finite dimension statement
  306. Proof of Rolle's theorem proof
  307. Rolle's theorem statement
  308. Proof that linear maps on finite-dimensional normed spaces are continuous proof
  309. Linear maps on finite-dimensional spaces are continuous statement
  310. Proof of the mean value theorem from Rolle's theorem proof
  311. Mean value theorem statement
  312. Proof of the chain rule in several variables proof
  313. Chain rule in several variables statement
  314. Proof of the chain rule for a composition with a curve proof
  315. Chain rule for a composition with a curve statement
  316. Proof of the mean value inequality proof
  317. Mean value inequality statement
  318. Proof that C^1 vector fields satisfy the Picard–Lindelöf hypotheses proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Picard%E2%80%93Lindel%C3%B6f_theorem, Theorem
About this page
TagB711ES8JNY
URIm2://B711ES8JNY
Kindproof
WritingW0 stub
MSC34A12
ProvesC^1 vector fields satisfy the Picard–Lindelöf hypotheses
UsesPicard–Lindelöf hypotheses, Lipschitz condition, Open ball, Heine–Borel theorem, Continuous real function on a compact set attains its bounds, Cauchy–Schwarz inequality, Mean value inequality
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.