Curvature is tensorial: Difference between revisions

From Diffgeom
No edit summary
Line 50: Line 50:
| 1 || <math>f\nabla_X\nabla_Y - \nabla_Y (f \nabla_X) - \nabla_{[fX,Y]}</math> || Fact (1): <math>\nabla</math> is <math>C^\infty</math>-linear in its subscript argument. || <math>\nabla_{fX} \to f\nabla_X</math>
| 1 || <math>f\nabla_X\nabla_Y - \nabla_Y (f \nabla_X) - \nabla_{[fX,Y]}</math> || Fact (1): <math>\nabla</math> is <math>C^\infty</math>-linear in its subscript argument. || <math>\nabla_{fX} \to f\nabla_X</math>
|-
|-
| 2 || <math>f\nabla_X\nabla_Y - (Yf)\nabla_X - f \nabla_Y\nabla_X - \nabla_{[fX,Y]}</math> || Fact (2), the Leibniz-like axiom for connection. || <math>\nabla_Y(f \nabla_X) \to (Yf)\nabla_X + f\nabla_Y\nabla_X</math>. To understand this more clearly imagine an input <math>Z</math> to the whole expression, so that the rewrite becomes <math>\nabla_Y(f \nabla_X(Z)) \to (Yf)\nabla_X(Z) + f\nabla_Y\nabla_X(Z)</math>. In the notation of fact (3), <math>A = Y</math>, <math>f = f</math>, and <math>B = \nabla_X(Z)</math>.
| 2 || <math>f\nabla_X\nabla_Y - (Yf)\nabla_X - f \nabla_Y\nabla_X - \nabla_{[fX,Y]}</math> || Fact (2) || <math>\nabla_Y(f \nabla_X) \to (Yf)\nabla_X + f\nabla_Y\nabla_X</math>. To understand this more clearly imagine an input <math>Z</math> to the whole expression, so that the rewrite becomes <math>\nabla_Y(f \nabla_X(Z)) \to (Yf)\nabla_X(Z) + f\nabla_Y\nabla_X(Z)</math>. In the notation of fact (3), <math>A = Y</math>, <math>f = f</math>, and <math>B = \nabla_X(Z)</math>.
|-
|-
| 3 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{(Yf)X} - \nabla_{[fX,Y]}</math> || Fact (1): <math>\nabla</math> is <math>C^\infty</math>-linear in its subscript argument || <math>(Yf)\nabla_X \to \nabla_{(Yf)X}</math>
| 3 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{(Yf)X} - \nabla_{[fX,Y]}</math> || Fact (1) || <math>(Yf)\nabla_X \to \nabla_{(Yf)X}</math>
|-
|-
| 4 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{(Yf)X + [fX,Y]}</math> || <math>\nabla</math> is additive in its subscript argument || <math>\nabla_{(Yf)X} + \nabla_{[fX,Y]} = \nabla_{(Yf)X + [fX,Y]}</math>
| 4 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{(Yf)X + [fX,Y]}</math> || <math>\nabla</math> is additive in its subscript argument || <math>\nabla_{(Yf)X} + \nabla_{[fX,Y]} = \nabla_{(Yf)X + [fX,Y]}</math>
Line 74: Line 74:
! Step no. !! Current status of left side !! Facts/properties used !! Specific rewrites
! Step no. !! Current status of left side !! Facts/properties used !! Specific rewrites
|-
|-
| 1 || <math>\nabla_X(f\nabla_Y) - f\nabla_Y\nabla_X - \nabla_{[X,fY]}</math> || Fact (1): <math>\nabla</math> is <math>C^\infty</math>-linear in its subscript argument || <math>\nabla_{fY} \to f\nabla_Y</math>.
| 1 || <math>\nabla_X(f\nabla_Y) - f\nabla_Y\nabla_X - \nabla_{[X,fY]}</math> || Fact (1) || <math>\nabla_{fY} \to f\nabla_Y</math>.
|-
|-
| 2 || <math>(Xf)\nabla_Y + f(\nabla_X\nabla_Y) - f\nabla_Y\nabla_X - \nabla_{[X,fY]}</math> || Fact (2), the Leibniz-like axiom for connection || <math>\nabla_X(f\nabla_Y) \to (Xf)\nabla_Y + f(\nabla_X\nabla_Y)</math>. To make this more concrete, imagine an input <math>Z</math>. Then, the rewrite becomes <math>\nabla_X(f\nabla_Y(Z)) \to (Xf)\nabla_Y(X) + f(\nabla_X\nabla_Y(Z))</math>. This comes setting <math>A = X</math>, <math>f = f</math>, <math>B = \nabla_YZ</math> in Fact (3).
| 2 || <math>(Xf)\nabla_Y + f(\nabla_X\nabla_Y) - f\nabla_Y\nabla_X - \nabla_{[X,fY]}</math> || Fact (2) || <math>\nabla_X(f\nabla_Y) \to (Xf)\nabla_Y + f(\nabla_X\nabla_Y)</math>. To make this more concrete, imagine an input <math>Z</math>. Then, the rewrite becomes <math>\nabla_X(f\nabla_Y(Z)) \to (Xf)\nabla_Y(X) + f(\nabla_X\nabla_Y(Z))</math>. This comes setting <math>A = X</math>, <math>f = f</math>, <math>B = \nabla_YZ</math> in Fact (3).
|-
|-
| 3 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{[X,fY]} + \nabla_{(Xf)Y}</math> || <math>\nabla</math> is <math>C^\infty</math>-linear in its subscript argument. || <math>(Xf)\nabla_Y \to \nabla_{(Xf)Y}</math>
| 3 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{[X,fY]} + \nabla_{(Xf)Y}</math> || Fact (1) || <math>(Xf)\nabla_Y \to \nabla_{(Xf)Y}</math>
|-  
|-  
| 4 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{[X,fY] - (Xf)Y}</math> || <math>\nabla</math> is additive in its subscript argument. || <math>\nabla_{[X,fY]} - \nabla_{(Xf)Y} \to \nabla_{[X,fY] - (Xf)Y}</math>.
| 4 || <math>f(\nabla_X\nabla_Y - \nabla_Y\nabla_X) - \nabla_{[X,fY] - (Xf)Y}</math> || <math>\nabla</math> is additive in its subscript argument. || <math>\nabla_{[X,fY]} - \nabla_{(Xf)Y} \to \nabla_{[X,fY] - (Xf)Y}</math>.
Line 87: Line 87:
===Tensoriality in the third variable===
===Tensoriality in the third variable===


