Level set

Last updated March 01, 2024

Points at constant slices of

x 2 = f (x 1)

.

Lines at constant slices of

x 3 = f (x 1, x 2)

.

Planes at constant slices of

x 4 = f (x 1, x 2, x 3)

.

(n - 1)

-dimensional level sets for functions of the form

f (x 1, x 2, \dots, x n) = a 1 x 1 + a 2 x 2 + \dots + a n x n

where

a 1, a 2, \dots, a n

are constants, in

(n + 1)

-dimensional Euclidean space, for

n = 1, 2, 3

.

Points at constant slices of

x 2 = f (x 1)

.

Contour curves at constant slices of

x 3 = f (x 1, x 2)

.

Curved surfaces at constant slices of

x 4 = f (x 1, x 2, x 3)

.

(n - 1)

-dimensional level sets of non-linear functions

f (x 1, x 2, \dots, x n

) in

(n + 1)

-dimensional Euclidean space, for

n = 1, 2, 3

.

In mathematics, a level set of a real-valued function $f$ of $n$ real variables is a set where the function takes on a given constant value $c$ , that is:

When the number of independent variables is two, a level set is called a level curve , also known as contour line or isoline; so a level curve is the set of all real-valued solutions of an equation in two variables $x 1$ and $x 2$ . When $n = 3$ , a level set is called a level surface (or isosurface ); so a level surface is the set of all real-valued roots of an equation in three variables $x 1$ , $x 2$ and $x 3$ . For higher values of $n$ , the level set is a level hypersurface , the set of all real-valued roots of an equation in $n > 3$ variables.

A level set is a special case of a fiber.

Alternative names

Level sets show up in many applications, often under different names. For example, an implicit curve is a level curve, which is considered independently of its neighbor curves, emphasizing that such a curve is defined by an implicit equation. Analogously, a level surface is sometimes called an implicit surface or an isosurface.

The name isocontour is also used, which means a contour of equal height. In various application areas, isocontours have received specific names, which indicate often the nature of the values of the considered function, such as isobar, isotherm, isogon, isochrone, isoquant and indifference curve.

Examples

Consider the 2-dimensional Euclidean distance:

d(x,y)={\sqrt {x^{2}+y^{2}}}

A level set $L_{r}(d)$ of this function consists of those points that lie at a distance of $r$ from the origin, that make a circle. For example, $(3,4)\in L_{5}(d)$ , because $d(3,4)=5$ . Geometrically, this means that the point $(3,4)$ lies on the circle of radius 5 centered at the origin. More generally, a sphere in a metric space $(M,m)$ with radius $r$ centered at $x\in M$ can be defined as the level set $L_{r}(y\mapsto m(x,y))$ .

A second example is the plot of Himmelblau's function shown in the figure to the right. Each curve shown is a level curve of the function, and they are spaced logarithmically: if a curve represents $L_{x}$ , the curve directly "within" represents $L_{x/10}$ , and the curve directly "outside" represents $L_{10x}$ .

Level sets versus the gradient

Theorem: If the function

f

is differentiable, the gradient of

f

at a point is either zero, or perpendicular to the level set of

f

at that point.

To understand what this 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 and does not want to either climb or descend, choosing a path which stays at the same height. In our analogy, the above theorem says that the two hikers will depart in directions perpendicular to each other.

A consequence of this theorem (and its proof) is that if $f$ is differentiable, a level set is a hypersurface and a manifold outside the critical points of $f$ . At a critical point, a level set may be reduced to a point (for example at a local extremum of $f$ ) or may have a singularity such as a self-intersection point or a cusp.

Sublevel and superlevel sets

A set of the form

L_{c}^{-}(f)=\left\{(x_{1},\dots ,x_{n})\mid f(x_{1},\dots ,x_{n})\leq c\right\}

is called a sublevel set of f (or, alternatively, a lower level set or trench of f). A strict sublevel set of f is

\left\{(x_{1},\dots ,x_{n})\mid f(x_{1},\dots ,x_{n})<c\right\}

