Math 2.0

Ordinary differential equations Proof

Proof of the test for exactness

Builds on Exact equationMean value theoremThe integral of a continuous function is an antiderivativeDifferentiation under the integral signFundamental theorem of calculusContinuous partial derivatives imply differentiability

Proof

We write My=∂M/∂yM_y = \partial M / \partial y and Nx=∂N/∂xN_x = \partial N / \partial x.

  1. Necessity. Assume the equation is exact on RR. So there is a differentiable ψ:R→ℝ\psi : R \to \R with ∂ψ/∂x=M\partial \psi / \partial x = M and ∂ψ/∂y=N\partial \psi / \partial y = N on RR.
  2. Fix (x,y)∈R(x, y) \in R. Since RR is open, there is h0>0h_0 > 0 with [x,x+h]×[y,y+h]⊆R[x, x + h] \times [y, y + h] \subseteq R for each h∈(0,h0]h \in (0, h_0]. Fix such an hh.
  3. Let Δ=ψ(x+h,y+h)−ψ(x+h,y)−ψ(x,y+h)+ψ(x,y)\Delta = \psi(x + h, y + h) - \psi(x + h, y) - \psi(x, y + h) + \psi(x, y).
  4. Let g(s)=ψ(s,y+h)−ψ(s,y)g(s) = \psi(s, y + h) - \psi(s, y) for s∈[x,x+h]s \in [x, x + h]. Then gg is differentiable with g′(s)=M(s,y+h)−M(s,y)g'(s) = M(s, y + h) - M(s, y), since ∂ψ/∂x=M\partial \psi / \partial x = M.
  5. By the mean value theorem, Δ=g(x+h)−g(x)=h g′(ξ)\Delta = g(x + h) - g(x) = h\, g'(\xi) for some ξ∈(x,x+h)\xi \in (x, x + h).
  6. The function t↦M(ξ,t)t \mapsto M(\xi, t) is differentiable with derivative My(ξ,t)M_y(\xi, t). The mean value theorem gives η∈(y,y+h)\eta \in (y, y + h) with M(ξ,y+h)−M(ξ,y)=h My(ξ,η)M(\xi, y + h) - M(\xi, y) = h\, M_y(\xi, \eta). So Δ=h2My(ξ,η)\Delta = h^2 M_y(\xi, \eta).
  7. In the same way, let k(t)=ψ(x+h,t)−ψ(x,t)k(t) = \psi(x + h, t) - \psi(x, t) for t∈[y,y+h]t \in [y, y + h]. Then k′(t)=N(x+h,t)−N(x,t)k'(t) = N(x + h, t) - N(x, t), since ∂ψ/∂y=N\partial \psi / \partial y = N.
  8. Two uses of the mean value theorem, first for kk and then for s↦N(s,η′)s \mapsto N(s, \eta'), give points ξ′∈(x,x+h)\xi' \in (x, x + h) and η′∈(y,y+h)\eta' \in (y, y + h) with Δ=h2Nx(ξ′,η′)\Delta = h^2 N_x(\xi', \eta').
  9. By steps 6 and 8, My(ξ,η)=Nx(ξ′,η′)M_y(\xi, \eta) = N_x(\xi', \eta'). Both points lie in the square [x,x+h]×[y,y+h][x, x + h] \times [y, y + h].
  10. Let h→0h \to 0 along h=h0/jh = h_0 / j. Both points tend to (x,y)(x, y). Since MyM_y and NxN_x are continuous, My(x,y)=Nx(x,y)M_y(x, y) = N_x(x, y).
  11. Sufficiency. Assume My=NxM_y = N_x on RR. Fix (x0,y0)∈R(x_0, y_0) \in R, and for (x,y)∈R(x, y) \in R let ψ(x,y)=∫x0xM(s,y0) ds+∫y0yN(x,t) dt\psi(x, y) = \int_{x_0}^{x} M(s, y_0)\, ds + \int_{y_0}^{y} N(x, t)\, dt.
  12. Since RR is a rectangle, the segments from (x0,y0)(x_0, y_0) to (x,y0)(x, y_0) and from (x,y0)(x, y_0) to (x,y)(x, y) lie in RR. The integrands are continuous, so ψ\psi is well defined.
  13. The first term of ψ\psi does not depend on yy. The function t↦N(x,t)t \mapsto N(x, t) is continuous on (γ,δ)(\gamma, \delta). By the antiderivative theorem, ∂ψ/∂y(x,y)=N(x,y)\partial \psi / \partial y (x, y) = N(x, y).
  14. Fix (x1,y1)∈R(x_1, y_1) \in R. The first term A(x)=∫x0xM(s,y0) dsA(x) = \int_{x_0}^{x} M(s, y_0)\, ds has A′(x1)=M(x1,y0)A'(x_1) = M(x_1, y_0), by the antiderivative theorem.
  15. Let B(x)=∫y0y1N(x,t) dtB(x) = \int_{y_0}^{y_1} N(x, t)\, dt. If y1=y0y_1 = y_0, then B=0B = 0 and B′(x1)=0B'(x_1) = 0.
  16. Otherwise let c=min⁡(y0,y1)c = \min(y_0, y_1) and d=max⁡(y0,y1)d = \max(y_0, y_1), and choose h>0h > 0 with [x1−h,x1+h]⊆(α,β)[x_1 - h, x_1 + h] \subseteq (\alpha, \beta). Then NN and NxN_x are continuous on [x1−h,x1+h]×[c,d]⊆R[x_1 - h, x_1 + h] \times [c, d] \subseteq R.
  17. By differentiation under the integral sign, B′(x1)=∫y0y1Nx(x1,t) dtB'(x_1) = \int_{y_0}^{y_1} N_x(x_1, t)\, dt. Here BB is ±∫cdN(x,t) dt\pm \int_c^d N(x, t)\, dt, so the rule applies to it.
  18. By hypothesis Nx(x1,t)=My(x1,t)N_x(x_1, t) = M_y(x_1, t). The function t↦M(x1,t)t \mapsto M(x_1, t) is continuous on [c,d][c, d] with derivative My(x1,t)M_y(x_1, t).
  19. The fundamental theorem of calculus gives ∫cdMy(x1,t) dt=M(x1,d)−M(x1,c)\int_c^d M_y(x_1, t)\, dt = M(x_1, d) - M(x_1, c). So B′(x1)=M(x1,y1)−M(x1,y0)B'(x_1) = M(x_1, y_1) - M(x_1, y_0) in both orders of y0,y1y_0, y_1.
  20. This also holds when y1=y0y_1 = y_0. Adding steps 14 and 19 gives ∂ψ/∂x(x1,y1)=M(x1,y1)\partial \psi / \partial x (x_1, y_1) = M(x_1, y_1).
  21. So the partial derivatives of ψ\psi are MM and NN, which are continuous on the open set RR. By continuous partial derivatives imply differentiability, ψ\psi is differentiable on RR.
  22. Hence ψ\psi is a potential function, and the equation is exact on RR.

Idea

For necessity, the double difference Δ\Delta of ψ\psi over a small square can be computed as h2Myh^2 M_y or as h2Nxh^2 N_x, at nearby points. Shrinking the square and using continuity gives My=NxM_y = N_x. For sufficiency, we integrate MM along a horizontal segment and NN along a vertical one. The condition My=NxM_y = N_x makes the xx-derivative of the second integral cancel the error of the first.

Reading path

To understand this page from the ground up, read these 343 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 Rolle's theorem, Proof of the derivative of a map into R^n by components, 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 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 that continuous functions on a closed bounded interval are uniformly continuous, 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 of differentiation under the integral sign, 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 integral of a continuous function is an antiderivative, 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 linearity of differentiation, Proof of the mean value theorem for integrals, Proof that a continuous image of a compact set is compact, Proof of the Heine–Cantor theorem by a finite cover of balls, 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 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 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 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 the linearity of the integral, Proof of Zorn's lemma, Proof that metric spaces are Hausdorff, Proof of the second fundamental theorem of calculus, Proof of the intermediate value theorem by the supremum, Proof that differentiable functions are continuous, 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 of the derivative of a map into a product, 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 Lipschitz maps are uniformly continuous, Proof that continuous partial derivatives imply differentiability, Proof that a set is open if and only if its complement is closed, Proof of the fundamental theorem of calculus, Proof of the mean value theorem from Rolle's theorem, Proof of continuity via open sets in metric spaces, Proof that continuous functions are Riemann integrable, Proof of the constant multiple rule.

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

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Exact_differential_equation, Identifying first-order exact differential equations
About this page
Tag2X5V81FS0J
URIm2://2X5V81FS0J
Kindproof
WritingW0 stub
MSC34A05
ProvesTest for exactness
UsesExact equation, Mean value theorem, The integral of a continuous function is an antiderivative, Differentiation under the integral sign, Fundamental theorem of calculus, Continuous partial derivatives imply differentiability
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.