Let <math>f: M \to \R</math> be a scalar function. We will show that:
'''Given''': A <math>C^\infty</math>-function <math>f:M \to \R</math>.


<math>\! R(X,Y) (fZ) = f R(X,Y) Z</math>
'''To prove''': <math>\! R(X,Y) (fZ) = f R(X,Y) Z</math>. More explicitly, <math>\! \nabla_X\nabla_Y(fZ) - \nabla_Y\nabla_X(fZ) - \nabla_{[X,Y]}(fZ)  = f (\nabla_X\nabla_Y - \nabla_Y\nabla_X - \nabla_{[X,Y]})Z + ((XY - YX - [X,Y])f)Z</math>.


We start out with the left side:
We start out with the left side:
Line 95: Line 95:
<math>\nabla_X\nabla_Y(fZ) - \nabla_Y\nabla_X(fZ) - \nabla_{[X,Y]}(fZ)</math>
<math>\nabla_X\nabla_Y(fZ) - \nabla_Y\nabla_X(fZ) - \nabla_{[X,Y]}(fZ)</math>


Now we apply the Leibniz rule for connnections on each term:
Each step below is obtained from the previous one via some manipulation explained along side.


<math>\nabla_X( (Yf)(Z) + f \nabla_YZ) - \nabla_Y ((Xf)Z + f \nabla_XZ) - f \nabla_{[X,Y]}Z - ([X,Y]f) Z</math>
{| class="sortable" border="1"
 
! Step no. !! Current status of left side !! Facts/properties used !! Specific rewrites
We again apply the Leibniz rule to the first two term groups:
|-
 
| 1 || <math>\! \nabla_X( (Yf)(Z) + f \nabla_YZ) - \nabla_Y ((Xf)Z + f \nabla_XZ) - f \nabla_{[X,Y]}Z - ([X,Y]f) Z</math> || Fact (2) || <math>\nabla_Y(fZ) \to (Yf)(Z) + f\nabla_YZ</math> and <math>\nabla_X(fZ) \to (Xf)Z + f\nabla_XZ</math>
<math>(XYf)(Z) + (Yf) \nabla_XZ + (Xf) \nabla_YZ + f \nabla_X\nabla_YZ - (YXf)Z - (Xf) \nabla_YZ - (Yf) \nabla_XZ -f \nabla_Y\nabla_XZ - f \nabla_{[X,Y]}Z - ([X,Y]f) Z</math>
|-
 
| 2 || <math>\! (XYf)(Z) + (Yf) \nabla_XZ + (Xf) \nabla_YZ + f \nabla_X\nabla_YZ - (YXf)Z - (Xf) \nabla_YZ - (Yf) \nabla_XZ -f \nabla_Y\nabla_XZ - f \nabla_{[X,Y]}Z - ([X,Y]f) Z</math> || Fact (2) || <math>\nabla_X((Yf)Z) \to X((Yf)Z) + (Yf)\nabla_XZ</math>, etc.
After cancellations we are left with the following six terms:
|-
 
| 3 || <math>f (\nabla_X\nabla_Y - \nabla_Y\nabla_X - \nabla_{[X,Y]})Z + ((XY - YX - [X,Y])f)Z</math> || -- || cancellations
<math>f (\nabla_X\nabla_Y - \nabla_Y\nabla_X - \nabla_{[X,Y]})Z + ((XY - YX - [X,Y])f)Z</math>
|-
 
| 4 || <math>f (\nabla_X\nabla_Y - \nabla_Y\nabla_X - \nabla_{[X,Y]})Z + ((XY - YX - [X,Y])f)Z</math>|| use <math>[X,Y] = XY - YX</math>, definition || cancellation
But since <math>[X,Y] = XY - YX</math>, the last three terms vanish, and we are left with:
|}
 
