|
|
|
|
finite-dimensional linear problem
|
(Definition)
|
|
|
Let
be a linear mapping, and let be given. When both the domain and codomain are finite-dimensional, a linear equation
where is the unknown, can be solved by means of row reduction. To do so, we need to choose a basis
of the domain , and a basis
of the codomain . Let be the transformation matrix of relative to these bases, and let
be the coordinate vector of relative to the basis of . Expressing this in terms of matrix notation, we have
We can now restate the abstract linear equation as the matrix-vector equation
with
unknown, or equivalently, as the following system of linear equations
with
unknown. Solutions of the abstract linear equation are in one-to-one correspondence with solutions of the matrix-vector equation . The correspondence is given by
Note that the dimension of the domain is the number of variables, while the dimension of the codomain is the number of equations. The equation is called under-determined or over-determined depending on whether the former is greater than the latter, or vice versa. In general, over-determined systems are inconsistent, while under-determined ones have multiple solutions. However, this is a “rule of
thumb” only, and exceptions are not hard to find. A full understanding of consistency, and multiple solutions relies on the notions of kernel, image, rank, and is described by the rank-nullity theorem.
Elementary applications focus exclusively on the coefficient matrix and the right-hand vector, and neglect to mention the underlying linear mapping. This is unfortunate, because the concept of a linear equation is much more general than the traditional notion of “variables and equations”, and relies in an essential way on the idea of a linear mapping. See the example on polynomial as a case in point. Polynomial interpolation is a linear problem,
but one that is specified abstractly, rather than in terms of variables and equations.
|
Anyone with an account can edit this entry. Please help improve it!
"finite-dimensional linear problem" is owned by rmilson.
|
|
(view preamble)
Cross-references: polynomial interpolation, point, polynomial, coefficient, rank-nullity theorem, rank, image, kernel, multiple, inconsistent, over-determined, under-determined, variables, dimension, one-to-one correspondence, solutions, equation, terms, vector, coordinate, bases, matrix, transformation, basis, row reduction, linear equation, finite-dimensional, codomain, domain, linear mapping
There are 12 references to this entry.
This is version 9 of finite-dimensional linear problem, born on 2002-02-22, modified 2007-03-27.
Object id is 2502, canonical name is FiniteDimensionalLinearProblem.
Accessed 9122 times total.
Classification:
| AMS MSC: | 15A06 (Linear and multilinear algebra; matrix theory :: Linear equations) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|