Math 2.0

Ordinary differential equations Proof

Proof of the Peano existence theorem by Euler polygons

Builds on Initial value problemHeine–Borel theorem in finite-dimensional normed spacesContinuous image of a compact set is compactHeine–Cantor theoremEquicontinuityArzelà–Ascoli theoremCompactness and sequential compactness agree in metric spacesUniform convergenceTriangle inequality for integralsMonotonicity of the integralLinearity of the integralFirst fundamental theorem of calculus

Proof

We build Euler polygons, extract a uniformly convergent subsequence with the Arzelà–Ascoli theorem, and show that the limit solves the integral equation.

  1. On ℝn\mathbb{R}^n we use the norm ∣x∣=max⁡i∣xi∣\abs{x} = \max_i \abs{x_i}, and on ℝ×ℝn\mathbb{R} \times \mathbb{R}^n the norm max⁡(∣t∣,∣x∣)\max(\abs{t}, \abs{x}). Integrals of vector functions are taken coordinatewise. For continuous vv on [c,d][c, d], the triangle inequality for integrals and monotonicity of the integral in each coordinate give ∣∫cdv∣≤∫cd∣v∣\abs{\int_c^d v} \le \int_c^d \abs{v}.
  2. Since DD is open, there are a,b>0a, b > 0 such that R=[t0−a,t0+a]×{x:∣x−x0∣≤b}R = [t_0 - a, t_0 + a] \times \set{x : \abs{x - x_0} \le b} lies in DD.
  3. The set RR is closed and bounded, so it is compact by the Heine–Borel theorem. Its image under the continuous map ∣f∣\abs{f} is compact, hence bounded. Choose M>0M > 0 with ∣f(p)∣≤M\abs{f(p)} \le M for all p∈Rp \in R.
  4. By the Heine–Cantor theorem, ff is uniformly continuous on RR.
  5. Let h=min⁡(a,b/M)h = \min(a, b/M) and X=[t0−h,t0+h]X = [t_0 - h, t_0 + h]. For an integer N≥1N \ge 1, let tk=t0+kh/Nt_k = t_0 + k h / N for k=−N,…,Nk = -N, \dots, N.
  6. Define xN:X→ℝnx_N : X \to \mathbb{R}^n by xN(t0)=x0x_N(t_0) = x_0 and, step by step outward from t0t_0, xN(t)=xN(tk)+(t−tk) f(tk,xN(tk))x_N(t) = x_N(t_k) + (t - t_k)\, f(t_k, x_N(t_k)). For k≥0k \ge 0 this is used for t∈[tk,tk+1]t \in [t_k, t_{k+1}], and for k≤0k \le 0 for t∈[tk−1,tk]t \in [t_{k-1}, t_k].
  7. We show by induction on ∣k∣\abs{k} that this is well defined and that ∣xN(t)−x0∣≤M∣t−t0∣\abs{x_N(t) - x_0} \le M \abs{t - t_0}. Assume the bound holds at tkt_k. Then ∣xN(tk)−x0∣≤Mh≤b\abs{x_N(t_k) - x_0} \le M h \le b and ∣tk−t0∣≤a\abs{t_k - t_0} \le a, so (tk,xN(tk))∈R(t_k, x_N(t_k)) \in R.
  8. So f(tk,xN(tk))f(t_k, x_N(t_k)) is defined and has norm at most MM. On the next piece, ∣xN(t)−x0∣≤M∣tk−t0∣+M∣t−tk∣=M∣t−t0∣\abs{x_N(t) - x_0} \le M \abs{t_k - t_0} + M \abs{t - t_k} = M \abs{t - t_0}, since tkt_k lies between t0t_0 and tt. This completes the induction.
  9. Each xNx_N is continuous and piecewise linear, with slopes of norm at most MM. Splitting [t′,t][t', t] at the nodes and using the triangle inequality gives ∣xN(t)−xN(t′)∣≤M∣t−t′∣\abs{x_N(t) - x_N(t')} \le M \abs{t - t'} for all t,t′∈Xt, t' \in X.
  10. By steps 8 and 9, each coordinate family {xN,i:N≥1}\set{x_{N, i} : N \ge 1} is bounded by ∣x0∣+b\abs{x_0} + b. It is equicontinuous, with δ=ε/M\delta = \varepsilon / M for each ε>0\varepsilon > 0.
  11. By the Arzelà–Ascoli theorem, the closure of the family of first coordinates is compact in C(X)C(X). By sequential compactness, some subsequence of (xN,1)(x_{N,1}) converges in C(X)C(X), that is uniformly.
  12. Repeating step 11 for coordinates 2,…,n2, \dots, n, each time inside the previous subsequence, gives N1<N2<⋯N_1 < N_2 < \cdots and a continuous z:X→ℝnz : X \to \mathbb{R}^n with sup⁡t∈X∣xNj(t)−z(t)∣→0\sup_{t \in X} \abs{x_{N_j}(t) - z(t)} \to 0.
  13. Letting j→∞j \to \infty in step 8 gives ∣z(t)−x0∣≤M∣t−t0∣≤b\abs{z(t) - x_0} \le M \abs{t - t_0} \le b. So (t,z(t))∈R⊆D(t, z(t)) \in R \subseteq D for t∈Xt \in X, and z(t0)=x0z(t_0) = x_0.
  14. Let ε>0\varepsilon > 0. By step 4, choose η>0\eta > 0 with ∣f(p)−f(q)∣<ε\abs{f(p) - f(q)} < \varepsilon for p,q∈Rp, q \in R with distance less than η\eta.
  15. Let eN(t)=xN(t)−x0−∫t0tf(s,xN(s)) dse_N(t) = x_N(t) - x_0 - \int_{t_0}^t f(s, x_N(s))\, ds for t∈Xt \in X. The integrand is continuous, since xNx_N is continuous.
  16. Let t≥t0t \ge t_0 lie in [tk,tk+1][t_k, t_{k+1}]. By step 6, xN(t)−x0x_N(t) - x_0 is the sum of the integrals of the constants f(tj,xN(tj))f(t_j, x_N(t_j)) over the pieces [tj,tj+1][t_j, t_{j+1}] for j<kj < k and over [tk,t][t_k, t].
  17. So, by linearity of the integral, eN(t)e_N(t) is the sum over these pieces of the integrals of f(tj,xN(tj))−f(s,xN(s))f(t_j, x_N(t_j)) - f(s, x_N(s)), with ss in the piece of tjt_j.
  18. For ss in that piece, ∣s−tj∣≤h/N\abs{s - t_j} \le h / N and, by step 9, ∣xN(s)−xN(tj)∣≤Mh/N\abs{x_N(s) - x_N(t_j)} \le M h / N. If NN is so large that h/N<ηh/N < \eta and Mh/N<ηMh/N < \eta, each integrand has norm less than ε\varepsilon.
  19. By step 1 the pieces of total length t−t0t - t_0 then give ∣eN(t)∣≤εh\abs{e_N(t)} \le \varepsilon h. The case t≤t0t \le t_0 is the same. So sup⁡X∣eN∣→0\sup_X \abs{e_N} \to 0 as N→∞N \to \infty.
  20. For large jj, ∣xNj(s)−z(s)∣<η\abs{x_{N_j}(s) - z(s)} < \eta for all s∈Xs \in X, so ∣f(s,xNj(s))−f(s,z(s))∣<ε\abs{f(s, x_{N_j}(s)) - f(s, z(s))} < \varepsilon. By step 1, ∣∫t0t(f(s,xNj(s))−f(s,z(s)))ds∣≤εh\abs{\int_{t_0}^t \left( f(s, x_{N_j}(s)) - f(s, z(s)) \right) ds} \le \varepsilon h for all t∈Xt \in X.
  21. For t∈Xt \in X, z(t)−x0−∫t0tf(s,z(s)) dsz(t) - x_0 - \int_{t_0}^t f(s, z(s))\, ds equals (z(t)−xNj(t))+eNj(t)+∫t0t(f(s,xNj(s))−f(s,z(s)))ds\left( z(t) - x_{N_j}(t) \right) + e_{N_j}(t) + \int_{t_0}^t \left( f(s, x_{N_j}(s)) - f(s, z(s)) \right) ds.
  22. By steps 12, 19 and 20, all three terms tend to 00 as j→∞j \to \infty. Hence z(t)=x0+∫t0tf(s,z(s)) dsz(t) = x_0 + \int_{t_0}^t f(s, z(s))\, ds for each t∈Xt \in X.
  23. The map s↦f(s,z(s))s \mapsto f(s, z(s)) is continuous on XX. Write ∫t0t=∫t0−ht−∫t0−ht0\int_{t_0}^t = \int_{t_0 - h}^t - \int_{t_0 - h}^{t_0}. By the first fundamental theorem of calculus in each coordinate, zz is differentiable at each t∈(t0−h,t0+h)t \in (t_0 - h, t_0 + h) with z′(t)=f(t,z(t))z'(t) = f(t, z(t)).
  24. Let I=(t0−h,t0+h)I = (t_0 - h, t_0 + h), an open interval that contains t0t_0. By steps 13 and 23, zz restricted to II solves the initial value problem: (t,z(t))∈D(t, z(t)) \in D and z′(t)=f(t,z(t))z'(t) = f(t, z(t)) for t∈It \in I, and z(t0)=x0z(t_0) = x_0.

Idea

Euler polygons follow the field ff in small straight steps, so they almost solve the equation. Their slopes are bounded by MM, which makes the family equicontinuous, and the Arzelà–Ascoli theorem gives a uniformly convergent subsequence. Uniform continuity of ff on a compact box then shows that the limit solves the integral equation exactly.

Reading path

To understand this page from the ground up, read these 336 pages in order. The foundations come first. The path takes the proofs Proof that Darboux and Riemann integrals agree, Proof of the limit of a sum of sequences, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the epsilon-net characterisation of total boundedness, Proof that open sets are the sets that are neighbourhoods of all their points, Proof of the diameter characterisation of Cauchy sequences, Proof of the completeness of the space of bounded continuous functions, 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 of De Morgan's laws for sets, Proof of De Morgan's laws by truth tables, 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 that a union of open sets of a metric space is open, Proof of the reverse triangle inequality, Proof that an intersection of closed sets of a metric space is closed, Proof that continuous functions on a closed bounded interval are uniformly continuous, 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 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 mean value theorem for integrals, Proof that a continuous image of a compact set is compact, Proof that the closure is the smallest closed superset, Proof of the Heine–Cantor theorem by a finite cover of balls, Proof of the Heine–Borel theorem in finite-dimensional normed spaces, Proof that compact subsets of a Hausdorff space are closed, Proof of epsilon-delta continuity at a point in metric spaces, Proof of Riemann's criterion for integrability, 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 of the first fundamental theorem of calculus, 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 of the description of the closure in a metric space, Proof that every spanning set contains a basis, by Zorn's lemma, Proof that limits preserve non-strict inequalities, Proof that closed sets contain their limits, Proof of the linearity of the integral, Proof of Zorn's lemma, Proof that metric spaces are Hausdorff, Proof of the intermediate value theorem by the supremum, 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 triangle inequality for integrals, Proof of the Archimedean property in an Archimedean ordered field, Proof that a continuous real function on a compact set attains its bounds, Proof of the additivity of the integral over intervals, 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 monotonicity of the integral, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof that a set is compact iff it is complete and totally bounded, Proof that the closure is closed, Proof that a set is open if and only if its complement is closed, Proof of continuity via open sets in metric spaces, Proof that continuous functions are Riemann integrable, Proof of the Arzelà–Ascoli theorem by total boundedness.

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

Where this leads

4 pages build on this one.

Further reading

  1. Web https://www.mat.univie.ac.at/~gerald/ftp/book-ode/ode.pdf, Section 2.7
  2. Web https://en.wikipedia.org/wiki/Peano_existence_theorem, Proof
About this page
Tag11BXZD1EVQ
URIm2://11BXZD1EVQ
Kindproof
WritingW0 stub
MSC34A12
ProvesPeano existence theorem
UsesInitial value problem, Heine–Borel theorem in finite-dimensional normed spaces, Continuous image of a compact set is compact, Heine–Cantor theorem, Equicontinuity, Arzelà–Ascoli theorem, Compactness and sequential compactness agree in metric spaces, Uniform convergence, Triangle inequality for integrals, Monotonicity of the integral, Linearity of the integral, First fundamental theorem of calculus
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.