✦ScienexySCIENCE KNOWLEDGE LIBRARY
reference · SCI-MAT-004-011

Linear Combinations

A linear combination is an expression formed by multiplying vectors by scalars and adding the resulting vectors. Linear combinations are fundamental to linear algebra because they describe how vectors can be constructed from other vectors and provide the foundation for span, linear independence, bases, dimension, and matrix representations. A comprehensive introduction to linear combinations, explaining scalar coefficients, vector addition, span, geometric interpretations, matrix representation, and the role of linear combinations in generating vector spaces.

  • v = c₁v₁ + c₂v₂ + ⋯ + cₖvₖ: General linear combination.

  • span{v₁, …, vₖ} = {c₁v₁ + ⋯ + cₖvₖ : cᵢ ∈ F}: Span of a collection of vectors.

  • Ac = b: Matrix equation representing a linear combination of the columns of A.

  • v = c₁e₁ + c₂e₂ + ⋯ + cₙeₙ: Representation of a vector using basis vectors.

  • c₁v₁ + c₂v₂ + ⋯ + cₖvₖ = 0: Linear relation among vectors.

  • c₁ = c₂ = ⋯ = cₖ = 0: Trivial solution to a homogeneous coefficient equation.

  • v = (v₁, v₂, …, vₙ): Component representation of a vector.

  • v = c₁v₁ + c₂v₂ + ... + cₖvₖ

  • v = Σᵢ₌₁ᵏ cᵢvᵢ

  • Span{v₁, v₂, ..., vₖ} = {c₁v₁ + c₂v₂ + ... + cₖvₖ : cᵢ ∈ F}

  • A c = b

  • dim(Span{v₁, ..., vₖ}) ≤ k

  • v = c₁e₁ + c₂e₂ + ... + cₙeₙ (basis representation)

Explanation

A linear combination is one of the central operations in linear algebra. Given vectors v₁, v₂, …, vₖ in a vector space over a field F, a linear combination is an expression of the form c₁v₁ + c₂v₂ + ⋯ + cₖvₖ, where c₁, c₂, …, cₖ are scalars from F. The scalars are called coefficients. The resulting vector belongs to the same vector space because vector spaces are closed under scalar multiplication and vector addition. Linear combinations allow vectors to be constructed from other vectors. For example, in R², the vector (5, 1) can be expressed as 2(1, 0) + 1(3, 1), or as 5(1, 0) + 1(0, 1). The same vector may have different representations using different collections of vectors. The set of all possible linear combinations of a collection of vectors is called their span. If the span of a collection equals the entire vector space, the collection spans that space. If one vector can be expressed as a linear combination of the others, the collection is linearly dependent. If the only linear combination that produces the zero vector has all coefficients equal to zero, the collection is linearly independent. These concepts are closely connected. A spanning set provides enough vectors to construct every vector in a space, while linear independence ensures that the chosen vectors do not contain unnecessary redundancy. A basis is a collection that satisfies both conditions. Linear combinations also provide a direct connection to matrix multiplication. If the vectors are placed as columns of a matrix A and the coefficients are placed in a vector c, then the resulting linear combination is Ac. Therefore, determining whether a vector b can be expressed as a linear combination of given vectors is equivalent to asking whether the system Ac = b has a solution. This connection allows linear combinations to be studied using matrix equations and row reduction. Linear combinations are also used to describe polynomial expressions, functions, geometric constructions, physical quantities, and data representations. In more advanced mathematics, they provide the foundation for concepts such as vector subspaces, coordinate systems, basis expansions, and approximation methods.

A linear combination is an expression formed by multiplying a collection of vectors by scalar coefficients and adding the resulting vectors. If v₁, v₂, ..., vₖ are vectors in a vector space and c₁, c₂, ..., cₖ are scalars from its scalar field, then c₁v₁ + c₂v₂ + ... + cₖvₖ is a linear combination of those vectors. Linear combinations are fundamental because they describe how vectors can be constructed from other vectors. The set of all possible linear combinations of a given collection of vectors is called their span. The span is always a subspace of the original vector space. In ℝ², one nonzero vector spans a line through the origin, while two linearly independent vectors span the entire plane. In ℝ³, one nonzero vector spans a line, two independent vectors span a plane through the origin, and three independent vectors span the entire space. If the vectors are dependent, some may be redundant and the span may have a smaller dimension than the number of listed vectors. Linear combinations also provide the foundation for expressing vectors in terms of a basis, solving linear systems, understanding matrix columns, and studying linear transformations.