Similarly

L_{c}^{+}(f)=\left\{(x_{1},\dots ,x_{n})\mid f(x_{1},\dots ,x_{n})\geq c\right\}

is called a superlevel set of f (or, alternatively, an upper level set of f). And a strict superlevel set of f is

\left\{(x_{1},\dots ,x_{n})\mid f(x_{1},\dots ,x_{n})>c\right\}

Sublevel sets are important in minimization theory. By Weierstrass's theorem, the boundness of some non-empty sublevel set and the lower-semicontinuity of the function implies that a function attains its minimum. The convexity of all the sublevel sets characterizes quasiconvex functions.^[2]

Related Research Articles

<span class="mw-page-title-main">Elliptic curve</span> Algebraic curve

In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point $O$ . An elliptic curve is defined over a field $K$ and describes points in $K 2$ , the Cartesian product of $K$ with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions $(x, y)$ for:

<span class="mw-page-title-main">Mean value theorem</span> On the existence of a tangent to an arc parallel to the line through its endpoints

In mathematics, the mean value theorem states, roughly, that for a given planar arc between two endpoints, there is at least one point at which the tangent to the arc is parallel to the secant through its endpoints. It is one of the most important results in real analysis. This theorem is used to prove statements about a function on an interval starting from local hypotheses about derivatives at points of the interval.

In mathematics, mathematical physics and the theory of stochastic processes, a harmonic function is a twice continuously differentiable function $where U is an open subset of that satisfies Laplace's equation, that is,$

In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function subject to equation constraints. It is named after the mathematician Joseph-Louis Lagrange.

The calculus of variations is a field of mathematical analysis that uses variations, which are small changes in functions and functionals, to find maxima and minima of functionals: mappings from a set of functions to the real numbers. Functionals are often expressed as definite integrals involving functions and their derivatives. Functions that maximize or minimize functionals may be found using the Euler–Lagrange equation of the calculus of variations.

In vector calculus, Green's theorem relates a line integral around a simple closed curve $C$ to a double integral over the plane region $D$ bounded by $C$ . It is the two-dimensional special case of Stokes' theorem.

<span class="mw-page-title-main">Convex function</span> Real function with secant line between points above the graph itself

In mathematics, a real-valued function is called convex if the line segment between any two distinct points on the graph of the function lies above the graph between the two points. Equivalently, a function is convex if its epigraph is a convex set. In simple terms, a convex function graph is shaped like a cup $, while a concave function's graph is shaped like a cap .$

In mathematics, an implicit equation is a relation of the form $where R is a function of several variables. For example, the implicit equation of the unit circle is$

In mathematics, an affine algebraic plane curve is the zero set of a polynomial in two variables. A projective algebraic plane curve is the zero set in a projective plane of a homogeneous polynomial in three variables. An affine algebraic plane curve can be completed in a projective algebraic plane curve by homogenizing its defining polynomial. Conversely, a projective algebraic plane curve of homogeneous equation $h (x, y, t) = 0$ can be restricted to the affine algebraic plane curve of equation $h (x, y, 1) = 0$ . These two operations are each inverse to the other; therefore, the phrase algebraic plane curve is often used without specifying explicitly whether it is the affine or the projective case that is considered.

In the calculus of variations and classical mechanics, the Euler–Lagrange equations are a system of second-order ordinary differential equations whose solutions are stationary points of the given action functional. The equations were discovered in the 1750s by Swiss mathematician Leonhard Euler and Italian mathematician Joseph-Louis Lagrange.

In algebraic geometry, a projective variety over an algebraically closed field k is a subset of some projective n-space $over k that is the zero-locus of some finite family of homogeneous polynomials of n + 1 variables with coefficients in k, that generate a prime ideal, the defining ideal of the variety. Equivalently, an algebraic variety is projective if it can be embedded as a Zariski closed subvariety of .$

