A Cartesian basis is an orthonormal basis associated with the perpendicular axes of a Cartesian coordinate system.
A symmetric real bilinear form is positive-definite when for every nonzero vector. It defines an inner product and the associated norm . The complex Killing form is not positive-definite on the entire complex Cartan subalgebra; its restriction to the Euclidean subspace of a Cartan subalgebra is a real positive-definite form.
A bilinear form is alternating if for every vector . Expanding implies . The converse requires characteristic different from two. In that characteristic a skew-symmetric matrix of odd integer size has zero determinant, since . Thus an alternating form on a finite odd-dimensional vector space is degenerate. A nondegenerate alternating form defines a symplectic vector space.
A scalar-valued map is bilinear when it is linear in either argument with the other held fixed. A bilinear form is the case . Checking bilinearity is one of the algebraic steps in verifying a real inner product; being a symmetric bilinear form and having positive squared norm impose further conditions.
A bilinear form on a normed vector space is continuous exactly when it is bounded. For the nontrivial direction, continuity at gives such that whenever and ; scaling nonzero into these balls gives .
The radical of a symmetric bilinear form isThe form is nondegenerate exactly when its radical is zero.
A bilinear form on a finite-dimensional vector space is nondegenerate whenequivalently when is an isomorphism from to its dual space.
A symplectic vector space is a vector space equipped with a nondegenerate antisymmetric bilinear form. Every finite-dimensional symplectic vector space has even dimension: splitting off one symplectic two-plane leaves a smaller nondegenerate antisymmetric space, and induction completes the decomposition.
If preserves a nondegenerate bilinear form that is alternating and satisfies on a finite-dimensional vector space over a field of characteristic different from two, thenThe two eigenspaces are orthogonal for , since . Each restricted form is nondegenerate: a vector annihilating its own eigenspace also annihilates the other and hence all of . Both dimensions are even, say and . Consequently as an integer obtained from the eigenspace dimensions. Over the real numbers this gives the congruence .
The symplectic orthogonal complement of a subspace is . The nondegenerate bilinear form gives . An isotropic subspace of a symplectic vector space satisfies ; a Lagrangian subspace satisfies equality.
A subspace of a symplectic vector space is isotropic when . It has at most half the dimension of ; equality makes it a Lagrangian subspace. This use of isotropic concerns an alternating bilinear form, rather than an isotropic quadratic form.
If is a nondegenerate bilinear form on a finite-dimensional vector space and is any bilinear form, there is a unique linear map such thatThe right radical of is .
The inertia of a real symmetric bilinear form is the triple giving the numbers of positive, negative, and zero squares in a diagonalization. Sylvester's law of inertia makes it independent of the chosen basis.
For a real symmetric bilinear form, let and be the dimensions of its positive and negative diagonal subspaces. This pair gives the first two components of the inertia of a bilinear form and is independent of basis by the Sylvester's law of inertia. For a nondegenerate form their sum is the full dimension; otherwise the nullity is an additional invariant. Another convention calls the difference the signature of a quadratic form. The pair convention describes the positive and negative harmonic spaces of the real de Rham intersection form in dimension four.
A complex sesquilinear form is linear in one argument and conjugate-linear in the other. Here the first argument is taken to be linear.
The radical of a Hermitian form is the vector subspace orthogonal to the entire space. The form descends to the quotient vector space by its radical: adding a radical vector to either argument does not change the value. For a positive semidefinite Hermitian form, the Cauchy-Schwarz inequality identifies this radical with its zero-norm vectors, so the quotient form is positive definite. This conclusion does not hold for a general indefinite Hermitian form: a zero-norm vector need not belong to its radical.
A Hermitian form is positive semidefinite when for every vector. It need not define an inner product, because a nonzero vector may have zero squared norm. The Cauchy-Schwarz inequality still holds: applying nonnegativity to and minimizing the quadratic expression in gives when ; when , varying forces . Thus its zero-norm vectors are exactly the radical of a Hermitian form. Quotienting this radical of a Hermitian form gives a positive inner product; taking its Hilbert space completion then gives a Hilbert space. This is the final positivity step in the Gupta-Bleuler null-state quotient.
An indefinite Hermitian form takes both positive and negative values on for nonzero vectors. For example, is indefinite. It is not a positive inner product defining a Hilbert space, and a nonzero vector can have zero norm without being orthogonal to all vectors. A positive semidefinite restricted form becomes a positive inner product only after quotienting its radical of a Hermitian form.
For a basis , the matrix of a Hermitian form has entries . With the convention that is linear in its first argument, coordinate columns satisfy .
A vector space consists of vectors that may be added and multiplied by scalars, subject to the vector-space axioms.
A vector space with scalar field is equivalently a torsion-free divisible Abelian group. An embedding of such groups automatically respects rational scalar multiplication because solutions to are unique.
For complex vector spaces, an antilinear map satisfies . It is linear over the real numbers and conjugates complex scalar multiplication. This differs from two conjugate linear operators, which are related by similarity rather than conjugate-linearity.
An antiunitary operator between complex Hilbert spaces is a surjective antilinear map satisfying the displayed inner product identity. It preserves norms but conjugates scalars. In a chosen orthonormal basis it is , with a unitary operator and coefficientwise complex conjugation. Conversely any such is antiunitary. Antilinearity by itself does not preserve norms.
A vector space over the field of complex numbers. A complex-linear map preserves addition and multiplication by complex scalars.
For real vectors of equal length and equal sum, write when for every proper initial segment; the downward arrow means decreasing rearrangement. Majorization compares how unevenly a fixed total is distributed. The uniform probability vector is majorized by every probability vector, while majorizes every probability vector. The order controls exact pure-state entanglement conversion in Nielsen's pure-state conversion theorem.
If is a finite field, a vector space of finite dimension over has elements. Every infinite-dimensional vector space over is an infinite elementary abelian -group under addition.
A subset of is a finite-field Kakeya set when it contains an affine line in a vector space in every one-dimensional direction. The line position may depend on the direction. The polynomial method in combinatorics yields the finite-field Kakeya polynomial bound on its cardinality.
For a finite-field Kakeya set , a smaller cardinality would give a nonzero polynomial of total degree of a polynomial at most vanishing on , by the dimension of a bounded-total-degree polynomial space. Its restriction to each complete affine line in a vector space has roots of a polynomial and degree less than , hence vanishes identically. The top homogeneous polynomial part then vanishes in every direction. A polynomial of degree less than in each variable cannot vanish everywhere on unless it is zero, giving a contradiction. For the prime field, this is the polynomial nonvanishing below the field size.
The linear span of a subset of a vector space is the set of all finite linear combinations of elements of .
For a vector subspace , the quotient vector space consists of cosets , with vector operations induced from .
A vector subspace is a subset closed under vector addition and scalar multiplication, and is therefore itself a vector space.
A flag is a strictly nested chain of vector subspaces of a fixed vector space. A complete flag contains a subspace of every possible dimension. For an action by linear maps, an invariant flag means that each of its vector subspaces is an invariant subspace. A basis adapted to an invariant complete flag makes all these maps upper triangular, connecting complete flags to simultaneous triangularization of a Lie algebra representation.
A complete flag in an -dimensional vector space is a nested sequence of vector subspaces with . An action preserves such a flag exactly when its matrices are upper triangular in a basis adapted to the flag. The Lie theorem supplies an invariant complete flag for every complex finite-dimensional Lie algebra representation of a solvable Lie algebra.
The fixed coordinate subspace of dimension in consists of vectors whose coordinates after the first vanish. Restricting a quadratic form to it uses only the leading by matrix block. It specifies one fixed support; allowing every support of size would introduce another combinatorial counting step.
The intersection of any family of vector subspaces of a common vector space is the set of vectors belonging to every member of the family. It is again a vector subspace.
A hyperplane is a vector subspace of codimension one. A projective hyperplane in is the zero set of one nonzero homogeneous linear form.
A closed vector subspace of a topological vector space is both a vector subspace and a closed set. The kernel of a continuous linear map is a closed vector subspace.
If is a nonzero closed linear subspace of a normed ambient space and is finite-dimensional with , the unit sphere of has positive distance from . Otherwise a sequence of nearly coincident points yields a bounded sequence in , hence a convergent subsequence; closedness of puts its norm-one limit in both vector subspaces. In applications to a bidual space, completeness of the Banach space makes its canonical image closed.
An affine subspace of a vector space is a translate of a vector subspace . Its dimension is the dimension of .
In a vector space over a field , an affine line is a translate of a one-dimensional vector subspace. Its direction is that vector subspace, so multiplying by a nonzero scalar preserves the direction. Over a finite field of size it contains exactly distinct points. This usage concerns affine subsets of vector spaces, rather than the affine line as an affine scheme.
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.
The direct sum of two vector spaces consists of pairs with componentwise operations. A vector space is an internal direct sum of subspaces and exactly when every vector has a unique expression with and .
An orthogonal direct sum is a direct sum whose distinct summands are mutually orthogonal. For and , the Pythagorean identity gives . In a Hilbert space, a closed subspace of a Hilbert space and its orthogonal complement give an orthogonal direct sum of the entire space. The component maps are orthogonal projections and have operator norm one when their ranges are nonzero.
A submodule of a module is a direct summand if some submodule gives . Equivalently, the inclusion has a left inverse R-module homomorphism, or is the image of an idempotent endomorphism of .
For every subspace of a finite-dimensional vector space , extending a basis of to a basis of produces a subspace such that .
Vectors are linearly dependent when some nonzero choice of coefficients gives a vanishing linear combination.
For a basis with cyclic indexing, the vectors have coefficient matrix , where cyclically shifts coordinates. Its determinant is . They therefore form a basis exactly when is odd over a field of characteristic different from two. For even , alternating coefficients produce a nontrivial linear dependence.
Every linearly independent subset of a finite-dimensional vector space extends to a basis. Starting with its vectors, add a vector outside their current span until the span is the whole space. Each addition preserves linear independence, and the process stops because the dimension is finite. This also lets a linear functional on a vector subspace extend to the ambient space by assigning arbitrary values on the additional basis vectors.
The standard basis of the vector space consists of the vectors whose th coordinate is one and whose other coordinates are zero. Every vector has the unique expression in this basis.
If a vector space is spanned by vectors, every linearly independent family in it has at most members. Consequently, any two finite bases have the same number of vectors.
For polynomials in fixed variables and of a fixed degree, the monomials of that degree form a basis of the corresponding homogeneous component.
An axial vector transforms as under an orthogonal matrix . It agrees with a polar vector under a proper rotation matrix and has the additional determinant sign under an orientation-reversing transformation. Angular momentum and angular velocity are axial vectors.
A polar vector transforms as under an orthogonal matrix , including an orientation-reversing transformation. Displacement, velocity and force are polar vectors. An axial vector instead transforms as .
A Euclidean vector is a vector in a finite-dimensional real inner-product space, represented in Cartesian coordinates by an ordered tuple of real components.
The cross product of two three-dimensional vectors is perpendicular to both, has magnitude , and is oriented by the right-hand rule.
A horizontal shear fixes the horizontal axis pointwise and sends to . Its determinant is one and both eigenvalues are one. A nonzero shear preserves area but generally changes lengths and angles. Composing a shear with a planar rotation can produce a symmetric stretch; having determinant one alone does not make a linear map a shear.
A uniform dilation about the origin multiplies every vector by one positive real scale . The linear map multiplies lengths by and -dimensional volumes by . This differs from stretching different axes by different factors. The case is the identity map.
A real-linear map between complex vector spaces that commutes with multiplication by . On , its real matrix is , representing multiplication by . On , such a map with real determinant one is a rotation. In higher complex dimension, determinant one does not force the map to be a unitary operator.
If a linear functional vanishes on the image of a linear map but , the equation has no solution. In Euclidean coordinates, a vector with provides such an obstruction whenever . In finite dimensions these annihilating functionals exactly characterize membership in the image: precisely when it is orthogonal to every vector in .
A linear map is surjective when its image is all of . For finite-dimensional spaces this is equivalent to .
An affine function on a real or complex vector space has the form , where is a linear map and is constant. Its derivative is the constant map . It is linear exactly when .
Linearity is the property .
For a finite almost-everywhere measurable function , the multiplication operator on L2 space has maximal operator domain . It is a closed operator: if and in L2 space, subsequences converge almost everywhere, giving . Its domain is dense, since truncating a function to the sets approximates it in L2 space. If is bounded, this is a bounded linear operator of norm equal to the essential supremum of .
For a real measurable function on a sigma-finite measure space, multiplication on is an unbounded self-adjoint operator. Testing its adjoint relation on identifies the same maximal domain. Outside the essential range, multiplication by is a bounded resolvent. Inside it, normalized indicators of finite-positive-measure sets where is close to are approximate eigenvectors, so the inverse cannot be bounded.
A linear projection is an idempotent linear operator: . Every vector decomposes as , into the image of a linear map and the kernel of a linear map. Those two vector subspaces form a direct sum. An orthogonal projection additionally uses the orthogonal complement in an inner-product space.
If two closed subspaces of a Hilbert space give , the projection onto along fixes and vanishes on . It need not be an orthogonal projection. The bounded inverse theorem applied to the addition map on the complete component spaces proves boundedness of the component maps. With both complementary subspaces nonzero, its operator norm and that of equal , with the directed subspace angle convention. Indeed, for fixed , the smallest possible norm of over is , which proves the formula for . Equality with follows from the block representation on : both squared operator norms are . If a summand is zero, is zero or the identity operator, and one complementary operator norm is zero; those cases must be treated directly.
For equal finite-dimensional closed subspaces of a Hilbert space , positivity of makes invertible. The displayed reconstruction is the unique element of whose orthogonal projection onto matches that of . It is the oblique projection onto along . Its operator norm is the value of the secant function at the directed subspace angle, and its error is at most that secant function value times the best orthogonal projection error. The lower error bound follows from the Pythagorean identity. Zero-dimensional cases are handled directly.
The domain of an operator is the set of vectors on which is defined. For an unbounded differential operator, the domain includes regularity and boundary conditions and is part of the operator's definition.
A linear operator on a Hilbert space is densely defined when its operator domain is a dense subset of . Density makes the adjoint operator unique wherever its defining inner-product identity has a solution.
The identity operator maps every vector to itself. Every nonzero vector is an eigenvector with eigenvalue one.
Articles were limited to the first 100 out of 610 total.
Articles by others on the same topic
This is a section about Linear algebra!
For example, this sentence. And then another one.
This is a section about Linear algebra!
For example, this sentence. And then another one.
Linear algebra is a branch of mathematics that deals with vectors, vector spaces, linear transformations, and systems of linear equations. It provides a framework for modeling and solving problems in various fields, including engineering, physics, computer science, economics, and more. Key concepts in linear algebra include: 1. **Vectors**: Objects that have both magnitude and direction, often represented as ordered lists of numbers (coordinates).