KNOWPIA
WELCOME TO KNOWPIA

In vector calculus, the **gradient** of a scalar-valued differentiable function of several variables is the vector field (or vector-valued function) whose value at a point gives the direction and the rate of fastest increase. The gradient transforms like a vector under change of basis of the space of variables of . If the gradient of a function is non-zero at a point , the direction of the gradient is the direction in which the function increases most quickly from , and the magnitude of the gradient is the rate of increase in that direction, the greatest absolute directional derivative.^{[1]} Further, a point where the gradient is the zero vector is known as a stationary point. The gradient thus plays a fundamental role in optimization theory, where it is used to minimize a function by gradient descent. In coordinate-free terms, the gradient of a function may be defined by:

where is the total infinitesimal change in for an infinitesimal displacement , and is seen to be maximal when is in the direction of the gradient . The nabla symbol , written as an upside-down triangle and pronounced "del", denotes the vector differential operator.

When a coordinate system is used in which the basis vectors are not functions of position, the gradient is given by the vector^{[a]} whose components are the partial derivatives of at .^{[2]} That is, for , its gradient is defined at the point in *n*-dimensional space as the vector^{[b]}

Note that the above definition for gradient is only defined for the function , if it is differentiable at . There can be functions for which partial derivatives exist in every direction but fail to be differentiable. Furthermore, this definition as the vector of partial derivatives is only valid when the basis of the coordinate system is orthonormal. For any other basis, the Metric tensor at that point needs to be taken into account.

For example, the function unless at origin where , is not differentiable at the origin as it does not have a well defined tangent plane despite having well defined partial derivatives in every direction at the origin.^{[3]} In this particular example, under rotation of x-y coordinate system, the above formula for gradient fails to transform like a vector (gradient becomes dependent on choice of basis for coordinate system) and also fails to point towards the 'steepest ascent' in some orientations. For differentiable functions where the formula for gradient holds, it can be shown to always transform as a vector under transformation of the basis so as to always point towards the fastest increase.

The gradient is dual to the total derivative : the value of the gradient at a point is a tangent vector – a vector at each point; while the value of the derivative at a point is a *co*tangent vector – a linear functional on vectors.^{[c]} They are related in that the dot product of the gradient of at a point with another tangent vector equals the directional derivative of at of the function along ; that is, .
The gradient admits multiple generalizations to more general functions on manifolds; see § Generalizations.

Consider a room where the temperature is given by a scalar field, *T*, so at each point (*x*, *y*, *z*) the temperature is *T*(*x*, *y*, *z*), independent of time. At each point in the room, the gradient of *T* at that point will show the direction in which the temperature rises most quickly, moving away from (*x*, *y*, *z*). The magnitude of the gradient will determine how fast the temperature rises in that direction.

Consider a surface whose height above sea level at point (*x*, *y*) is *H*(*x*, *y*). The gradient of *H* at a point is a plane vector pointing in the direction of the steepest slope or grade at that point. The steepness of the slope at that point is given by the magnitude of the gradient vector.

The gradient can also be used to measure how a scalar field changes in other directions, rather than just the direction of greatest change, by taking a dot product. Suppose that the steepest slope on a hill is 40%. A road going directly uphill has slope 40%, but a road going around the hill at an angle will have a shallower slope. For example, if the road is at a 60° angle from the uphill direction (when both directions are projected onto the horizontal plane), then the slope along the road will be the dot product between the gradient vector and a unit vector along the road, as the dot product measures how much the unit vector along the road aligns with the steepest slope^{[d]}, which is 40% times the cosine of 60°, or 20%.

More generally, if the hill height function *H* is differentiable, then the gradient of *H* dotted with a unit vector gives the slope of the hill in the direction of the vector, the directional derivative of *H* along the unit vector.

The gradient of a function at point is usually written as . It may also be denoted by any of the following:

- : to emphasize the vector nature of the result.
- and : Written with Einstein notation, where repeated indices (i) are summed over.

The gradient (or gradient vector field) of a scalar function *f*(*x*_{1}, *x*_{2}, *x*_{3}, …, *x _{n}*) is denoted ∇

