Added to Favorites

${pType}

In mathematics, a level set of a real-valued function f of n variables is a set of the form
## Alternative names

## Level sets versus the gradient

## See also

## References

- { (x
_{1},...,x_{n}) | f(x_{1},...,x_{n}) = c }

For example, given a specific radius r, the equation of a circle defines an isocontour.

r^{2}=x^{2} + y^{2}

If we choose r=5 then our isovalue is c=5^{2}=25.

All points (x,y) that evaluate to 25 constitute the isocontour. This means that they are a member of the isocontour's level set. If a point evaluates to less than 25 the point is on the inside of the isocontour. If the result is greater than 25, it is on the outside.

When the number of variables is two, this is a level curve (contour line), if it is three this is a level surface, and for higher values of n the level set is a level hypersurface.

More specifically, a level curve is the set of all real-valued roots of an equation in two variables x_{1} and x_{2}. A level surface is the set of all real-valued roots of an equation in three variables x_{1}, x_{2} and x_{3}. A level hypersurface is the set of all real-valued roots of an equation in n (n > 3) variables.

A set of the form

- { (x
_{1},...,x_{n}) | f(x_{1},...,x_{n}) ≤ c }

Level sets show up in great many applications, often under different names.

For example, a level curve is also called an implicit curve, emphasizing that such a curve is defined by an implicit function. The name isocontour is also used, which means a contour of equal height. In various applications, isobars, isotherms, isogons and isochrones are isocontours.

Analogously, a level surface is sometimes called an implicit surface or an isosurface.

Lastly, a general level set is also called a fiber.

Theorem. The gradient of f at a point is perpendicular to the level set of f at that point.

This theorem is quite remarkable. To understand what it means, imagine that two hikers are at the same location on a mountain. One of them is bold, and decides to go in the direction where the slope is steepest. The other one is more cautious; he does not want to either climb or descend, choosing a path which will keep him at the same height. In our analogy, the above theorem says that the two hikers will depart in directions perpendicular to one another.

Proof. Let x_{0} be the point of interest. The level set going through x_{0} is {x | f(x) = f(x_{0})}. Consider a curve γ(t) in the level set going through x_{0}, so we will assume that γ(0) = x_{0}.
We have

- $f(\{mathbf\; gamma\}(t))\; =\; f(\{mathbf\; x\_0\})\; =\; c.$

Now let us differentiate at t = 0 by using the chain rule. We find

- $J\_f(\{mathbf\; x\_0\})\; \{mathbf\; gamma\}\text{'}(0)=0.$

Equivalently, the Jacobian of f at x_{0} is the gradient at x_{0}

- $nabla\; f(\{mathbf\; x\}\_0)\; cdot\; \{mathbf\; gamma\}\text{'}(0)=0.$

Thus, the gradient of f at x_{0} is perpendicular to the tangent γ′(0) to the curve (and to the level set) at that point. Since the curve γ(t) is arbitrary, it follows that the gradient is perpendicular to the level set. Q.E.D.

A consequence of this theorem is that if a level set crosses itself (more precisely, fails to be a smooth submanifold or hypersurface) then the gradient vector must be zero at all points of crossing. Then, every point in the crossing will be a critical point of f.

- Isosurface
- Contour line
- Level set method
- Level set (data structures)
- Gradient descent
- Constraint (mathematics)
- Implicit function
- Metaballs
- HyperFun

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Thursday September 11, 2008 at 13:45:51 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Thursday September 11, 2008 at 13:45:51 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2015 Dictionary.com, LLC. All rights reserved.