Suffix Notation

Relevant parts to questions...

  • Converting everything into suffix form by applying free and dummy indices.
  • Using , both directions.
  • Using , , and .
  • Einstein convention: any index that appears exactly twice in a term is summed over .

Suffix Notation (or Index Notation) drops the explicit symbol via the Einstein summation convention - repeated indices are implicitly summed. Two index types appear:

  • Dummy indices: appear exactly twice in a term, summed over - arbitrary name, no presence in result, e.g., .
  • Free indices: appear exactly once in a term, label components of the result - same name on every term in an equation, e.g., the -th component of a vector.

Index-counting sanity checks (always verify):

  1. Every term must have the same free indices.
  2. No index appears more than twice in a single term.
  3. Number of free indices = rank of the expression.

Suffix Notation Dictionary

Vector/matrix formSuffix formNotes
Dot product Scalar
Cross product Vector
Matrix product Rank 2
Transpose Swap indices
Trace Scalar
Coordinate derivative Cartesian only

Converting to Suffix Form

  1. Introduce free index for each free slot of the result (e.g., for vector identities).
  2. Distribute the free index across each vector/tensor in the expression.
  3. Introduce a fresh dummy index for each scalar sub-expression (dot product, contraction).

Example

Convert :

  1. Apply free index : ;
  2. Introduce a fresh dummy index for each scalar dot product: .

Note that we use different dummy indices for each scalar - never reuse a dummy index within the same term.