15.18.1 Tensor Symmetry Slot Exchange Check

Tensor Symmetry Slot Exchange Check is the verification strategy that tests tensor symmetry not by comparing components across every one of the d factorial permutations of the index positions, but by checking invariance under only the exchanges of adjacent index slots, exploiting the fact that these adjacent exchanges generate the full symmetric group.

The Reduction to Adjacent Exchanges

Adjacent Transpositions as Generators

The symmetric group on d letters is generated by the d minus one adjacent transpositions, each swapping a single pair of neighboring positions in an ordered list of d slots: the transposition of positions one and two, of positions two and three, and so on up to positions d minus one and d. Every permutation of the d slots can be written as a composition of some sequence of these adjacent transpositions, a fact underlying the description of the symmetric group as a Coxeter group with these transpositions as its standard generators.

Why Checking Generators Suffices

If a tensor's components are invariant under each of the d minus one adjacent slot exchanges individually, they are invariant under any composition of these exchanges, and hence under every permutation of the d slots, since an arbitrary permutation is by definition some composition of the generators. The Slot Exchange Check therefore replaces the requirement of verifying invariance under all d factorial permutations with the much smaller requirement of verifying invariance under only d minus one specific transpositions, applied for every assignment of the remaining, unaffected indices.

Formulating the Check

The Explicit Condition

For each adjacent pair of positions k and k plus one, and for every assignment of values to all d indices, the Slot Exchange Check requires

with all indices other than positions k and k plus one held fixed on both sides. Carrying this out for every k from one to d minus one, and for every assignment of the fixed indices, constitutes a complete Slot Exchange Check.

Sufficiency Argument in Detail

The sufficiency of this reduced check follows a standard argument used throughout the theory of generated groups: define a relation on index tuples by declaring two tuples related if the check condition connects them directly; the full permutation-invariance requirement is exactly the assertion that this relation, extended by transitivity, connects every tuple to every rearrangement of itself, and since adjacent transpositions generate the whole symmetric group, the transitive closure of direct adjacent-exchange relations does connect every tuple to every one of its rearrangements, establishing that checking only the generating exchanges is logically equivalent to checking the full Component Constraint.

Computational Advantages

Reduced Number of Distinct Conditions to Encode

Whereas the Component Equality Check organizes the verification by grouping index tuples into orbits under the full permutation action, the Slot Exchange Check organizes it instead by a fixed, small list of d minus one transposition rules, each easy to state and implement independently of the others; this makes the Slot Exchange Check particularly well suited to settings where symmetry is to be enforced constructively, for instance by applying each adjacent-exchange rule as a local constraint when building a tensor programmatically, rather than checked after the fact on a fully assembled tensor.

Analogy with Sorting Networks

Because any permutation can be realized as a sequence of adjacent transpositions, in the same way that any rearrangement of a list can be achieved by a sequence of adjacent swaps as in a bubble-sort procedure, the Slot Exchange Check can be implemented using the same elementary swap-based logic used in sorting algorithms, adapted to compare rather than reorder, giving a direct and easily audited implementation route.

Relation to Other Verification Strategies

Consistency with the Orbit-Based Check

The Slot Exchange Check and the Component Equality Check are logically equivalent, each fully implying the Component Constraint, but they organize the verification work differently: the orbit-based check groups tuples by their final sorted representative, while the Slot Exchange Check proceeds incrementally, one adjacent swap at a time, and is often the more natural choice when symmetry is to be verified or enforced during the construction of a tensor rather than after its components are already fully assembled.

Role in Proving Transformation Preservation

The generator-based reasoning underlying the Slot Exchange Check is the same reasoning invoked in the proof of Transformation Preservation, where the general permutation-invariance of a transformed tensor is established by considering an arbitrary permutation and reducing the argument, implicitly, to the generating transpositions; the Slot Exchange Check makes this reduction explicit and usable as a direct, standalone verification procedure in its own right.