Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Linear Combinations



Definition
Geometric Interpretation
Span
Spanning Sets
Trivial and Non-Trivial Combinations
Linear Combinations and Systems of Equations
Toward Independence and Basis
Summary: Linear Combinations as the Unifying Construction



Building New Vectors from Old

Every operation in this section — addition, subtraction, scalar multiplication — is a special case of one unifying construction: the linear combination. Scale a collection of vectors by chosen coefficients, then add the results. The output is a single vector assembled from the pieces. This idea is deceptively simple, but it reaches into every corner of linear algebra. Asking which vectors can be built from a given set leads to the concept of span. Asking whether a set contains redundant vectors leads to linear independence. Asking whether a particular vector can be expressed as a combination of others turns out to be equivalent to solving a system of linear equations. The definitions introduced here are developed formally in the vector spaces section, but their computational foundation belongs here, grounded in the concrete algebra of Rn\mathbb{R}^n.



Definition

Given vectors v1,v2,…,vk\mathbf{v}_1, \mathbf{v}_2, \ldots, \mathbf{v}_k in Rn\mathbb{R}^n and scalars c1,c2,…,ckc_1, c_2, \ldots, c_k in R\mathbb{R}, the expression

c1v1+c2v2+⋯+ckvkc_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k


is a linear combination of those vectors. The scalars cic_i are called the coefficients or weights of the combination. Each term civic_i\mathbf{v}_i is a scaled copy of vi\mathbf{v}_i, and the full expression adds all the scaled copies together.

The definition imposes no restrictions on the coefficients — they can be positive, negative, or zero. Setting all coefficients to 11 reduces the linear combination to ordinary vector addition. Using a single vector with one coefficient gives scalar multiplication. Setting all coefficients to zero produces the zero vector. These familiar operations are not separate concepts; they are boundary cases of the same construction.

A linear combination always produces a vector in the same Rn\mathbb{R}^n as the inputs. Both scalar multiplication and addition preserve the dimension, so no matter how many vectors are combined or what coefficients are chosen, the result remains in the original space.

Geometric Interpretation

The geometric meaning of a linear combination depends on how many vectors are involved and how they relate to one another.

A single nonzero vector v\mathbf{v} generates all its scalar multiples: cvc\mathbf{v} for every real number cc. These fill a line through the origin in the direction of v\mathbf{v}. Moving cc from −∞-\infty to ∞\infty sweeps the entire line, passing through the origin at c=0c = 0.

Two vectors u\mathbf{u} and v\mathbf{v} that are not parallel generate all combinations c1u+c2vc_1\mathbf{u} + c_2\mathbf{v}. Varying both coefficients independently fills a plane through the origin — the plane that contains both u\mathbf{u} and v\mathbf{v}. In R2\mathbb{R}^2, two non-parallel vectors already span the entire space. In R3\mathbb{R}^3, they span a flat sheet passing through the origin, leaving one dimension unreached.

Three vectors in R3\mathbb{R}^3 that do not all lie in the same plane span the full space: every point in R3\mathbb{R}^3 is reachable as c1u+c2v+c3wc_1\mathbf{u} + c_2\mathbf{v} + c_3\mathbf{w} for some choice of coefficients. If the three vectors are coplanar, however, the third contributes nothing new — the span remains a plane rather than expanding to fill three dimensions.

The coefficients act as continuous dials. Adjusting one coefficient while holding the others fixed slides the result along the direction of the corresponding vector. Adjusting all of them simultaneously moves the result anywhere within the span.

Span

The span of a set of vectors is the collection of every vector that can be formed as a linear combination of the set. For vectors v1,v2,…,vk\mathbf{v}_1, \mathbf{v}_2, \ldots, \mathbf{v}_k:

span{v1,v2,…,vk}={c1v1+c2v2+⋯+ckvk∣ci∈R}\text{span}\{\mathbf{v}_1, \mathbf{v}_2, \ldots, \mathbf{v}_k\} = \{c_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k \mid c_i \in \mathbb{R}\}


