A Wikibookian believes this page should be split into smaller pages with a narrower subtopic. You can help by splitting this big page into smaller ones. Please make sure to follow the naming policy. Dividing books into smaller sections can provide more focus and allow each one to do one thing well, which benefits everyone. 
In your previous study of calculus, we have looked at functions and their behavior. Most of these functions we have examined have been all in the form
 f(x) : R → R,
and only occasional examination of functions of two variables. However, the study of functions of several variables is quite rich in itself, and has applications in several fields.
We write functions of vectors  many variables  as follows:
 f : R^{m} → R^{n}
and f(x) for the function that maps a vector in R^{m} to a vector in R^{n}.
Before we can do calculus in R^{n}, we must familiarize ourselves with the structure of R^{n}. We need to know which properties of R can be extended to R^{n}
Topology in R^{n}Edit
We are already familiar with the nature of the regular real number line, which is the set R, and the twodimensional plane, R^{2}. This examination of topology in R^{n} attempts to look at a generalization of the nature of ndimensional spaces  R, or R^{23}, or R^{n}.
Lengths and distancesEdit
If we have a vector in R^{2}, we can calculate its length using the Pythagorean theorem. For instance, the length of the vector (2, 3) is
We can generalize this to R^{n}. We define a vector's length, written x, as the square root of the sum of the squares of each of its components. That is, if we have a vector x=(x_{1},...,x_{n}),
Now that we have established some concept of length, we can establish the distance between two vectors. We define this distance to be the length of the two vectors' difference. We write this distance d(x, y), and it is
This distance function is sometimes referred to as a metric. Other metrics arise in different circumstances. The metric we have just defined is known as the Euclidean metric.
Open and closed ballsEdit
In R, we have the concept of an interval, in that we choose a certain number of other points about some central point. For example, the interval [1, 1] is centered about the point 0, and includes points to the left and right of zero.
In R^{2} and up, the idea is a little more difficult to carry on. For R^{2}, we need to consider points to the left, right, above, and below a certain point. This may be fine, but for R^{3} we need to include points in more directions.
We generalize the idea of the interval by considering all the points that are a given, fixed distance from a certain point  now we know how to calculate distances in R^{n}, we can make our generalization as follows, by introducing the concept of an open ball and a closed ball respectively, which are analogous to the open and closed interval respectively.
 an open ball
 is a set in the form { x ∈ R^{n}d(x, a) < r}
 a closed ball
 is a set in the form { x ∈ R^{n}d(x, a) ≤ r}
In R, we have seen that the open ball is simply an open interval centered about the point x=a. In R^{2} this is a circle with no boundary, and in R^{3} it is a sphere with no outer surface. (What would the closed ball be?)
Boundary pointsEdit
If we have some area, say a field, then the common sense notion of the boundary is the points 'next to' both the inside and outside of the field. For a set, S, we can define this rigorously by saying the boundary of the set contains all those points such that we can find points both inside and outside the set. We call the set of such points ∂S
Typically, when it exists the dimension of ∂S is one lower than the dimension of S. e.g. the boundary of a volume is a surface and the boundary of a surface is a curve.
This isn't always true; but it is true of all the sets we will be using.
A set S is bounded if there is some positive number such that we can encompass this set by a closed ball about 0. > if every point in it is within a finite distance of the origin, i.e there exists some r>0 such that x is in S implies x<r.
Curves and parameterizationsEdit
If we have a function f : R → R^{n}, we say that f's image (the set {f(t)  t ∈ R}  or some subset of R) is a curve in R^{n} and f is its parametrization.
Parameterizations are not necessarily unique  for example, f(t) = (cos t, sin t) such that t ∈ [0, 2π) is one parametrization of the unit circle, and g(t) = (cos at, sin at) such that t ∈ [0, 2π/a) is a whole family of parameterizations of that circle.
Collision and intersection pointsEdit
Say we have two different curves. It may be important to consider
 points the two curves share  where they intersect
 intersections which occur for the same value of t  where they collide.
