Linear map¶

A function between vector spaces that preserves vector addition and scalar multiplication, equivalently preserving every finite linear combination.

Version: v2 · 2026-09-19 · History
Domain-specific #: 5342
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Linear Algebra, Vector Space Morphisms → Mathematics

Core Idea¶

A map T:V→W is linear when T(u+v)=T(u)+T(v) and T(av)=aT(v) for all vectors and scalars.^[n1] Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of linear algebra. It is structure-preserving morphism of vector spaces and its basis-independent kernel-image behavior. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the map preserves all linear combinations under the same scalar field fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the map preserves all linear combinations under the same scalar field. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the map preserves all linear combinations under the same scalar field, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Linear map, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

The Fair Arrow Machine

Imagine a machine that changes arrows. A Linear map is a fair machine: if you join two arrows tip to tail and then feed them in, you get the same result as feeding each arrow in alone and then joining what comes out. And if you make an arrow twice as long first, the result also comes out twice as long.

Add-and-Stretch Rule

Vectors are things you can add together and stretch by numbers, like arrows. A Linear map is a rule that turns vectors into other vectors while keeping those two operations working. Adding first and then mapping gives the same answer as mapping first and then adding. Stretching first and then mapping gives the same answer as mapping first and then stretching. Because of this, if you know what the map does to a few building-block arrows, you know what it does to every arrow.

Structure-Preserving Vector Map

A Linear map T from a vector space V to a vector space W satisfies T(u + v) = T(u) + T(v) and T(av) = aT(v) for all vectors u, v and scalars a. Together these mean T preserves every linear combination. As a result, T is completely determined by what it does to a basis of V, and once bases are chosen, T can be written as a matrix that acts by multiplication. The matrix depends on the bases, but the map itself doesn't. Some properties are basis-free, such as its kernel (the vectors sent to zero) and its image (everything it reaches). Something like f(x) = x + 1 is not linear in this sense, because it fails T(0) = 0.

A Linear map is a function T: V → W between vector spaces over the same field satisfying additivity, T(u + v) = T(u) + T(v), and homogeneity, T(av) = aT(v). Equivalently, it preserves all linear combinations, which makes it the structure-preserving morphism of vector spaces. Fixing a basis of V shows that T is determined by the images of the basis vectors. Fixing bases of both V and W gives a matrix representation in which applying T becomes matrix multiplication. The intrinsic content is basis-independent: kernel, image, and the relations between them, such as rank–nullity in finite dimensions. To check linearity, you must specify the spaces and the scalar field and verify both laws. Affine maps with a nonzero translation, and maps that respect only addition over a different field, are neighboring objects, not instances.

Structural Signature¶

Carrier: vector spaces over a common field, a function between them, vector addition, scalar multiplication, kernels, images, and optional bases or matrices
Inputs or antecedent state: the exact linear algebra carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Linear map
Constitutive operation: Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen.
Invariant: the map preserves all linear combinations under the same scalar field
Recognition test: type the carrier, state every parameter and convention in the definition, test that the map preserves all linear combinations under the same scalar field, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Linear map, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the map preserves all linear combinations under the same scalar field fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of linear algebra. The field contains many questions and methods that do not instantiate Linear map.
It is not its most familiar example. Multiplication by an m-by-n matrix defines a linear map from F^n to F^m. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Affine map. An affine map has form T(v)+b and preserves affine combinations; it is linear only when the offset b is zero.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Linear map must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside linear algebra, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Linear map belongs to linear algebra and is useful where the analyst can specify vector spaces over a common field, a function between them, vector addition, scalar multiplication, kernels, images, and optional bases or matrices, then evaluate the map preserves all linear combinations under the same scalar field. The scope is broad within that domain but bounded by the need for the map preserves all linear combinations under the same scalar field. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.^[1]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact linear algebra carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Linear map are converted, constrained, or organized by Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Linear map must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Linear map, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the map preserves all linear combinations under the same scalar field the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Linear map can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact linear algebra carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Linear map, the structure counts as Linear map exactly when the map preserves all linear combinations under the same scalar field.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Linear map. Linear map compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Linear map. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: vector spaces over a common field, a function between them, vector addition, scalar multiplication, kernels, images, and optional bases or matrices. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the map preserves all linear combinations under the same scalar field independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the map preserves all linear combinations under the same scalar field, infer recognizing and comparing instances of Linear map, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Linear map must control the decision and an object that resembles Linear map in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of linear algebra because they reuse vector spaces over a common field, a function between them, vector addition, scalar multiplication, kernels, images, and optional bases or matrices, Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen., and type the carrier, state every parameter and convention in the definition, test that the map preserves all linear combinations under the same scalar field, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from Multiplication by an m-by-n matrix defines a linear map from F^n to F^m. to A proof tests additivity and homogeneity, states the field and distinguishes affine translations whose nonzero offset breaks linearity..^[2]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Linear map, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

