15.1.5 Tensor Symmetric Verification Scope

Tensor Symmetric Verification Scope is the delineation of which methods for confirming that a given tensor is symmetric, namely reducing the check to adjacent transpositions, testing idempotence under the symmetrization operator, and checking equality of components under index permutation, are treated within this branch, as distinct from numerical tolerance issues and verification of partial rather than full symmetry.

What Falls Within Scope

Reduction to Adjacent Transpositions

Within scope is the fact that verifying $\sigma \cdot t=t$ for every permutation $\sigma \in S_k$ need not be checked separately for all $k!$ permutations, since the adjacent transpositions ${\tau }_1,\dots ,{\tau }_{k-1}$, each swapping positions $i$ and $i+1$, generate the entire symmetric group; confirming ${\tau }_i\cdot t=t$ for each of these $k-1$ generators is sufficient to conclude symmetry under every permutation.

Idempotence Under Symmetrization

Also within scope is the use of the symmetrization operator itself as a verification tool: since $\text{Sym}\left(t\right)=t$ exactly when $t$ is already symmetric, applying the symmetrization operator and comparing the result to the original tensor gives a single, direct test that avoids checking individual permutations altogether, at the cost of requiring the full averaging computation.

Component-Level Verification Against a Basis

Within scope as well is the component-level method of verification described at the level of the symmetric component scope: expanding $t$ in a fixed basis and confirming that its component array satisfies $T^{i_1\dots i_k}=T^{i_{\sigma \left(1\right)}\dots i_{\sigma \left(k\right)}}$ for the generating transpositions, giving a concrete numerical procedure equivalent to the coordinate-free reduction above.

What Falls Outside Scope

Numerical Tolerance and Approximate Symmetry

When components are computed or measured only approximately, as floating-point numbers subject to rounding error, deciding whether a nearly-but-not-exactly symmetric array should be treated as symmetric requires a choice of numerical tolerance and an accompanying error analysis; this practical, numerically-motivated question is outside scope, which addresses only exact symmetry in the algebraic sense.

Verifying Partial Symmetry

Confirming that a tensor is symmetric in only some of its indices, rather than fully symmetric in all of them, requires checking invariance under a proper subgroup of $S_k$ generated by a restricted set of transpositions; this falls outside scope, which is restricted to the verification of full symmetry across every index simultaneously, consistent with the component scope established elsewhere in this branch.

Verifying Symmetry After a Change of Basis

Whether the property of being symmetric persists correctly after a change of basis is a fact about the basis-independence of the definition rather than a verification procedure; while the definition of a symmetric tensor is manifestly basis-independent since it is stated at the level of the abstract permutation action, working out the details of this invariance under an explicit change of basis is outside the present scope.

Why Reduction to Generators Suffices

The Generating Set Argument

If $t$ is invariant under every generator of a group, it is invariant under every element of the group, since an arbitrary group element is a finite product of generators and their inverses, and the permutation action respects this product structure, $\left(\sigma \tau \right)\cdot t=\sigma \cdot (\tau \cdot t)$; this is the precise reason checking only the $k-1$ adjacent transpositions, rather than all $k!$ permutations, is a logically complete verification method, not merely a practical shortcut.