Variables

  • v: Resulting vector formed by a linear combination.

  • v₁, v₂, …, vₖ: Given vectors.

  • c₁, c₂, …, cₖ: Scalar coefficients.

  • F: Underlying scalar field, commonly R or C.

  • A: Matrix whose columns are the given vectors.

  • c: Column vector of coefficients.

  • b: Target vector to be represented.

  • span(S): Set of all linear combinations of vectors in S.

  • 0: Zero vector of the relevant vector space.

  • k: Number of vectors in the collection.

  • v: the resulting vector or target vector.

  • v₁, v₂, ..., vₖ: the given vectors used to construct a linear combination.

  • c₁, c₂, ..., cₖ: scalar coefficients.

  • k: the number of vectors in the given collection.

  • F: the scalar field, commonly ℝ or ℂ.

  • Σ: summation notation.

  • A: a matrix whose columns are the given vectors.

  • c: a column vector of scalar coefficients.

  • b: a target vector to be expressed as a linear combination.

  • e₁, e₂, ..., eₙ: basis vectors.

Example or application

Let v₁ = (1, 0) and v₂ = (0, 1). Choose scalars c₁ = 3 and c₂ = 4. Their linear combination is 3v₁ + 4v₂ = 3(1, 0) + 4(0, 1) = (3, 0) + (0, 4) = (3, 4). Therefore, (3, 4) is a linear combination of v₁ and v₂. In fact, every vector (x, y) in R² can be expressed as x(1, 0) + y(0, 1), so these two vectors span R².

Let v₁ = (1, 0) and v₂ = (0, 1) in ℝ². Choose coefficients c₁ = 3 and c₂ = −2. Their linear combination is 3v₁ − 2v₂ = 3(1, 0) − 2(0, 1) = (3, −2). Since every vector (x, y) in ℝ² can be written as x(1, 0) + y(0, 1), these two standard basis vectors span ℝ². In contrast, consider v₁ = (1, 2) and v₂ = (2, 4). Every linear combination of these vectors lies on the line y = 2x because v₂ = 2v₁. Therefore, their span is only a line through the origin, not the entire plane.

Definition

A linear combination of vectors v₁, v₂, …, vₖ is any vector that can be expressed as c₁v₁ + c₂v₂ + ⋯ + cₖvₖ, where each cᵢ is a scalar from the underlying field.

A linear combination of vectors v₁, v₂, ..., vₖ is any vector that can be written as c₁v₁ + c₂v₂ + ... + cₖvₖ, where c₁, c₂, ..., cₖ are scalars belonging to the scalar field of the vector space.

Purpose

The purpose of studying linear combinations is to understand how vectors can be constructed from other vectors using scalar multiplication and addition. This concept allows learners to determine whether a collection of vectors can generate a particular vector or an entire vector space. It also provides the foundation for understanding span, independence, basis, dimension, and matrix equations.

Linear combinations describe how vectors can be built from other vectors through scalar multiplication and addition. They provide a precise way to determine whether a target vector belongs to the span of a given collection. They also establish the mathematical foundation for bases, vector-space generation, matrix multiplication, and solving systems of linear equations.

Importance

Linear combinations are important because almost every major topic in linear algebra depends on them. They explain how vectors are generated, how bases represent spaces, how matrix columns combine to produce solutions, and how transformations act on linear combinations. They are also central to scientific modeling, data representation, coordinate systems, approximation methods, and computational algorithms. Understanding linear combinations makes it easier to understand why some vector collections are redundant and why others provide a minimal representation of a space.

Linear combinations are central to nearly every major concept in linear algebra. They define the span of a set of vectors and help determine whether vectors generate a particular space. They are also essential for understanding linear independence, dependence, and basis representations. Matrix multiplication can be interpreted as forming linear combinations of a matrix's columns. This connection allows systems of equations to be studied as questions about whether a target vector can be generated from specified column vectors. Linear combinations also appear in approximation, data representation, mechanics, computer graphics, and scientific modeling.

Learning Objectives

  • Define a linear combination of vectors.

  • Identify the scalar coefficients and vectors in a linear combination.

  • Calculate linear combinations using component-wise vector operations.

  • Determine whether a given vector can be formed from a collection of vectors.

  • Explain the meaning of the span of a collection of vectors.

  • Connect linear combinations with matrix multiplication.

  • Understand how linear combinations lead to linear independence and dependence.

  • Explain the relationship between spanning sets and bases.

  • Represent vectors using standard and nonstandard basis vectors.

  • Apply linear combinations to mathematical and practical problems.

  • Construct linear combinations in two- and three-dimensional spaces.

  • Explain the meaning of the span of a set of vectors.

  • Determine whether a given vector belongs to the span of other vectors.

  • Interpret linear combinations geometrically.

  • Express a vector using standard basis vectors.

  • Represent linear combinations using matrix multiplication.

  • Explain the relationship between linear combinations and systems of equations.

  • Recognize how linear combinations relate to linear independence and bases.

  • Identify practical applications of linear combinations.

