Alternating bilinear form Created 2026-10-05 Updated 2026-10-14
A bilinear form is alternating if for every vector . Expanding gives , hence . If the characteristic is not two, the converse follows from by dividing by two. In characteristic two, the relation is just symmetry and does not force zero self-pairings: on has .[ref]
The matrix
gives an alternating bilinear form over every field. Over the real numbers, its value is the signed area of the parallelogram with sides : , and swapping the sides gives . Every self-pairing is zero, yet , so this bilinear form is nondegenerate. Directly, pairing with gives , and pairing it with gives ; both vanish only when .
In characteristic different from two, a skew-symmetric matrix of odd integer size has zero determinant, since . Thus an alternating bilinear form on a finite odd-dimensional vector space is a degenerate bilinear form. The stronger statement that the rank of an alternating bilinear form is even holds in all characteristics: splitting off a two-dimensional block with matrix repeatedly proves it. A nondegenerate alternating bilinear form defines a symplectic vector space, the linear setting for signed area rather than squared length.
A quadratic form over a field is an anisotropic quadratic form if forces . An isotropic quadratic form instead has a nonzero zero vector. This is a property of the form together with its coefficient field, rather than just the displayed polynomial.[ref]
For example, is anisotropic over . If a nonzero rational solution had , then too; otherwise would be a rational square root of two. Over , however, is a nonzero zero vector. The coordinate change , gives , a hyperbolic plane of a quadratic form.
This example also separates anisotropy from positive definiteness: the rational form takes the positive value and the negative value , despite having no nonzero rational zero. In a Witt decomposition, an anisotropic remainder is what remains after all hyperbolic planes have been split off. Its Witt index is zero. In characteristic two, one must test vanishing of the quadratic form itself; properties of the associated polar bilinear form alone do not supply the same test.
Bi-invariant pseudo-Riemannian metric Created 2026-10-14 Updated 2026-11-05
On a connected Lie group, a nondegenerate invariant symmetric bilinear form on a Lie algebra extends by translation to a metric preserved by both left and right translation. For a disconnected Lie group, the form must additionally be invariant under the full Adjoint representation of a Lie group. It may have indefinite signature. Its Levi-Civita connection is for left-invariant vector fields, and its Ricci tensor is . Choosing the nondegenerate Killing form of a semisimple Lie algebra yields a canonical indefinite Einstein manifold; compact groups instead admit the positive metric .
Bilinear form Created 2026-09-24 Updated 2026-10-14
A bilinear form takes two vectors in a vector space over a field and returns a scalar in . Its defining property is separate linearity: holding either input fixed gives a linear functional of the other. For scalars and vectors ,
This is a scalar-valued bilinear map; the chosen field is part of the definition.[ref]
Separate linearity does not mean that is a linear map on the vector space with componentwise vector addition and scalar multiplication. Over the real numbers, , whereas a linear map on the pair would give . The simplest example is on the one-dimensional vector space : fixing gives , but doubling both and quadruples their product.
A bilinear form measures how two inputs interact. The dot product measures alignment; a symmetric bilinear form can describe a quadratic form; an alternating bilinear form can measure signed area. A nondegenerate bilinear form turns each vector into a unique linear functional and so connects geometry with the dual space. The same short definition therefore supports lengths, bilinear orthogonal complements, and symplectic vector spaces, depending on the additional properties imposed.
Over the complex numbers, a bilinear form is linear in both inputs without conjugating either scalar. A Hermitian form instead is a sesquilinear form and conjugates when its inputs are exchanged. For complex matrices, the adjoint used with Hermitian forms and matrix C-star algebras is the conjugate transpose, whereas a bilinear form uses the ordinary transpose . For example, has , while the Hermitian form has .[ref]
Bilinearity Created 2026-10-05 Updated 2026-10-31
A map between vector spaces is bilinear when it is linear in either argument with the other held fixed. A scalar-valued bilinear form is the case and is the scalar field. 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.
Bilinear map Created 2026-10-06 Updated 2026-10-25
A bilinear map is a map between vector spaces that is linear in each argument when the other is fixed. The nonlinear temperature advection can be written as the diagonal of a bilinear map, , when velocity depends linearly on temperature. Unlike a bilinear form, its output need not be a scalar.
Bilinear sum Created 2026-09-28 Updated 2026-11-05
A bilinear sum has the form
where are finite index sets and the coefficient sequences can be controlled separately. It is a bilinear form in these two coefficient lists. In analytic number theory, the function often oscillates with the product , as in a Type II sum.
The Cauchy-Schwarz inequality eliminates one coefficient list and exposes correlations:
Useful cancellation comes from small off-diagonal correlations, not from the bilinear notation alone. For example, take and . Orthogonality of roots of unity makes the inner correlation for and zero otherwise, giving . The termwise triangle inequality only gives . This explains why Fourier analysis and large sieve estimates are effective tools for bilinear sums.
Bill Casselman 2026-11-05
Bill Casselman writes research and expository mathematics connecting algebraic structure with concrete calculations. His author-hosted Introduction to quadratic forms by Bill Casselman explains quadratic forms over general fields, including the distinctions required in characteristic two. It develops decomposition results using totally isotropic subspaces and the hyperbolic plane.[ref]
For example, over the quadratic form separates into a hyperbolic plane on the first two coordinates and an anisotropic quadratic form on the last. The -axis consists of isotropic vectors, but it is not invisible to the whole form: its associated bilinear form pairs nontrivially with . Pairing such complementary directions produces the hyperbolic part of an orthogonal direct sum. The example helps distinguish a vector on which a quadratic form vanishes from a vector in the radical of its associated bilinear form.[ref]
Binary inner product Created 2026-09-28 Updated 2026-11-05
For vectors , the binary inner product is the bilinear form
Its value is the parity of the coordinates at which both vectors are one. For example, , whereas because in the finite field .
The terminology does not impose the positive definiteness axiom of a real or complex inner product. A nonzero vector can have zero self-pairing, as the second example shows. The form is nevertheless a nondegenerate bilinear form: a nonzero coordinate of is detected by pairing with the corresponding standard basis vector. This pairing defines orthogonality and dual codes in coding theory.
Bounded bilinear form Created 2026-09-24 Updated 2026-10-14
A bilinear form on a real normed vector space is bounded when one constant satisfies
This is an upper bound on the magnitude of every pairing. It says nothing about the sign of and does not require a symmetric bilinear form. The chosen norm is part of the hypothesis. Boundedness is equivalent to joint continuity, as shown by the boundedness criterion for a bilinear form.[ref]
For example, on with the Euclidean norm, the bilinear forms
both satisfy the upper bound with , by the Cauchy-Schwarz inequality. Yet their quadratic forms are and : the former takes negative values and the latter vanishes at the nonzero vector . Thus neither is a coercive bilinear form. The latter is also a degenerate bilinear form, whereas is nondegenerate. Boundedness controls size, not positivity or loss of directions.
Every bilinear form on a real or complex finite-dimensional vector space equipped with any norm is bounded. In coordinates, write using its matrix of a bilinear form. The Cauchy-Schwarz inequality gives , with the spectral norm; finite-dimensional equivalence of norms transfers this to the chosen norm. The conclusion concerns each fixed norm and fixed bilinear form: it does not supply a single constant for an arbitrary family of matrices or changing dimensions.
On an infinite-dimensional vector space, the upper bound is an additional condition. Equip the finitely supported sequences with the norm inherited from the l2 sequence space and set
Each pairing is a finite sum, so this is a well-defined bilinear form. For the basis vector , however, and ; no finite works. It is even a coercive bilinear form with , since . Consequently coercivity alone does not imply boundedness on a normed vector space. This example uses , which is not a Hilbert space; it does not define this pairing on all of the l2 sequence space.
A bounded bilinear form defines a bounded linear operator by , where is the continuous dual space. Its operator norm is the smallest admissible :
This converts an upper bound for pairings into an upper bound for a linear map taking an unknown vector to a linear functional.
Boundedness criterion for a bilinear form Created 2026-10-03 Updated 2026-10-14
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 .
Cartan three-form 2026-10-14
An adjoint-invariant symmetric bilinear form on a Lie algebra makes the displayed tensor alternating. If is invariant under the full group Adjoint representation, its left-translated three-form is also right-invariant. On left-invariant fields, the exterior derivative is by the Jacobi identity. The Killing form supplies such a on every semisimple Lie group. An overall sign change in the lowered structure-constant convention negates the form but not its invariance or closedness.
Cayley transform (Lie theory) Created 2026-09-24 Updated 2026-11-05
The Cayley transform is the rational matrix function , defined when is invertible. For the orthogonal group, unitary group, and analogous groups preserving a nondegenerate bilinear form or Hermitian form, it gives a local parametrization near the identity by their Lie algebras. If , expanding both sides gives
so . The inverse chart is wherever is invertible. The Cayley transform of a real skew-symmetric matrix is the positive-definite real orthogonal example.
The formula is not a parametrization of an arbitrary Matrix Lie group. For example, belongs to the special linear Lie algebra, but , so its transform is not in the special linear group. In indefinite form-preserving groups, the Cayley chart's full domain can also meet components outside the identity component of a Lie group; its local behavior near zero alone does not imply a global parametrization.
Charles Weibel 2026-11-05
Charles Weibel authored an exposition of bilinear forms over a field. It develops diagonalization and the classification of symmetric bilinear forms, including the real signature described by Sylvester's law of inertia. These classifications explain why changing a basis can simplify a form without removing invariants such as its numbers of positive and negative squares.[ref]
Clifford module 2026-11-05
For a quadratic form on a vector space , a Clifford module is a module over the Clifford algebra . Equivalently it is a vector space with a linear assignment satisfying
Over a field of characteristic different from two, expanding gives , with the bilinear form associated to . The universal property of the Clifford algebra extends these generator actions to an action of the whole algebra over a field.
For over , the matrices and both square to and anticommute. They make a Clifford module. Such modules provide the algebraic setting for spinors; changing the sign convention for changes the required generator squares.
Coercive bilinear form Created 2026-09-24 Updated 2026-10-14
A real bilinear form on a normed vector space is coercive when there is one constant such that
The lower bound uniformly controls every direction in the chosen norm. Unlike the upper bound defining a bounded bilinear form, it forces positive diagonal values at every nonzero vector. No symmetry is assumed. For complex Hilbert spaces, the usual analogue uses a sesquilinear form and ; it is not the same assertion for a complex bilinear form.
A concrete bounded and coercive example on , with the Euclidean norm, is
Its quadratic form is
The best lower constant is , attained at . Nevertheless, and , so coercivity does not imply a symmetric bilinear form. The symmetric part of a matrix determines , while the skew-symmetric matrix part changes mixed pairings without changing . This is the symmetric and alternating parts of a bilinear form decomposition.[ref]
For the upper constant, direct multiplication gives . Its eigenvalues are , so the optimal upper constant, the spectral norm, is . The two constants answer different questions: how large a mixed pairing can be, and how small a self-pairing can be relative to squared norm.
Figure 1.
Bounded saddle and flat-direction quadratic forms contrasted with a uniformly coercive bowl
. Details.
The plotted quadratic forms show the mechanism: descends in one direction, leaves one direction uncontrolled, and controls both. These are self-pairings; their level sets cannot reveal the skew-symmetric matrix part. Calling a quadratic energy here refers to this diagnostic quantity, not to a claim that a nonsymmetric equation comes from minimizing an energy functional.
On a real finite-dimensional vector space with any norm, strict positivity for every nonzero does imply coercivity. Indeed the quadratic form is continuous, and its positive minimum on the compact unit sphere supplies . If is also a symmetric bilinear form, this is positive definiteness. For general , it is the symmetric and alternating parts of a bilinear form decomposition that isolates the positive part. Switching between equivalent norms preserves coercivity, but usually changes its constant.
The infinite-dimensional vector space distinction is explicit on the real l2 sequence space:
The Cauchy-Schwarz inequality gives boundedness with , and for every nonzero vector. But with , so no positive works. On the span of , the best lower constant is : each finite restriction is coercive, but the control disappears as grows. Strict positivity is therefore weaker than a uniform lower bound.
The practical payoff is a stability estimate for a weak formulation. Assume is a real Hilbert space, is both a bounded bilinear form and a coercive bilinear form, and the load is a bounded linear functional. The Lax-Milgram theorem gives a unique satisfying for all , including nonsymmetric .[ref] The dual norm measures load size. Testing with gives the short energy estimate
For the bound holds directly; otherwise divide by . Subtracting the equations for two loads and using the same argument gives . Thus a positive lower constant limits the response to load errors. The upper bound and completeness of the Hilbert space enter the existence theorem; the estimate itself uses the lower bound and the load's dual norm.
For the displayed matrix , take . Then for every means , not , with this ordering of the bilinear form. Since ,
For , the exact response is and . For , it is , with norm . The actual maximal amplification is the operator norm : the coercivity estimate is valid but need not be sharp for a nonsymmetric bilinear form.
Figure 2.
Solutions for unit loads lie inside the coercivity bound, and response grows at most linearly with load norm
. Details.
A coercive zero-Dirichlet weak form gives a bounded solution map from into . Composing with the compact Sobolev embedding into gives the compact inverse . Transposing the bilinear form produces its Hilbert-space adjoint inverse . The Fredholm compatibility condition for a shifted equation is orthogonality of to the homogeneous adjoint solutions. Indeed when , and the zero spectral parameter is excluded at resonance by coercivity.
For sufficiently regular coefficients and a function , this boundary quantity is the outward flux appearing when a divergence-form principal operator is integrated by parts. Its zero condition is the natural Neumann boundary condition for the corresponding bilinear form. With only bounded coefficients and a Sobolev solution, the weak formulation can encode that natural condition without asserting that a pointwise boundary derivative exists.
Constant-drift massive-Laplacian Dirichlet problem Created 2026-10-03 Updated 2026-11-05
Let be a bounded open set, a constant vector, and . On the real Sobolev space , consider the bounded bilinear form
Its weak solution solves
with zero Dirichlet boundary condition. The minus sign follows from integration by parts: because is constant. To represent the plus-drift equation, instead use the form with .
No smallness condition on is needed. For a smooth compactly supported ,
Density extends the identity to , since the drift pairing is continuous in the norm. Therefore for every constant . This is a coercive bilinear form, so the Lax-Milgram theorem gives a unique weak solution for arbitrary constant drift. The drift changes the equation but contributes no energy to this homogeneous-Dirichlet estimate.
Convex functional 2026-10-25
A functional on a real vector space is convex when it is a convex function: for . For a symmetric nonnegative bilinear form and a linear functional , the quadratic functional is convex, since its convexity difference is .