1 Definition

A linear combination is an expression obtained by multiplying given objects by scalars and then adding the results. The objects may be numbers, vectors, functions, matrices, or other elements of a structure in which addition and scalar multiplication are defined. The idea formalizes the process of building a new object from simpler ones using weighted addition.

1.1 General form

In its most common form, a linear combination of elements \(x_1, x_2, \dots, x_n\) is written as \[ a_1x_1 + a_2x_2 + \cdots + a_nx_n, \] where \(a_1, a_2, \dots, a_n\) are scalars. The number of terms can be finite, and in many settings it is essential that the combination use only finitely many nonzero coefficients.

1.2 Scalars and coefficients

The scalars are the numbers used as multipliers, while the coefficients are the specific scalar values attached to each term. In real vector spaces, the scalars are usually real numbers; in complex vector spaces, they are complex numbers. Coefficients determine how strongly each element contributes to the final result.

1.3 Relation to addition and scalar multiplication

Linear combinations rely on two basic operations: addition and scalar multiplication. Scalar multiplication changes the size or weight of an element, and addition combines the resulting terms. Because these operations define the structure of vector spaces and related algebraic systems, linear combinations appear wherever such structures are studied.

2 Examples

2.1 Linear combination of numbers

For numbers, a linear combination is a sum of multiples of those numbers. For example, \(2(3) - 5(1)\) is a linear combination of 3 and 1. Although this is a simple case, it illustrates the general pattern of weighting terms and adding them.

2.2 Linear combination of vectors

If \(v_1\) and \(v_2\) are vectors, then \(3v_1 - 2v_2\) is a linear combination of those vectors. In geometry, this can represent another vector in the same space, combining direction and magnitude from the original vectors.

2.3 Linear combination of functions

Functions can also be combined linearly. If \(f(x)\) and \(g(x)\) are functions, then \(af(x) + bg(x)\) is another function. Such expressions are common in differential equations, approximation theory, and Fourier analysis.

2.4 Linear combination of matrices

Matrices may be added after being multiplied by scalars, producing a matrix linear combination. For instance, \(2A - B\) is valid when \(A\) and \(B\) have the same dimensions. This operation is used in matrix algebra and in the study of linear transformations.

3 Properties

3.1 Closure under linear combination

In many algebraic settings, combining elements linearly keeps the result within the same structure. For vector spaces, any linear combination of vectors in the space is again a vector in that space. This closure property is a defining feature of linear structures.

3.2 Homogeneity

If all coefficients in a linear combination are multiplied by the same scalar, the entire expression is scaled by that factor. This homogeneity reflects the compatibility of linear combinations with scalar multiplication. It is one reason linear methods behave predictably under rescaling.

3.3 Associativity and distributivity

The rules of associativity and distributivity allow terms in a linear combination to be regrouped and expanded without changing the value. These laws make it possible to simplify expressions, compare coefficients, and perform algebraic manipulations systematically.

4 In vector spaces

4.1 Linear combinations in finite-dimensional spaces

In a finite-dimensional vector space, every vector can often be written as a linear combination of finitely many basis vectors. This provides a coordinate description of the vector and reduces geometric or abstract problems to algebraic ones. The choice of generating vectors strongly affects the efficiency of this representation.

4.2 Linear combinations in infinite-dimensional spaces

In infinite-dimensional spaces, such as spaces of functions, linear combinations are usually still finite when defining the algebraic structure. More elaborate expansions may involve infinite series, but these are treated separately from ordinary linear combinations. The finite-sum notion remains the basic building block.

4.3 Coordinate representation

Coordinates express a vector as the coefficients in a linear combination of basis vectors. Once a basis is fixed, the vector is identified with an ordered list of scalars. This viewpoint is central to computations in linear algebra.

5 Span and subspaces

5.1 Span of a set of vectors

The span of a set of vectors is the collection of all their linear combinations. It is the smallest set containing those vectors that is closed under addition and scalar multiplication. Span describes all possible outcomes reachable from the chosen generators.

5.2 Subspace generated by linear combinations

A subspace generated by a set of vectors consists of all linear combinations of those vectors. Because the result is closed under the vector space operations, it forms a vector subspace. This construction is fundamental in describing solution spaces and geometric planes or lines through the origin.

5.3 Minimal spanning sets

A minimal spanning set is a set of vectors that still spans the space after removing no vector without losing that property. Such sets are closely related to bases, since a basis is both spanning and linearly independent. Minimal spanning sets are useful for reducing redundancy.

6 Linear independence

6.1 Dependence as a nontrivial linear combination

Vectors are linearly dependent if some nontrivial linear combination of them equals zero. Nontrivial means that not all coefficients are zero. This condition shows that one vector can be expressed in terms of others.

6.2 Criteria for independence

A set is linearly independent when the only linear combination that gives zero is the trivial one with all coefficients equal to zero. Various algebraic tests help determine independence, including row reduction and determinant methods in finite dimensions. Independence indicates that no vector in the set is redundant.

6.3 Consequences for bases

A basis is a linearly independent spanning set. Because of independence, every vector in the space has a unique coordinate representation relative to the basis. This uniqueness makes bases indispensable in theory and computation.

7 Systems of linear equations

7.1 Linear combinations of equations

Linear combinations are used to combine equations in a system into new equations with the same solutions. By adding multiples of equations, one can eliminate variables or simplify the system. This method preserves consistency while making the system easier to solve.

7.2 Row operations and elimination

Row operations on augmented matrices are matrix versions of taking linear combinations of equations. They form the basis of Gaussian elimination and related methods. Through these operations, a system can be transformed into an equivalent but simpler form.

7.3 Linear combinations in matrix form

A system of linear equations can be written compactly as a matrix equation. The coefficients define rows or columns that interact through linear combinations with the unknown variables. This form connects equation solving with vector spaces and matrix theory.

8 Applications

8.1 Solving algebraic problems

Linear combinations simplify many algebraic tasks, including simplifying expressions, isolating variables, and comparing structures. They also help organize calculations by expressing complicated objects in terms of simpler components. This makes them a standard tool in algebra.

8.2 Geometry and parametric forms

In geometry, linear combinations describe points on lines, planes, and higher-dimensional affine objects when combined with appropriate reference points or vectors. Parametric equations often use linear combinations of direction vectors to represent shapes. This approach gives a clear geometric interpretation of algebraic formulas.

8.3 Signal representation

Signals can be expressed as linear combinations of basic waveforms or basis functions. This idea underlies many methods in engineering and applied mathematics, where complex signals are assembled from simpler components. It supports analysis, filtering, and data compression.

8.4 Approximation and interpolation

Linear combinations are used to approximate functions and data with simpler models. Interpolation methods combine known values or basis functions to construct intermediate results. In numerical work, this provides a practical way to estimate unknown quantities.

9.1 Basis

A basis is a set of vectors from which every vector in the space can be formed by a unique linear combination. It combines spanning power with linear independence. Bases provide the standard language for coordinates.

9.2 Span

Span is the set of all linear combinations of a given collection of elements. It measures what can be built from those elements using linear operations alone. Span is a central notion in describing subspaces.

9.3 Linear map

A linear map is a function that preserves linear combinations. That is, it respects both addition and scalar multiplication. Linear maps are the natural transformations between vector spaces.

9.4 Affine combination

An affine combination is similar to a linear combination, but its coefficients sum to 1. Such combinations describe points in affine geometry and are often used for positions rather than vectors. They differ from linear combinations by not requiring the origin as a reference.