4.10.10 · D3Advanced Topics (Elite Level)

Worked examples — Metric tensor — raising - lowering indices

2,177 words10 min readBack to topic

The scenario matrix

Every metric you will ever lower/raise with falls into one of these case classes. The whole point of raising/lowering only changes with the shape of , so we organise by shape.

Cell Case class What is special about Covered by
A Identity / Cartesian orthonormal Ex 1
B Diagonal, all , unequal pure rescaling, no sign flip Ex 2
C Diagonal with a (indefinite) one component flips sign Ex 3
D Coordinate-dependent diagonal (polar) entries depend on position Ex 4
E Off-diagonal (couples slots) cross terms Ex 5
F Degenerate / zero row (breakdown) , no inverse exists Ex 6
G Rank-2 tensor, one slot at a time mixed index Ex 7
H Real-world word problem reading off a physical setup Ex 8
I Exam twist: raise back / consistency round-trip Ex 9

We will hit every cell. Each example says which cell it fills.

Figure — Metric tensor — raising - lowering indices

Ex 1 — Cell A: the case where nothing happens

  1. Write the rule. . Why this step? It is the definition; we always start by naming which machine we run.
  2. Do : Why this step? Sum over the repeated index ; only is non-zero in this row.
  3. Do : Why this step? Same, second row.
  4. Result: .

Verify: the norm both ways: , and . Consistent, and equals ordinary . ✓ This is exactly the Mistake the parent warns about: upper and lower look identical only here.


Ex 2 — Cell B: pure rescaling (diagonal, all positive, unequal)

  1. Lower. ; Why this step? Diagonal metric ⇒ each lower component is just its own upper component scaled by the diagonal entry.
  2. Build the inverse. For a diagonal matrix, . Why this step? Raising needs , and for diagonal the inverse is entry-by-entry reciprocals.
  3. Raise back. ; Why this step? Round-trip must return the original — a built-in sanity check.

Verify: raising undid lowering: . ✓ Also . ✓ No sign flip because all diagonal entries are positive (that only happens in Cell C).


Ex 3 — Cell C: the sign flip (indefinite metric)

  1. Lower each slot. ; ; Why this step? The Minkowski spacetime metric is diagonal, so each slot uses one entry — but the time entry is , so the time component flips sign. That flip is the entire physical content of an indefinite metric.
  2. Contract. Why this step? The invariant length must be a valid contraction: one up, one down. This number is coordinate-independent.

Verify: using the metric directly, . ✓ In particle physics this equals (with ), so , . Sign is negative because the vector is timelike — exactly the right regime.


Ex 4 — Cell D: coordinate-dependent metric (polar)

Figure — Metric tensor — raising - lowering indices
  1. Inverse metric. . At : . Why this step? Raising needs ; here it depends on where you are — that is new versus Cells A–C.
  2. Raise radial. Why this step? , so the radial direction behaves like plain Cartesian.
  3. Raise angular. Why the ? Look at the red arrow in the figure: the basis vector has physical length , not . A covariant component already carries a factor of that length, so raising must divide it back out — hence .

Verify: the norm should be metric-independent of representation. . Cross-check with . ✓


Ex 5 — Cell E: off-diagonal metric (coupled slots)

  1. Lower, keeping BOTH terms. Why this step? Off-diagonal couples the components — dropping the cross term is the classic error. Each lower component mixes all upper components.
  2. Invert the metric. For , inverse . Here , so . Why this step? Raising needs the true matrix inverse, not reciprocals of entries (that shortcut only works when off-diagonals vanish).
  3. Raise back. ; Why this step? Round-trip must recover .

Verify: . ✓ And : row-1 = . ✓ Norm: ; and . ✓


Ex 6 — Cell F: degenerate metric (the breakdown case)

  1. Lowering still works. ; Why this step? Lowering only multiplies by ; no inverse needed, so it is always defined.
  2. Try to raise. Compute . Why this step? Raising requires , and a matrix with zero determinant has no inverse. The raising operation is undefined.
  3. Interpret. Row 2 is row 1: the second basis "direction" carries no independent length information. A genuine metric on an inner product space must be non-degenerate () precisely so both directions of the translation exist.

Verify: , so no inverse ⇒ raising impossible. This is the boundary/degenerate cell the reader must recognise: check before assuming you can raise. ✓ (Notice is itself proportional , echoing the degeneracy.)


Ex 7 — Cell G: a rank-2 tensor, one slot at a time

  1. Rule for one slot. — the metric pairs with the second index only. Why this step? Raise/lower one index at a time; each converts exactly one slot (parent §4).
  2. Column (uses ): ; Why this step? Lowering the -slot multiplies that whole column by .
  3. Column (uses ): ; Why this step? leaves the -column unchanged.
  4. Result:

Verify: the trace — this contracted scalar is invariant. Direct check: . ✓


Ex 8 — Cell H: real-world word problem

  1. Read off the metric. Perpendicular axes with scales and : . Why this step? ; each basis vector's squared physical length sits on the diagonal.
  2. True squared length. Why this step? The invariant length uses the metric, not the naive — that would give the wrong .
  3. Length. metres.
  4. Covariant components. ;

Verify: cross-check length via covariant form: . ✓ Naive (wrong) answer would be — the metric matters, exactly the Mistake point.


Ex 9 — Cell I: exam twist, the consistency round-trip

  1. State the key identity. (the inverse-metric defining relation). Why this step? This is the ONE fact that makes raising undo lowering — the metric and its inverse are true matrix inverses.
  2. Apply it. Why this step? Associativity of matrix multiplication lets us collapse the pair to , and the Kronecker delta simply relabels.
  3. Numeric spot-check with : from Ex 5 we already saw . ✓

Verify: For this specific , . ✓


Recall Answers
  1. Cell A (, Cartesian orthonormal) — the metric is the identity, so the machine changes nothing.
  2. , .
  3. Off-diagonal couples slots: mixes both.
  4. (non-degenerate) — otherwise no inverse exists (Cell F).

Connections

Case Map

diagonal all plus

diagonal with minus

entries depend on position

off diagonal

det zero

Metric g

rescale only

sign flip Minkowski

polar r squared

coupled slots

degenerate no inverse

raise with reciprocals

raise with full inverse

cannot raise