Math 2.0

Real functions Proof

Proof of the implicit function theorem for a surjective derivative

Builds on Implicit function theoremInverse function theoremJacobian matrixRank of a matrixLinear independenceChain rule in several variables

Proof

We choose mm coordinates in which the derivative is invertible, and apply the implicit function theorem.

  1. Let UU, m≤nm \le n, FF and pp be as in the statement. Let J=JF(p)J = J_F(p) be the m×nm \times n Jacobian matrix, so DF(p)v=JvDF(p) v = J v.
  2. The image of DF(p)DF(p) is the column space of JJ. Since DF(p)DF(p) is surjective, the column space is ℝm\R^m, so the rank of JJ is mm.
  3. A spanning set of ℝm\R^m contains a basis. So some mm columns of JJ, with indices i1<⋯<imi_1 < \dots < i_m, are linearly independent. The m×mm \times m matrix CC of these columns is invertible.
  4. Case m=nm = n. Then C=JC = J, and DF(p)DF(p) is invertible. By the inverse function theorem, FF is injective on an open neighbourhood WW of pp. So {x∈W:F(x)=0}={p}\set{x \in W : F(x) = 0} = \set{p}. This is the graph of the constant function of the empty list of remaining coordinates.
  5. Case m<nm < n. For x∈ℝnx \in \R^n, let x′′=(xi1,…,xim)∈ℝmx'' = (x_{i_1}, \dots, x_{i_m}) \in \R^m, and let x′∈ℝn−mx' \in \R^{n-m} list the other coordinates in their order. Let P(x)=(x′,x′′)P(x) = (x', x'').
  6. The map PP is a linear bijection that only reorders coordinates, so it preserves norms. Hence Ω=P(U)\Omega = P(U) is open, and G=F∘P−1 ⁣:Ω→ℝmG = F \circ P^{-1} \colon \Omega \to \R^m is of class C1C^1.
  7. Write P(p)=(p′,p′′)P(p) = (p', p''). By the chain rule, the partial derivatives of GG with respect to the coordinates of x′′x'' at (p′,p′′)(p', p'') are the columns i1,…,imi_1, \dots, i_m of JJ. So Dx′′G(p′,p′′)=CD_{x''} G(p', p'') = C, which is invertible.
  8. Also G(p′,p′′)=F(p)=0G(p', p'') = F(p) = 0. By the implicit function theorem, there are open sets U′∋p′U' \ni p' in ℝn−m\R^{n-m} and V′∋p′′V' \ni p'' in ℝm\R^m and a C1C^1 function φ ⁣:U′→V′\varphi \colon U' \to V' with this property. For (x′,x′′)∈U′×V′(x', x'') \in U' \times V', G(x′,x′′)=0G(x', x'') = 0 if and only if x′′=φ(x′)x'' = \varphi(x').
  9. The function GG is evaluated on U′×V′U' \times V' in this statement, so U′×V′⊆ΩU' \times V' \subseteq \Omega. Let W=P−1(U′×V′)W = P^{-1}(U' \times V'). It is open, since PP is continuous, and p∈W⊆Up \in W \subseteq U.
  10. Let x∈Wx \in W. Then (x′,x′′)=P(x)∈U′×V′(x', x'') = P(x) \in U' \times V' and F(x)=G(x′,x′′)F(x) = G(x', x''). So F(x)=0F(x) = 0 if and only if x′′=φ(x′)x'' = \varphi(x').
  11. Hence {x∈W:F(x)=0}\set{x \in W : F(x) = 0} is the set of x∈ℝnx \in \R^n with x′∈U′x' \in U' and x′′=φ(x′)x'' = \varphi(x'). This is the graph of the C1C^1 function φ\varphi of the n−mn - m coordinates in x′x'.
  12. So the coordinates xi1,…,ximx_{i_1}, \dots, x_{i_m} and the neighbourhood WW have the property in the statement.

Idea

Surjectivity of DF(p)DF(p) means that the Jacobian matrix has mm independent columns. The coordinates of these columns play the role of yy in the implicit function theorem, and the remaining coordinates play the role of xx. After this renumbering, the statement is the implicit function theorem.

Reading path

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

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Implicit_function_theorem, Statement of the theorem
About this page
Tag2MCN92CX58
URIm2://2MCN92CX58
Kindproof
WritingW0 stub
MSC26B10
ProvesImplicit function theorem for a surjective derivative
UsesImplicit function theorem, Inverse function theorem, Jacobian matrix, Rank of a matrix, Linear independence, Chain rule in several variables
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.