Math 2.0

Operations research, mathematical programming Proof

Proof of the Lagrange multiplier theorem by the implicit function theorem

Builds on Implicit function theoremJacobian matrixGradientRow rank equals column rankLinear independenceLocal maximum and minimumDerivative vanishes at a local extremumChain rule in several variablesContinuous partial derivatives imply differentiabilityC^k function characterised by continuous derivativesContinuity in R^n

Proof

We solve the constraints for mm of the variables, and reduce to an extremum without constraints.

  1. Let UU, m<nm < n, ff, gg, MM and aa be as in the statement. The functions ff and gg are of class C^1, so they are differentiable on UU.
  2. Let J=Dg(a)J = Dg(a), the m×nm \times n Jacobian matrix. Its rows are the gradients ∇g1(a),…,∇gm(a)\nabla g_1(a), \dots, \nabla g_m(a), which are linearly independent. So the row space of JJ has dimension mm. Since row rank equals column rank, the columns of JJ span ℝm\R^m, and some mm of them are linearly independent.
  3. Reordering the coordinates of ℝn\R^n reorders the entries of every gradient in the same way. So it does not change the statement. We may therefore assume that the last mm columns of JJ are linearly independent.
  4. Write x=(u,w)x = (u, w) with u∈ℝn−mu \in \R^{n-m} and w∈ℝmw \in \R^m, and a=(a′,b)a = (a', b). Write DuD_u and DwD_w for the matrices of partial derivatives with respect to uu and ww. Then Dwg(a)D_w g(a) is the m×mm \times m matrix of the last mm columns of JJ, so it is invertible.
  5. Since g(a)=0g(a) = 0, the implicit function theorem gives open sets U′∋a′U' \ni a' and V′∋bV' \ni b, and a C1C^1 function φ ⁣:U′→V′\varphi \colon U' \to V', with this property. For (u,w)∈U′×V′(u, w) \in U' \times V', g(u,w)=0g(u, w) = 0 if and only if w=φ(u)w = \varphi(u). Here U′×V′⊆UU' \times V' \subseteq U, since gg is evaluated on this set.
  6. The theorem also gives Dφ(a′)=−(Dwg(a))−1Dug(a)D\varphi(a') = -\big( D_w g(a) \big)^{-1} D_u g(a). Since (a′,b)∈U′×V′(a', b) \in U' \times V' and g(a′,b)=0g(a', b) = 0, we have φ(a′)=b\varphi(a') = b.
  7. Define ψ(u)=(u,φ(u))\psi(u) = (u, \varphi(u)) for u∈U′u \in U'. Then ψ(u)∈M\psi(u) \in M for every u∈U′u \in U', and ψ(a′)=a\psi(a') = a.
  8. Assume that ff restricted to MM has a local maximum at aa. So there is ε>0\varepsilon > 0 with f(x)≤f(a)f(x) \le f(a) for x∈Mx \in M with ∥x−a∥<ε\norm{x - a} < \varepsilon.
  9. The map ψ\psi is continuous at a′a'. So there is δ>0\delta > 0 with ∥ψ(u)−a∥<ε\norm{\psi(u) - a} < \varepsilon for u∈U′u \in U' with ∥u−a′∥<δ\norm{u - a'} < \delta. For such uu, step 8 gives f(ψ(u))≤f(a)=f(ψ(a′))f(\psi(u)) \le f(a) = f(\psi(a')).
  10. Thus f∘ψf \circ \psi has a local maximum at a′a', on the open set U′U'. The case of a local minimum is the same, with the inequalities reversed.
  11. By the chain rule, f∘ψf \circ \psi is differentiable at a′a', with D(f∘ψ)(a′)=Duf(a)+Dwf(a) Dφ(a′)D(f \circ \psi)(a') = D_u f(a) + D_w f(a) \, D\varphi(a').
  12. By the theorem that the derivative vanishes at a local extremum, this derivative is 00. With step 6, Duf(a)=Dwf(a)(Dwg(a))−1Dug(a)D_u f(a) = D_w f(a) \big( D_w g(a) \big)^{-1} D_u g(a).
  13. Define the row vector λ=Dwf(a)(Dwg(a))−1\lambda = D_w f(a) \big( D_w g(a) \big)^{-1}, with entries λ1,…,λm\lambda_1, \dots, \lambda_m. Then Dwf(a)=λ Dwg(a)D_w f(a) = \lambda \, D_w g(a), and step 12 says Duf(a)=λ Dug(a)D_u f(a) = \lambda \, D_u g(a).
  14. Together, Df(a)=λ Dg(a)Df(a) = \lambda \, Dg(a) as 1×n1 \times n matrices. The row λ Dg(a)\lambda \, Dg(a) is ∑iλi∇gi(a)\sum_i \lambda_i \nabla g_i(a). So ∇f(a)=λ1∇g1(a)+⋯+λm∇gm(a)\nabla f(a) = \lambda_1 \nabla g_1(a) + \dots + \lambda_m \nabla g_m(a).
  15. If μ∈ℝm\mu \in \R^m also satisfies this equation, then ∑i(λi−μi)∇gi(a)=0\sum_i (\lambda_i - \mu_i) \nabla g_i(a) = 0. The gradients are linearly independent, so μ=λ\mu = \lambda. This proves uniqueness.

Idea

Near aa, the constraint set is the graph w=φ(u)w = \varphi(u), by the implicit function theorem. On this graph, f(u,φ(u))f(u, \varphi(u)) is a function of uu alone with a free local extremum, so its derivative is zero. The formula for DφD\varphi then shows that Df(a)Df(a) is a combination of the rows of Dg(a)Dg(a).

Reading path

To understand this page from the ground up, read these 475 pages in order. The foundations come first. The path takes the proofs Proof of the Steinitz exchange lemma by induction, 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 of the decomposition of a permutation into transpositions, Proof of the implicit function theorem from the inverse function theorem, Proof that the symmetric group is generated by transpositions, Proof of the Laplace expansion along a column by transposition, Proof that open sets are the sets that are neighbourhoods of all their points, Proof that closed balls are closed, Proof of the diameter characterisation of Cauchy sequences, 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 that equivalence classes form a partition, Proof of the triangle inequality for norms, Proof of the sum of a finite geometric series, 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 that the coordinate space F^n has dimension n, Proof that the determinant is multiplicative by expanding the rows, Proof that permuting rows multiplies the determinant by the sign, Proof that closed subsets of complete spaces are complete, Proof of the derivative as a little-o approximation, Proof that disjoint cycles commute, Proof that the derivative vanishes at a local extremum, Proof of the equality of complex numbers, Proof that a matrix is invertible iff its determinant is a unit, Proof that a linear map between normed spaces is continuous if and only if it is bounded, Proof of the determinant of a block triangular matrix by the Leibniz formula, 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 that a matrix with two equal rows has determinant zero, 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 the Laplace expansion along a row by the Leibniz formula, 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 that the determinant of a transpose equals the determinant, Proof of the laws of exponents in a group, Proof of the limit of a product of sequences, Proof of the inverse in terms of the adjugate, 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 Banach fixed point theorem by iteration, Proof of the triangle inequality for real numbers, Proof that an intersection of subgroups is a subgroup, 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 that the sign is a homomorphism, 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 determinant of the inverse, Proof that every spanning set contains a basis, by Zorn's lemma, Proof that the determinant of the identity matrix is one, Proof of Fermat's theorem on stationary points, Proof that limits preserve non-strict inequalities, Proof of the inverse function theorem by the contraction mapping principle, Proof that closed sets contain their limits, Proof of Zorn's lemma, Proof that metric spaces are Hausdorff, Proof that the derivative gives the directional derivatives, Proof that differentiable functions are continuous, Proof of the decomposition of a permutation into disjoint cycles, Proof of the product of a matrix and its adjugate by Laplace expansion, 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 division algorithm, Proof of the Archimedean property in an Archimedean ordered field, Proof of the sign of a cycle, Proof that finite-dimensional normed spaces are complete, Proof that a continuous real function on a compact set attains its bounds, Proof of the Leibniz formula from the defining properties of the determinant, Proof of the uniqueness of inverses, Proof of the derivative of a map into a product, Proof that row rank equals column rank by a factorization A = CR, 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 a subspace of a finite-dimensional space has smaller or equal dimension, Proof that the determinant is multilinear in the rows, Proof that open balls are open, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof that Lipschitz maps are uniformly continuous, Proof that C^k functions are characterised by continuous derivatives, Proof that continuous partial derivatives imply differentiability, Proof that a set is open if and only if its complement is closed, Proof of the subgroup criterion, 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. Affine combination concept
  2. Basis concept
  3. Binary operation definition
  4. Column space concept
  5. Complex numbers object
  6. Complex numbers as pairs of reals concept
  7. Construction of the reals from Cauchy sequences concept
  8. Coordinate space object
  9. Coordinate vector concept
  10. Cycle notation concept
  11. Definition by recursion concept
  12. Dimension concept
  13. Divisibility definition
  14. Element definition
  15. Euclidean metric example
  16. Euclidean space object
  17. Extended real number line object
  18. Function concept
  19. Function composition concept
  20. Group concept
  21. Identity matrix object
  22. Imaginary unit object
  23. Inner product concept
  24. Inner product space concept
  25. Integers object
  26. Limit point of a set definition
  27. Linear isomorphism concept
  28. Linear map concept
  29. Linear span concept
  30. Local maximum definition
  31. Mathematical induction concept
  32. Matrix definition
  33. Matrix multiplication concept
  34. Multilinear map concept
  35. Natural numbers object
  36. Norm concept
  37. Norm induced by an inner product concept
  38. Ordered field definition
  39. Peano axioms concept
  40. Permutation concept
  41. Permutation definition
  42. Proof of Zorn's lemma proof
  43. Proposition concept
  44. Rank of a matrix concept
  45. Rational numbers object
  46. Real numbers object
  47. Row space concept
  48. Sequence definition
  49. Set bounded above definition
  50. Standard basis object
  51. Transpose concept
  52. Transposition concept
  53. Vector space definition
  54. p-metric on R^n example
  55. Identity element definition
  56. Real and imaginary parts definition
  57. Convex set definition
  58. Set definition
  59. Fréchet derivative definition
  60. Having a directional derivative definition
  61. Total derivative concept
  62. Function of several variables concept
  63. Vector-valued function concept
  64. Group homomorphism definition
  65. Ring definition
  66. Subgroup definition
  67. Symmetric group definition
  68. Ring of integers statement
  69. Limit of a function definition
  70. Local minimum definition
  71. Block matrix definition
  72. Matrix multiplication definition
  73. Square matrix definition
  74. Transpose definition
  75. Successor function definition
  76. Archimedean ordered field definition
  77. Conjunction definition
  78. Disjunction definition
  79. Implication definition
  80. Negation definition
  81. Predicate definition
  82. The reals form a field statement
  83. Real sequence definition
  84. Subsequence definition
  85. Infimum definition
  86. Supremum definition
  87. Inner product definition
  88. Linear combination definition
  89. Linear map definition
  90. Linear subspace definition
  91. Norm definition
  92. p-norm on R^n example
  93. Inverse element definition
  94. Complex conjugate definition
  95. Empty set object
  96. Family of sets definition
  97. Ordered pair definition
  98. Differentiable function of several variables concept
  99. Local maximum and minimum definition
  100. Partial derivative concept
  101. Unit of a ring definition
  102. Transposition definition
  103. Limit of a function of several variables concept
  104. Parametrised curve concept
  105. Intersection definition
  106. Union definition
  107. Continuity at a point definition
  108. Derivative definition
  109. Set-builder notation concept
  110. Proof that an intersection of subgroups is a subgroup proof
  111. Invertible matrix definition
  112. Addition of natural numbers definition
  113. Biconditional definition
  114. Truth table concept
  115. Modus ponens concept
  116. Existential quantifier definition
  117. Universal quantifier definition
  118. Bounded sequence definition
  119. Cauchy sequence definition
  120. Geometric sequence definition
  121. Limit of a sequence definition
  122. Monotone sequence definition
  123. The rationals form a field statement
  124. Proof of the Archimedean property in an Archimedean ordered field proof
  125. The successor function is injective statement
  126. Zero is not a successor statement
  127. Inner product space definition
  128. Linear independence definition
  129. Composition of linear maps definition
  130. Linear isomorphism definition
  131. Linear span definition
  132. Multilinear map definition
  133. Normed vector space definition
  134. Completeness axiom statement
  135. Cartesian product definition
  136. Gradient concept
  137. Jacobian matrix concept
  138. Disjoint sets definition
  139. Proof of the equality of complex numbers proof
  140. Proof of the uniqueness of inverses proof
  141. Partial derivative definition
  142. Continuity in R^n definition
  143. Differentiable function of several variables definition
  144. Union of a family of sets definition
  145. Continuous function definition
  146. Axiom of extensionality statement
  147. Differentiable function definition
  148. Subset definition
  149. Mathematical proof concept
  150. Proof of the derivative as a little-o approximation proof
  151. Proof of the commutativity of addition by induction proof
  152. Uniqueness quantifier definition
  153. Archimedean property statement
  154. Propositional logic concept
  155. Order on the natural numbers definition
  156. Proof of the sum of a finite geometric series proof
  157. Convergent sequence definition
  158. Sequential continuity definition
  159. The rationals form an ordered field statement
  160. Column space definition
  161. Row space definition
  162. Norm induced by an inner product definition
  163. Spanning set definition
  164. Alternating multilinear map definition
  165. Equality of complex numbers statement
  166. Higher partial derivatives definition
  167. Binary relation definition
  168. Jacobian matrix definition
  169. Differentiable on an open set definition
  170. Uniqueness of inverses statement
  171. Universal set definition
  172. Partition of a set definition
  173. Topological space definition
  174. Derivative as a little-o approximation statement
  175. Gradient definition
  176. Proof of the derivative of a map into R^n by components proof
  177. Order on the reals definition
  178. Tautology definition
  179. Commutativity of addition statement
  180. Determinant definition
  181. Sum of a finite geometric series statement
  182. Proof of strong induction from ordinary induction proof
  183. Finite-dimensional vector space definition
  184. Basis definition
  185. Proof of the Steinitz exchange lemma by induction proof
  186. Antisymmetric relation definition
  187. Reflexive relation definition
  188. Symmetric relation definition
  189. Transitive relation definition
  190. Iterated derivative definition
  191. Jacobian determinant definition
  192. Sequential compactness definition
  193. Function definition
  194. Complement definition
  195. Subspace topology definition
  196. Proof of the subgroup criterion proof
  197. Interval definition
  198. Proof of the laws of exponents in a group proof
  199. Proof that a matrix with two equal rows has determinant zero proof
  200. Proof that the determinant of the identity matrix is one proof
  201. Logical equivalence definition
  202. Dimension definition
  203. Coordinate vector definition
  204. Dimension theorem for vector spaces statement
  205. Strong induction statement
  206. Minor definition
  207. Proof that the determinant is multilinear in the rows proof
  208. Steinitz exchange lemma statement
  209. Equivalence relation definition
  210. Preorder definition
  211. Codomain definition
  212. Function composition definition
  213. Identity function definition
  214. Injective function definition
  215. Choice function definition
  216. Image of a set definition
  217. Preimage of a set definition
  218. Restriction of a function definition
  219. Subgroup criterion statement
  220. Proof of the epsilon-delta form of continuity proof
  221. Proof of the epsilon-delta form of the limit of a function proof
  222. Determinant of a matrix with two equal rows statement
  223. Laws of exponents in a group statement
  224. Determinant of the identity matrix statement
  225. Metric space definition
  226. Determinant is multilinear in the rows statement
  227. Cofactor definition
  228. Proof of the well-ordering principle from strong induction proof
  229. Rank of a matrix definition
  230. Proof that the coordinate space F^n has dimension n proof
  231. Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
  232. Proof of the double negation law by a truth table proof
  233. Partial order definition
  234. Left inverse definition
  235. Right inverse definition
  236. Surjective function definition
  237. Axiom of choice statement
  238. Proof that disjoint cycles commute proof
  239. Equivalence class definition
  240. Epsilon-delta definition of continuity statement
  241. Intersection of subgroups is a subgroup statement
  242. Subspace metric definition
  243. Epsilon-delta definition of a limit statement
  244. Dimension of the coordinate space statement
  245. Closed ball definition
  246. Convergence of a sequence in a metric space definition
  247. Lipschitz map definition
  248. Open ball definition
  249. Triangle inequality for a metric statement
  250. Adjugate matrix definition
  251. Diameter of a set definition
  252. Double negation law statement
  253. Well-ordering principle statement
  254. Dimension of a subspace statement
  255. Maximal element definition
  256. Total order definition
  257. Upper bound definition
  258. Bijective function definition
  259. Proof that equivalence classes form a partition proof
  260. Disjoint cycles commute statement
  261. Subgroup generated by a subset definition
  262. Metric topology definition
  263. Bounded set definition
  264. Contraction mapping definition
  265. Proof by contradiction concept
  266. Proof of the division algorithm proof
  267. Proof of the diameter characterisation of Cauchy sequences proof
  268. Proof that row rank equals column rank by a factorization A = CR proof
  269. Proof that every sequence has a monotone subsequence, by peaks proof
  270. Chain definition
  271. Proof that a function is bijective iff it has a two-sided inverse proof
  272. Equivalence classes form a partition statement
  273. Open set definition
  274. Division algorithm statement
  275. Epsilon characterisation of Cauchy sequences statement
  276. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  277. Row rank equals column rank statement
  278. Every sequence has a monotone subsequence statement
  279. Bijective iff it has a two-sided inverse statement
  280. Hausdorff space definition
  281. Open cover definition
  282. Closed set definition
  283. Continuous map of topological spaces definition
  284. Proof that open sets are the sets that are neighbourhoods of all their points proof
  285. Proof of the decomposition of a permutation into disjoint cycles proof
  286. Proof that the derivative gives the directional derivatives proof
  287. Equivalent metrics definition
  288. Zorn's lemma statement
  289. Proof of the description of the open sets of a metric space proof
  290. Complete metric space definition
  291. The reals form an ordered field statement
  292. Compact space definition
  293. Proof that the composition of continuous maps is continuous proof
  294. Proof that a set is open if and only if its complement is closed proof
  295. Open sets characterised by neighbourhoods statement
  296. Derivative gives the directional derivatives statement
  297. Equivalent norms definition
  298. Decomposition of a permutation into disjoint cycles statement
  299. Open sets of a metric space statement
  300. Proof that the coordinate map is a linear isomorphism proof
  301. Absolute value definition
  302. Proof that every spanning set contains a basis, by Zorn's lemma proof
  303. Proof of the approximation property of the supremum proof
  304. Proof of the existence of the infimum by negation proof
  305. Proof of the existence of square roots of nonnegative reals proof
  306. Complement of an open set is closed statement
  307. Composition of continuous maps is continuous statement
  308. Compact set definition
  309. Continuous linear map definition
  310. Continuity at a point of a topological space definition
  311. Banach space definition
  312. Proof of the decomposition of a permutation into transpositions proof
  313. Proof of the triangle inequality for real numbers proof
  314. Proof that the absolute value is multiplicative proof
  315. Proof that closed sets contain their limits proof
  316. Proof that closed balls are closed proof
  317. Proof that open balls are open proof
  318. Proof of the epsilon-N definition of the limit of a sequence proof
  319. Every spanning set contains a basis statement
  320. Isomorphism with the coordinate space statement
  321. Existence of square roots of nonnegative reals statement
  322. Approximation property of the supremum statement
  323. Existence of the infimum statement
  324. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  325. Proof of continuity via closed sets proof
  326. Decomposition of a permutation into transpositions statement
  327. Closed sets contain their limits statement
  328. Triangle inequality statement
  329. Absolute value is multiplicative statement
  330. Closed balls are closed statement
  331. Open balls are open statement
  332. Square root definition
  333. Epsilon-N definition of the limit of a sequence statement
  334. Proof that the reals are Archimedean from the completeness axiom proof
  335. Sign of a permutation definition
  336. Continuity via closed sets statement
  337. Compactness via open covers statement
  338. Modulus of a complex number definition
  339. Proof of the limit of a sum of sequences proof
  340. Proof that closed subsets of complete spaces are complete proof
  341. Proof of the uniqueness of limits proof
  342. Proof that the symmetric group is generated by transpositions proof
  343. Proof of epsilon-delta continuity at a point in metric spaces proof
  344. Proof of the squeeze theorem for sequences proof
  345. Proof of the Lebesgue number lemma by a finite cover of balls proof
  346. Proof of continuity via open sets in metric spaces proof
  347. Proof that limits preserve non-strict inequalities proof
  348. Proof that differentiable functions are continuous proof
  349. Proof that metric spaces are Hausdorff proof
  350. Proof that convergent sequences are bounded proof
  351. The reals are Archimedean statement
  352. Proof that subsequences of a convergent sequence converge to the same limit proof
  353. Proof of the monotone convergence theorem for sequences proof
  354. Proof that compact subsets of a Hausdorff space are closed proof
  355. Proof that a complex number times its conjugate is the square of its modulus proof
  356. Proof that a continuous image of a compact set is compact proof
  357. The symmetric group is generated by transpositions statement
  358. Proof that the sign is a homomorphism proof
  359. Closed subsets of complete spaces are complete statement
  360. Lebesgue number lemma statement
  361. Proof of the sign of a cycle proof
  362. Epsilon-delta continuity in metric spaces statement
  363. Proof that compact subsets of a metric space are bounded proof
  364. Metric spaces are Hausdorff statement
  365. Proof that compactness and sequential compactness agree in metric spaces proof
  366. Differentiable functions are continuous statement
  367. Limit of a sum of sequences statement
  368. Uniqueness of limits statement
  369. Proof of the sequence characterisation of uniform continuity proof
  370. Limits preserve non-strict inequalities statement
  371. Convergent sequences are bounded statement
  372. Squeeze theorem statement
  373. Proof of the triangle inequality for norms proof
  374. Subsequences of a convergent sequence converge to the same limit statement
  375. Proof that there is a natural number n with 1/n below any positive epsilon proof
  376. Monotone convergence theorem for sequences statement
  377. Compact subsets of a Hausdorff space are closed statement
  378. A complex number times its conjugate statement
  379. Continuous image of a compact set is compact statement
  380. Sign of a cycle statement
  381. Sign is a homomorphism statement
  382. Compactness and sequential compactness agree in metric spaces statement
  383. Continuity via open sets statement
  384. Compact subsets of a metric space are bounded statement
  385. Proof of the limit of a product of sequences proof
  386. Epsilon-delta uniform continuity statement
  387. Proof that permuting rows multiplies the determinant by the sign proof
  388. There is a natural number n with 1/n below any positive epsilon statement
  389. Proof that a decreasing sequence bounded below converges proof
  390. The sequence r^n tends to zero for |r| < 1 example
  391. Triangle inequality for norms statement
  392. Proof that a linear map between normed spaces is continuous if and only if it is bounded proof
  393. Proof of the Banach fixed point theorem by iteration proof
  394. Permuting rows multiplies the determinant by the sign statement
  395. Proof that Lipschitz maps are uniformly continuous proof
  396. Proof of the sequential characterization of limits proof
  397. Proof that continuity is equivalent to sequential continuity proof
  398. Decreasing sequence bounded below converges statement
  399. Proof of the Cauchy–Schwarz inequality proof
  400. Limit of a product of sequences statement
  401. Banach fixed point theorem statement
  402. Lipschitz maps are uniformly continuous statement
  403. Continuity is equivalent to sequential continuity statement
  404. Sequential characterization of limits statement
  405. Proof of the Leibniz formula from the defining properties of the determinant proof
  406. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  407. Cauchy–Schwarz inequality statement
  408. Bounded linear maps are continuous statement
  409. Leibniz formula for determinants statement
  410. Proof of the linearity of differentiation proof
  411. Bolzano–Weierstrass theorem statement
  412. Proof of the derivative of a map into a product proof
  413. Proof of the determinant of a block triangular matrix by the Leibniz formula proof
  414. Proof of the Heine–Borel theorem by sequential compactness proof
  415. Linearity of differentiation statement
  416. Operator norm definition
  417. Proof of the Laplace expansion along a row by the Leibniz formula proof
  418. Proof that the determinant is multiplicative by expanding the rows proof
  419. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  420. Proof that the determinant of a transpose equals the determinant proof
  421. Completeness of the real numbers statement
  422. Derivative of a map into a product statement
  423. Proof of the constant multiple rule proof
  424. Heine–Borel theorem statement
  425. Boundedness theorem statement
  426. Determinant of a block triangular matrix statement
  427. Determinant is multiplicative statement
  428. Laplace expansion along a row statement
  429. Determinant of a transpose statement
  430. Constant multiple rule statement
  431. Derivative of a map into R^n by components statement
  432. Proof of the determinant of the inverse proof
  433. Proof of the Laplace expansion along a column by transposition proof
  434. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  435. Proof that a continuous real function on a compact set attains its bounds proof
  436. Extreme value theorem statement
  437. Continuous real function on a compact set attains its bounds statement
  438. Determinant of the inverse statement
  439. Laplace expansion along a column statement
  440. Proof of Fermat's theorem on stationary points proof
  441. Proof of the equivalence of norms in finite dimension by compactness of the unit sphere proof
  442. Proof of the product of a matrix and its adjugate by Laplace expansion proof
  443. Fermat's theorem on stationary points statement
  444. Proof that the derivative vanishes at a local extremum proof
  445. Equivalence of norms in finite dimension statement
  446. Product of a matrix and its adjugate statement
  447. Proof of Rolle's theorem proof
  448. Rolle's theorem statement
  449. Derivative vanishes at a local extremum statement
  450. Proof that linear maps on finite-dimensional normed spaces are continuous proof
  451. Proof that finite-dimensional normed spaces are complete proof
  452. Proof of the inverse in terms of the adjugate proof
  453. Linear maps on finite-dimensional spaces are continuous statement
  454. Finite-dimensional normed spaces are complete statement
  455. Proof of the mean value theorem from Rolle's theorem proof
  456. Inverse in terms of the adjugate statement
  457. Mean value theorem statement
  458. Proof that a matrix is invertible iff its determinant is a unit proof
  459. Proof of the chain rule in several variables proof
  460. Proof that continuous partial derivatives imply differentiability proof
  461. Chain rule in several variables statement
  462. A matrix is invertible iff its determinant is a unit statement
  463. Derivative of the inverse function in several variables statement
  464. Continuous partial derivatives imply differentiability statement
  465. Proof of the chain rule for a composition with a curve proof
  466. Chain rule for a composition with a curve statement
  467. Proof that C^k functions are characterised by continuous derivatives proof
  468. C^k function characterised by continuous derivatives statement
  469. Proof of the mean value inequality proof
  470. Mean value inequality statement
  471. Proof of the inverse function theorem by the contraction mapping principle proof
  472. Inverse function theorem statement
  473. Proof of the implicit function theorem from the inverse function theorem proof
  474. Implicit function theorem statement
  475. Proof of the Lagrange multiplier theorem by the implicit function theorem proof

Where this leads

10 pages build on this one.

Further reading

  1. Web https://econ.sufe.edu.cn/_upload/article/files/12/23/c80337b04ffebac31ff87c5d4454/a079e700-0a8b-43d5-82c2-b120938a69d1.pdf, Theorem 4.4
About this page
Tag6F09WX7TE2
URIm2://6F09WX7TE2
Kindproof
WritingW0 stub
MSC90C46
ProvesLagrange multipliers
UsesImplicit function theorem, Jacobian matrix, Gradient, Row rank equals column rank, Linear independence, Local maximum and minimum, Derivative vanishes at a local extremum, Chain rule in several variables, Continuous partial derivatives imply differentiability, C^k function characterised by continuous derivatives, Continuity in R^n
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.