Key Concepts

  • Linear combination: A sum of scalar multiples of given vectors.

  • Coefficient: A scalar that multiplies a vector in a linear combination.

  • Generating set: A collection of vectors whose linear combinations produce a specified space.

  • Span: The set of all possible linear combinations of a collection of vectors.

  • Spanning set: A collection whose span equals the entire vector space under consideration.

  • Trivial linear combination: A combination in which every coefficient is zero.

  • Nontrivial linear combination: A combination in which at least one coefficient is nonzero.

  • Linear relation: An equation expressing a linear combination of vectors as the zero vector.

  • Linear independence: The property that the zero vector has only the trivial representation as a linear combination of the given vectors.

  • Linear dependence: The property that a nontrivial linear combination of the given vectors equals zero.

  • Basis: A linearly independent spanning set.

  • Coordinate representation: The coefficients used to express a vector relative to a specified basis.

  • Column combination: A matrix-vector product interpreted as a linear combination of matrix columns.

  • Term

    Linear combination

    Explanation

    A vector formed by multiplying given vectors by scalar coefficients and adding the results.

  • Term

    Scalar coefficient

    Explanation

    A number from the scalar field that determines how much of a particular vector contributes to a linear combination.

  • Term

    Span

    Explanation

    The set of all possible linear combinations of a given set of vectors. It forms a subspace.

  • Term

    Generating set

    Explanation

    A collection of vectors whose linear combinations produce every vector in the space or subspace being considered.

  • Term

    Target vector

    Explanation

    The vector one wants to express as a linear combination of a given set of vectors.

  • Term

    Basis representation

    Explanation

    The unique expression of a vector as a linear combination of the vectors in a chosen basis.

  • Term

    Column space

    Explanation

    The span of the columns of a matrix. It contains all vectors that can be produced by multiplying the matrix by an appropriate coefficient vector.

  • Term

    Coefficient vector

    Explanation

    A vector containing the scalar coefficients used to combine the columns of a matrix.

  • Term

    Redundant vector

    Explanation

    A vector that can already be expressed as a linear combination of other vectors in the same collection.

  • Term

    Vector generation

    Explanation

    The process of constructing vectors in a space from a specified collection of vectors using linear combinations.

Working Principle

A linear combination is created by multiplying each selected vector by a scalar and adding the resulting vectors. The coefficients control the contribution of each vector. Because a vector space is closed under scalar multiplication and addition, the result remains inside the same space. When the vectors are arranged as the columns of a matrix, the coefficients form a column vector and the linear combination becomes a matrix-vector product. The set of all possible coefficient choices generates the span. If every target vector in a space can be obtained, the given vectors span that space. If different coefficient choices produce the same vector because of a nontrivial linear relation, the collection is dependent.

A linear combination uses scalar multiplication to adjust individual vectors and vector addition to combine them. The coefficients control the contribution of each vector. Allowing all possible scalar coefficients produces the span of the given vectors. In matrix form, the vectors can be arranged as columns of a matrix A, and the coefficients can be placed in a column vector c. The product Ac is exactly the corresponding linear combination of the columns of A. Therefore, determining whether a target vector b is a linear combination of those columns is equivalent to determining whether the system Ac = b has a solution. The number of independent directions among the vectors determines the dimension of their span.

Process

To calculate a linear combination, first identify the given vectors and their scalar coefficients. Confirm that all vectors belong to the same vector space and have compatible dimensions. Multiply each vector by its corresponding scalar. Add the resulting vectors component by component. If the task asks whether a target vector can be represented, assign unknown coefficients and form an equation. Place the given vectors as columns of a matrix and solve Ac = b. If a solution exists, the target vector belongs to the span; if no solution exists, it does not. For a collection of vectors, solve the corresponding homogeneous equation to investigate linear independence.

To form a linear combination, identify the given vectors and their scalar coefficients. Multiply each vector by its corresponding coefficient, then add the resulting vectors component by component. To test whether a target vector belongs to the span, arrange the given vectors as columns of a matrix and place the target vector on the right-hand side of a linear system. Solve the system using elimination or row reduction. If at least one solution exists, the target vector belongs to the span. If no solution exists, it does not. To determine the dimension of the span, identify the number of linearly independent vectors in the collection. When working with a basis, express the target vector in terms of basis vectors; the coefficients are its coordinates relative to that basis.

