6.4.2 Tensor Degree Order Relation

Tensor Degree Order Relation is the statement of how the naming scheme of order classification (scalar, vector, matrix-like, higher-order) relates as a whole to the grading scheme of degree classification, describing order classification as the restriction of degree classification to homogeneous elements and describing degree classification as the extension of order classification's naming convention across the entire graded algebra T(V), including elements that mix several orders at once. Where the degree–slot-count relation compares the two schemes at the level of a single number, this relation compares them at the level of the two classification systems themselves and the vocabulary each one is designed to support.

Order Classification as a Restriction of Degree Classification

Order Names Attach to Individual Homogeneous Pieces

Order classification's names — scalar for n = 0, vector or covector for n = 1, matrix-like for n = 2, higher-order otherwise — are defined for an individual tensor considered in isolation; applied to an element of T(V), these names only make direct sense for a homogeneous element, since only a homogeneous element has a single well-defined order to be named by.

Degree Classification Recovers Order Classification on Each Summand

Restricting degree classification to any single summand V^{⊗n} reproduces exactly the order-classification picture for tensors of order n: every element there is homogeneous of degree n, hence of order n, and the two classification vocabularies coincide completely within that one summand.

Diagram of Restriction Versus Extension

Degree Classification as an Extension of Order Classification

Extending the Naming Scheme Across Summands

Degree classification extends order classification's naming idea from a single summand to the entire direct sum, replacing a fixed name like "matrix-like" with a numerical degree label n that applies uniformly across every summand, including those, such as n = 5 or n = 12, for which order classification offers no special name beyond stating the number.

Extending to Genuinely Mixed Elements

Order classification has no mechanism for describing an element that combines, say, a vector part and a matrix-like part in a single sum; degree classification extends naturally to exactly this case, describing such an element by its full set of degrees, {1, 2}, rather than forcing it into one of order classification's fixed categories.

Structural Reasons the Relation Is Exact, Not Approximate

T(V) Is Graded, Not Merely Filtered

Because T(V) is built as an exact direct sum ⊕ V^{⊗n} rather than as a filtration by increasing subspaces, every element decomposes into homogeneous parts with no approximation or loss of information; this is what makes the degree–order relation an exact correspondence on homogeneous elements rather than an approximate or leading-order one, as would be the case in a merely filtered (as opposed to graded) algebra.

Contrast With Filtered, Non-Graded Settings

In algebraic settings where only a filtration is available and the associated graded pieces must be constructed as quotients, the relation between an "order"-like invariant and a "degree" defined on the associated graded object is typically only approximate, capturing leading behavior rather than exact identity; the direct-sum structure of T(V) avoids this complication entirely, since the graded pieces already exist as literal subspaces rather than as derived quotients.

Practical Consequences of the Relation

Choosing Which Vocabulary to Use

When discussing a specific, individually given tensor, order classification's vocabulary (scalar, vector, matrix-like, higher-order) is typically preferred, since it is the more familiar and immediately named terminology; when discussing an element of T(V) that might not be homogeneous, or discussing structural properties of the algebra as a whole, degree classification's vocabulary is required instead, since it is the only one of the two designed to remain meaningful in that broader setting.

Translating Between Statements Made in Each Vocabulary

A statement made using order classification about "an order-n tensor" translates directly into a statement using degree classification about "a degree-n homogeneous element of T(V)," and this translation is always faithful precisely because of the exact coincidence established by the degree–order relation on homogeneous elements.

Why This Relation Matters

Avoiding a False Sense That the Two Schemes Are Simply Identical

Recognizing order classification as a restriction, and degree classification as an extension, clarifies that the two schemes are related but not simply identical in scope, preventing statements proven only for individually classified tensors from being assumed, without further justification, to hold for general elements of the graded algebra.

Supporting Constructions Built by Extending Order-Based Ideas

Many constructions on T(V), such as defining an algebra homomorphism by specifying its action on each homogeneous degree and extending linearly, rely directly on this relation: the construction is first carried out using order-classification-style reasoning on each summand, then assembled into a single, fully general statement using the extension that degree classification provides.