Difference between revisions of "Implicit function theorem"
Jump to navigation
Jump to search
m (Implicit Function Theorem moved to Implicit function theorem) |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | + | The '''Implicit function theorem''' is a [[theorem]] of [[calculus]]. It states that a (multiple-[[variable]]) function has many [[inverse]]s hidden in different [[neighborhood]]s of the [[image]]. That is to say, the [[graph]] of the function can be finitely [[partition]]ed so that each piece has an inverse function. It is used by [[mathematics|mathematicians]] for local analysis of functions which cannot be globally inverted. It is considered one of the fundaments of the Calculus and does not require [[complex analysis]] for proof. | |
| − | |||
| − | The '''Implicit | ||
[[Category:Calculus]] | [[Category:Calculus]] | ||
Latest revision as of 17:43, January 3, 2009
The Implicit function theorem is a theorem of calculus. It states that a (multiple-variable) function has many inverses hidden in different neighborhoods of the image. That is to say, the graph of the function can be finitely partitioned so that each piece has an inverse function. It is used by mathematicians for local analysis of functions which cannot be globally inverted. It is considered one of the fundaments of the Calculus and does not require complex analysis for proof.