16.7.2 Tensor Repeated Argument Swap Argument
Tensor Repeated Argument Swap Argument describes how swapping repeated indices changes a tensor's sign, key in algebraic operations.
Tensor Repeated Argument Swap Argument is the specific proof technique — swapping a repeated argument with itself and comparing the result to the sign-reversal law — used to derive that an antisymmetric tensor must vanish whenever two of its arguments coincide, presented here as a reusable pattern of reasoning rather than a one-off calculation.
The Core Move of the Argument
Setting Up the Self-Swap
The argument begins by taking the sign-reversal law, already established for a tensor T, and specializing it to the degenerate case where the two arguments being swapped are the same vector v:
Closing the Argument
The right-hand side of this specialized equation is literally the same expression as the left-hand side, so the equation reads X = −X for X = T(...,v,...,v,...), which forces:
This is the entire argument: no further computation, expansion, or case analysis is needed once the substitution u = w = v is made.
Why This Argument Pattern Recurs
The "Self-Application Forces a Fixed Point" Pattern
The swap argument is an instance of a broader reasoning pattern: whenever an operation is known to act as multiplication by −1, and that same operation can be shown to fix its input unchanged in some special case, the only way to reconcile "unchanged" with "multiplied by −1" is for the fixed input to equal zero. This same pattern of reasoning appears throughout algebra whenever an involution's fixed points under a sign-flipping action are analyzed.
Applicability Beyond Two Arguments
The swap argument generalizes immediately to tensors of any rank k ≥ 2: for any two positions a and b among the k slots, setting the vectors at those two positions equal reduces the general sign-reversal law to the same X = −X structure, regardless of how many other arguments are present or what values they take.
with the underbraces indicating the positions now hold the identical vector v, giving the same self-referential equation regardless of k.
Contrast with the Reverse Direction Argument
Not to Be Confused with Deriving Sign-Reversal from Vanishing
This swap argument runs in the direction "sign-reversal implies vanishing," and should be kept distinct from the opposite derivation, which uses a bilinear expansion of T(...,u+w,...,u+w,...) = 0 to derive sign-reversal starting from vanishing; the two arguments are converses of each other and rely on different techniques — this one on direct substitution, the other on expanding a sum.
Why This Direction Is Simpler
The swap argument's direction is comparatively simpler because it requires no expansion step: the self-swap substitution alone produces the needed equation immediately, whereas the reverse direction requires invoking multilinearity to expand a sum of vectors before the vanishing hypothesis can be applied.
The Argument's Dependence on Characteristic
Where the Argument Requires Care
The final step, dividing 2X = 0 by 2 to conclude X = 0, is valid only when 2 is invertible in the underlying field. In characteristic 2, the argument stalls at 2X = 0, which holds trivially for any X and yields no information, marking the precise point where this swap argument's conclusion becomes unavailable.