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]
https://webspace.maths.qmul.ac.uk/p.j.cameron/notes/linalg.pdf. Peter J. Cameron, Notes on Linear Algebra, §§9.1–9.2: alternating forms in arbitrary characteristic
The matrixgives 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.
Bi-invariant pseudo-Riemannian metric 2026-10-14
A nondegenerate invariant symmetric bilinear form on a Lie algebra extends by translation to a metric preserved by both left and right translation. 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]
Bilinear Forms by Keith Conrad. §1: examples and the Hermitian distinction
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.
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 satisfiesThis 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 formsboth 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 setEach 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.
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 thatThe 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, isIts quadratic form isThe 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.
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]
Introduction to Finite Element Methods by Christian Clason. §2.2, Theorem 2.7, pp. 20–21, equation (2.9): hypotheses, unique solvability and load bound
The dual norm measures load size. Testing with gives the short energy estimateFor 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.
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.
Conormal flux of a divergence-form operator 2026-10-31
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.
Let be bounded, satisfy , and . The bilinear formon is bounded. The Cauchy-Schwarz inequality and giveso it is a coercive bilinear form. The Lax-Milgram theorem therefore gives a unique weak solution of with zero Dirichlet boundary condition.
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 .
For a Lie subalgebra , its defining representation is its given action on the vector space . The Lie bracket identity verifies the representation property. For the special linear Lie algebra, diagonal trace-zero matrices have coordinate weights of a representation on the standard basis; for a Special orthogonal Lie algebra, the same action preserves the defining symmetric bilinear form.
Degenerate bilinear form Created 2026-09-24 Updated 2026-10-14
A bilinear form is degenerate if some nonzero vector pairs to zero with every vector on at least one side. For a symmetric bilinear form or an alternating bilinear form, this says its radical of a bilinear form contains a nonzero vector. On a finite-dimensional vector space, it is equivalent to a singular matrix of a bilinear form, or .
For , . The nonzero vector is invisible to every pairing, and changing never changes . The quadratic form therefore has two parallel lines as its unit level set. This is a lost direction, a stronger condition than being an isotropic vector: with , but .
Dirichlet form 2026-10-14
A Dirichlet form on a real space is a densely defined closed nonnegative symmetric bilinear form with the Markov contraction property. In the real case, truncating to keeps it in the form domain and cannot increase . The Dirichlet form of a Markov chain is a discrete energy example; Laplacian energy on a region supplies a continuous example.
A smooth uniformly elliptic differential expression with symmetric Dirichlet bilinear form has an unbounded self-adjoint operator realization on , whose domain is on a smooth bounded domain. If the form is strictly positive, the Lax-Milgram theorem and elliptic regularity make a bounded map from to . Its action on is compact by the Rellich-Kondrachov compactness theorem and self-adjoint by symmetry of the form. The spectral theorem for compact Hermitian operators therefore gives an orthonormal basis of smooth Dirichlet eigenfunctions with positive eigenvalues tending to infinity.
A bilinear form with zero left and right radicals induces injective linear maps and . Finite dimensions force , so both maps are isomorphisms. For any other bilinear form , composing its maps to the dual spaces with these inverse isomorphisms gives unique endomorphisms with . In bases with invertible pairing matrix and coefficient matrix , and .
Galerkin orthogonality Created 2026-09-28 Updated 2026-10-14
Let be a conforming finite element space. Suppose the exact solution satisfies for every and its Galerkin method approximation satisfies for every , using the same bilinear form and linear functional. Subtracting the two identities gives Galerkin orthogonality:This identity itself does not require symmetry. Its interpretation as an orthogonal projection in an energy norm does require a bounded symmetric coercive bilinear form: then is an inner product, is perpendicular to every available discrete correction, andConsequently is the unique closest point in in the energy norm. This Pythagorean theorem in a function space explains the beauty of the Galerkin method: integrated local equations compute a global best approximation. The Céa lemma supplies the corresponding estimate in a chosen reference norm.
For the finite element solution of the one-dimensional Poisson equation, and . Testing the error against the th piecewise-linear hat function on a uniform mesh givesIn this model vanishes at every node, so each of these integrals is individually zero, although is positive inside every element. Galerkin orthogonality controls the derivative-weighted balance; it does not say that the pointwise error vanishes.
The exact identity assumes conformity and exact evaluation of the continuous forms, including any numerical integration that is used. If assembly instead uses and , subtraction gives the consistency defectThus inexact numerical integration need not preserve the projection. In the Petrov-Galerkin method the error is tested against a different test space, and for a nonsymmetric bilinear form the displayed identity need not describe perpendicularity in any energy norm.
Geometric representation of a Coxeter group Created 2026-09-24 Updated 2026-10-03
For a finite-rank Coxeter system, let have basis and symmetric bilinear formIts geometric representation sends the generator to the reflection