The span is a subset of Rn\mathbb{R}^n that contains all vectors reachable through linear combinations — and no others. It always contains the zero vector, since setting every coefficient to zero produces 0\mathbf{0}.

The geometric shape of the span reflects the structure of the input vectors. A single nonzero vector spans a line. Two non-parallel vectors span a plane. In general, the span of kk vectors that are "sufficiently independent" is a kk-dimensional flat subspace passing through the origin. What "sufficiently independent" means precisely is the subject of linear independence, but the intuition is clear: each new vector expands the span by one dimension only if it points in a direction not already covered.

The span of the standard basis {e1,e2,…,en}\{\mathbf{e}_1, \mathbf{e}_2, \ldots, \mathbf{e}_n\} is all of Rn\mathbb{R}^n, since any vector (v1,v2,…,vn)(v_1, v_2, \ldots, v_n) equals v1e1+v2e2+⋯+vnenv_1\mathbf{e}_1 + v_2\mathbf{e}_2 + \cdots + v_n\mathbf{e}_n. The span of a proper subset of the standard basis is a coordinate subspace — a lower-dimensional slice of Rn\mathbb{R}^n aligned with the coordinate axes.

The formal theory of span, including its relationship to subspaces, is developed in the vector spaces section.

Spanning Sets

A set of vectors spans a space if every vector in that space belongs to the span of the set. Equivalently, the set spans Rn\mathbb{R}^n if for every vector b\mathbf{b} in Rn\mathbb{R}^n, there exist coefficients c1,c2,…,ckc_1, c_2, \ldots, c_k such that c1v1+c2v2+⋯+ckvk=bc_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k = \mathbf{b}.

The standard basis {e1,e2,…,en}\{\mathbf{e}_1, \mathbf{e}_2, \ldots, \mathbf{e}_n\} spans Rn\mathbb{R}^n with exactly nn vectors and no redundancy. But spanning sets need not be this efficient. The set {(1,0), (0,1), (1,1)}\{(1, 0),\ (0, 1),\ (1, 1)\} also spans R2\mathbb{R}^2, because any vector (a,b)(a, b) can be written as a(1,0)+b(0,1)+0(1,1)a(1, 0) + b(0, 1) + 0(1, 1). The third vector is unnecessary — it is already a linear combination of the first two — yet its presence does not prevent the set from spanning. A spanning set with redundant vectors is larger than it needs to be but still reaches every point in the space.

The question of which vectors in a spanning set are genuinely needed and which are superfluous is answered by the concept of linear independence. A spanning set with no redundancy is called a basis — the smallest possible spanning set for a given space. Both ideas are formalized in the vector spaces section.

Trivial and Non-Trivial Combinations

Among all possible linear combinations of a set of vectors, one always exists regardless of the vectors involved: the trivial combination. Setting every coefficient to zero gives:

0v1+0v2+⋯+0vk=00\mathbf{v}_1 + 0\mathbf{v}_2 + \cdots + 0\mathbf{v}_k = \mathbf{0}


This produces the zero vector for any choice of v1,…,vk\mathbf{v}_1, \ldots, \mathbf{v}_k. It is called trivial because it carries no information about the vectors themselves — it works automatically, without engaging with the actual components.

A non-trivial combination is one in which at least one coefficient is nonzero. The distinction between trivial and non-trivial combinations is the key to defining linear independence. A set of vectors is linearly independent if the only combination that produces 0\mathbf{0} is the trivial one — there is no way to combine the vectors with nonzero coefficients and arrive back at the origin. If a non-trivial combination does produce 0\mathbf{0}, then at least one vector in the set can be written as a linear combination of the others, revealing redundancy.