Intersection pointsEdit
Firstly, we have two parameterizations f(t) and g(t), and we want to find out when they intersect, this means that we want to know when the function values of each parametrization are the same. This means that we need to solve
 f(t) = g(s)
because we're seeking the function values independent of the times they intersect.
For example, if we have f(t) = (t, 3t) and g(t) = (t, t^{2}), and we want to find intersection points:
 f(t) = g(s)
 (t, 3t) = (s, s^{2})
 t = s and 3t = s^{2}
with solutions (t, s) = (0, 0) and (3, 3)
So, the two curves intersect at the points (0, 0) and (3, 3).
Collision pointsEdit
However, if we want to know when the points "collide", with f(t) and g(t), we need to know when both the function values and the times are the same, so we need to solve instead
 f(t) = g(t)
For example, using the same functions as before, f(t) = (t, 3t) and g(t) = (t, t^{2}), and we want to find collision points:
 f(t) = g(t)
 (t, 3t) = (t, t^{2})
 t = t and 3t = t^{2}
which gives solutions t = 0, 3 So the collision points are (0, 0) and (3, 3).
We may want to do this to actually model physical problems, such as in ballistics.
Continuity and differentiabilityEdit
If we have a parametrization f : R → R^{n}, which is built up out of component functions in the form f(t) = (f_{1}(t),...,f_{n}(t)), f is continuous if and only if each component function is also.
In this case the derivative of f(t) is
 a_{i} = (f_{1}′(t),...,f_{n}′(t)). This is actually a specific consequence of a more general fact we will see later.
Tangent vectorsEdit
Recall in singlevariable calculus that on a curve, at a certain point, we can draw a line that is tangent to that curve at exactly at that point. This line is called a tangent. In the several variable case, we can do something similar.
We can expect the tangent vector to depend on f′(t) and we know that a line is its own tangent, so looking at a parametrised line will show us precisely how to define the tangent vector for a curve.
An arbitrary line is f(t)=at+b, with :f_{i}(t)=a_{i}t+b_{i}, so
 f_{i}′(t)=a_{i} and
 f′(t)=a, which is the direction of the line, its tangent vector.
Similarly, for any curve, the tangent vector is f′(t).
Angle between curvesEdit
We can then formulate the concept of the angle between two curves by considering the angle between the two tangent vectors. If two curves, parametrized by f_{1} and f_{2} intersect at some point, which means that
 f_{1}(s)=f_{2}(t)=c,
the angle between these two curves at c is the angle between the tangent vectors f_{1}′(s) and f_{2}′(t) is given by
Tangent linesEdit
With the concept of the tangent vector as being analogous to being the gradient of the line in the one variable case, we can form the idea of the tangent line. Recall that we need a point on the line and its direction.
If we want to form the tangent line to a point on the curve, say p, we have the direction of the line f′(p), so we can form the tangent line
 x(t)=p+t f′(p)
Different parameterizationsEdit
One such parametrization of a curve is not necessarily unique. Curves can have several different parametrizations. For example, we already saw that the unit circle can be parametrized by g(t) = (cos at, sin at) such that t ∈ [0, 2π/a).
Generally, if f is one parametrization of a curve, and g is another, with
 f(t_{0}) = g(s_{0})
there is a function u(t) such that u(t_{0})=s_{0}, and g'(u(t)) = f(t) near t_{0}.
This means, in a sense, the function u(t) "speeds up" the curve, but keeps the curve's shape.
SurfacesEdit
A surface in space can be described by the image of a function f : R^{2} → R^{n}. f is said to be the parametrization of that surface.
For example, consider the function
 f(α, β) = α(2,1,3)+β(1,2,0)
