8.20 Tensor Index Expansion Operation

Tensor Index Expansion Operation is the process of converting a compact tensor index expression, in which free and dummy indices stand for entire ranges of components and implied summations, into the fully written-out form that lists every individual component equation or every individual term of a summation explicitly. It is the inverse, in a practical sense, of the abbreviation that index notation provides: where index notation compresses many equations or many summands into a single symbolic line, the expansion operation reverses that compression to reveal exactly what is being computed, which is essential both for verifying an index identity by hand and for translating an index expression into explicit numerical or symbolic computation.

Expanding Free Indices

Free Indices Represent a Family of Equations

An expression with one or more free indices is not a single equation but a stand-in for one equation per value that each free index can take. For a vector equation v^i = A^i_j w^j in three dimensions, expanding the free index i produces three separate scalar equations, one for i = 1, one for i = 2, and one for i = 3:

and analogously for i = 2 and i = 3. Multiple free indices multiply this count: an expression with two free indices each ranging over n values expands into n² separate scalar equations, one for each combination of values.

Expansion Reveals the Component Structure

Writing out every free-index equation individually shows precisely which components of the input tensors contribute to each component of the output, information that is present but compressed in the index form. This is the reason expansion is used as a checking device: an identity claimed in index notation can be confirmed correct, for a given small dimension, by expanding every free index and verifying each resulting scalar equation directly.

Expanding Dummy (Summed) Indices

Dummy Indices Represent a Sum of Terms

A repeated index appearing once as an upper index and once as a lower index within the same term signals summation under the Einstein convention, and expanding that dummy index means writing out the summation sign and every individual summand explicitly:

Every term in the expanded sum is a plain product of specific components, with no remaining index notation, so the dummy-index expansion is what turns an implied summation into an explicit, term-by-term arithmetic expression.

Multiple Dummy Indices Expand Multiplicatively

When an expression contains more than one independent dummy index, expansion produces one term for every combination of values across all the summed indices, so two independent dummy indices each ranging over n values expand into n² individual product terms before they are added together, matching the term count used when bounding the computational cost of evaluating the contraction.

Combined Expansion of Free and Dummy Indices

Full Expansion Procedure

When an expression has both free and dummy indices, complete expansion is carried out in two stages: first, one equation is written for each combination of values of the free indices; second, within each such equation, the dummy indices are expanded into their full sum of terms. The result of full expansion is therefore a finite, explicit list of scalar equations, each itself a finite, explicit sum of scalar products, with no index notation remaining anywhere.

Diagram of the Two-Stage Expansion

Use in Verifying Tensor Identities

Checking an Identity by Full Expansion in Low Dimension

A proposed tensor identity, such as a symmetry property or a contraction identity, can be verified by choosing a small concrete dimension (commonly n = 2 or n = 3), fully expanding both sides of the identity into explicit scalar equations, and confirming that every resulting scalar equation holds. While this method does not itself constitute a general proof valid for all dimensions, it is a standard sanity check that catches sign errors, mismatched index placements, and incorrect summation ranges before a general argument is attempted.

Translating Index Notation Into Computation

Beyond verification, the expansion operation is the bridge between compact index notation, used for deriving and stating tensor relations, and explicit component arrays or nested loops, used for actually computing with tensors. A symbolic or numerical computation engine that evaluates a contracted expression is, in effect, performing the index expansion operation internally, iterating over every value of every dummy index and accumulating the resulting terms for each combination of free-index values.