where the right-hand side is the directional derivative and there are many ways to represent it. Formally, the derivative is *dual* to the gradient; see relationship with derivative.

When a function also depends on a parameter such as time, the gradient often refers simply to the vector of its spatial derivatives only (see Spatial gradient).

The magnitude and direction of the gradient vector are independent of the particular coordinate representation.^{[4]}^{[5]}

In the three-dimensional Cartesian coordinate system with a Euclidean metric, the gradient, if it exists, is given by

where **i**, **j**, **k** are the standard unit vectors in the directions of the *x*, *y* and *z* coordinates, respectively. For example, the gradient of the function
is
or

In some applications it is customary to represent the gradient as a row vector or column vector of its components in a rectangular coordinate system; this article follows the convention of the gradient being a column vector, while the derivative is a row vector.

In cylindrical coordinates with a Euclidean metric, the gradient is given by:^{[6]}

where *ρ* is the axial distance, *φ* is the azimuthal or azimuth angle, *z* is the axial coordinate, and **e**_{ρ}, **e**_{φ} and **e**_{z} are unit vectors pointing along the coordinate directions.

In spherical coordinates, the gradient is given by:^{[6]}

where *r* is the radial distance, *φ* is the azimuthal angle and *θ* is the polar angle, and **e**_{r}, **e**_{θ} and **e**_{φ} are again local unit vectors pointing in the coordinate directions (that is, the normalized covariant basis).

For the gradient in other orthogonal coordinate systems, see Orthogonal coordinates (Differential operators in three dimensions).

We consider general coordinates, which we write as *x*^{1}, …, *x*^{i}, …, *x*^{n}, where n is the number of dimensions of the domain. Here, the upper index refers to the position in the list of the coordinate or component, so *x*^{2} refers to the second component—not the quantity *x* squared. The index variable *i* refers to an arbitrary element *x*^{i}. Using Einstein notation, the gradient can then be written as:

(Note that its dual is ),

where and refer to the unnormalized local covariant and contravariant bases respectively, is the inverse metric tensor, and the Einstein summation convention implies summation over *i* and *j*.

If the coordinates are orthogonal we can easily express the gradient (and the differential) in terms of the normalized bases, which we refer to as and , using the scale factors (also known as Lamé coefficients) :

(and ),

where we cannot use Einstein notation, since it is impossible to avoid the repetition of more than two indices. Despite the use of upper and lower indices, , , and are neither contravariant nor covariant.

The latter expression evaluates to the expressions given above for cylindrical and spherical coordinates.

The gradient is closely related to the total derivative (total differential) : they are transpose (dual) to each other. Using the convention that vectors in are represented by column vectors, and that covectors (linear maps ) are represented by row vectors,^{[a]} the gradient and the derivative are expressed as a column and row vector, respectively, with the same components, but transpose of each other:

While these both have the same components, they differ in what kind of mathematical object they represent: at each point, the derivative is a cotangent vector, a linear form (or covector) which expresses how much the (scalar) output changes for a given infinitesimal change in (vector) input, while at each point, the gradient is a tangent vector, which represents an infinitesimal change in (vector) input. In symbols, the gradient is an element of the tangent space at a point, , while the derivative is a map from the tangent space to the real numbers, . The tangent spaces at each point of can be "naturally" identified^{[e]} with the vector space itself, and similarly the cotangent space at each point can be naturally identified with the dual vector space of covectors; thus the value of the gradient at a point can be thought of a vector in the original , not just as a tangent vector.

Computationally, given a tangent vector, the vector can be *multiplied* by the derivative (as matrices), which is equal to taking the dot product with the gradient:

The best linear approximation to a differentiable function at a point in is a linear map from to which is often denoted by or and called the differential or total derivative of at . The function , which maps to , is called the total differential or exterior derivative of and is an example of a differential 1-form.

Much as the derivative of a function of a single variable represents the slope of the tangent to the graph of the function,^{[7]} the directional derivative of a function in several variables represents the slope of the tangent hyperplane in the direction of the vector.

