13.14.4 Tensor Contraction Scalar Result Case

Tensor Contraction Scalar Result Case is the specific instance of the contraction result type in which the number of contractions performed equals the smaller of the original contravariant and covariant index counts, reducing the object to type $$(0,0)$$ and leaving a plain scalar with no remaining tensorial structure. It identifies the boundary case within the general classification of contraction outcomes at which every available index has been consumed, distinguishing this terminal outcome from any result type that still retains one or more free indices.

Conceptual Basis

The Terminal Point of the General Result Type Formula

The general contraction result type formula describes how a tensor's type shrinks as contractions accumulate. The scalar result case identifies the specific point along this progression where the formula yields $$(0,0)$$, marking the natural endpoint beyond which no further contraction of the same tensor is possible.

Requiring Equal or Balanced Reduction

Because each contraction removes one contravariant and one covariant index together, reaching the scalar result case requires that the number of contractions performed equal the smaller of the two original counts, and additionally requires that this smaller count itself equal the larger count if every index is to be exhausted rather than merely minimized.

Distinguishing From Merely Small Result Types

A result type such as $$(1,0)$$ or $$(0,1)$$ represents a low-rank but still nonzero tensor, retaining one free index and therefore still subject to basis-dependent transformation; the scalar result case is reached only when both counts reach exactly zero simultaneously.

Formal Description

Condition for Reaching the Scalar Case

For a tensor of original type $$(p,q)$$, the scalar result case is reached after $$k$$ contractions precisely when:

requiring both that $$p$$ equal $$q$$ in the original tensor and that every one of these matched indices be contracted.

Impossibility When Counts Are Unequal

If the original tensor has $$p\ne q$$, the scalar result case can never be reached by contracting that tensor alone, since the maximum number of contractions possible is bounded by $$\min (p,q)$$, leaving a residual type of $$\left(\right|p-q|,0)$$ or its covariant counterpart rather than $$(0,0)$$.

Reachability Through Combination With Other Tensors

Even when a single tensor cannot reach the scalar result case on its own, combining it with additional tensors, such as a metric or another tensor supplying the missing variance, and then contracting the combined index set can bring the total contravariant and covariant counts into balance, allowing the scalar case to be reached.

Properties

Basis Independence as a Defining Feature

Because the scalar result case corresponds to the complete elimination of all indices, any value obtained in this case is automatically invariant under a change of basis, distinguishing it sharply from any nonscalar result type, which continues to depend on the coordinate system through its remaining free indices.

Terminal Status Within a Contraction Sequence

Once the scalar result case has been reached, no further contraction of that specific object is possible, since no indices remain to be paired, making this case the natural stopping point for any sequence of contractions applied to a fixed starting tensor or combination of tensors.

Coincidence With Full Contraction

The scalar result case is identical to what is elsewhere described as full contraction, viewed here specifically as a particular value taken by the general contraction result type rather than as a named operation in its own right.

Applications

Extracting Invariants From Tensor Fields

The scalar result case is the mechanism by which scalar invariants, such as trace, norm, or curvature scalars, are extracted from tensor fields of higher rank, providing quantities that can be compared, plotted, or interpreted without reference to any particular coordinate system.

Endpoint of Symbolic Simplification

In symbolic tensor computation, recognizing when a sequence of planned contractions will reach the scalar result case allows the final output type to be anticipated in advance, confirming that the computation is expected to terminate in a single number rather than in an object still requiring further reduction.

Verification Through Basis Comparison

Because the scalar result case guarantees basis independence, recomputing a contraction expected to reach this case in two different bases and confirming agreement between the two computed values serves as a direct check on the correctness of the contractions performed.