Publication
Isometries of quadratic spaces
Related concepts (24)
Quadratic form
In mathematics, a quadratic form is a polynomial with terms all of degree two ("form" is another name for a homogeneous polynomial). For example, is a quadratic form in the variables x and y. The coefficients usually belong to a fixed field K, such as the real or complex numbers, and one speaks of a quadratic form over K. If , and the quadratic form equals zero only when all variables are simultaneously zero, then it is a definite quadratic form; otherwise it is an isotropic quadratic form.
Isotropic quadratic form
In mathematics, a quadratic form over a field F is said to be isotropic if there is a non-zero vector on which the form evaluates to zero. Otherwise the quadratic form is anisotropic. More explicitly, if q is a quadratic form on a vector space V over F, then a non-zero vector v in V is said to be isotropic if q(v) = 0. A quadratic form is isotropic if and only if there exists a non-zero isotropic vector (or null vector) for that quadratic form. Suppose that (V, q) is quadratic space and W is a subspace of V.
Irreducible polynomial
In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients.
Polynomial ring
In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field. Often, the term "polynomial ring" refers implicitly to the special case of a polynomial ring in one indeterminate over a field. The importance of such polynomial rings relies on the high number of properties that they have in common with the ring of the integers.
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1. Polynomials appear in many areas of mathematics and science.
Ε-quadratic form
In mathematics, specifically the theory of quadratic forms, an ε-quadratic form is a generalization of quadratic forms to skew-symmetric settings and to *-rings; ε = ±1, accordingly for symmetric or skew-symmetric. They are also called -quadratic forms, particularly in the context of surgery theory. There is the related notion of ε-symmetric forms, which generalizes symmetric forms, skew-symmetric forms (= symplectic forms), Hermitian forms, and skew-Hermitian forms.
Degenerate bilinear form
In mathematics, specifically linear algebra, a degenerate bilinear form f (x, y ) on a vector space V is a bilinear form such that the map from V to V∗ (the dual space of V ) given by v ↦ (x ↦ f (x, v )) is not an isomorphism. An equivalent definition when V is finite-dimensional is that it has a non-trivial kernel: there exist some non-zero x in V such that for all A nondegenerate or nonsingular form is a bilinear form that is not degenerate, meaning that is an isomorphism, or equivalently in finite dimensions, if and only if for all implies that .
Definite quadratic form
In mathematics, a definite quadratic form is a quadratic form over some real vector space V that has the same sign (always positive or always negative) for every non-zero vector of V. According to that sign, the quadratic form is called positive-definite or negative-definite. A semidefinite (or semi-definite) quadratic form is defined in much the same way, except that "always positive" and "always negative" are replaced by "never negative" and "never positive", respectively.
Minimal polynomial (field theory)
In field theory, a branch of mathematics, the minimal polynomial of an element α of a field extension is, roughly speaking, the polynomial of lowest degree having coefficients in the field, such that α is a root of the polynomial. If the minimal polynomial of α exists, it is unique. The coefficient of the highest-degree term in the polynomial is required to be 1. More formally, a minimal polynomial is defined relative to a field extension E/F and an element of the extension field E/F.
Minimal polynomial (linear algebra)
In linear algebra, the minimal polynomial μA of an n × n matrix A over a field F is the monic polynomial P over F of least degree such that P(A) = 0. Any other polynomial Q with Q(A) = 0 is a (polynomial) multiple of μA. The following three statements are equivalent: λ is a root of μA, λ is a root of the characteristic polynomial χA of A, λ is an eigenvalue of matrix A. The multiplicity of a root λ of μA is the largest power m such that ker((A − λIn)m) strictly contains ker((A − λIn)m−1).