The gradient is related to the differential by the formula for any , where is the dot product: taking the dot product of a vector with the gradient is the same as taking the directional derivative along the vector.

If is viewed as the space of (dimension ) column vectors (of real numbers), then one can regard as the row vector with components so that is given by matrix multiplication. Assuming the standard Euclidean metric on , the gradient is then the corresponding column vector, that is,

The best linear approximation to a function can be expressed in terms of the gradient, rather than the derivative. The gradient of a function from the Euclidean space to at any particular point in characterizes the best linear approximation to at . The approximation is as follows:

for close to , where is the gradient of computed at , and the dot denotes the dot product on . This equation is equivalent to the first two terms in the multivariable Taylor series expansion of at .

Let *U* be an open set in **R**^{n}. If the function *f* : *U* → **R** is differentiable, then the differential of *f* is the Fréchet derivative of *f*. Thus ∇*f* is a function from *U* to the space **R**^{n} such that
where · is the dot product.

As a consequence, the usual properties of the derivative hold for the gradient, though the gradient is not a derivative itself, but rather dual to the derivative:

- Linearity
- The gradient is linear in the sense that if
*f*and*g*are two real-valued functions differentiable at the point*a*∈**R**^{n}, and α and β are two constants, then*αf*+*βg*is differentiable at*a*, and moreover - Product rule
- If
*f*and*g*are real-valued functions differentiable at a point*a*∈**R**^{n}, then the product rule asserts that the product*fg*is differentiable at*a*, and - Chain rule
- Suppose that
*f*:*A*→**R**is a real-valued function defined on a subset*A*of**R**^{n}, and that*f*is differentiable at a point*a*. There are two forms of the chain rule applying to the gradient. First, suppose that the function*g*is a parametric curve; that is, a function*g*:*I*→**R**^{n}maps a subset*I*⊂**R**into**R**^{n}. If*g*is differentiable at a point*c*∈*I*such that*g*(*c*) =*a*, then where ∘ is the composition operator: (*f*∘*g*)(*x*) =*f*(*g*(*x*)).

More generally, if instead *I* ⊂ **R**^{k}, then the following holds:
where (*Dg*)^{T} denotes the transpose Jacobian matrix.

For the second form of the chain rule, suppose that *h* : *I* → **R** is a real valued function on a subset *I* of **R**, and that *h* is differentiable at the point *f*(*a*) ∈ *I*. Then

A level surface, or isosurface, is the set of all points where some function has a given value.

If *f* is differentiable, then the dot product (∇*f* )_{x} ⋅ *v* of the gradient at a point *x* with a vector *v* gives the directional derivative of *f* at *x* in the direction *v*. It follows that in this case the gradient of *f* is orthogonal to the level sets of *f*. For example, a level surface in three-dimensional space is defined by an equation of the form *F*(*x*, *y*, *z*) = *c*. The gradient of *F* is then normal to the surface.

More generally, any embedded hypersurface in a Riemannian manifold can be cut out by an equation of the form *F*(*P*) = 0 such that *dF* is nowhere zero. The gradient of *F* is then normal to the hypersurface.

Similarly, an affine algebraic hypersurface may be defined by an equation *F*(*x*_{1}, ..., *x*_{n}) = 0, where *F* is a polynomial. The gradient of *F* is zero at a singular point of the hypersurface (this is the definition of a singular point). At a non-singular point, it is a nonzero normal vector.

The gradient of a function is called a gradient field. A (continuous) gradient field is always a conservative vector field: its line integral along any path depends only on the endpoints of the path, and can be evaluated by the gradient theorem (the fundamental theorem of calculus for line integrals). Conversely, a (continuous) conservative vector field is always the gradient of a function.

The gradient of a function at point *x* is also the direction of its steepest ascent, i.e. it maximizes its directional derivative:

Let be an arbitrary unit vector. With the directional derivative defined as

we get, by substituting the function with its Taylor series,

where denotes higher order terms in .

Dividing by , and taking the limit yields a term which is bounded from above by the Cauchy-Schwarz inequality ^{[8]}

Choosing maximizes the directional derivative, and equals the upper bound

