Artin-Tate lemma Created 2026-09-28 Updated 2026-11-05
Let be commutative rings. If is Noetherian, is a finitely generated algebra over , and is a finitely generated module over , then is a finitely generated algebra over .[ref]
Choose algebra generators for over and module generators for over . Express every as a -linear combination of the . Let be the -subalgebra generated by the finitely many coefficients in these expressions. The -module contains one and is stable under multiplication by every , so . Thus is finite as a -module.
The Hilbert basis theorem makes Noetherian. Hence its submodule is finitely generated over . Combining those module generators with the finite algebra generators of gives finitely many algebra generators for over .
Baker's theorem Created 2026-10-14 Updated 2026-11-05
If chosen logarithms of algebraic numbers are linearly independent over , then they, together with one, are linearly independent over . More generally a nonzero homogeneous linear combination with algebraic coefficients is transcendental. Quantitative lower bounds for integer coefficients are a separate, effective aspect of logarithmic-form theory.
Basis Created 2026-09-24 Updated 2026-10-14
A basis is a linearly independent spanning set of vectors in a vector space. Every vector is a unique finite linear combination of basis vectors. Independence supplies uniqueness, and spanning supplies existence. An ordered basis turns the coefficients into a coordinate vector.
For , the matrix with these vectors as columns is
Hence the coordinate vector of is , and recovers the usual coordinates. The determinant is nonzero, so this recovery works for every vector in . A basis need not have perpendicular or unit-length vectors; an orthonormal basis adds those geometric conveniences when an inner product is available.
The point of changing basis is to simplify the operation being studied. Diagonalization uses an eigenbasis to turn a coupled linear map into independent scalings. In a space of polynomials, the basis makes differentiation easy to encode, while orthogonal polynomials can make approximation errors easier to measure. Gilbert Strang's MIT lecture on independence, basis and dimension develops this connection between attainable columns, redundant columns and coordinates.[ref]
Bézout's identity 2026-10-13
For integers not both zero, there are integers such that . The extended Euclidean algorithm constructs them. For example, and ; the second identity also gives the modular inverse of modulo .
The identity converts a greatest common divisor into a solvability certificate. The linear Diophantine equation is solvable in integers precisely when divides . Every common divisor divides any integer linear combination; conversely, multiplying a Bézout identity by constructs a solution when that quotient is integral. The coefficients generally are not unique, as the description of all solutions of a linear Diophantine equation makes explicit.
Brauer induction Created 2026-10-14 Updated 2026-11-05
Every complex character of a representation of a finite group is an integer linear combination of characters of induced representations from one-dimensional group representations of subgroups . Negative coefficients are allowed. Unlike Artin induction, the subgroups need not be cyclic groups. Applied to an Artin L-function, compatibility with induced representations turns this character identity into a product of one-dimensional Artin L-functions with integer exponents, reducing the behavior at to abelian extensions.
For a nonzero vector space with an infinite field or infinite basis, cardinality is the displayed maximum, since vectors are finite linear combinations of basis vectors. Over a finite field, infinite underlying size forces infinite dimension. Over a countably infinite field, every positive finite dimension is already countably infinite. The theory of infinite underlying spaces is therefore categorical in every infinite cardinal for a finite field, but only in uncountable cardinals for a countably infinite field.
Cauchy mean value theorem Created 2026-10-07 Updated 2026-10-25
For and real-valued functions that are continuous on the closed interval and differentiable on the open interval , there exists with
Apply Rolle's theorem to the linear combination , which has equal endpoint values. The displayed product identity permits zero derivatives. For the ratio form, additionally assume for every . Then Rolle's theorem ensures , so both denominators below are nonzero:
Neither derivative needs to be continuous, and may vanish. Choosing recovers the mean value theorem; the ratio form also gives the zero-over-zero endpoint case of L'Hôpital's rule. [ref]
Centralizer of a subalgebra Created 2026-10-05 Updated 2026-11-05
For a subalgebra of an associative algebra , its centralizer is
It is a subalgebra of . When is a group algebra and is the group algebra of a subgroup , its elements are exactly the linear combinations with coefficients constant on the conjugation orbits of .
Characteristic polynomial of a linear recurrence Created 2026-10-20 Updated 2026-11-05
For the constant-coefficient homogeneous linear recurrence relation , its characteristic polynomial is
A nonzero root gives the solution . Over a field of characteristic zero, a root of multiplicity contributes when . The Fibonacci sequence has , whose roots give its familiar closed formula.
Equivalently, annihilates the shift on every solution. Reducing modulo therefore expresses the distant term as a linear combination of . Repeated squaring in the polynomial quotient ring gives this combination using logarithmically many multiplications in .
Chebyshev system 2026-10-14
A Chebyshev system on a nondegenerate real interval is a family of real continuous functions such that every linear combination with coefficients not all zero has at most distinct zeros. The condition entails linear independence and unique interpolation at any distinct points. It is a zero-counting hypothesis, not a requirement to count multiplicities.
Closed linear span 2026-10-14
In a normed vector space, the closed linear span of is the closure of its linear span in the norm topology. It includes limits of finite linear combinations. In a Hilbert space, an infinite orthonormal basis spans in this closed sense, allowing norm-convergent series in addition to finite sums.
Coefficient Created 2026-10-06 Updated 2026-10-14
A scalar multiplying a specified term in a linear combination, polynomial or power series. When the term family has linear independence, the coefficients are unique; uniqueness of finite Laurent polynomial coefficients follows after multiplying by a sufficiently large power to obtain an ordinary polynomial.
For , the three point evaluation functionals at form a basis of the dual space of real polynomials of degree at most two. The displayed recovery formulas express the coordinate functionals, hence the dual basis to , as linear combinations of these evaluations. More generally distinct-node polynomial interpolation identifies values with coefficient data through an invertible Vandermonde matrix.
Conjugate direction 2026-10-31
Nonzero vectors are conjugate directions with respect to a symmetric positive-definite matrix when they are pairwise orthogonal in the inner product . They need not be orthogonal in the ordinary Euclidean inner product. They are linearly independent: multiplying a vanishing linear combination by isolates its th coefficient times .
Conjugation averaging on a compact group Created 2026-10-14 Updated 2026-11-05
Normalized Haar measure makes this averaging a norm-one projection onto continuous class functions. Averaging a trace coefficient replaces its coefficient endomorphism by . On an irreducible summand this average is by Schur lemma. It follows that averaging finite-dimensional matrix coefficients yields finite linear combinations of irreducible characters. Together with the Peter-Weyl theorem, this proves uniform density of those characters among continuous class functions.
Contrast (statistics) Created 2026-10-14 Updated 2026-11-05
A contrast is a linear combination of group means with . It compares responses without depending on a common additive level. Treatment contrasts and factorial contrasts specify comparisons in a design of experiments.
Controllability 2026-10-13
Controllability asks whether the available control inputs can move a dynamical system between every pair of states in its declared state space. Fixing a duration gives the precise condition for every , where is the state space and its reachable set. With freely chosen duration, every pair must instead be connectable in some permitted finite time, which may depend on the pair. Always specify admissible control inputs, deadlines and any constraints along the path. [ref]
The surprising part is that one control input can control several state variables by acting at different times. For the double integrator, acceleration changes velocity directly, while the accumulated velocity changes position. Starting from rest, accelerate during the first half of the journey and brake during the second: the final velocity can vanish although the final position has changed. The figure is an analytic mathematical example in dimensionless quantities, with no experimental measurements.
Figure 1.
Timing one control input controls both position and velocity
. The double integrator starts at and runs to . Left: for one time unit, then for one time unit. Middle: the analytic state path ends at , after reaching when braking begins. Right: unit inputs on the first and second halves separately contribute and to the endpoint. Their linear combinations fill the plane when input amplitudes are unrestricted real numbers; subtracting the second contribution from the first gives . Details.
Controllability is useful before trying to design a controller: a requested endpoint outside the reachable set cannot be attained by clever choice of feedback control. The Kalman rank criterion makes this an exact linear algebra calculation for the stated linear time-invariant system model. It concerns whole states, so attaining one plant output is not enough to establish controllability. In quantum control, the declared state space may be an orbit constrained by conservation laws; see quantum controllability and unitary orbit of a density operator.
Convex combination Created 2026-09-24 Updated 2026-10-14
A convex combination is a finite weighted average of points in a real vector space. For , it has the form
The nonnegative coefficients forbid subtracting a component, and their unit sum keeps the result on the same affine scale as the inputs. With two points it parametrizes their line segment; equal coefficients give their centroid. A convex set contains every finite convex combination of its points. Conversely, the two-point case already gives the defining property of a convex set.[ref]
The distinction from a linear combination is concrete. Combining and with coefficients and gives , outside their line segment, despite the unit coefficient sum. Using two coefficients both equal to one gives here, but their sum is two, so it is not a convex combination with those coefficients. A numerical output may happen to coincide with a point admitting a different convex representation; the definition applies to the specified coefficients.
Convex cone 2026-10-05
A convex cone is a subset of a real vector space closed under nonnegative linear combinations: whenever and . The positive semidefinite cone and the copositive cone are examples, ordered by inclusion through the positive-semidefinite-plus-nonnegative cone.
The unique scalar coefficients in the finite linear combination expressing a vector in a chosen basis. Spanning gives existence, while linear independence makes the difference of two proposed representations have all zero coefficients. Ordering a finite basis turns these coefficients into a coordinate vector.