16.6.1 Tensor Sign Change Transposition Input

Tensor Sign Change Transposition Input is the specific class of input to the sign-change behavior formed by a transposition — an exchange of exactly two argument positions with all others held fixed — treated as the elementary unit that every more complex rearrangement of an alternating tensor's arguments ultimately reduces to.

Transpositions as the Elementary Input

What Qualifies as a Transposition Input

A transposition input to the sign-change behavior consists of a single pair of positions (a, b) selected from among the tensor's k argument slots, with the instruction to exchange only those two while every other slot's content remains untouched:

This is the simplest possible nontrivial input the sign-change behavior can receive, short of the identity (no exchange at all).

The Resulting Output

Feeding a transposition input into an alternating tensor always produces exactly one sign flip, independent of which two positions a and b were chosen:

Why Transposition Input Is Treated as Elementary

Generating the Full Symmetric Group

Every permutation of k objects, no matter how complex, can be written as a composition of transpositions. This means transposition input is not just one convenient case among many; it is a generating set for the entire symmetric group S_k acting on the tensor's argument slots.

for some sequence of transposition inputs τ₁,...,τₘ, though the specific sequence used is not unique.

Reducing General Sign Computation to Transposition Counting

Because feeding a general permutation σ decomposed this way into the sign-change behavior applies each τᵢ in turn, the output sign is the product of m individual −1 factors:

so verifying the sign-change behavior only for transposition inputs is sufficient to determine the behavior for any permutation input whatsoever.

Well-Definedness Despite Non-Unique Decomposition

Parity Invariance

Although a given permutation σ can be decomposed into transpositions in more than one way, and even with a different number of transpositions m, the parity of m (even or odd) never changes across decompositions. This is what guarantees that feeding transposition-input decompositions of the same σ into an alternating tensor always yields the same final sign, regardless of decomposition choice.

Adjacent versus Non-Adjacent Transposition Input

A transposition input (a, b) with a and b non-adjacent can itself be rewritten as a composition of 2|a − b| − 1 adjacent transposition inputs, each contributing one sign flip; the net parity of this sub-decomposition is always odd, consistently reproducing the single sign flip expected from the non-adjacent transposition directly.

Distinguishing Transposition Input from Cyclic Input

Cycles Are Not Elementary

A k-cycle, which rotates k slots simultaneously, is a valid input to the sign-change behavior but is not itself a transposition; it decomposes into k − 1 transpositions, yielding sign (−1)^{k−1}. Distinguishing cyclic input from transposition input clarifies why 3-cycles preserve sign ((−1)² = +1) while 4-cycles reverse it ((−1)³ = −1), a distinction that would be opaque without first isolating transposition input as the atomic case.

Diagram of Transposition Input Composition