8.18.4 Tensor Term Balance Requirement

Tensor Term Balance Requirement is the specific precondition, drawn from the general index balance rule, that every individual term standing in an additive sum of tensor expressions must carry the identical free-index inventory as every other term in that same sum, since tensor addition is defined only component by component and has no meaning between terms whose free indices fail to correspond. It isolates the particular case of balance that governs the legitimacy of a + sign placed between two or more tensor expressions, as distinct from the balance required across the two sides of a full equation or within the construction of a single term from several factors.

The Requirement Stated Directly

Matching Inventory as the Condition for Addition

For an expression such as

to be a legitimate tensor sum, every one of its three terms must share the identical free-index inventory: the upper index $i$ and the lower index $j$, in exactly these positions, on every term. Since all three terms in this example meet that condition, the sum is well-formed and denotes the single tensor obtained by adding corresponding components.

Why Any Deviation Disqualifies the Sum

If even one term in an additive expression departs from the shared inventory — carrying an extra free index, missing one that the others have, or placing a shared letter in a different position — the sum as a whole fails the term balance requirement, and the resulting expression does not correspond to any well-defined tensor addition, regardless of how many of the remaining terms are mutually consistent with one another.

Grounding the Requirement in the Definition of Addition

Addition Is Defined Component by Component

Tensor addition, at the level of components, is defined by adding the corresponding component of one tensor to the corresponding component of another — the same free-index value on both operands is what identifies which two numbers are to be added. This component-wise definition presupposes that both tensors being added share the same free-index structure, since without that correspondence there is no principled way to decide which component of one term should be paired with which component of another.

An Example of the Failure Mode Without the Requirement

Attempting to add a term of type $(1,0)$, such as $A^{i}$, to a term of type $(0,1)$, such as $B_{i}$, despite the superficial similarity of using the same letter $i$, would require deciding whether the upper-indexed components of $A$ correspond to the upper- or lower-indexed components of $B$ — a decision the notation gives no basis for making, precisely because the two terms were never in a position to be validly added under the term balance requirement in the first place.

Applying the Requirement to Longer Sums

Pairwise Sufficiency Extends to the Whole Sum

Because tensor addition is associative and commutative in the same way ordinary numerical addition is, verifying that every term in a longer sum shares the same free-index inventory as any one reference term — rather than checking every possible pair of terms individually — is sufficient to establish that the entire sum satisfies the term balance requirement, since matching against a single common reference automatically implies pairwise matching among all the terms.

Parenthesization Does Not Affect the Requirement

Because associativity holds once every term satisfies term balance, grouping a long sum into sub-sums with parentheses, such as $(A^{i}{}{j} + B^{i}{}{j}) + C^{i}{}_{j}$, does not introduce any additional balance requirement beyond the one already applying to the sum as a flat list of terms; the requirement is a property of the full collection of terms, independent of how they happen to be grouped for the purposes of evaluation.

Distinguishing Term Balance From Related Requirements

Contrast With Balance Within a Single Term's Construction

Term balance concerns the relationship between multiple terms joined by addition; it is a distinct concern from the internal consistency required when a single term is itself built by multiplying several tensor factors together, where the question is instead whether those factors' free indices combine without unintended collision, a matter addressed separately by term-level free index matching within a single product.

Contrast With Balance Across the Two Sides of an Equation

Term balance also differs from the requirement that the two sides of an entire equation share a common free-index inventory; term balance applies within one side of an equation, among the terms that side is composed of, and is typically verified before the further step of comparing that side's inventory against the other side's is even attempted.

Consequences of Violating the Requirement

The Sum Has No Defined Value

An additive expression violating term balance does not evaluate to any determinate tensor, since there is no consistent rule for combining components across mismatched free-index structures; any further use of such an expression — substituting it into a larger formula, evaluating it numerically, or comparing it to another expression — inherits this lack of definition.

The Violation Usually Signals an Upstream Error

Because term balance is typically satisfied automatically when a sum is constructed correctly from tensors of a common type, a violation discovered during a derivation most often indicates that one of the summed terms was itself derived incorrectly at an earlier stage — carrying an unintended extra contraction, or a missing one — making the violation a useful pointer back toward the specific step responsible for the error.

Role Within the Index Balance Rule

The term balance requirement is the instance of the general index balance rule that governs the legitimacy of addition specifically, translating the broad principle that free indices must be conserved wherever tensor expressions interact into the concrete, checkable condition that every addend in a sum must carry the same free-index inventory as every other addend. It functions as a necessary gatekeeping check performed on each side of a tensor equation before that side's overall inventory can be meaningfully compared against the other side under the equation-level balance rule.