This characterization is developed formally in the linear independence section, but the computational meaning is accessible now: if the equation c1v1+⋯+ckvk=0c_1\mathbf{v}_1 + \cdots + c_k\mathbf{v}_k = \mathbf{0} has only the solution c1=c2=⋯=ck=0c_1 = c_2 = \cdots = c_k = 0, the vectors are independent. If it has other solutions, they are dependent.
Combination Coefficient pattern What it produces What it tells you about the vectors
Trivial every ci = 0 always the zero vector 0, regardless of the vi nothing — it exists for every set and reveals no structure
Non-trivial at least one ci ≠ 0 depends on the vectors and the specific coefficients chosen if a non-trivial combination produces 0, the vectors are linearly dependent — at least one is a combination of the others

Linear Combinations and Systems of Equations

The question "Is b\mathbf{b} a linear combination of v1,v2,…,vk\mathbf{v}_1, \mathbf{v}_2, \ldots, \mathbf{v}_k?" is an algebraic question about the existence of coefficients. Writing it out component by component produces a system of linear equations:

c1v1+c2v2+⋯+ckvk=bc_1\mathbf{v}_1 + c_2\mathbf{v}_2 + \cdots + c_k\mathbf{v}_k = \mathbf{b}


Arranging the vectors v1,…,vk\mathbf{v}_1, \ldots, \mathbf{v}_k as columns of a matrix AA and the coefficients as an unknown vector x\mathbf{x}, the equation becomes:

Ax=bA\mathbf{x} = \mathbf{b}


The linear combination question and the system-of-equations question are identical — they are two descriptions of the same problem. The combination exists if and only if the system has a solution. Solving the system finds the coefficients; the coefficients reconstruct the combination.

This connection transforms a geometric question (does b\mathbf{b} lie in the span of the columns?) into a computational one (does the augmented matrix [A∣b][A \mid \mathbf{b}] reduce to a consistent system?). The tools for answering the computational question — row reduction, echelon forms, pivot analysis — belong to the linear systems section, but the conceptual link originates here, in the definition of a linear combination.

Toward Independence and Basis

Linear combinations open two questions that this page has raised but not resolved. The first: given a set of vectors, can any of them be removed without shrinking the span? A vector that is a linear combination of the others in the set contributes nothing new — every point it helps reach is already reachable without it. A set where no vector is redundant in this sense is called linearly independent. Independence is a property of the set as a whole, not of any individual vector, and it is characterized by the trivial-combination criterion: the only way to combine the vectors into 0\mathbf{0} is with all-zero coefficients.

The second question: what is the smallest set of vectors whose span equals the entire space? Such a set must span Rn\mathbb{R}^n (reaching every vector) and be linearly independent (containing no excess). A set with both properties is a basis for Rn\mathbb{R}^n, and every basis of Rn\mathbb{R}^n contains exactly nn vectors — a fact that defines the dimension of the space.

Both concepts — linear independence and basis — are developed rigorously in the vector spaces section. The machinery of linear combinations built on this page provides the raw material from which those definitions are constructed.

Summary: Linear Combinations as the Unifying Construction

Every operation introduced earlier in the section can be written as a linear combination with a particular pattern of coefficients. Scalar multiplication is a one-vector combination; ordinary addition is a two-vector combination with both coefficients equal to 1; the trivial combination uses all-zero coefficients. The table below recovers each familiar operation as a special case of the general formula c₁v₁ + ⋯ + cₖvₖ — showing that the construction on this page is not a new tool, but a unifying lens through which every operation earlier in the section can be viewed.
Operation Written as a linear combination Coefficient pattern # vectors k
Scalar multiplication cv cv a single coefficient c 1
Vector addition u + v 1·u + 1·v both coefficients equal to 1 2
Vector subtraction u − v 1·u + (−1)·v coefficients 1 and −1 2
Trivial combination 0·v₁ + 0·v₂ + ⋯ + 0·vₖ every coefficient zero — always produces 0 any
General linear combination c₁v₁ + c₂v₂ + ⋯ + cₖvₖ arbitrary scalars c₁, …, cₖ any