6.5.1 Tensor Valence Covariant Count
Tensor Valence Covariant Count measures how tensor components transform under coordinate changes, essential for understanding tensor structure in physics and mathematics.
Tensor Valence Covariant Count is the number q of down-arrow (covariant, lower) entries appearing in a tensor's valence sequence, obtained by counting the covariant positions within the full ordered arrangement rather than merely stating the type total in isolation. It is the same integer that type classification records as the second component of the pair (p, q), but recovered here as a derived quantity, extracted by scanning a specific, already-fixed valence sequence rather than assumed as a given input.
Extracting the Covariant Count From a Valence Sequence
The Counting Formula
Given a valence sequence (σ₁, ..., σ_k) with each σ_i ∈ {↑, ↓}, the covariant count is:
the size of the set of positions carrying a down-arrow, computed directly from the sequence rather than supplied separately.
Worked Example
For the valence sequence (↑, ↓, ↑, ↓, ↓), scanning position by position finds down-arrows at positions 2, 4, and 5, giving a covariant count of q = 3, and by the same scan an upper count of p = 2, so the full type recovered from this valence is (2, 3).
Diagram of Scanning a Valence Sequence for Down-Arrows
Relation to Type Classification
Consistency With the Type Pair
The covariant count extracted from any valid valence sequence for a tensor always equals the q component of that tensor's type (p, q); this consistency is not a coincidence but a direct consequence of how valence is defined — as a refinement of type that records position in addition to count, never in contradiction with it.
Why the Same Number Has Two Routes to It
Type classification supplies q directly, as one of the two defining totals; valence classification supplies the same q indirectly, as a quantity that must be counted from a more detailed structure; both routes are valid and always agree, but they reflect different levels of the classification hierarchy — one coarse and given outright, the other fine and derived by scanning.
The Covariant Count as a Constraint on Valence
Fixing q Without Fixing the Full Valence
Knowing only that q = 3 for a tensor of some order k constrains, but does not determine, the full valence sequence, since the three down-arrows could occupy any 3 of the k available positions; the covariant count is necessary information for reconstructing a valence but is not, on its own, sufficient.
Number of Valences Sharing a Fixed Covariant Count
counts exactly how many distinct arrangements of down-arrows among k total positions are consistent with a given covariant count, matching the general count of valences for a type (p, q) once p = k - q is substituted in.
Practical Uses of the Covariant Count
Verifying a Contraction Is Well-Formed
Before performing a contraction that pairs a specific upper slot against a specific lower slot, confirming that the covariant count q is at least 1 (so that a lower slot exists to pair with) is a necessary preliminary check, distinct from and prior to identifying exactly which lower slot among the q available will be used.
Bookkeeping During Repeated Contractions
When performing several contractions in sequence, tracking how the covariant count decreases by exactly 1 with each contraction that removes one lower slot provides a running check that the bookkeeping of the overall calculation remains consistent with the number of lower slots actually available at each step.
Why the Covariant Count Matters
A Bridge Between Type and Valence
The covariant count is the specific quantity that shows how type classification's summary information is always recoverable from valence classification's more detailed information, reinforcing that valence is a genuine refinement of type rather than an unrelated, independent classification scheme.
A Building Block for More Detailed Slot Bookkeeping
Isolating the covariant count as its own well-defined quantity, separate from the covariant slots' specific positions, supports bookkeeping tasks — such as checking contraction feasibility — that need only the count and not the full positional detail that a complete valence sequence provides.