Tensor

A multilinear map over a vector space, represented in coordinates by an indexed array whose components co-vary contravariantly and covariantly under change of basis so the underlying geometric object stays invariant — the transformation law being what makes it a tensor rather than a mere array.

Core Idea

A tensor of type (p, q) over a vector space V is a multilinear map from p copies of V* and q copies of V to the field — in coordinates, an array with p upper (contravariant) and q lower (covariant) indices. Under a change of basis each upper index transforms by A and each lower by A⁻ᵀ, so the geometric object stays invariant. This transformation law is the defining commitment: an indexed array is a tensor precisely when its components co-vary in that rule-governed way. Contraction over a paired index extracts invariant scalars like the trace or scalar curvature.

Scope of Application

Lives across the multilinear-algebra-bearing subfields of mathematics, physics, and engineering; the word covers two genuinely different objects, so its use splits by sense (transformation law in force, or mere multi-way array).

• Continuum mechanics and field physics — stress, strain, elasticity, and the electromagnetic field tensor.
• General relativity — metric, Ricci, Riemann, stress-energy tensors; the field equations as tensor identities.
• Materials science — anisotropic dielectric, piezoelectric, thermal-expansion tensors under crystal symmetry.
• Graphics, robotics, medical imaging — inertia, rotation, and diffusion tensors (diffusion-tensor MRI).
• Machine learning and signal processing — any multi-way array; CP/Tucker decompositions, no transformation law.

Clarity

Naming a quantity a tensor reduces a vague question — is this geometrically real, or an artifact of my coordinates? — to a sharp test: do its components obey the multilinear transformation law under change of basis? A tensor is defined by invariance of the underlying map, so the array is demoted to a representation while the object is what survives the coordinate change. General covariance raises this to a method: a law worth the name is a tensor equation, holding in every frame at once. One caution: in machine learning "tensor" means any multi-way array, with no transformation law and only dimensional bookkeeping implied.

Manages Complexity

The tensor compresses along two axes. First, the number of equations: a law stated component by component is an avalanche of frame-tied scalar relations, which tensor notation collapses to a handful of identities that hold in all frames at once — so the analyst carries the tensors and their type and recovers any frame's components on demand. Second, the question "is this quantity geometrically real?", reduced to one mechanical diagnostic — do the components transform correctly? — with the type (p, q) organizing which slots transform how, making contraction and index-raising principled.

Abstract Reasoning

The concept licenses a diagnostic (test reality by the transformation law; audit an equation's covariance by index structure), an interventionist move (contract to extract invariant scalars, raise/lower via the metric, decompose a data array by CP/Tucker — each with entailed rank and invariance), boundary-drawing (tensor versus array; geometric versus ML sense; the symmetry class), and a predictive order-of-events — write the law covariantly first, then read off every frame and every invariant as entailments.

Knowledge Transfer

Within its home domain the tensor transfers as full mechanism, but the word covers two objects. In geometry and physics — continuum mechanics, relativity, materials, imaging — the full apparatus carries because every substrate is a real vector space whose components co-vary; there transfer is recognition of the same frame-invariant object. In machine learning only the dimensional-bookkeeping half carries (axes, contraction, CP/Tucker), with no frame-invariance. The strongest genuine transfer is the decomposition formalism along the numerically multi-indexed axis. Beyond that it is metaphor; what recurs is carried by the parents invariance/frame_of_reference, transformation, and relation, not the tensor's index calculus.

Relationships to Other Abstractions

Current abstraction Tensor Domain-specific

Parents (3) — more general patterns this builds on

• Tensor presupposes Transformation Prime

  Tensor identity is certified by a rule-governed change of component state under basis replacement; without the action there is no transformation-law test.

• Tensor presupposes Vector Space Prime

  A tensor cannot be typed, evaluated, or transformed until a vector space and its dual supply the slots, scalars, bases, and linear-combination operations.

• Tensor is a decomposition of Invariance Prime

  Removing multilinear notation leaves a named object preserved under a named nontrivial change of representation, with scope and preserved features explicit.

Children (1) — more specific cases that build on this

• Matrix Domain-specific is a kind of, conditional Tensor

  A matrix is a rank-two tensor only when its entries are components of a multilinear object and co-vary by the tensor transformation law.

Hierarchy paths (3) — routes to 3 parentless roots

• Tensor → Transformation → Function (Mapping)

Show alternative paths (2)

Neighborhood in Abstraction Space

Tensor sits in a sparse region of the domain-specific corpus (90^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (309 abstractions)

Nearest neighbors

• Matrix — 0.84
• Rank (Linear Algebra) — 0.82
• Kernel — 0.82
• Cross-reference Relation — 0.81
• Long Parameter List — 0.80

Computed from structural-signature embeddings · 2026-07-12