Tensor Transformation Rule
Relevant parts to questions...
- Using (rank 2), (rank 3), etc.: one per free index.
- Verifying tensor character by applying the rule and cancelling s via orthogonality .
- Recognising dummy vs free indices on both sides: primed indices are free, original indices are dummy.
The Tensor Transformation Rule generalises the vector rule to tensors of any rank. A tensor of rank picks up exactly factors of the Coordinate Transformation Matrix , one per free index:
For the most common cases:
- Rank 0 (scalar):: - no factors, invariant.
- Rank 1 (vector):: - one factor of .
- Rank 2:: - two factors of , one per index. In matrix form: .
- Rank 3:: - three factors.
This rule is the definition of a tensor: anything that transforms this way is a tensor, and anything that doesn’t, isn’t.
Properties
- Free vs dummy indices::the primed indices on the left are free, while the unprimed indices on the right are dummy (summed). Both sides carry the same free indices.
- Dimensional count::in 3D, a rank- tensor has components.
- Symmetry is frame-independent::if in one frame, then in every frame. The rule preserves Symmetry and Antisymmetry.
- Cartesian-specific::this rule assumes is a constant rotation matrix. In generalised coordinates it is replaced by the more general rule with separate covariant/contravariant factors (see Mixed Components).
Applications
- Verifying a quantity is a tensor by direct application::e.g. the Kronecker Delta is rank-2 since .
- Proving the Gradient of a vector field is a rank-2 tensor, via product + chain rule::.
- Matrix form for rank-2:: is the quickest way to compute numerically when and are given as matrices.
- Shortcut via the Quotient Rule::if contracting with an arbitrary tensor produces a tensor, then itself is a tensor - no need to verify the transformation rule directly.
Kronecker delta is a rank-2 tensor
We need . Applying the rule:
, using orthogonality.
Since is defined identically in every frame, . ✓
One per free index; dummies sum.