7.2 Tensor Component Areas

Tensor Component Areas is the survey of the distinct facets into which the study of tensor components divides — scope (what counts as a component and what does not), value range (what a component may equal), indexing (how components are addressed), extraction (how components and slices are pulled out of a tensor), counting (how many components exist), and transformation (how components change under a change of basis) — treated together as the complete map of questions one can ask about a tensor's components. Surveying these areas as a set clarifies how the narrower topics fit together into a single coherent picture of what a component is and how it behaves.

The Definitional Area: Scope

What Counts as a Component

The scope area establishes the baseline definition: a component is a single scalar obtained by fixing every index slot of a tensor relative to a chosen basis, distinguished from the whole tensor, from partially fixed slices, and from basis-independent invariants computed from components. Every other area presupposes this scope as its starting point, since counting, indexing, and transforming all refer to the same well-defined notion of "a component" fixed by this area.

The Range-of-Values Area: Value Scope

What a Component May Equal

Separate from the question of what a component is lies the question of what values it may take: unrestricted components range freely over the base field, while structural conditions such as symmetry or positive-definiteness narrow this range, either component by component or jointly across the whole array.

The Addressing Area: Indexing

How Components Are Located

The indexing area covers the valid integer ranges for addressing each slot and the conventions (one-based versus zero-based) governing where that range begins, providing the vocabulary of integer tuples used by every other area to refer to specific components.

The Retrieval Area: Extraction

Pulling Components and Slices Out of a Tensor

The extraction area covers the spectrum from fully fixing every slot (producing a scalar) to fixing only some slots (producing a lower-order slice), together with the formal description of extraction as evaluation of the tensor against basis vectors and covectors, and the linearity properties that operation satisfies.

The Cardinality Area: Component Count

How Many Components Exist

Component count ties order, type, and dimension together into the formula N = d^{p+q} (or its shape-based generalization across multiple spaces), governing how the number of components grows and what that growth implies for storage and computation as order or dimension increases.

The Dynamic Area: Transformation

How Components Change Under a Change of Basis

Transformation is the area that connects components back to the basis-independent tensor they represent, specifying precisely how each component's numerical value must update when the basis changes, according to the rule dictated by that slot's contravariant or covariant status.

Diagram of the Six Areas

Why Treating These as a Coordinated Set of Areas Matters

Preventing Gaps in Understanding

Because these six areas together cover essentially every question one might have about components, treating them as a coordinated set rather than as isolated topics prevents gaps: a treatment that discusses component count and transformation without also fixing scope, for instance, risks leaving the reader unable to say precisely what object is being counted or transformed in the first place.

Ordering the Areas for Learning

The areas also suggest a natural order of study, beginning with scope (fixing what a component is), proceeding through value range and indexing (fixing what values and addresses are possible), then extraction and counting (fixing how components are obtained and how many exist), and concluding with transformation (fixing how the whole system behaves under a change of basis) — a progression from static definition to dynamic behavior that mirrors how the concept of a tensor component is typically built up from first principles.