Applications

  • Expressing vectors in terms of standard or alternative basis vectors.

  • Representing physical forces as combinations of component directions.

  • Combining data features in mathematical and statistical models.

  • Constructing polynomial functions from simpler basis polynomials.

  • Representing signals using combinations of simpler functions.

  • Solving systems of linear equations through matrix-column combinations.

  • Describing geometric positions and directions.

  • Understanding basis expansions in quantum mechanics.

  • Building numerical approximations using selected basis functions.

  • Studying the structure and dimension of vector spaces.

  • Matrix multiplication constructs outputs as linear combinations of matrix columns.

  • Systems of linear equations can be interpreted as finding coefficients that express a target vector using given vectors.

  • Computer graphics combines basis directions to represent positions and transformations.

  • Physics uses linear combinations to resolve forces and velocities into components.

  • Engineering uses linear combinations to model combined signals, forces, and system responses.

  • Data science represents observations as combinations of feature directions and basis vectors.

  • Signal processing represents signals as combinations of simpler component signals.

  • Numerical analysis uses linear combinations to approximate functions and solutions.

  • Quantum mechanics expresses states as combinations of basis states in complex vector spaces.

Worked Example

Problem: Determine whether b = (7, 5) can be expressed as a linear combination of v₁ = (1, 1) and v₂ = (2, −1). Step 1: Assume b = c₁v₁ + c₂v₂. Step 2: Substitute the vectors: (7, 5) = c₁(1, 1) + c₂(2, −1). Step 3: Equate corresponding components to obtain c₁ + 2c₂ = 7 and c₁ − c₂ = 5. Step 4: Subtract the second equation from the first: 3c₂ = 2, so c₂ = 2/3. Step 5: Substitute into c₁ − c₂ = 5: c₁ = 5 + 2/3 = 17/3. Step 6: Verify: (17/3)(1, 1) + (2/3)(2, −1) = (17/3, 17/3) + (4/3, −2/3) = (21/3, 15/3) = (7, 5). Therefore, b is a linear combination of v₁ and v₂, with coefficients c₁ = 17/3 and c₂ = 2/3.

Problem: Determine whether b = (5, 1) can be expressed as a linear combination of v₁ = (1, 1) and v₂ = (2, −1). Solution: 1. Assume b = c₁v₁ + c₂v₂. 2. Substitute the vectors: (5, 1) = c₁(1, 1) + c₂(2, −1). 3. Equate corresponding components: c₁ + 2c₂ = 5 and c₁ − c₂ = 1. 4. Subtract the second equation from the first: 3c₂ = 4, so c₂ = 4/3. 5. Substitute into c₁ − c₂ = 1: c₁ = 7/3. 6. Therefore, b = (7/3)v₁ + (4/3)v₂. Verification: (7/3, 7/3) + (8/3, −4/3) = (15/3, 3/3) = (5, 1). Final result: b belongs to Span{v₁, v₂}. The coefficients are c₁ = 7/3 and c₂ = 4/3.

Common Misconceptions

  • A linear combination can only use positive coefficients. Coefficients may be positive, negative, zero, real, or complex, depending on the underlying field.

  • Every combination of vectors is a linear combination. A linear combination specifically uses scalar multiplication followed by vector addition.

  • A vector can have only one linear-combination representation. A vector may have multiple representations when the chosen vectors are linearly dependent.

  • The span of a set is always the entire vector space. A collection may span only a line, plane, or smaller subspace.

  • A linear combination changes the underlying vector space. The result remains in the same vector space when its operations are valid.

  • The coefficients in a linear combination are always the vector components. They are coordinates only relative to a specified basis.

  • A collection that spans a space must be linearly independent. A spanning set may contain redundant vectors.

  • A zero coefficient means the corresponding vector is invalid. A zero coefficient simply means that vector contributes nothing to that particular combination.

  • A linear combination requires scalar multiplication followed by addition; arbitrary multiplication between vectors is not part of the definition.

  • The coefficients may be positive, negative, or zero, depending on the scalar field.

  • A vector with a zero coefficient contributes nothing to the linear combination.

  • The span of a set is not necessarily the entire vector space; it may be a line, plane, or smaller subspace.

  • A collection containing several vectors does not automatically span a space of the same dimension.

  • If vectors are linearly dependent, some may be redundant, but their span can still be useful.

  • A vector belongs to a span if at least one valid set of coefficients produces it; the coefficients need not always be unique.

  • When the given vectors form a basis, the coefficients representing a vector are unique.

  • The zero vector is always in the span of any collection of vectors because all coefficients can be chosen as zero.

  • Matrix multiplication by a coefficient vector forms a linear combination of the matrix's columns, not its rows.

