Matrix and Tensor Representations
Matrix and Tensor Representations model complex data through structured frameworks, enabling advanced signal processing via multi-dimensional analysis.
Matrix and Tensor Representations are structured Behavioral Representations whose scientific meaning is distributed jointly across two or more explicitly declared logical axes. These axes include their coordinate domains, element semantics, units or value types, support mappings, masks, and structural constraints. It is essential to establish immediately that a matrix or tensor representation is not merely defined by being stored in a two- or N-dimensional programming array. Furthermore, the tensor order or tensor rank in this context is distinct from the matrix rank known in linear algebra. Here, the term tensor denotes a semantically indexed multidimensional representation rather than automatically asserting the coordinate-transformation properties associated with mathematical tensors in multilinear or differential geometry.
Meaning and Boundaries of Matrix and Tensor Representation
A Matrix or Tensor Behavioral Representation is a regular multidimensional arrangement of representation elements indexed jointly by two or more declared logical axes. The scientific meaning of each element arises from the full tuple of axis coordinates that index it. The representation's identity encompasses:
- Axis names and roles: What each axis semantically represents and its scientific function.
- Axis order: The fixed ordering of axes that defines the logical indexing scheme.
- Coordinate values or IDs: The explicit set of coordinate identifiers along each axis.
- Shape policy: The cardinality (size) of each axis and constraints on shape.
- Element semantics: The scientific meaning assigned to each element, including units or value type restrictions.
- Support mapping: The declared domain of validity or observed coordinates.
- Missingness and sparse/default semantics: How absent or default values are handled and interpreted.
- Structural symmetries: Any declared symmetry, antisymmetry, directionality, or diagonal properties.
- Representation version: The versioning or revision history of the representation definition.
Key Distinctions
| Object | Scientific Role | Identity Comes From | Critical Non-Equivalence |
|---|---|---|---|
| Matrix | Two-axis representation with potentially special row/column semantics | Axis names, roles, order; coordinate domains and semantics | Matrix rank ≠ tensor order; meaning depends on axis identities, not just shape or storage |
| Multidimensional Tensor Representation | Representation with three or more logical axes | Axis identities and full coordinate tuples | Higher-order axes add semantic distinctions beyond dimensionality alone |
| Axis | Logical dimension indexing elements | Semantic name and role; coordinate domain | Axis identity ≠ positional index; axis 0 ≠ axis named "time" |
| Axis Coordinate | Location identifier along an axis | Coordinate value or ID within the axis domain | Coordinate semantics differ even if cardinality matches |
| Element | Single value at the intersection of all axes | Full index tuple across all axes | Element meaning depends on all axis coordinates jointly, not value alone |
| Slice | Subset fixing or selecting coordinates on one or more axes | Coordinates fixed or selected | Slice semantics depend on retained coordinate identities, not just array positions |
| Block | Structured subdomain grouping coordinates | Membership in a declared coordinate subset or grouping | Blocks convey structural semantics beyond shape |
| Representation Instance | One realized matrix/tensor with fixed coordinate sets and values | Complete set of axes, coordinates, semantics, and metadata | Storage format or numeric array is only one implementation choice |
| Storage Array | Computational data structure holding numeric values | Array shape, dtype, memory layout | Does not define semantics or axis identities; only one physical realization |
Order, Shape, Named Axes, and Coordinates
A generic tensor-element abstraction for the ith representation instance is:
Here:
iindexes the representation instance.Z_iis one matrix or tensor Representation Instance.kis the number of declared logical axes.j_ris an index along logical axisrforr = 1, …, k.𝒱is the declared element value domain.
The scientific meaning of the element requires the semantic identity and coordinate associated with every j_r, not merely its stored numeric value.
The tensor shape is defined as:
Where:
n_ris the cardinality of logical axisr.kis the tensor order or number of logical axes.
Note that k is not matrix rank, intrinsic dimension, sample size, or information content. Equal shape does not establish semantic compatibility.
Named Axes
Named axes serve as stable semantic keys of matrix and tensor structure. Representative axes include:
timedescriptorchannelsensorjointcoordinatefrequencyscaleentitysourcetargetmodalityparticipanttrialconditioncomponent
Positional labels such as axis 0 or last dimension are implementation references and should never substitute for scientific axis identity.
Axis Coordinates
Axis coordinates are the values or IDs identifying locations along an axis. Examples include:
- Timestamps (for
timeaxis). - Frequencies (for
frequencyaxis). - Scale values (for
scaleaxis). - Descriptor IDs (for
descriptoraxis). - Joint names (for
jointaxis). - Coordinate labels such as
x,y,z(forcoordinateaxis). - Participant or modality IDs.
- Entity IDs.
Axis cardinality (length) alone does not reveal coordinate semantics. For example, an axis of length 17 could represent 17 joints, 17 frequencies, 17 participants, or 17 latent components.
Axis Role Comparison
| Axis Role | Representative Coordinates | Ordering Semantics | Primary Risk If Hidden |
|---|---|---|---|
| Support / Observation | Time stamps, trial numbers | Typically temporal or experimental order | Misaligned temporal or experimental context |
| Component / Descriptor | Feature IDs, descriptor names | Arbitrary or meaningful order | Confusion of features or descriptors |
| Physical Coordinate | x, y, z labels | Spatial order or indexing | Misinterpretation of spatial dimensions |
| Channel / Sensor | Sensor IDs (e.g., EEG channels) | Fixed sensor layout | Mixing sensor signals or misattributing data |
| Frequency / Scale | Frequency bins, scale levels | Increasing frequency or scale | Mixing frequency bands or scale levels |
| Entity | Subject IDs, object IDs | Arbitrary or known ordering | Confusion of subjects or entities |
| Source / Target Relation | Source and target node IDs | Directional roles | Reversing relationships or confusing directionality |
| Modality | Modality labels (e.g., audio, video) | Experimental or sensor order | Mixing modalities without awareness |
| Collection / Participant / Trial | Participant IDs, trial numbers | Experimental sequence | Misalignment in experiments or datasets |
Canonical Behavioral Matrix and Tensor Schemas
Representative matrix schemas include:
- time × descriptor: Common in time series feature analysis; rows correspond to time points, columns to features or descriptors.
- channel × time: Sensor signals recorded over time; rows are channels, columns are time samples.
- time × frequency: Time-frequency representations; rows are time points, columns frequency bins.
- joint × coordinate: Spatial pose data; rows are joints, columns spatial dimensions.
- entity × entity: Pairwise relationships or interactions between entities.
Each two-dimensional shape can encode fundamentally different semantics. The interpretation of rows and columns, their coordinate identities, units, support domain, and any diagonal or symmetry rules belong to the representation definition, not to shape alone.
Representative higher-order tensor schemas include:
- joint × coordinate × time: Pose trajectories over time.
- participant × time × descriptor: Experimental data across multiple participants.
- sensor × axis × time: Multichannel inertial or EEG signals with spatial axes.
- source × target × frequency: Pairwise interactions resolved over frequencies.
- scale × time × descriptor: Multiscale time series features.
- entity × time × component: Multivariate dynamic entity properties.
These examples illustrate axis composition rather than a fixed ontology. Adding an axis creates a new structural distinction only if the axis carries a defensible scientific role.
Mixed Semantic Axes and Unit Structure
A tensor can comprise axes with heterogeneous semantic and physical units. For example, one axis's coordinates might correspond to descriptors with different physical units (e.g., meters, seconds, volts), another axis may represent time, and another participants. Homogeneous numeric data type (dtype) does not imply homogeneous scientific units. Operations across mixed-unit axes require unit-aware or otherwise justified semantics to avoid invalid interpretations.
Canonical Schemas Comparison
| Schema | Element Meaning | Axis Semantics | Main Interpretation Risk |
|---|---|---|---|
| Time × Descriptor | Feature values at each time point | Time stamps; descriptors/features | Confusing time for feature dimension or mixing descriptors |
| Channel × Time | Sensor signal values over time | Sensor IDs; time stamps | Mixing sensors or mislabeling temporal order |
| Time × Frequency | Spectral power or coefficients | Time stamps; frequency bins | Interpreting time-frequency as simple matrix without transform |
| Joint × Coordinate × Time | 3D pose coordinates across time | Joint names; coordinate labels; time stamps | Losing spatial or temporal semantics after reshape |
| Participant × Time × Descriptor | Features per participant per time | Participant IDs; time stamps; descriptors | Misalignment of participants or time indices |
| Source × Target × Frequency | Relation strength between sources and targets over frequency | Source IDs; target IDs; frequency bins | Confusing source-target roles or frequency interpretations |
| Scale × Time × Descriptor | Multiscale feature values | Scale levels; time stamps; descriptors | Mixing scale semantics or units |
Axis Permutation, Slicing, Stacking, and Alignment
Axis permutation (or transpose) refers to reordering the logical axes of a representation. A permutation preserves the same scientific representation only if every axis identity, coordinate mapping, and element correspondence is preserved. While permutation changes storage/index order, it does not necessarily alter scientific content. Losing the permutation map or incorrectly relabeling axes creates a semantically different or invalid representation, even if all numeric values remain intact.
Slicing and subsetting restrict the representation to declared coordinates or ranges along one or more axes. Slicing can preserve the representation schema over a smaller support or component set but changes support, available entities/components, boundary context, or comparability when the removed coordinates matter. A positional slice must be interpreted through coordinate identity rather than array position alone.
Stacking introduces a new logical axis that collects compatible matrix/tensor instances or components. Stacking requires a meaningful new coordinate, such as participant, trial, condition, or modality. Concatenation extends an existing axis, requiring compatible semantics on all unaffected axes and a defensible ordering or coordinate union on the extended axis.
Coordinate-aware alignment before combination is critical:
- Inner alignment retains only coordinates shared by all inputs.
- Outer alignment forms a union of all coordinates, potentially introducing missing entries.
- Left/right/reference alignment follows a declared coordinate set.
Same axis length does not prove coordinate identity. Silently aligning by position risks pairing different participants, timestamps, frequencies, descriptors, joints, or entities.
Structural Operations Comparison
| Structural Change | Semantic Condition | Information Preserved | Primary Failure Mode |
|---|---|---|---|
| Axis Permutation | Axis identities and coordinate mappings preserved | Element values and semantics | Losing or mislabeling axis identity breaks equivalence |
| Slice | Coordinates explicitly selected and identified | Subset of elements within declared support | Ignoring coordinate semantics leads to misinterpretation |
| Stack | New axis with meaningful coordinate introduced | All original axes plus new axis | Arbitrary stacking without semantic basis confuses data |
| Concatenate | Compatible axes and coordinate unions with defensible ordering | Extended axis with preserved semantics | Mixing incompatible coordinate semantics or order |
| Inner Align | Shared coordinates explicitly identified | Intersection support preserved | Losing unique coordinates leading to data loss |
| Outer Align | Union of all coordinates with defined missingness semantics | Complete combined support including missing | Unhandled missing entries cause invalid analyses |
Reshape, Flattening, Broadcasting, and Reduction Boundaries
Reshape changes the arrangement of stored values into another shape under an explicit index mapping. Reshape is scientifically semantics-preserving only when the new logical axes and the mapping between old and new index tuples are declared. Preserving element count and numeric order alone is insufficient when the new shape obscures which dimensions correspond to time, descriptors, joints, or entities.
Flattening merges two or more logical axes into one composite axis. A reversible flattening requires a composite-coordinate map that can recover the original axis identities and coordinates. Without such a map, values remain numerically intact but the representation loses semantic structure. For example, flattening joint × coordinate × time into one vector differs scientifically from retaining the original axes, even if an inverse array reshape is technically possible.
Singleton-axis insertion/removal and broadcasting:
- Inserting a size-one axis allows value reuse across another axis.
- Broadcasting replicates one value or vector across compatible shapes.
Shape compatibility is not semantic compatibility. Broadcasting participant-level context across time can be legitimate, but broadcasting one participant's value across other participant IDs manufactures unsupported evidence.
Reductions and contractions collapse an axis by summing, averaging, maximizing, integrating, or other operations. Reduction removes that axis and produces another representation or descriptor-like summary. The semantics depend on the operation and weighting. Axis reduction is not a neutral reshape and should not be treated as information preserving unless the removed distinction is intentionally irrelevant under the declared purpose.
Structural Operations Comparison
| Operation | Values Copied/Combined? | Semantic Metadata Required | Information Risk |
|---|---|---|---|
| Reshape | Rearranged without combining | Mapping between old and new axes | Losing axis identity or mapping leads to semantic confusion |
| Flatten | Merged axes (no value change) | Composite-coordinate map | Losing map loses semantic structure |
| Unflatten | Split composite axis | Composite-coordinate map | Without map, original axes cannot be recovered |
| Insert Singleton Axis | Dimension added, values reused | Axis identity and coordinate | Misuse can imply false replication across incompatible axes |
| Squeeze | Remove size-one axis | Axis identity | Removing meaningful singleton axes misrepresents structure |
| Broadcast | Replication of values | Semantic compatibility of axes | Broadcasting across incompatible coordinates fabricates data |
| Reduce Axis | Combines values (sum, mean, etc.) | Operation semantics | Reduction may lose key distinctions; not information preserving |
Dense, Sparse, Masked, and Block-Structured Forms
Dense matrix/tensor forms explicitly store every coordinate tuple in the logical domain.
Sparse forms store only selected entries plus explicit default or absence semantics. An unstored sparse entry can mean mathematical zero, no relation, unavailable value, unobserved coordinate, or another declared state. Sparse storage is not scientifically interpretable without its default semantics.
Masks and validity structures provide information separate from stored element values. They distinguish:
- Valid zero
- Missing
- Invalid
- Padded
- Structurally inapplicable
- Censored
- Unavailable
- Unobserved entries
A tensor filled with zeros and a mask can represent something fundamentally different from the same numeric tensor in which every zero is a genuine observation.
Block-structured matrices/tensors group subsets of coordinates into scientifically meaningful blocks such as modality blocks, body regions, sensor groups, descriptor families, within- versus between-entity regions, or multiscale bands. Block identity carries semantics not recoverable from shape alone. Reordering or combining blocks requires preserving membership and coordinate lineage.
Ragged and variable-cardinality boundaries arise when the regular tensor assumption of a rectangular Cartesian product of axis coordinate sets fails. Variable-length sequences, changing entity sets, variable landmark counts, or irregular nested structures may require padding/masks, ragged containers, sets, graphs, or composite representations rather than forcing every instance into the same dense tensor domain.
Storage Form Comparison
| Form | Unstored/Masked Meaning | Structural Benefit | Scientific Caution |
|---|---|---|---|
| Dense | No unstored entries; all explicit | Simple indexing and access | Potentially large storage; may mask missingness |
| Sparse-Zero | Unstored assumed zero | Storage and computation savings | Zero may differ from missing or invalid without semantics |
| Sparse-Absence | Unstored means absence or missing | Efficient for incomplete data | Must declare absence meaning; ambiguous otherwise |
| Masked Dense | Explicit mask marks missing/invalid | Mixed value and validity info | Mask must be enforced and interpreted correctly |
| Padded | Extra entries hold no data, often zero-filled | Enables ragged data in dense form | Padding can distort statistics if not handled |
| Block-Structured | Grouped coordinate subsets with block ID | Exploits domain structure | Reordering or merging blocks requires careful semantics |
| Ragged/Nonrectangular Boundary | Variable-length or irregular support | Models nested/variable data | Cannot force into dense rectangular tensor without loss |
Repeated Axes, Symmetry, Directionality, and Diagonals
Repeated-domain axes occur in representations such as:
entity × entitychannel × channeljoint × jointsource × target
Two axes can draw coordinates from the same entity set but play different roles. It is critical to preserve source/target or row/column role identity. An asymmetric relation matrix can change meaning under transpose even when both axes contain identical labels.
Symmetric, antisymmetric, directed/asymmetric, triangular, and unconstrained matrix structures are declared representational constraints:
- Symmetry can encode undirected relations or mathematical properties of the represented quantity.
- Symmetry must not be inferred solely from equal axis labels.
- Storing only one triangle is semantics-preserving only when the omitted half is recoverable under a declared symmetry rule.
Diagonal semantics in repeated-axis matrices vary widely:
- Self-relation
- Variance or self-similarity
- Unity by normalization
- Zero by definition
- Unavailable self-comparison
- Other domain-specific quantities
Do not force diagonals to zero or one merely because a matrix resembles adjacency, distance, correlation, covariance, or similarity matrices.
A relation matrix/tensor is distinct from a graph representation:
- A matrix organizes pairwise values over repeated axes without declaring nodes, edges, topology, edge existence, graph attributes, or graph-theoretic semantics.
- Thresholding or interpreting nonzero entries as edges creates an additional relational/graph mapping rather than exposing an inherent graph in every pairwise matrix.
Repeated-Axis and Structural Constraint Comparison
| Representation | Axis Roles | Structural Constraint | Diagonal Meaning | Graph Interpretation Boundary |
|---|---|---|---|---|
| Symmetric Relation Matrix | entity × entity | Symmetry declared | Domain-specific; may vary | Not automatically a graph; edges require mapping |
| Directed Source × Target Matrix | source × target | Asymmetric, directional | Domain-specific | Edge direction explicit; matrix may represent graph |
| Distance Matrix | entity × entity | Symmetric, zero diagonal | Zero by definition | Not a graph directly; distances do not imply edges |
| Covariance/Correlation-Like Matrix | entity × entity | Symmetric, positive semi-definite | Variance on diagonal | Statistical relation, not necessarily graph edges |
| Adjacency-Like Matrix | entity × entity | Often binary or weighted | Zero or undefined | Graph edges defined by nonzero entries explicitly |
| Source × Target × Frequency Tensor | source × target × frequency | Directional; frequency as third axis | Domain-specific | Tensor encodes frequency-resolved relations |
Semantic Compatibility, Round Trips, and Provenance
Semantic compatibility between Matrix/Tensor Representation Instances requires:
- Compatible representation definitions and versions.
- Named axes with matching roles.
- Coordinate identities and units/value semantics aligned.
- Support and fitted state consistent.
- Missingness and default value rules compatible.
- Structural constraints (symmetry, directionality) matched.
Equal data type and shape are weak implementation checks and do not establish scientific compatibility.
Semantic round trips involve inverse operations such as transpose/inverse-transpose, flatten/unflatten, dense/sparse conversion, padding/unpadding, serialization/deserialization, and chunk/reassembly. A round trip is scientifically lossless only when values and all metadata needed to recover axis, component, and support semantics survive. Recovering the same byte or numeric sequence while losing coordinate identities is not a semantic round trip.
Logical axis order is distinct from physical storage and memory layout. Variations such as row-major vs. column-major layout, strides, chunk order, compression blocks, contiguous vs. noncontiguous views, device placement, and library-specific tensor layouts affect computation but do not define the scientific order or meaning of logical axes. Scientific serialization should preserve sufficient metadata to reconstruct logical structure independently of any particular library's memory conventions.
Integrated Worked Comparison: Walking Episode Representations
Consider a walking episode recorded with multiple sensor modalities and descriptors:
- time × descriptor matrix: A contour of behavioral features extracted at each time point.
- sensor × axis × time tensor: Multichannel inertial signals, where
axisindexes spatial dimensions (e.g., x, y, z). - joint × coordinate × time tensor: Pose landmarks capturing joint positions over time.
- time × frequency matrix: Time-frequency spectral representation of signals.
- source × target × frequency tensor: Pairwise relational descriptors (e.g., connectivity) across frequencies.
Demonstrations:
-
Safe axis permutation: The pose tensor
joint × coordinate × timepermuted totime × joint × coordinateremains semantically equivalent only when an explicit permutation map preserves axis identities and coordinate correspondences. -
Same-shaped but semantically incompatible matrix: A
time × descriptormatrix with identical shape but where rows encode sensor channels and columns frequency bins is semantically different despite shape equality. -
Coordinate-aware concatenation: Time-series matrices from multiple trials concatenated along a new
trialaxis with explicit trial IDs preserve semantic clarity. -
Outer alignment with missing entries: Combining sensor data from sessions with differing sensor sets requires outer alignment on the
sensoraxis, introducing missing entries for absent sensors. -
Reversible flattening with composite-index map: Flattening the
joint × coordinate × timetensor into a vector using a composite coordinate map enables full unflattening and semantic recovery. -
Flattening losing semantic structure: Flattening without preserving the coordinate map leads to unrecoverable semantics, converting structured pose data into an opaque vector.
-
Valid zero distinct from missing: A connectivity tensor where a zero indicates no detected connection is semantically different from a missing or unobserved entry, which must be masked or otherwise marked.
-
Repeated-axis tensor with domain-specific diagonal: A
source × target × frequencytensor where diagonal entries represent self-connection strength, a domain-specific quantity not defaulting to zero or one. -
Relation matrix is not automatically a graph: Thresholding the
entity × entityrelation matrix to form edges is an additional operation; the matrix itself lacks inherent graph semantics. -
Time-frequency matrix is a transform representation: Despite matrix shape, the
time × frequencymatrix represents a transform domain, not a descriptor or sample matrix.
Axis Permutation, Slicing, Stacking, and Alignment
| Operation | Structural Change | Semantic Condition | Information Preserved | Primary Failure Mode |
|---|---|---|---|---|
| Axis Permutation | Reordering logical axes | All axis identities, coordinates, and element mapping preserved | Full data with reordered indices | Losing axis labels or coordinate maps |
| Slice | Subsetting coordinates along axes | Coordinates explicitly declared and identified | Subset of original data | Ignoring coordinate semantics, positional slicing confusion |
| Stack | Adding new logical axis collecting compatible instances | New axis has meaningful coordinate | Data plus new axis | Arbitrary stacking without semantic basis |
| Concatenate | Extending existing axis by combining coordinate sets | Compatible axis semantics and coordinate union | Extended axis data | Mixing incompatible coordinate semantics |
| Inner Align | Intersection support of coordinates | Shared coordinates identified | Shared data subset | Loss of unique coordinates and data |
| Outer Align | Union of all coordinates with possible missing entries | Missingness semantics properly declared | Complete combined support | Missing data unhandled or misinterpreted |
Reshape, Flattening, Broadcasting, and Reduction Boundaries
| Operation | Values Copied/Combined? | Semantic Metadata Required | Information Risk |
|---|---|---|---|
| Reshape | Rearranged | Mapping between old and new axes | Losing axis identity or semantic mapping |
| Flatten | Merged axes | Composite coordinate map | Losing coordinate map causes semantic loss |
| Unflatten | Split composite axis | Composite coordinate map | Irrecoverable original axes without map |
| Insert Singleton Axis | Values reused | Axis identity and coordinate | Implies unsupported replication if misused |
| Squeeze | Axis removed | Axis identity | Removing meaningful axes changes semantics |
| Broadcast | Values replicated | Semantic compatibility | Fabricating unsupported data across axes |
| Reduce Axis | Combined (sum, mean, etc.) | Operation semantics | Discards distinctions; not information preserving |
Dense, Sparse, Masked, and Block-Structured Forms
| Form | Unstored/Masked Meaning | Structural Benefit | Scientific Caution |
|---|---|---|---|
| Dense | No unstored entries | Simple direct indexing | May obscure missing vs. zero vs. invalid data |
| Sparse-Zero | Unstored entries assumed zero | Efficient storage for zeros | Zero may not equal missing or no data |
| Sparse-Absence | Unstored means absence or missing | Efficient sparse data modeling | Must declare meaning to avoid ambiguity |
| Masked Dense | Mask marks invalid, missing, or padded entries | Separates value from validity | Misuse conflates zero and missing data |
| Padded | Extra entries filled to uniform size | Enables handling ragged data | Padding can distort statistics |
| Block-Structured | Subsets grouped as blocks with shared semantics | Exploits known structure | Reordering or combining blocks risks semantics |
| Ragged/Nonrectangular Boundary | Variable axis coordinate counts | Models irregular nested data | Cannot force into dense tensor without loss |
Repeated Axes, Symmetry, Directionality, and Diagonals
| Representation | Axis Roles | Structural Constraint | Diagonal Meaning | Graph Interpretation Boundary |
|---|---|---|---|---|
| Symmetric Relation Matrix | entity × entity | Declared symmetry | Self-relation or domain-specific | Not automatically a graph; edge mapping required |
| Directed Source × Target | source × target | Directional/asymmetric | Domain-specific self-meaning | Graph edges explicit; matrix not graph by default |
| Distance Matrix | entity × entity | Symmetric, zero diagonal | Zero by definition | Not necessarily a graph |
| Covariance/Correlation Matrix | entity × entity | Symmetric, positive semi-definite | Variance or correlation | Statistical relation, not graph edges |
| Adjacency-Like Matrix | entity × entity | Binary or weighted | Zero or undefined | Graph edges defined by nonzero entries |
| Source × Target × Frequency | source × target × frequency | Directional with frequency axis | Domain-specific self-meaning | Tensor extends beyond graph to frequency-resolved |
Semantic Compatibility, Round Trips, and Provenance
Matrix and Tensor Representation provenance comprises the comprehensive information required to reconstruct and scientifically interpret each multidimensional structure. This includes, when material:
- Representation definition and version.
- Tensor order and shape policy.
- Named axes and their canonical order.
- Axis roles and coordinate domains/IDs including ordering.
- Element semantics, units, and value types.
- Source/support mapping and transformations used to assemble axes.
- Stack, concatenation, and alignment policies.
- Reshape and flattening maps.
- Masks and missingness semantics.
- Sparse default semantics.
- Block structure and coordinate groupings.
- Repeated-axis role identities.
- Symmetry, directionality, and diagonal constraints.
- Fitted-space or latent representation identity if applicable.
- Distinction between logical axis order and physical storage/memory layout.
- Implementation details and version.
- Comparability rules, uncertainty, and sensitivity information.
A defensible matrix or tensor representation is defined by the semantics of its axes and their joint indexing, not by dimensionality or storage shape alone. Preserving this metadata enables scientific reproducibility, valid combination, and meaningful interpretation.