This describes an infinite plane in R^{3}. If we restrict α and β to some domain, we get a parallelogramshaped surface in R^{3}.
Surfaces can also be described explicitly, as the graph of a function z = f(x, y) which has a standard parametrization as f(x,y)=(x, y, f(x,y)), or implictly, in the form f(x, y, z)=c.
Level setsEdit
The concept of the level set (or contour) is an important one. If you have a function f(x, y, z), a level set in R^{3} is a set of the form {(x,y,z)f(x,y,z)=c}. Each of these level sets is a surface.
Level sets can be similarly defined in any R^{n}
Level sets in two dimensions may be familiar from maps, or weather charts. Each line represents a level set. For example, on a map, each contour represents all the points where the height is the same. On a weather chart, the contours represent all the points where the air pressure is the same.
Limits and continuityEdit
Before we can look at derivatives of multivariate functions, we need to look at how limits work with functions of several variables first, just like in the single variable case.
If we have a function f : R^{m} → R^{n}, we say that f(x) approaches b (in R^{n}) as x approaches a (in R^{m}) if, for all positive ε, there is a corresponding positive number δ, f(x)b < ε whenever xa < δ, with x ≠ a.
This means that by making the difference between x and a smaller, we can make the difference between f(x) and b as small as we want.
If the above is true, we say
 f(x) has limit b at a
 f(x) approaches b as x approaches a
 f(x) → b as x → a
These four statements are all equivalent.
RulesEdit
Since this is an almost identical formulation of limits in the single variable case, many of the limit rules in the one variable case are the same as in the multivariate case.
For f and g, mapping R^{m} to R^{n}, and h(x) a scalar function mapping R^{m} to R, with
 f(x) → b as x → a
 g(x) → c as x → a
 h(x) → H as x → a