In multivariable calculus, the implicit function theorem is a tool that allows relations to be converted to functions of several real variables. It does so by representing the relation as the graph of a function. There may not be a single function whose graph can represent the entire relation, but there may be such a function on a restriction of the domain of the relation. The implicit function theorem gives a sufficient condition to ensure that there is such a function.

In mathematics, Frobenius' theorem gives necessary and sufficient conditions for finding a maximal set of independent solutions of an overdetermined system of first-order homogeneous linear partial differential equations. In modern geometric terms, given a family of vector fields, the theorem gives necessary and sufficient integrability conditions for the existence of a foliation by maximal integral manifolds whose tangent bundles are spanned by the given vector fields. The theorem generalizes the existence theorem for ordinary differential equations, which guarantees that a single vector field always gives rise to integral curves; Frobenius gives compatibility conditions under which the integral curves of r vector fields mesh into coordinate grids on r-dimensional integral manifolds. The theorem is foundational in differential topology and calculus on manifolds.

In mathematical analysis, and applications in geometry, applied mathematics, engineering, and natural sciences, a function of a real variable is a function whose domain is the real numbers $, or a subset of that contains an interval of positive length. Most real functions that are considered and studied are differentiable in some interval. The most widely considered such functions are the real functions, which are the real-valued functions of a real variable, that is, the functions of a real variable whose codomain is the set of real numbers.$

In mathematics, a critical point is the argument of a function where the function derivative is zero . The value of the function at a critical point is a critical value.

In mathematics, a quasiconvex function is a real-valued function defined on an interval or on a convex subset of a real vector space such that the inverse image of any set of the form $is a convex set. For a function of a single variable, along any stretch of the curve the highest point is one of the endpoints. The negative of a quasiconvex function is said to be quasiconcave .$

In mathematics, a line integral is an integral where the function to be integrated is evaluated along a curve. The terms path integral, curve integral, and curvilinear integral are also used; contour integral is used as well, although that is typically reserved for line integrals in the complex plane.

In mathematics, an ordinary differential equation (ODE) is a differential equation (DE) dependent on only a single independent variable. As with other DE, its unknown(s) consists of one function(s) and involves the derivatives of those functions. The term "ordinary" is used in contrast with partial differential equations which may be with respect to more than one independent variable.

In mathematical analysis and its applications, a function of several real variables or real multivariate function is a function with more than one argument, with all arguments being real variables. This concept extends the idea of a function of a real variable to several variables. The "input" variables take real values, while the "output", also called the "value of the function", may be real or complex. However, the study of the complex-valued functions may be easily reduced to the study of the real-valued functions, by considering the real and imaginary parts of the complex function; therefore, unless explicitly specified, only real-valued functions will be considered in this article.

Most of the terms listed in Wikipedia glossaries are already defined and explained within Wikipedia itself. However, glossaries like this one are useful for looking up, comparing and reviewing large numbers of terms together. You can help enhance this page by adding new terms or writing definitions for existing ones.

References

↑ Simionescu, P.A. (2011). "Some Advancements to Visualizing Constrained Functions and Inequalities of Two Variables". Journal of Computing and Information Science in Engineering. 11 (1). doi:10.1115/1.3570770.
↑ Kiwiel, Krzysztof C. (2001). "Convergence and efficiency of subgradient methods for quasiconvex minimization". Mathematical Programming, Series A. Berlin, Heidelberg: Springer. 90 (1): 1–25. doi:10.1007/PL00011414. ISSN 0025-5610. MR 1819784. S2CID 10043417.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Simionescu, P.A. (2011). "Some Advancements to Visualizing Constrained Functions and Inequalities of Two Variables". Journal of Computing and Information Science in Engineering. 11 (1). doi:10.1115/1.3570770.

[2] Kiwiel, Krzysztof C. (2001). "Convergence and efficiency of subgradient methods for quasiconvex minimization". Mathematical Programming, Series A. Berlin, Heidelberg: Springer. 90 (1): 1–25. doi:10.1007/PL00011414. ISSN 0025-5610. MR 1819784. S2CID 10043417.

[2]