<math>\! f R(X,Y)Z</math>

Revision as of 21:09, 25 February 2011

This article gives the statement, and possibly proof, that a map constructed in a certain way is tensorial
View other such statements

Statement

Let ∇ be a connection on a vector bundle E over a differential manifold M. The Riemann curvature tensor of ∇ is given as a map Γ(TM)⊗Γ(TM)⊗Γ(E)→Γ(E) defined by:

R(X,Y)Z=∇X∇YZ−∇Y∇XZ−∇[X,Y]Z

We claim that R is a tensorial map in each of the variables X,Y,Z.

Related facts

Facts used

Fact no. Name Statement with symbols
1 Any connection is C∞-linear in its subscript argument ∇fA=f∇A for any C∞-function f and vector field A.
2 The Leibniz-like axiom that is part of the definition of a connection For a function f and vector fields A,B, and a connection ∇, we have ∇A(fB)=(Af)(B)+f∇A(B)
3 Corollary of Leibniz rule for Lie bracket (in turn follows from leibniz rule for derivations For a function f and vector fields X,Y:


f[X,Y]=[fX,Y]+(Yf)X
f[X,Y]=[X,fY]−(Xf)Y

Proof

To prove tensoriality in a variable, it suffices to show C∞-linearity in that variable. This is because linearity in C∞-functions guarantees linearity in a function that is 1 at exactly one point, and zero at others.

The proofs for X and Y are analogous, and rely on manipulation of the Lie bracket [fX,Y] and the property of a connection being C∞ in the subscript vector. These proofs do not involve any explicit use of Z. The proof for Z relies simply on repeated application of the product rule, and the fact that XY−YX=[X,Y].

Tensoriality in the first variable

Given: f:M→R is a C∞-function.

To prove: R(fX,Y)=fR(X,Y), or more explicitly, ∇fX∇Y−∇Y∇fX−∇[fX,Y]=f(∇X∇Y−∇Y∇X−∇[X,Y]

We start out with the left side:

∇fX∇Y−∇Y∇fX−∇[fX,Y]

Each step below is obtained from the previous one via some manipulation explained along side.

Step no. Current status of left side Facts/properties used Specific rewrites
1 f∇X∇Y−∇Y(f∇X)−∇[fX,Y] Fact (1): ∇ is C∞-linear in its subscript argument. ∇fX→f∇X
2 f∇X∇Y−(Yf)∇X−f∇Y∇X−∇[fX,Y] Fact (2) ∇Y(f∇X)→(Yf)∇X+f∇Y∇X. To understand this more clearly imagine an input Z to the whole expression, so that the rewrite becomes ∇Y(f∇X(Z))→(Yf)∇X(Z)+f∇Y∇X(Z). In the notation of fact (3), A=Y, f=f, and B=∇X(Z).
3 f(∇X∇Y−∇Y∇X)−∇(Yf)X−∇[fX,Y] Fact (1) (Yf)∇X→∇(Yf)X
4 f(∇X∇Y−∇Y∇X)−∇(Yf)X+[fX,Y] ∇ is additive in its subscript argument ∇(Yf)X+∇[fX,Y]=∇(Yf)X+[fX,Y]
5 f(∇X∇Y−∇Y∇X−∇[X,Y]) Fact (3) [fX,Y]+(Yf)X→f[X,Y].

Tensoriality in the second variable

Given: f:M→R is a C∞-function.

To prove: R(X,fY)=fR(X,Y), or more explicitly, ∇X∇fY−∇fY∇X−∇[X,fY]=f(∇X∇Y−∇Y∇X−∇[X,Y].

We start out with the left side:

∇X∇fY−∇fY∇X−∇[X,fY]

Each step below is obtained from the previous one via some manipulation explained along side.

Step no. Current status of left side Facts/properties used Specific rewrites
1 ∇X(f∇Y)−f∇Y∇X−∇[X,fY] Fact (1) ∇fY→f∇Y.
2 (Xf)∇Y+f(∇X∇Y)−f∇Y∇X−∇[X,fY] Fact (2) ∇X(f∇Y)→(Xf)∇Y+f(∇X∇Y). To make this more concrete, imagine an input Z. Then, the rewrite becomes ∇X(f∇Y(Z))→(Xf)∇Y(X)+f(∇X∇Y(Z)). This comes setting A=X, f=f, B=∇YZ in Fact (3).
3 f(∇X∇Y−∇Y∇X)−∇[X,fY]+∇(Xf)Y Fact (1) (Xf)∇Y→∇(Xf)Y
4 f(∇X∇Y−∇Y∇X)−∇[X,fY]−(Xf)Y ∇ is additive in its subscript argument. ∇[X,fY]−∇(Xf)Y→∇[X,fY]−(Xf)Y.
5 f(∇X∇Y−∇Y∇X−∇[X,Y] Fact (3) [X,fY]−(Xf)Y→f[X,Y]

Tensoriality in the third variable

Given: A C∞-function f:M→R.

To prove: R(X,Y)(fZ)=fR(X,Y)Z. More explicitly, ∇X∇Y(fZ)−∇Y∇X(fZ)−∇[X,Y](fZ)=f(∇X∇Y−∇Y∇X−∇[X,Y])Z+((XY−YX−[X,Y])f)Z.

We start out with the left side:

∇X∇Y(fZ)−∇Y∇X(fZ)−∇[X,Y](fZ)

Each step below is obtained from the previous one via some manipulation explained along side.

Step no. Current status of left side Facts/properties used Specific rewrites
1 ∇X((Yf)(Z)+f∇YZ)−∇Y((Xf)Z+f∇XZ)−f∇[X,Y]Z−([X,Y]f)Z Fact (2) ∇Y(fZ)→(Yf)(Z)+f∇YZ and ∇X(fZ)→(Xf)Z+f∇XZ
2 (XYf)(Z)+(Yf)∇XZ+(Xf)∇YZ+f∇X∇YZ−(YXf)Z−(Xf)∇YZ−(Yf)∇XZ−f∇Y∇XZ−f∇[X,Y]Z−([X,Y]f)Z Fact (2) ∇X((Yf)Z)→X((Yf)Z)+(Yf)∇XZ, etc.
3 f(∇X∇Y−∇Y∇X−∇[X,Y])Z+((XY−YX−[X,Y])f)Z -- cancellations
4 f(∇X∇Y−∇Y∇X−∇[X,Y])Z+((XY−YX−[X,Y])f)Z use [X,Y]=XY−YX, definition cancellation