Multiplication by an m-by-n matrix defines a linear map from F^n to F^m. The example exposes the carrier and directly tests that the map preserves all linear combinations under the same scalar field; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is vector spaces over a common field, a function between them, vector addition, scalar multiplication, kernels, images, and optional bases or matrices; the operative rule is Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen.; the invariant is the map preserves all linear combinations under the same scalar field; and the result supports recognizing and comparing instances of Linear map, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[n1] Changing incidental notation or scale leaves the structure intact, while removing the map preserves all linear combinations under the same scalar field destroys the classification.

Mapped back: vector spaces over a common field, a function between them, vector addition, scalar multiplication, kernels, images, and optional bases or matrices → Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen. → the map preserves all linear combinations under the same scalar field → recognizing and comparing instances of Linear map, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

A proof tests additivity and homogeneity, states the field and distinguishes affine translations whose nonzero offset breaks linearity. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the map preserves all linear combinations under the same scalar field, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the map preserves all linear combinations under the same scalar field fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[1] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Linear map, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Linear map, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from linear algebra and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, Preservation of the two vector-space operations makes T determined by its values on a basis and representable by matrix multiplication after bases are chosen., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Linear map, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Linear map, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in linear algebra.

This entry is a kind of Linearity.

It is the canonical morphism preserving linear structure. It remains its own entry because it is the structure-preserving morphism of vector spaces, preserving addition and scalar multiplication, with basis-independent kernel and image behavior.

Relationships to Other Abstractions¶

Current abstraction Linear map Domain-specific

Parents (1) — outgoing typed relations

Linear map is a kind of Linearity Prime

It is the canonical morphism preserving linear structure.

Children (3) — abstractions linked here by typed relations

Discrete Chebyshev Transform Domain-specific is a kind of Linear map

A fixed-convention discrete Chebyshev transform is a linear map between finite nodal-value and polynomial-coefficient spaces.
Elasticity tensor Domain-specific is a kind of Linear map

A small-strain elasticity tensor is a linear map from symmetric strain to symmetric stress, with an elastic constitutive differentia.
Invariant Subspace Domain-specific presupposes Linear map

Invariant Subspace presupposes Linear map because invariance is defined by a specified linear operator mapping the subspace into itself.

Hierarchy path (1) — routes to 1 parentless root

Linear map → is a kind of Linearity

Neighborhood in Abstraction Space¶

Linear map sits in a crowded region of the domain-specific corpus (6^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Vector Spaces & Linear Structures (17 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25

Not to Be Confused With¶

Affine map. An affine map has form T(v)+b and preserves affine combinations; it is linear only when the offset b is zero.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Linear map. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Linear map. An extension qualifies only when its changed axioms and retained invariant are stated.

Notes¶

[n1] Source cited in the frozen article, 'terminology - What does 'linear' mean in Linear Algebra?'. ↩a ↩b

References¶

[1] Sheldon Jay Axler, 'Linear Algebra Done Right', [[Springer Science+Business Media, 2015. registry ↩a ↩b

[2] I. N Bronshtein, K. A Semendyayev, 'Handbook of Mathematics', Springer-Verlag, 2004. registry ↩