16.4 Tensor Antisymmetric Tensor Relation

Tensor Antisymmetric Tensor Relation is the overarching family of algebraic relations that define what it means for a tensor to be antisymmetric, gathering together the component-level equations, the sign-change law under reordering, and the structural consequences that follow from them into a single coherent relational framework.

Scope of the Relation Family

What Counts as an Antisymmetric Relation

A relation belongs to this family if it expresses some form of the statement that exchanging two arguments (or two index labels) of a tensor negates its value:

Every relation discussed under this heading — component identities, sign-change laws, permutation formulas, vanishing conditions — is a restatement or logical consequence of this one defining equation applied in a particular context.

Two Equivalent Formulations

The family is often presented in two equivalent forms, an abstract multilinear-map form and an indexed-component form:

with the coordinate-free form used for conceptual reasoning and the component form used for explicit computation.

The Constituent Relations

Component Relation

At the level of individual scalar entries, the family includes the requirement that swapping index labels negates the corresponding component value, which in turn forces every diagonal-type entry (equal indices) to vanish.

Sign Change Relation

At the level of operations, the family includes the multiplicative law describing exactly how much the tensor's value scales — always by a factor of +1 or −1 — under any rearrangement of its arguments, generalized to full permutations via the signature function sgn(σ).

Permutation Extension Relation

Extending beyond single swaps, the family includes the general formula covering rearrangement by an arbitrary permutation σ of k indices:

which reduces to the pairwise relation when σ is a single transposition.

Consequences Unified by the Relation Family

Vanishing on Repeated Labels

Every member of the family implies the same vanishing consequence: a tensor value or component with two coinciding arguments or index labels must equal zero, since the relation forces it to equal its own negative.

Dimension Bound on Rank

Because the vanishing consequence rules out any rank-k tensor from having a nonzero value once k exceeds the ambient dimension n (no k distinct index labels can be drawn from only n options), the relation family collectively bounds the possible ranks of nontrivial antisymmetric tensors to k ≤ n.

Independent Component Count

The relation family determines the count of independent components at each rank:

directly from the requirement that components are equal up to sign across any reordering of a fixed index set.

The Relation Family Across Representations

Matrix Representation for Rank 2

At rank 2, the entire relation family collapses to the single matrix identity:

Levi-Civita Representation for Top Rank

At the top rank k = n, the relation family is captured entirely by proportionality to the Levi-Civita symbol:

for a single scalar c, since the one-dimensional space of top-rank alternating tensors leaves no freedom beyond an overall scale factor.

Diagram of the Relation Family Hierarchy