Practice Questions

  • Define a linear combination and explain the role of scalar coefficients.

  • Calculate 2(1, 3) − 3(2, 1).

  • Express the vector (5, 7) as a linear combination of (1, 0) and (0, 1).

  • What is the span of a collection of vectors?

  • Determine whether (4, 1) is a linear combination of (1, 1) and (1, −1).

  • Explain how a linear combination can be represented using matrix multiplication.

  • What is the difference between a spanning set and a basis?

  • Can a vector have more than one representation as a linear combination? Explain.

  • Determine whether the vector (3, 6) belongs to the span of {(1, 2)}.

  • Explain how linear combinations lead to the concepts of linear independence and dependence.

  • Give two applications of linear combinations in science or engineering.

  • Question

    Define a linear combination of vectors.

    Answer

    It is an expression of the form c₁v₁ + c₂v₂ + ... + cₖvₖ, where the cᵢ are scalars and the vᵢ are vectors.

  • Question

    Calculate 2(1, 3) − 3(2, 1).

    Answer

    The result is (2, 6) − (6, 3) = (−4, 3).

  • Question

    What is the span of a set of vectors?

    Answer

    It is the set of all possible linear combinations of those vectors.

  • Question

    Do the vectors (1, 0) and (0, 1) span ℝ²?

    Answer

    Yes. Every vector (x, y) can be expressed as x(1, 0) + y(0, 1).

  • Question

    What is the span of the vectors (1, 2) and (2, 4) in ℝ²?

    Answer

    They span the line through the origin in the direction (1, 2), because the second vector is twice the first.

  • Question

    How can a linear combination be represented using matrix multiplication?

    Answer

    Arrange the given vectors as columns of a matrix A and the coefficients as a vector c. The product Ac gives the linear combination.

  • Question

    Is the zero vector always in the span of a collection of vectors?

    Answer

    Yes. Choosing every coefficient equal to zero produces the zero vector.

  • Question

    If three vectors in ℝ² are given, can they be linearly independent?

    Answer

    No. Any collection of more than two vectors in the two-dimensional space ℝ² must be linearly dependent.

  • Question

    Determine whether (4, 5) belongs to the span of (1, 0) and (0, 1).

    Answer

    Yes. (4, 5) = 4(1, 0) + 5(0, 1).

  • Question

    Why is a basis representation unique?

    Answer

    Because the basis vectors are linearly independent, no nonzero combination of them can produce the zero vector. Therefore, a vector cannot have two different coefficient representations in the same basis.

Key Takeaway

A linear combination builds new vectors by multiplying existing vectors by scalars and adding the results. This simple operation is the foundation of span, basis, linear independence, dimension, and matrix representations. Understanding it is essential for determining what a collection of vectors can generate.

A linear combination constructs a vector by multiplying given vectors by scalar coefficients and adding the results. The span of a collection contains every vector that can be constructed in this way. Linear combinations connect vector operations with matrix multiplication, systems of equations, bases, and linear independence, making them one of the central building blocks of linear algebra.

Prerequisites

  • Understanding of scalars and vectors.

  • Basic vector addition and scalar multiplication.

  • Familiarity with coordinate representation.

  • Basic algebraic equations and solving for unknowns.

  • Understanding of matrix notation is helpful.

  • Knowledge of vector addition and scalar multiplication.

  • Familiarity with coordinate and column-vector notation.

  • Basic matrix multiplication.

  • Understanding of linear equations and systems.

Reference

  • Gilbert Strang, Introduction to Linear Algebra, Wellesley-Cambridge Press.

  • David C. Lay, Steven R. Lay, and Judi J. McDonald, Linear Algebra and Its Applications, Pearson.

  • Sheldon Axler, Linear Algebra Done Right, Springer.

  • Howard Anton and Chris Rorres, Elementary Linear Algebra: Applications Version, Wiley.

  • Strang, Gilbert. Introduction to Linear Algebra. Wellesley-Cambridge Press.

  • Lay, David C., Steven R. Lay, and Judi J. McDonald. Linear Algebra and Its Applications. Pearson.

  • Axler, Sheldon. Linear Algebra Done Right. Springer.

  • MIT OpenCourseWare. Linear Algebra, course materials by Gilbert Strang.

Related Topics

  • Scalars, Vectors and Matrices

  • Dimensions and Mathematical Spaces

  • Linear Independence and Dependence

  • Geometric Interpretation of Linear Algebra

  • Algebraic and Geometric Approaches to Linear Problems

  • Systems of Linear Equations

  • Coordinate Systems and Vector Representation

  • Linear Equations and Linear Relationships

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Linear Algebra