User:SamHB/MVCalc2
| Resource type: this resource is a course. |
| Subject classification: this is a physics resource . |
| Subject classification: this is a mathematics resource . |
| Educational level: this is a secondary education resource. |
| Educational level: this is a tertiary (university) resource. |
This is the second lecture in multivariable calculus.
Contents |
[edit] Submanifolds
In this lecture we will discuss lower-dimensional regions embedded in a higher-dimensional space, such as lines within 2- or 3-dimensional space, or surfaces within 3-dimensional space. The proper name for the "spaces" we have been discussing is manifold, which means "a set that can have coordinate systems".
The points in an embedded submanifold are described by sets of numbers, commonly called "parameters", though we will just call them coordinates. The assignment of numbers to the points is commonly called "parameterization", though they are really just coordinates. For example, a surface in 3-dimensional space might be described by two parameters or coordinates
and
, so that the surface is described by functions:
Similarly, a particle's path through space might be "parameterized by time", so that its position at any instant is given by 3 functions:
We will treat the subject of describing submanifolds simply by choosing a coordinate system for the larger space, and then removing some coordinates from the system by setting them to constants. Once we have developed the formulas for working with submanifolds, we will be able to dispense with the extra coordinates.
For example, a circle of radius
, in a 2-dimensional plane, can be described by choosing polar coordinates
on the plane, centered at the circle's center. Set the
coordinate to a constant:
. It drops out of the coordinate system, leaving
as the single coordinate.
The surface of a sphere, within 3-dimensional space, can be described by choosing spherical coordinates
, and setting
. The coordinates of the surface are
. An ellipse can be defined by choosing confocal coordinates and setting
to some constant.
[edit] Out With the Jacobian, In With the Metric
There is some unfinished business from lecture 1 that needs to be attended to. We defined the Jacobian matrix in terms of the transformation between two coordinate systems, and we came close to considering the Jacobian between Cartesian coordinates and some coordinate system
as "the Jacobian of the system
". We stopped short of doing that because it isn't true. The usual Jacobian
for spherical coordinates is:
But a different Cartesian system, created, for example, by permuting
,
, and
, would have:
with a Jacobian matrix of:
There is no "Jacobian matrix of spherical coordinates
". But, fortunately for integration, there is a "Jacobian determinant of
". The determinants
and
are both
.
|
Digression: The Jacobian matrix of the transformation between two Cartesian coordinate systems is an orthogonal matrix.
Readers who already know this, or who find it plausible and are willing to accept it, may skip this. Recall that a matrix is orthogonal if all of its row vectors are orthonormal, or all of its column vectors are orthonormal, or its transpose is the same as its inverse. (The three conditions are equivalent.) A better name would have been "orthonormal matrix". An important theorem is that the product of orthogonal matrices is orthogonal. We won't attempt to prove that the Jacobian matrix connecting two Cartesian coordinate systems is orthogonal, because it goes deeply into just how one conceptualizes the connection between intuitive geometric concepts and more careful analytic concepts. The reader should convince himself/herself that the connection between Cartesian coordinate systems is a Euclidean motion, which can be broken down into translations and rotations. The Jacobian matrix of a translation is the identity matrix, since only derivatives are involved. The Jacobian matrix of a rotation is also orthogonal. In 2 dimensions it takes the form: the rows of which are orthonormal. In 3 dimensions it is harder to see, but it can be broken down into rotations around the coordinate axes, the matrices of which can be seen to be orthogonal. We have already established that the Jacobian matrix of the composition of transformations is the product of the individual matrices, and we know that the product of orthogonal matrices is orthogonal. |
This explains why we were able to pretend that a given coordinate system had a "Jacobian" when we were developing the integration formulas—we only used the determinant. If a coordinate system
has two Jacobian matrices
and
for its transformations to two Cartesian coordinate systems, we have
where
is the orthogonal matrix connecting the two Cartesian systems.
Now the determinant of an orthogonal matrix is
.
-
- Why?
, so 
- Why?
Since we are being careful to maintain orientation, the determinant is always
.
-
- Some textbooks don't bother with that, and have to take the absolute value of the Jacobian determinant in integration formulas.
This means that
, so the integrations formulas work.
But taking the determinant of
throws away too much information. Is there some manipulation that we can perform that preserves more information but is still impervious to the choice of the "reference" Cartesian system?
|
This is sometimes called the "metric tensor" (for reasons that we definitely won't go into), or just the "metric".
The metric matrix, like the Jacobian, is referenced to two coordinate systems:
, though we will soon see that we don't need to name the Cartesian system.
Like the Jacobian, its determinant is indicated by a boldface lowercase
or
.
Theorem: The metric matrix between a given coordinate system and some "reference" Cartesian system is independent of that Cartesian system.
Proof: The Jacobians relating the given "test" system to the two "reference" Cartesian systems are
and
. We showed above (in a "digression") that
where
is an orthogonal matrix.
So
This means that we really are justified in calling some matrix
the "metric of the coordinate system", as soon as we can calculate it relative to any Cartesian coordinate system. And we no longer need to state what the "reference" system is.
means the same as
.
Theorem:
is a symmetric matrix.
Proof:
Theorem: 
Proof: ![\det[g] = \det([J]^t [J]) = \det[J]^t \det[J] = (\det[J])^2\,](http://upload.wikimedia.org/wikiversity/en/math/c/e/f/cef81a481cd71a3a9dcda51f3ed0d7a4.png)
The square root of the metric determinant is much more commonly used than the determinant itself.
We can now reformulate the integration formula from the previous lecture:
|
|
Or, letting the
be some Cartesian system, we get the formula for integrating in arbitrary coordinates relative to the metric:
|
Integrating any integrand in any coordinate system.
|
And similarly in other dimensions.
Here are some metrics:
2-dimensional polar coordinates:
3-dimensional spherical coordinates:
Toroidal coordinates:
Confocal coordinates:
|
Digression: Why do all the metric matrices seen so far have all entries off the main diagonal equal to zero?
This fact is not essential to what we are doing, but it is interesting. The reason is that all of the coordinate systems we have seen so far (and all the "classical" systems) are orthogonal. This means that the coordinate lines, even though they are themselves curved, intersect each other at right angles. This phenomenon is most clearly seen in 2 dimensions with polar coordinates or confocal coordinates. The diagram at the right shows the intersection of some coordinate lines in a general 3-dimensional curvilinear coordinate system Now the components of the direction vector for So the direction vectors' components are given by the columns of the Jacobian matrix. If the coordinate system is orthogonal, it follows that the columns of the Jacobian matrix are orthogonal.
So we have or This means that, if the coordinate system is orthogonal, the metric matrix just has numbers along the main diagonal— The square roots of those numbers are called the "Lamé coefficients", usually denoted We have Similarly for 2 dimensions, of course. So, in 3-dimensional spherical coordinates, for example, we have But we are not restricting ourselves to orthogonal coordinate systems (to do so would make parameterization of submanifolds much more difficult), so we will not use Lamé coefficients. |
[edit] Submanifolds
Now that the preliminaries are out of the way, we can get to the subject of this lecture.
A submanifold is the result of setting some coordinates, in some coordinate system of the larger manifold, equal to some constants. The remaining coordinates are the coordinates of the submanifold.
A surface embedded in 3-dimensional space is the result of holding one coordinate constant. If we hold one coordinate constant in 3-dimensional Cartesian coordinates, we get the plane determined by the other 2 coordinates. But we can get more interesting surfaces by using more interesting coordinate systems. And we can get curves in 2- or 3-dimensional spaces by holding constant all cordinates except one. Here are some examples:
- If the original coordinate system was spherical coordinates, the result of holding
is the surface of a sphere of radius
.
- A toroidal surface can be the result of holding
in toroidal coordinates
. Its coordinates are
and
.
- A circle in the plane can be the result of holding
in polar coordinates.
- A helix in 3 dimensions can be made by introducing "helical coordinates"[1]
:
-
- One then sets
and
. The result is a 1-dimensional manifold, that is, a curve, with coordinate
.
is the "pitch" of the helix, per radian.
- Since we will need these soon, here are the Jacobian and metric for helical coordinates:
[edit] Does This Really Give Us Freedom to Choose the Coordinates on the Submanifold?
Yes, as long as we have freedom to choose any coordinates on the main manifold. And we do have that freedom—that's why we did not restrict ourselves to orthogonal coordinate systems.
Here is an example. Suppose we are interested in a surface which is a hemisphere of unit radius, centered at the origin, and above the
plane. But instead of the obvious
coordinates, we want to express a point's position in terms of its
and
coordinates, that is, the coordinates of the point on the
plane directly below it. We create an artificial coordinate system
:
This system is obviously nonstandard. We calculate:
This is a very peculiar coordinate system. But it might be just what we need if we had to find the electric charge on a hemispherical object in which the charge density was given as a function of
and
.
Now we set
. We have:
We get a 2-dimensional manifold, with a coordinates
. For all points of the manifold, we have
, that is, the points lie on the hemisphere.
Now we create the 2-dimensional metric for the hemisphere. To do this, we simply remove the rows and columns of the metric that referred to the coordinates that were removed from the submanifold. We get this metric:
This is the (2-dimensional) metric on the hemisphere, effectively in
coordinates. We might say that the hemisphere has been parameterized by
and
.
We might want to express these in the more familiar Cartesian Coordinates. In fact, the only reason we used completely different names
for the new coordinate system, even though the two coordinates that we were actually interested in are
and
, is that one must be extremely careful in calculating partial derivatives to obtain the Jacobian.
We normally think of
and
as Cartesian coordinates, but, in this case, on the surface of a sphere, the coordinates are most definitely not Cartesian.
Of course, we can see the 3-dimensional space, including the
coordinate, and we know that
but tiny creatures living on the hemispherical surface don't know that. They only see the
and
coordinates.
What is accomplished by getting the metric on the 2-dimensional manifold? We can integrate! The square root of the metric determinant is the correction factor that we have to put into an integral to integrate over the hemisphere. The integration is in terms of
and
, or
and
if we clearly understand that these coordinates are not the actual Cartesian ones.
The area of a tiny patch of the hemisphere in these coordinates is
So we can use this to obtain the surface area of the hemisphere by integration. Use the usual rule—plug in the square root of the metric matrix:
but
so
so
|
How to obtain the metric on a submanifold.
Formulate a coordinate system for the main manifold such that the submanifold is specified by setting one or more coordinates to some constants. Those coordinates will not be present in the submanifold. Obtain the metric matrix for the main manifold in terms of those coordinates. Strike out the rows and columns of the matrix that correspond to coordinates that were removed. |
Before proving this, we will look at a few more examples.
For the torus, set
in toroidal coordinates, so the 2-dimensional patch has coordinates
and
. After removing
, and setting it to the constant
, we have:
The reader should convince himself/herself that, for a small "rectangular" patch on the surface of a torus, the "height" around the cross-sectional circle is
, the "length" around the main circle is
, and the area is
.
For the helix, set
and
in helical coordinates. It can be seen that the horizontal distance traversed for a small change in
is
, and the vertical distance is
. (Remember that
is the pitch, or vertical rise, per radian of
.) The actual distance along the helix itself is
.
Here is the metric, once we have removed the 1st and 3rd rows and columns. The metric matrix is a 1x1 matrix:
[edit] Geometrical Meaning of the Metric
To prove what we have been saying about the metric (and to prepare for the next lecture), we need to work out the geometric significance of the metric. It should come as no surprise that something with the wonderful properties we saw in the previous sections should have a simple and elegant geometrical interpretation.
[edit] Vector Components Defined Relative to a Coordinate System
Consider the 3 infinitesimal vectors, starting out tangent to the coordinate lines, going from the point
to
,
, and
.
Well, they can't go precisely to those points, because the coordinate lines are curved, and vectors have to be straight. But the notion of such a vector works in the infinitesimal limit. We will define "natural components" for these vectors, relative to our coordinate system, that will make them, in effect, "natural basis vectors".
We will say that:
-
- The vector
goes from
to 
- The vector
-
- The vector
goes from
to 
- The vector
-
- The vector
goes from
to 
- The vector
That is, the 3 components of tiny vectors tell how much the 3 coordinates change when we move from a given point to another point. In the language of vector algebra, we have chosen a new basis for infinitesimal vectors, that is, a new description of vectors in terms of sets of 3 numbers. We have shown just the basis vectors, but of course a vector can point anywhere, and have any or all of its components nonzero.
|
"Natural" vector definitions vs. "orthonormal" vector definitions.
Warning: Many treatments of vector calculus use a different formulation of the components of vectors. We are using "natural" vector components, while many treatments use "orthonormal" components. Those treatments require that coordinate systems be orthogonal. "Orthonormal" components, and orthogonal coordinate systems, allow one to use the "sum of pairwise products" rule for calculating vector dot products, but many other formulas are more straightforward with "natural" components. |
Now these are actual geometric vectors. As such, they have actual
,
, and
Cartesian components. The "natural curvilinear vector components" are different from the Cartesian components.
-
- We need to emphasize this. Vector lengths, angles, dot products, and cross products are physical geometric concepts that are independent of the coordinate system. But vectors have different components when measured according to different coordinate systems. We will explain how, given the coordinate system, these geometric concepts may be calculated from the vector components, such that one always gets the right answer; in fact, this is the main result of this course. One thing that we can say right now is that you must not assume that the length of a vector is the square root of the sum of the squares of its components, unless the coordinate system is Cartesian. The length (and everything else!) comes from the knowledge of the coordinate system, which can be found in the metric.
Given a vector's natural curvilinear components, we can get its Cartesian components by using the Jacobian. When we moved from
to
, the
,
, and
coordinates changed thusly:
So the Cartesian components of the vector with natural curvilinear components
are
.
Similarly,
has Cartesian components
, and
has Cartesian components
.
Now let's calculate the dot product of the natural vectors
and
.
-
- The reader should look at the dot product page if necessary. That particular properties we need are linearity, and the "sum of pairwise products" rule—in Cartesian coordinates:
-
.
-
- The reader should look at the dot product page if necessary. That particular properties we need are linearity, and the "sum of pairwise products" rule—in Cartesian coordinates:
Once the components of a vector are expressed in Cartesian terms, the answer is obtained by the sum of pairwise products rule:
Similarly:
And so on. We can get the dot products of any pairs of natural coordinate basis vectors directly from the metric!
|
Dot products and the metric.
That is, for example, Well, not quite. Remember that we can't speak of the geometrical meaning of vectors in space, unless they are infinitesimal, so we have to say, for example: |
We can only do this for vectors that are of infinitesimal length, because, as we have seen, the vectors only follow the coordinate lines for infinitesimal distances. The vectors start out tangent to the coordinate lines, but the coordinate lines curve while the vectors stay straight. The rule here is: when vectors are considered to "point to" a point on the manifold, they must be infinitesimal. This doesn't mean that we can never deal with large vectors—when doing physical problems involving electric and magnetic fields, for example, the vectors can be any size we like. We just can't interpret such vectors as "pointing to" some location on the manifold.
|
Digression: Tangent vectors.
Mathematicians refer to geometrical vectors on a manifold as "tangent vectors", and the vector space in which they lie as a "tangent space". This is because, to the extent that vectors can be visualized geometrically, they are straight lines that are tangent to the manifold at the point of origin. The vectors at the surface of a sphere, for example, could be considered to be straight lines lying in the plane that is tangent to the sphere at the vectors' point of origin. |
A few things that we noticed before now become obvious.
- The symmetry of the metric matrix follows from the symmetry of the dot product.
- If the coordinate system is orthogonal, so that the coordinate lines are orthogonal at any point, then the tiny basis vectors are orthogonal, so their dot products are zero. This means that the off-diagonal entries in the metric matrix are zero in that case.
- The length of a vector is the square root of its dot product with itself, so the length of the vector
is
. If the coordinate system is orthogonal, so that we have Lamé coefficients, this is just
. The Lamé coefficients are the scale factors for the lengths of infinitesimal basis vectors, if the coordinate system is orthogonal.
But we can do even better. The metric matrix gives us directly (albeit laboriously) the dot products of any vectors, in terms of their natural components. This is because the dot product is linear in each argument:
By breaking a vector into the sum of the basis vectors times its various components, and using linearity, we have:
where
and
are the natural components of the two vectors[2].
This is more easily calculated using matrix manipulations. Express one vector as a "row matrix", followed by the metric matrix, followed by the other vector as a "column matrix". When the three matrices are multiplied, the result is a 1x1 matrix. The value in that matrix is the dot product.
-
.
[edit] The Metric on a Submanifold
It is now easy to see why we can use the method of striking rows and columns out of the metric matrix to get the metric for a submanifold. The elements of the metric matrix are just the dot products of basis vectors. A basis vector in a submanifold is also a basis vector in the larger manifold, with all of the dropped components equal to zero. The dot product of two vectors is the same whether we use the large metric matrix or the small one, because the extra matrix elements are multiplied by zero.
In fact, any vector in the submanifold is a vector in the larger manifold, with the extra components in the larger manifold equal to zero. So the smaller metric matrix gives the dot products of vectors in the submanifold, as required.
Finally, let's give a direct proof that the square root of the metric determinant gives the correct "area/length/volume element correction factor" in integrals.
We have tiny basis vectors
We need to find the actual geometrical volume of the parallelepiped that they span. If they were orthogonal (which they would be if the coordinate system were orthogonal), they would span a rectangular region, and the volume would be simply the product of their geometrical lengths. But in the general case, we need to use the "parallelogram trick" to make them all perpendicular to each other. This is done by adding appropriate multiples of one vector to another. This does not change the volume, but the correct choice of multiplier can make the vectors orthogonal[3].
First, we subtract a multiple of
from
, obtaining
. Let that multiple be:
We have:
Then
-
.
So, to get
, we need this equal to zero, so:
While we are "straightening" the vectors by subtracting multiples of one vector from another without changing the volume that they span, we perform a similar operation on the metric matrix, subtracting multiples of one row from another. A theorem of determinants tells us that this does not change the value of the determinant[4]. We subtract
times the first row from the second row.
A very important cancelation occurs.
Similarly, we create a vector
by subtracting a multiple of
from
.
The value to make
perpendicular to
is:
Now
,
, and
span the necessary volume, and
and
are both perpendicular to
, but not to each other.
We also subtract
times the first row of the matrix that we are working on from the third row. As before, the determinant is still
:
But the rules for calculating determinants say that we can now remove the first column:
Finally, we "straighten"
, to make it perpendicular to
. We define:
Now:
To get
, this must be zero, so:
Also, 
So
,
, and
are all orthogonal, so the volume is the product of their lengths.
We will need these facts presently:
We subtract
times the first row of the (now 2x2) matrix that we are working on from the second row.
Now calculate the lengths of
,
, and
.
Making use of the previous facts:
But these three dot products are just the factors of
that we worked out previously. So
Example: What is the surface area of a torus?
Exercise: Here is one in which the integrand isn't just 1. The Gaussian curvature, per unit area, of a torus is
. (The calculation of this is rather advanced. It involves either Riemann's tensor or the "second fundamental form".) We have expressed this in toroidal coordinates, of course. Note that it is positive on the outer (bulging) part, and negative on the inner (saddle-like) part. What is the total surface integral of the Gaussian curvature,
?
[edit] Footnotes and References
- ↑ Like "toroidal coordinates", this system is not standard, and won't be found in the literature.
- ↑ People who take tensor algebra seriously write the components of vectors as superscripts. We have no need for such niceties in this course.
- ↑ This is just the W:Gram-Schmidt process.
- ↑ This is no coincidence! The "parallelogram trick" and the theory of determinants mirror each other. The volume spanned by some vectors is the determinant of the matrix made from those vectors.







![\begin{bmatrix} \cos\theta & - \sin\theta \\[2.5ex] \sin\theta & \cos\theta \end{bmatrix}](http://upload.wikimedia.org/wikiversity/en/math/e/9/1/e912b5d967a117fed54760a369afac29.png)
, so 
![[J]^t[J]\,](http://upload.wikimedia.org/wikiversity/en/math/1/1/9/119b53969de5312d460c8cad75bfb20b.png)
![[g_1] = [J_1]^t [J_1] = ([C][J_2])^t ([C][J_2]) = [J_2]^t [C]^t [C] [J_2] = [J_2]^t [C]^{-1} [C] [J_2] = [J_2]^t [J_2] = [g_2]\,](http://upload.wikimedia.org/wikiversity/en/math/2/a/d/2adea1acc463fac20487354dc9dce829.png)
![[g]^t = ([J]^t [J])^t = [J]^t {[J]^t}^t = [J]^t [J] = [g]\,](http://upload.wikimedia.org/wikiversity/en/math/7/d/2/7d2fc486b155bf1cbce50c10b9b4756e.png)


![[g] = \begin{bmatrix} 1 & 0 \\[2.5ex] 0 & r^2 \end{bmatrix}\ \ \ \ \mathbf{g} = r^2\ \ \ \ \sqrt{\mathbf{g}} = r\,](http://upload.wikimedia.org/wikiversity/en/math/4/7/a/47a5913c5cc45ff38ebc66ef6bf8e1e2.png)
![[g] = \begin{bmatrix} 1 & 0 & 0 \\[2.5ex] 0 & r^2 & 0 \\[2.5ex] 0 & 0 & r^2 \sin^2\theta \end{bmatrix}\ \ \ \ \mathbf{g} = r^4 \sin^2\theta\ \ \ \ \sqrt{\mathbf{g}} = r^2 \sin\theta\,](http://upload.wikimedia.org/wikiversity/en/math/b/c/c/bcc7b31c7a722543ebedd948f4dfb929.png)
![[g] = \begin{bmatrix} 1 & 0 & 0 \\[2.5ex] 0 & (S + r \cos\phi)^2 & 0 \\[2.5ex] 0 & 0 & r^2 \end{bmatrix}\ \ \ \ \mathbf{g} = r^2 (S + r \cos\phi)^2\ \ \ \ \sqrt{\mathbf{g}} = r (S + r \cos\phi)\,](http://upload.wikimedia.org/wikiversity/en/math/3/7/9/3790495694cf2c744e950966af74e64f.png)
![[g] = \begin{bmatrix} A^2 (\sinh^2\rho + \sin^2\theta) & 0 \\[2.5ex] 0 & A^2 (\sinh^2\rho + \sin^2\theta) \end{bmatrix}\ \ \ \ \mathbf{g} = A^4 (\sinh^2\rho + \sin^2\theta)^2\ \ \ \ \sqrt{\mathbf{g}} = A^2 (\sinh^2\rho + \sin^2\theta)\,](http://upload.wikimedia.org/wikiversity/en/math/e/e/f/eef96faa7d1f3046785b5bc0b1639cc7.png)
. If the coordinate system is orthogonal, as the diagram suggests, then the direction vectors of the coordinate lines are all orthogonal to each other, and each direction vector is orthogonal to the plane created by the other two.
are proportional to the changes in
,
, and
for infinitesimal changes in
and
, of course.) That is, the components are proportional to
![\sum_{k} [J]_{ki} [J]_{kj} = 0 \ \ \ \text{if}\ \ \ i \ne j](http://upload.wikimedia.org/wikiversity/en/math/f/e/d/fed2a8291f3bce7888b538faa0ffecd9.png)
![[g]_{ij} = [J^t J]_{ij} = 0 \ \ \ \text{if}\ \ \ i \ne j](http://upload.wikimedia.org/wikiversity/en/math/2/0/3/203dc0a031efc48b46af6981b79e6942.png)
,
, and
. The determinant is just the product of those numbers:
,
, and
.
.
:

![[J\langle xyz/r\theta s\rangle] = \begin{bmatrix} \cos\theta & - r \sin\theta & 0 \\[2.5ex] \sin\theta & r \cos\theta & 0 \\[2.5ex] 0 & P & 1 \end{bmatrix}](http://upload.wikimedia.org/wikiversity/en/math/8/d/6/8d6e308337e010122caddb1c74d2736d.png)
![[g\langle r\theta s\rangle] = \begin{bmatrix} 1 & 0 & 0 \\[2.5ex] 0 & r^2 + P^2 & P \\[2.5ex] 0 & P & 1 \end{bmatrix}\ \ \ \ \mathbf{g} = r^2\ \ \ \ \sqrt{\mathbf{g}} = r\,](http://upload.wikimedia.org/wikiversity/en/math/e/4/7/e476b379d9a23310844499153d96a1ca.png)



![[J\langle xyz/uvw\rangle] = \begin{bmatrix} 1 & 0 & 0 \\[2.5ex] 0 & 1 & 0 \\[2.5ex] \displaystyle\frac{- u}{\sqrt{w^2 - u^2 - v^2}} & \displaystyle\frac{- v}{\sqrt{w^2 - u^2 - v^2}} & \displaystyle\frac{w}{\sqrt{w^2 - u^2 - v^2}} \end{bmatrix}](http://upload.wikimedia.org/wikiversity/en/math/4/e/1/4e1ef04eed163e79ae2c68dc514ef37b.png)
![[g\langle uvw\rangle] = \begin{bmatrix} \displaystyle\frac{w^2 - v^2}{w^2 - u^2 - v^2} & \displaystyle\frac{uv}{w^2 - u^2 - v^2} & \displaystyle\frac{- uw}{w^2 - u^2 - v^2} \\[2.5ex] \displaystyle\frac{uv}{w^2 - u^2 - v^2} & \displaystyle\frac{w^2 - u^2}{w^2 - u^2 - v^2} & \displaystyle\frac{- vw}{w^2 - u^2 - v^2} \\[2.5ex] \displaystyle\frac{- uw}{w^2 - u^2 - v^2} & \displaystyle\frac{- vw}{w^2 - u^2 - v^2} & \displaystyle\frac{w^2}{w^2 - u^2 - v^2} \end{bmatrix}](http://upload.wikimedia.org/wikiversity/en/math/0/0/d/00deaf46969378e1752b7964bf7bd008.png)




![[g\langle uv\rangle] = \begin{bmatrix} \displaystyle\frac{1 - v^2}{1 - u^2 - v^2} & \displaystyle\frac{uv}{1 - u^2 - v^2} & \\[2.5ex] \displaystyle\frac{uv}{1 - u^2 - v^2} & \displaystyle\frac{1 - u^2}{1 - u^2 - v^2} \end{bmatrix}\ \ \ \ \mathbf{g} = \displaystyle\frac{1}{1 - u^2 - v^2}\ \ \ \ \sqrt{\mathbf{g}} = \displaystyle\frac{1}{\sqrt{1 - u^2 - v^2}}\,](http://upload.wikimedia.org/wikiversity/en/math/6/0/1/601407d6f035a3b80a9bc745b9b2dea5.png)
![[g\langle xy\rangle] = \begin{bmatrix} \displaystyle\frac{1 - y^2}{1 - x^2 - y^2} & \displaystyle\frac{xy}{1 - x^2 - y^2} & \\[2.5ex] \displaystyle\frac{xy}{1 - x^2 - y^2} & \displaystyle\frac{1 - x^2}{1 - x^2 - y^2} \end{bmatrix}\ \ \ \ \mathbf{g} = \displaystyle\frac{1}{1 - x^2 - y^2}\ \ \ \ \sqrt{\mathbf{g}} = \displaystyle\frac{1}{\sqrt{1 - x^2 - y^2}}\,](http://upload.wikimedia.org/wikiversity/en/math/4/c/a/4ca595632a4b31fd260f33a8a81a82e3.png)






![[g] = \begin{bmatrix} (S + R \cos\phi)^2 & 0 \\[2.5ex] 0 & R^2 \end{bmatrix}\ \ \ \ \mathbf{g} = R^2 (S + R \cos\phi)^2\ \ \ \ \sqrt{\mathbf{g}} = R (S + R \cos\phi)\,](http://upload.wikimedia.org/wikiversity/en/math/d/8/b/d8b4bf6b8efccad6e7ad036fa7ad08bc.png)
![[g] = \begin{bmatrix} R^2 + P^2 \end{bmatrix}\ \ \ \ \mathbf{g} = R^2 + P^2\ \ \ \ \sqrt{\mathbf{g}} = \sqrt{R^2 + P^2}\,](http://upload.wikimedia.org/wikiversity/en/math/b/8/2/b829f3bfdafef63b92e402cb200f60b7.png)



.
.
![= \left(J_{11} J_{12} + J_{21} J_{22} + J_{31} J_{32}\right)\Delta u\ \Delta v = [J^t J]_{12}\ \Delta u\ \Delta v = g_{12}\ \Delta u\ \Delta v\,](http://upload.wikimedia.org/wikiversity/en/math/4/d/6/4d6da8c727b8365c17038188722405e2.png)
![[\Delta u, 0, 0] \cdot[0, 0, \Delta w] = g_{13}\Delta u \Delta w\,](http://upload.wikimedia.org/wikiversity/en/math/8/7/2/872c434fd82d3ca09d34522c3b4e26ad.png)
![[\Delta u, 0, 0] \cdot[\Delta u, 0, 0] = g_{11}(\Delta u)^2\,](http://upload.wikimedia.org/wikiversity/en/math/2/8/1/281d768ef333803da19d060da457310d.png)
entry in the metric matrix is the geometrical dot product of the
and
natural basis vectors.
is the dot product of the vectors
and
:![[1, 0, 0] \cdot [0, 1, 0] = g_{12}\,](http://upload.wikimedia.org/wikiversity/en/math/6/8/1/6813e44b0996127f80647dd3313bbcaf.png)
![[\Delta u, 0, 0] \cdot [0, \Delta v, 0] = g_{12}\Delta u \Delta v\,](http://upload.wikimedia.org/wikiversity/en/math/6/e/0/6e0735b03d6be49ffc99b80087c31cff.png)
. If the coordinate system is orthogonal, so that we have Lamé coefficients, this is just
. The Lamé coefficients are the scale factors for the lengths of infinitesimal basis vectors, if the coordinate system is orthogonal.


.![\vec{U} = [\Delta u, 0, 0]\,](http://upload.wikimedia.org/wikiversity/en/math/6/0/2/602a6cd35270e4442e6c3c175350d892.png)
![\vec{V} = [0, \Delta v, 0]\,](http://upload.wikimedia.org/wikiversity/en/math/3/d/6/3d6d8b4e812eef4f012d78751ce19ce3.png)
![\vec{W} = [0, 0, \Delta w]\,](http://upload.wikimedia.org/wikiversity/en/math/e/1/6/e16310ec612d07ee8eb198291442cfb0.png)

![\vec{P} = \vec{V} - A \frac{\Delta v}{\Delta u} \vec{U} = [0, \Delta v, 0] - A [\Delta v, 0, 0] = [-A, 1, 0] \Delta v\,](http://upload.wikimedia.org/wikiversity/en/math/9/f/5/9f5f0a91b83518143025ec07831232a3.png)
.

![\vec{Q} = \vec{W} - B \frac{\Delta w}{\Delta u} \vec{U} = [-B, 0, 1] \Delta w\,](http://upload.wikimedia.org/wikiversity/en/math/1/2/4/124e96b432a87d80e03717e17f8d01a3.png)



![\vec{R} = \vec{Q} - C \frac{\Delta w}{\Delta v} \vec{P} = [AC-B, -C, 1] \Delta w\,](http://upload.wikimedia.org/wikiversity/en/math/9/1/4/914998638f43d102e01eb2981e1d65ec.png)














