4.20.1 Tensor Alternating Slot Exchange Rule

Tensor Alternating Slot Exchange Rule is the specific rule that exchanging the contents of any two argument slots of an alternating multilinear map negates its output: f(..., w, ..., v, ...) = -f(..., v, ..., w, ...), where the two shown positions have been swapped and every other slot is left untouched. The slot exchange rule is the operational form of alternation, the concrete computation used whenever two inputs to an alternating map are reordered.

Statement of the Rule

Two Slots, One Swap

For an alternating multilinear map f: V × ... × V → W and any two slot positions i ≠ j,

with the vectors at positions i and j traded and every other argument unchanged. The rule applies regardless of whether the two slots are adjacent, since it is stated for arbitrary positions i and j, not merely for neighboring ones.

Derivation From Vanishing on Repeats

The exchange rule follows from the requirement that f vanish whenever two arguments coincide. Expanding f(..., v+w, ..., v+w, ...) = 0 (same combination in both slots) by multilinearity in each of the two slots gives

The first and last terms vanish since each has a repeated argument, leaving f(...,v,...,w,...) + f(...,w,...,v,...) = 0, which is exactly the slot exchange rule.

Repeated Application

Composing Several Exchanges

Applying the slot exchange rule twice in succession, exchanging slots i,j and then exchanging slots k,l, multiplies the sign by -1 twice, returning to +1; more generally, applying the rule t times, for any sequence of t transpositions whose composite permutation is σ, produces an overall factor of sgn(σ) = (-1)^t, matching the sign of the permutation regardless of which particular sequence of transpositions realizes it.

Independence From the Chosen Sequence of Exchanges

Although a given permutation σ of the argument slots can be realized by many different sequences of transpositions, of possibly different lengths, the parity of the length (even or odd) is an invariant of σ itself; the slot exchange rule therefore produces a sign depending only on the target permutation σ, not on which particular chain of pairwise exchanges was used to reach it, guaranteeing the full permutation rule f(v_{σ(1)},...,v_{σ(n)}) = sgn(σ) f(v_1,...,v_n) is well defined.

Applications of the Rule

Row and Column Swaps in the Determinant

For the determinant, viewed as an alternating multilinear function of its column vectors, the slot exchange rule is precisely the familiar fact that swapping two columns (or, by the analogous row version, two rows) of a matrix negates its determinant; this is the most direct concrete instance of the rule, used routinely in Gaussian elimination to track sign changes when row-swapping pivots are performed.

Simplifying Computations With Alternating Forms

When evaluating an alternating multilinear map on a tuple of vectors given in a possibly inconvenient order, the slot exchange rule allows the vectors to be reordered into a more convenient sequence, such as one matching a known basis order, at the cost of tracking a single overall sign determined by the permutation used, rather than recomputing the map from scratch in the new order.

Detecting Repeated Structure Efficiently

Because two successive exchanges of the same pair of slots return the sign to its original value, the rule shows that any even permutation of the arguments leaves an alternating map's value unchanged, while any odd permutation negates it; this immediately identifies, without further computation, which reorderings of a tuple preserve the value of an alternating multilinear map and which reverse it.

Relation to the Wedge Product

Encoding the Rule Directly in Notation

The wedge product notation v₁ ∧ ... ∧ vₙ for the image of a tuple in the exterior power ⋀ⁿV is built so that the slot exchange rule holds by definition of the wedge product itself: v ∧ w = -w ∧ v, and more generally exchanging any two factors in a wedge product negates it, mirroring exactly the rule already established for alternating multilinear maps at the level of the underlying vector space construction.

Consistency With Factorization

Since every alternating multilinear map factors uniquely through ⋀ⁿV, and the slot exchange rule holds both for the original map and for the wedge product it factors through, the factorization is automatically compatible with slot exchanges: the induced linear map on ⋀ⁿV need not separately verify the exchange rule, since it is inherited directly from the exchange rule already built into the definition of the exterior power.

Boundary Cases

The Rule in Characteristic Two

In characteristic 2, -1 = 1, so the slot exchange rule as stated becomes f(...,w,...,v,...) = f(...,v,...,w,...), indistinguishable from ordinary symmetry; in this setting the vanishing-on-repeats condition remains the meaningful and strictly stronger notion, since it is no longer implied by, nor implies, a sign change that has become trivial.

Arity One Has No Exchange Rule

For an alternating multilinear map of arity n = 1, there is only one argument slot, so no pair of slots exists to exchange; the slot exchange rule is vacuously present but carries no content until arity at least 2 is reached, matching the fact that the notions of symmetric and alternating first become distinguishable from the general case at arity two.