The Jacobian matrix is the generalization of the gradient for vector-valued functions of several variables and differentiable maps between Euclidean spaces or, more generally, manifolds.^{[9]}^{[10]} A further generalization for a function between Banach spaces is the Fréchet derivative.

Suppose **f** : **R**^{n} → **R**^{m} is a function such that each of its first-order partial derivatives exist on ℝ^{n}. Then the Jacobian matrix of **f** is defined to be an *m*×*n* matrix, denoted by or simply . The (*i*,*j*)th entry is . Explicitly

Since the total derivative of a vector field is a linear mapping from vectors to vectors, it is a tensor quantity.

In rectangular coordinates, the gradient of a vector field **f** = ( *f*^{1}, *f*^{2}, *f*^{3}) is defined by:

(where the Einstein summation notation is used and the tensor product of the vectors **e**_{i} and **e**_{k} is a dyadic tensor of type (2,0)). Overall, this expression equals the transpose of the Jacobian matrix:

In curvilinear coordinates, or more generally on a curved manifold, the gradient involves Christoffel symbols:

where *g*^{jk} are the components of the inverse metric tensor and the **e**_{i} are the coordinate basis vectors.

Expressed more invariantly, the gradient of a vector field **f** can be defined by the Levi-Civita connection and metric tensor:^{[11]}

where ∇_{c} is the connection.

For any smooth function f on a Riemannian manifold (*M*, *g*), the gradient of *f* is the vector field ∇*f* such that for any vector field *X*,
that is,
where *g*_{x}( , ) denotes the inner product of tangent vectors at *x* defined by the metric *g* and ∂_{X} *f* is the function that takes any point *x* ∈ *M* to the directional derivative of *f* in the direction *X*, evaluated at *x*. In other words, in a coordinate chart *φ* from an open subset of *M* to an open subset of **R**^{n}, (∂_{X} *f* )(*x*) is given by:
where *X*^{j} denotes the *j*th component of *X* in this coordinate chart.

So, the local form of the gradient takes the form:

Generalizing the case *M* = **R**^{n}, the gradient of a function is related to its exterior derivative, since
More precisely, the gradient ∇*f* is the vector field associated to the differential 1-form *df* using the musical isomorphism
(called "sharp") defined by the metric *g*. The relation between the exterior derivative and the gradient of a function on **R**^{n} is a special case of this in which the metric is the flat metric given by the dot product.

Wikimedia Commons has media related to Gradient fields.

- Curl – Circulation density in a vector field
- Divergence – Vector operator in vector calculus
- Four-gradient – Four-vector analogue of the gradient operation
- Hessian matrix – (Mathematical) matrix of second derivatives
- Skew gradient
- Spatial gradient – Gradient whose components are spatial derivatives

- ^
^{a}^{b}This article uses the convention that column vectors represent vectors, and row vectors represent covectors, but the opposite convention is also common. **^**Strictly speaking, the gradient is a vector field , and the value of the gradient at a point is a tangent vector in the tangent space at that point, , not a vector in the original space . However, all the tangent spaces can be naturally identified with the original space , so these do not need to be distinguished; see § Definition and relationship with the derivative.**^**The value of the gradient at a point can be thought of as a vector in the original space , while the value of the derivative at a point can be thought of as a covector on the original space: a linear map .**^**the dot product (the slope of the road around the hill) would be 40% if the degree between the road and the steepest slope is 0°, i.e. when they are completely aligned, and flat when the degree is 90°, i.e. when the road is perpendicular to the steepest slope.**^**Informally, "naturally" identified means that this can be done without making any arbitrary choices. This can be formalized with a natural transformation.

**^**- Bachman (2007, p. 77)
- Downing (2010, pp. 316–317)
- Kreyszig (1972, p. 309)
- McGraw-Hill (2007, p. 196)
- Moise (1967, p. 684)
- Protter & Morrey (1970, p. 715)
- Swokowski et al. (1994, pp. 1036, 1038–1039)