then:
and consequently
when H≠0
ContinuityEdit
Again, we can use a similar definition to the one variable case to formulate a definition of continuity for multiple variables.
If f : R^{m} → R^{n}, f is continuous at a point a in R^{m} if f(a) is defined and
Just as for functions of one dimension, if f, g are both continuous at p, f+g, λf (for a scalar λ), f·g, and f×g are continuous also. If φ : R^{m} → R is continus at p, φf, f/φ are too if φ is never zero.
From these facts we also have that if A is some matrix which is n×m in size, with x in R^{m}, a function f(x)=A x is continuous in that the function can be expanded in the form x_{1}a_{1}+...+x_{m}a_{m}, which can be easily verified from the points above.
If f : R^{m} → R^{n} which is in the form f(x) = (f_{1}(x),...,f_{n}(x) is continuous if and only if each of its component functions are a polynomial or rational function, whenever they are defined.
Finally, if f is continuous at p, g is continuous at f(p), g(f(x)) is continuous at p.
Special note about limitsEdit
It is important to note that we can approach a point in more than one direction, and thus, the direction that we approach that point counts in our evaluation of the limit. It may be the case that a limit may exist moving in one direction, but not in another.
Differentiable functionsEdit
We will start from the onevariable definition of the derivative at a point p, namely
Let's change above to equivalent form of
which achieved after pulling f'(p) inside and putting it over a common denominator.
We can't divide by vectors, so this definition can't be immediately extended to the multiple variable case. Nonetheless, we don't have to: the thing we took interest in was the quotient of two small distances (magnitudes), not their other properties (like sign). It's worth noting that 'other' property of vector neglected is its direction. Now we can divide by the absolute value of a vector, so lets rewrite this definition in terms of absolute values
Another form of formula above is obtained by letting we have and if , the , so
 ,
where can be thought of as a 'small change'.
So, how can we use this for the severalvariable case?
If we switch all the variables over to vectors and replace the constant (which performs a linear map in one dimension) with a matrix (which denotes also a linear map), we have
or
If this limit exists for some f : R^{m} → R^{n}, and there is a linear map A : R^{m} → R^{n} (denoted by matrix A which is m×n), we refer to this map as being the derivative and we write it as D_{p} f.
A point on terminology  in referring to the action of taking the derivative (giving the linear map A), we write D_{p} f, but in referring to the matrix A itself, it is known as the Jacobian matrix and is also written J_{p} f. More on the Jacobian later.
PropertiesEdit
There are a number of important properties of this formulation of the derivative.
Affine approximationsEdit
If f is differentiable at p for x close to p, f(x)(f(p)+A(xp)) is small compared to xp, which means that f(x) is approximately equal to f(p)+A(xp).
We call an expression of the form g(x)+c affine, when g(x) is linear and c is a constant. f(p)+A(xp) is an affine approximation to f(x).
Jacobian matrix and partial derivativesEdit
The Jacobian matrix of a function is in the form
for a f : R^{m} → R^{n}, J_{p} f' is a n×m matrix.
The consequence of this is that if f is differentiable at p, all the partial derivatives of f exist at p.
However, it is possible that all the partial derivatives of a function exist at some point yet that function is not differentiable there, so it is very important not to mix derivative (linear map) with the Jacobian (matrix) especially in situations akin to the one cited.
Continuity and differentiabilityEdit
Furthermore, if all the partial derivatives exist, and are continuous in some neighbourhood of a point p, then f is differentiable at p. This has the consequence that for a function f which has its component functions built from continuous functions (such as rational functions, differentiable functions or otherwise), f is differentiable everywhere f is defined.
We use the terminology continuously differentiable for a function differentiable at p which has all its partial derivatives existing and are continuous in some neighbourhood at p.
Rules of taking JacobiansEdit
If f : R^{m} → R^{n}, and h(x) : R^{m} → R are differentiable at 'p':
Important: make sure the order is right  matrix multiplication is not commutative!
Chain ruleEdit
The chain rule for functions of several variables is as follows. For f : R^{m} → R^{n} and g : R^{n} → R^{p}, and g o f differentiable at p, then the Jacobian is given by
Again, we have matrix multiplication, so one must preserve this exact order. Compositions in one order may be defined, but not necessarily in the other way.
Alternate notationsEdit
For simplicity, we will often use various standard abbreviations, so we can write most of the formulae on one line. This can make it easier to see the important details.
We can abbreviate partial differentials with a subscript, e.g.,
When we are using a subscript this way we will generally use the Heaviside D rather than ∂,
Mostly, to make the formulae even more compact, we will put the subscript on the function itself.
If we are using subscripts to label the axes, x_{1}, x_{2} …, then, rather than having two layers of subscripts, we will use the number as the subscript.
We can also use subscripts for the components of a vector function, u=(u_{x}, u_{y}, u_{y}) or u=(u_{1},u_{2}…u_{n})
If we are using subscripts for both the components of a vector and for partial derivatives we will separate them with a comma.
The most widely used notation is h_{x}. Both h_{1} and ∂_{1}h are also quite widely used whenever the axes are numbered. The notation ∂_{x}h is used least frequently.
We will use whichever notation best suits the equation we are working with.
Directional derivativesEdit
Normally, a partial derivative of a function with respect to one of its variables, say, x_{j}, takes the derivative of that "slice" of that function parallel to the x_{j}'th axis.
More precisely, we can think of cutting a function f(x_{1},...,x_{n}) in space along the x_{j}'th axis, with keeping everything but the x_{j} variable constant.
From the definition, we have the partial derivative at a point p of the function along this slice as
provided this limit exists.
Instead of the basis vector, which corresponds to taking the derivative along that axis, we can pick a vector in any direction (which we usually take as being a unit vector), and we take the directional derivative of a function as
where d is the direction vector.
If we want to calculate directional derivatives, calculating them from the limit definition is rather painful, but, we have the following: if f : R^{n} → R is differentiable at a point p, p=1,
There is a closely related formulation which we'll look at in the next section.
Gradient vectorsEdit
The partial derivatives of a scalar tell us how much it changes if we move along one of the axes. What if we move in a different direction?
We'll call the scalar f, and consider what happens if we move an infintesimal direction dr=(dx,dy,dz), using the chain rule.
This is the dot product of dr with a vector whose components are the partial derivatives of f, called the gradient of f
We can form directional derivatives at a point p, in the direction d then by taking the dot product of the gradient with d
 .
Notice that grad f looks like a vector multiplied by a scalar. This particular combination of partial derivatives is commonplace, so we abbreviate it to
We can write the action of taking the gradient vector by writing this as an operator. Recall that in the onevariable case we can write d/dx for the action of taking the derivative with respect to x. This case is similar, but ∇ acts like a vector.
We can also write the action of taking the gradient vector as:
Properties of the gradient vectorEdit
GeometryEdit
 Grad f(p) is a vector pointing in the direction of steepest slope of f. grad f(p) is the rate of change of that slope at that point.
For example, if we consider h(x, y)=x^{2}+y^{2}. The level sets of h are concentric circles, centred on the origin, and
grad h points directly away from the origin, at right angles to the contours.
 Along a level set, (∇f)(p) is perpendicular to the level set {xf(x)=f(p) at x=p}.
If dr points along the contours of f, where the function is constant, then df will be zero. Since df is a dot product, that means that the two vectors, df and grad f, must be at right angles, i.e. the gradient is at right angles to the contours.
Algebraic propertiesEdit
Like d/dx, ∇ is linear. For any pair of constants, a and b, and any pair of scalar functions, f and g
Since it's a vector, we can try taking its dot and cross product with other vectors, and with itself.
DivergenceEdit
If the vector function u maps R^{n} to itself, then we can take the dot product of u and ∇. This dot product is called the divergence.
If we look at a vector function like v=(1+x^{2},xy) we can see that to the left of the origin all the v vectors are converging towards the origin, but on the right they are diverging away from it.
Div u tells us how much u is converging or diverging. It is positive when the vector is diverging from some point, and negative when the vector is converging on that point.
 Example:
 For v=(1+x^{2}, xy), div v=3x, which is positive to the right of the origin, where v is diverging, and negative to the left of the origin, where v is converging.
Like grad, div is linear.
Later in this chapter we will see how the divergence of a vector function can be integrated to tell us more about the behaviour of that function.
To find the divergence we took the dot product of ∇ and a vector with ∇ on the left. If we reverse the order we get
To see what this means consider i·∇ This is D_{x}, the partial differential in the i direction. Similarly, u·∇ is the partial differential in the u direction, multiplied by u
CurlEdit
If u is a threedimensional vector function on R^{3} then we can take its cross product with ∇. This cross product is called the curl.
Curl u tells us if the vector u is rotating round a point. The direction of curl u is the axis of rotation.
We can treat vectors in two dimensions as a special case of three dimensions, with u_{z}=0 and D_{z}u=0. We can then extend the definition of curl u to twodimensional vectors
This two dimensional curl is a scalar. In four, or more, dimensions there is no vector equivalent to the curl.
Example:
Consider u=(y, x). These vectors are tangent to circles centred on the origin, so appear to be rotating around it anticlockwise.
Example
Consider u=(y, xz, y), which is similar to the previous example.
This u is rotating round the axis i+k
Later in this chapter we will see how the curl of a vector function can be integrated to tell us more about the behaviour of that function.
Product and chain rulesEdit
Just as with ordinary differentiation, there are product rules for grad, div and curl.
 If g is a scalar and v is a vector, then

 the divergence of gv is

 the curl of gv is
 If u and v are both vectors then

 the gradient of their dot product is

 the divergence of their cross product is

 the curl of their cross product is
We can also write chain rules. In the general case, when both functions are vectors and the composition is defined, we can use the Jacobian defined earlier.
where J_{u} is the Jacobian of u at the point v.
Normally J is a matrix but if either the range or the domain of u is R^{1} then it becomes a vector. In these special cases we can compactly write the chain rule using only vector notation.
 If g is a scalar function of a vector and h is a scalar function of g then
 If g is a scalar function of a vector then
This substitution can be made in any of the equations containing ∇
Second order differentialsEdit
We can also consider dot and cross products of ∇ with itself, whenever they can be defined. Once we know how to simplify products of two ∇'s we'll know out to simplify products with three or more.
The divergence of the gradient of a scalar f is
This combination of derivatives is the Laplacian of f. It is commmonplace in physics and multidimensional calculus because of its simplicity and symmetry.
We can also take the Laplacian of a vector,
The Laplacian of a vector is not the same as the divergence of its gradient
Both the curl of the gradient and the divergence of the curl are always zero.
This pair of rules will prove useful.
IntegrationEdit
We have already considered differentiation of functions of more than one variable, which leads us to consider how we can meaningfully look at integration.
In the single variable case, we interpret the definite integral of a function to mean the area under the function. There is a similar interpretation in the multiple variable case: for example, if we have a paraboloid in R^{3}, we may want to look at the integral of that paraboloid over some region of the xy plane, which will be the volume under that curve and inside that region.
Riemann sumsEdit
When looking at these forms of integrals, we look at the Riemann sum. Recall in the onevariable case we divide the interval we are integrating over into rectangles and summing the areas of these rectangles as their widths get smaller and smaller. For the multiplevariable case, we need to do something similar, but the problem arises how to split up R^{2}, or R^{3}, for instance.
To do this, we extend the concept of the interval, and consider what we call a ninterval. An ninterval is a set of points in some rectangular region with sides of some fixed width in each dimension, that is, a set in the form {x∈R^{n}a_{i} ≤ x_{i} ≤ b_{i} with i = 0,...,n}, and its area/size/volume (which we simply call its measure to avoid confusion) is the product of the lengths of all its sides.
So, an ninterval in R^{2} could be some rectangular partition of the plane, such as {(x,y)  x ∈ [0,1] and y ∈ [0, 2]}. Its measure is 2.
If we are to consider the Riemann sum now in terms of subnintervals of a region Ω, it is
where m(S_{i}) is the measure of the division of Ω into k subnintervals S_{i}, and x^{*}_{i} is a point in S_{i}. The index is important  we only perform the sum where S_{i} falls completely within Ω  any S_{i} that is not completely contained in Ω we ignore.
As we take the limit as k goes to infinity, that is, we divide up Ω into finer and finer subnintervals, and this sum is the same no matter how we divide up Ω, we get the integral of f over Ω which we write
For two dimensions, we may write
and likewise for n dimensions.
Iterated integralsEdit
Thankfully, we need not always work with Riemann sums every time we want to calculate an integral in more than one variable. There are some results that make life a bit easier for us.
For R^{2}, if we have some region bounded between two functions of the other variable (so two functions in the form f(x) = y, or f(y) = x), between a constant boundary (so, between x = a and x =b or y = a and y = b), we have
An important theorem (called Fubini's theorem) assures us that this integral is the same as
 ,
if f is continuous on the domain of integration.
Order of integrationEdit
In some cases the first integral of the entire iterated integral is difficult or impossible to solve, therefore, it can be to our advantage to change the order of integration.
As of the writing of this, there is no set method to change an order of integration from dxdy to dydx or some other variable. Although, it is possible to change the order of integration in an x and y simple integration by simply switching the limits of integration around also, in nonsimple x and y integrations the best method as of yet is to recreate the limits of the integration from the graph of the limits of integration.
In higher order integration that can't be graphed, the process can be very tedious. For example, dxdydz can be written into dzdydx, but first dxdydz must be switched to dydxdz and then to dydzdx and then to dzdydx (as 3dimensional cases can be graphed, this method would lack parsimony).
Parametric integralsEdit
If we have a vector function, u, of a scalar parameter, s, we can integrate with respect to s simply by integrating each component of u separately.
Similarly, if u is given a function of vector of parameters, s, lying in R^{n}, integration with respect to the parameters reduces to a multiple integral of each component.
Line integralsEdit
In one dimension, saying we are integrating from a to b uniquely specifies the integral.
In higher dimensions, saying we are integrating from a to b is not sufficient. In general, we must also specify the path taken between a and b.
We can then write the integrand as a function of the arclength along the curve, and integrate by components.
E.g., given a scalar function h(r) we write
where C is the curve being integrated along, and t is the unit vector tangent to the curve.
There are some particularly natural ways to integrate a vector function, u, along a curve,
where the third possibility only applies in 3 dimensions.
Again, these integrals can all be written as integrals with respect to the arclength, s.
If the curve is planar and u a vector lying in the same plane, the second integral can be usefully rewritten. Say,
where t, n, and b are the tangent, normal, and binormal vectors uniquely defined by the curve.
Then
For the 2d curves specified b is the constant unit vector normal to their plane, and u_{b} is always zero.
Therefore, for such curves,
Green's TheoremEdit
Let C be a piecewise smooth, simple closed curve that bounds a region S on the Cartesian plane. If two function M(x,y) and N(x,y) are continuous and their partial derivatives are continuous, then
In order for Green's theorem to work there must be no singularities in the vector field within the boundaries of the curve.
Green's theorem works by summing the circulation in each infinitesimal segment of area enclosed within the curve.
Inverting differentialsEdit
We can use line integrals to calculate functions with specified divergence, gradient, or curl.
 If grad V = u
 where h is any function of zero gradient and curl u must be zero.
 If div u = V
 where w is any function of zero divergence.
 If curl u = v
 where w is any function of zero curl.
For example, if V=r^{2} then
and
so this line integral of the gradient gives the original function.
Similarly, if v=k then
Consider any curve from 0 to p=(x, y', z), given by r=r(s) with r(0)=0 and r(S)=p for some S, and do the above integral along that curve.
and curl u is
as expected.
We will soon see that these three integrals do not depend on the path, apart from a constant.
Surface and Volume IntegralsEdit
Just as with curves, it is possible to parameterise surfaces then integrate over those parameters without regard to geometry of the surface.
That is, to integrate a scalar function V over a surface A parameterised by r and s we calculate
where J is the Jacobian of the transformation to the parameters.
To integrate a vector this way, we integrate each component separately.
However, in three dimensions, every surface has an associated normal vector n, which can be used in integration. We write dS=ndS.
For a scalar function, V, and a vector function, v, this gives us the integrals
These integrals can be reduced to parametric integrals but, written this way, it is clear that they reflect more of the geometry of the surface.
When working in three dimensions, dV is a scalar, so there is only one option for integrals over volumes.
Gauss's divergence theoremEdit
We know that, in one dimension,
Integration is the inverse of differentiation, so integrating the differential of a function returns the original function.
This can be extended to two or more dimensions in a natural way, drawing on the analogies between single variable and multivariable calculus.
The analog of D is ∇, so we should consider cases where the integrand is a divergence.
Instead of integrating over a onedimensional interval, we need to integrate over a ndimensional volume.
In one dimension, the integral depends on the values at the edges of the interval, so we expect the result to be connected with values on the boundary.
This suggests a theorem of the form,
This is indeed true, for vector fields in any number of dimensions.
This is called Gauss's theorem.
There are two other, closely related, theorems for grad and curl:
 ,
 ,
with the last theorem only being valid where curl is defined.
Stokes' curl theoremEdit
These theorems also hold in two dimensions, where they relate surface and line integrals. Gauss's divergence theorem becomes
where s is arclength along the boundary curve and the vector n is the unit normal to the curve that lies in the surface S, i.e. in the tangent plane of the surface at its boundary, which is not necessarily the same as the unit normal associated with the boundary curve itself.
Similarly, we get
 ,
where C is the boundary of S
In this case the integral does not depend on the surface S.
To see this, suppose we have different surfaces, S_{1} and S_{2}, spanning the same curve C, then by switching the direction of the normal on one of the surfaces we can write
The left hand side is an integral over a closed surface bounding some volume V so we can use Gauss's divergence theorem.
but we know this integrand is always zero so the right hand side of (2) must always be zero, i.e. the integral is independent of the surface.
This means we can choose the surface so that the normal to the curve lying in the surface is the same as the curves intrinsic normal.
Then, if u itself lies in the surface, we can write
just as we did for line integrals in the plane earlier, and substitute this into (1) to get
This is Stokes' curl theorem