8.14.4 Tensor Index Range Repeated Index Limit

Tensor Index Range Repeated Index Limit is the constraint governing how many times a single index letter may legitimately appear within one term of a tensor expression, together with the numerical bound this constraint imposes on the length of the implicit summation that repetition triggers. A repeated index is limited to exactly two occurrences within a term — once in the upper position and once in the lower position — and, once that limit is respected, the index is summed over its full range, so that the repeated index limit fixes both the maximum allowed multiplicity of a symbol and the upper bound of the sum it produces.

The Multiplicity Limit on Repeated Indices

Exactly Two Occurrences, No More

Within a single term of a tensor expression, an index letter may appear at most twice, and if it appears twice, the two occurrences must be in opposite positions — one upper and one lower. An expression such as

respects this limit, since $i$ occurs exactly twice, once up and once down. A hypothetical expression in which the same index letter appeared three or more times within a single term would violate the repeated index limit and is considered ill-formed under the standard summation convention, since the convention only defines the meaning of a pairwise repetition.

Same-Position Repetition Also Exceeds the Limit

A letter appearing twice in the same position — twice upper, or twice lower, within one term — likewise falls outside what the repeated index limit permits under the ordinary convention, since implicit summation is defined specifically for an upper–lower pairing. Such same-position repetitions are typically flagged as notational errors unless an explicit non-standard convention, such as one used with a fixed orthonormal frame where index height is not tracked, has been declared in advance.

The Numerical Limit Imposed on the Resulting Sum

Upper Bound Supplied by the Ambient Range

Once a repeated index respects the multiplicity limit, its implicit summation is bounded above by the size of its index range, which is in turn fixed by the dimension $n$ of the space under discussion:

The repeated index limit therefore has two layers: a structural layer restricting how a letter may occur within a term, and a numerical layer restricting how far the resulting sum runs, with the second layer inherited directly from the implicit or explicit index range notation in force.

Distinguishing the Structural Limit From the Numeric Limit

The structural limit (at most two occurrences, opposite positions) is a rule about notation and is independent of dimension; it holds whether the ambient space is two-dimensional or twenty-dimensional. The numeric limit (the upper bound $n$ of the resulting sum) depends entirely on dimension and changes whenever the ambient space changes, even though the structural pattern of the expression stays identical.

Consequences of Exceeding the Limit

Ambiguity From Over-Repetition

If a single term were permitted to contain an index letter three or more times, it would become ambiguous which pairs of occurrences are meant to be summed against each other, since summation is fundamentally a pairwise operation between one upper and one lower slot. The strict two-occurrence limit exists precisely to prevent this ambiguity from arising, guaranteeing that every valid repeated index defines one, and only one, unambiguous sum.

Distinguishing Legitimate Multi-Index Expressions From Violations

An expression containing several different repeated index letters, each occurring exactly twice, does not violate the limit, since the limit applies per letter rather than to the term as a whole. An expression such as

is well-formed because $i$ and $j$ are each independently repeated exactly twice, even though the term as a whole contains four index occurrences.

Renaming and the Repeated Index Limit

Dummy Indices Can Be Freely Relabeled

Because a properly repeated index is a dummy index consumed entirely within its own term, it can be renamed to any unused letter without violating the repeated index limit or changing the value of the expression, provided the new letter does not collide with another index — free or dummy — already present in the same term. This freedom to relabel is itself a consequence of respecting the two-occurrence limit: since the letter carries no meaning outside its own pairing, no external reference to the original letter is broken by renaming it.

Role Within Index Range Notation

The repeated index limit is the rule that connects the syntactic pattern of index repetition to the semantic content of implicit summation and its numerical bound. It draws the boundary between well-formed and ill-formed use of repeated indices, and it is what allows the summation convention to be applied mechanically and unambiguously: any term satisfying the limit has a single, well-defined implicit sum, bounded above by the index's declared or inherited range, and any term violating it falls outside the scope of the convention altogether.