**^**- Bachman (2007, p. 76)
- Beauregard & Fraleigh (1973, p. 84)
- Downing (2010, p. 316)
- Harper (1976, p. 15)
- Kreyszig (1972, p. 307)
- McGraw-Hill (2007, p. 196)
- Moise (1967, p. 683)
- Protter & Morrey (1970, p. 714)
- Swokowski et al. (1994, p. 1038)

**^**"Non-differentiable functions must have discontinuous partial derivatives - Math Insight".*mathinsight.org*. Retrieved 2023-10-21.**^**Kreyszig (1972, pp. 308–309)**^**Stoker (1969, p. 292)- ^
^{a}^{b}Schey 1992, pp. 139–142. **^**Protter & Morrey (1970, pp. 21, 88)**^**T. Arens (2022).*Mathematik*(5th ed.). Springer Spektrum Berlin. ISBN 978-3-662-64388-4.**^**Beauregard & Fraleigh (1973, pp. 87, 248)**^**Kreyszig (1972, pp. 333, 353, 496)**^**Dubrovin, Fomenko & Novikov 1991, pp. 348–349.

- Bachman, David (2007),
*Advanced Calculus Demystified*, New York: McGraw-Hill, ISBN 978-0-07-148121-2 - Beauregard, Raymond A.; Fraleigh, John B. (1973),
*A First Course In Linear Algebra: with Optional Introduction to Groups, Rings, and Fields*, Boston: Houghton Mifflin Company, ISBN 0-395-14017-X - Downing, Douglas, Ph.D. (2010),
*Barron's E-Z Calculus*, New York: Barron's, ISBN 978-0-7641-4461-5`{{citation}}`

: CS1 maint: multiple names: authors list (link) - Dubrovin, B. A.; Fomenko, A. T.; Novikov, S. P. (1991).
*Modern Geometry—Methods and Applications: Part I: The Geometry of Surfaces, Transformation Groups, and Fields*. Graduate Texts in Mathematics (2nd ed.). Springer. ISBN 978-0-387-97663-1. - Harper, Charlie (1976),
*Introduction to Mathematical Physics*, New Jersey: Prentice-Hall, ISBN 0-13-487538-9 - Kreyszig, Erwin (1972),
*Advanced Engineering Mathematics*(3rd ed.), New York: Wiley, ISBN 0-471-50728-8 - "McGraw Hill Encyclopedia of Science & Technology".
*McGraw-Hill Encyclopedia of Science & Technology*(10th ed.). New York: McGraw-Hill. 2007. ISBN 978-0-07-144143-8. - Moise, Edwin E. (1967),
*Calculus: Complete*, Reading: Addison-Wesley - Protter, Murray H.; Morrey, Charles B. Jr. (1970),
*College Calculus with Analytic Geometry*(2nd ed.), Reading: Addison-Wesley, LCCN 76087042 - Schey, H. M. (1992).
*Div, Grad, Curl, and All That*(2nd ed.). W. W. Norton. ISBN 0-393-96251-2. OCLC 25048561. - Stoker, J. J. (1969),
*Differential Geometry*, New York: Wiley, ISBN 0-471-82825-4 - Swokowski, Earl W.; Olinick, Michael; Pence, Dennis; Cole, Jeffery A. (1994),
*Calculus*(6th ed.), Boston: PWS Publishing Company, ISBN 0-534-93624-5 - Arens, T.; Hettlich, F.; Karpfinger, C.; Kockelkorn, U.; Lichtenegger, K.; Stachel, H. (2022),
*Mathematik*(5th ed.), Springer Spektrum Berlin, ISBN 978-3-662-64388-4

- Korn, Theresa M.; Korn, Granino Arthur (2000).
*Mathematical Handbook for Scientists and Engineers: Definitions, Theorems, and Formulas for Reference and Review*. Dover Publications. pp. 157–160. ISBN 0-486-41147-8. OCLC 43864234.

Look up **gradient** in Wiktionary, the free dictionary.

- "Gradient". Khan Academy.
- Kuptsov, L.P. (2001) [1994], "Gradient",
*Encyclopedia of Mathematics*, EMS Press. - Weisstein, Eric W. "Gradient".
*MathWorld*.