6.22.2 Tensor Total Slot Count Relation

Tensor Total Slot Count Relation is the specific instance of the order-type relation which states that the order of a tensor, understood as the total number of index slots it possesses, is always exactly the sum of its contravariant slot count and its covariant slot count, so that a tensor of type (p, q) has order n = p + q with no exceptions and no additional terms. This relation is the arithmetic backbone underlying all classification of tensors by order and type: it is what makes "order" a well-defined, computable quantity once a type has been specified, and it is what bounds how many distinct types can share a given order.

Stating the Relation Precisely

The Defining Equation

For a tensor of type (p, q), an element of the space

the total slot count, that is, the order n, satisfies

with p counting the copies of V (contravariant slots, upper indices) and q counting the copies of V* (covariant slots, lower indices). Every index appearing on the tensor's components T^{i₁...i_p}_{j₁...j_q} is accounted for by exactly one of these two counts, and no index is left uncounted or counted twice.

Why the Relation Is Exact, Not Approximate

The relation is a direct consequence of how the tensor product space is built: forming V ⊗ V ⊗ ... ⊗ V ⊗ V* ⊗ ... ⊗ V* with p copies of V and q copies of V* produces an object whose components necessarily require one index per factor, so the index count is forced to equal p + q by the construction itself, not by a separate convention layered on top of it.

Consequences of the Slot Count Relation

Order Fixes the Possible (p, q) Pairs

Given a fixed order n, the total slot count relation restricts the possible types to the pairs (p, q) with p + q = n and p, q ≥ 0, giving exactly n + 1 possible types for that order: (n, 0), (n−1, 1), ..., (1, n−1), (0, n). This is the precise sense in which order constrains type without determining it — order fixes the sum, but not how that sum is split.

Type Always Determines Order Uniquely

Conversely, and without exception, specifying the type (p, q) immediately fixes the order via simple addition; there is no tensor with a well-defined type for which the order is anything other than p + q. This direction of the relation is unconditionally deterministic, which is why type is regarded as the more fundamental classification and order as the coarser summary derived from it.

Diagram of the Slot Count Bookkeeping

Boundary Cases Governed by the Relation

The Zero-Slot Case

When p = q = 0, the total slot count relation gives order n = 0, corresponding to scalars — the unique type with no index slots at all, and hence no basis dependence, since there is nothing for a change of basis to act on.

The Single-Slot Case

When n = 1, the relation admits exactly two solutions, (p, q) = (1, 0) and (p, q) = (0, 1), corresponding to vectors and covectors respectively; this is the smallest order at which the total slot count relation permits more than one type, marking the point where the distinction between contravariant and covariant first becomes necessary.

Relevance to Contraction Operations

Because a legitimate tensor contraction pairs one contravariant slot with one covariant slot and removes both, contraction reduces p by one and q by one simultaneously, lowering the total order n = p + q by exactly two. The total slot count relation is what guarantees this reduction is consistent: it certifies that after any valid contraction, the resulting object still satisfies n′ = p′ + q′ with p′ = p − 1 and q′ = q − 1, so the classification scheme remains self-consistent under the operations tensors are built to support.