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.
For a finite-dimensional Hermitian matrix , the Rayleigh quotient has precisely the range , where the endpoints are its extreme eigenvalues. The finite-dimensional spectral theorem writes a nonzero vector as in an orthonormal eigenbasis, giving
Thus the quotient is a convex combination of eigenvalues. The bounds follow immediately, and equality at either endpoint means that lies in the corresponding extreme eigenspace, including any repeated eigenvalue. Every intermediate value occurs: for orthonormal extreme eigenvectors, gives for . If all eigenvalues are equal, the quotient is constant.
The Hermitian hypothesis matters. The real matrix has only the eigenvalue , but . Its quotient is governed by the symmetric part of a matrix , not by a real orthonormal eigenbasis of . A nonsymmetric matrix therefore need not obey the displayed eigenvalue bounds.
Let be the interior nodes, and let be the nodal basis of the common conforming finite element space, with and zero boundary values. These piecewise-linear hat functions give the expansions
Testing the first equation with and then the second equation with gives the linear system
Here is the diffusion stiffness matrix and the mass matrix. Their entries are symmetric in , so both are symmetric matrices.
For , put . The two quadratic forms are
If , the linear independence of the basis ensures , so . If , the Poincaré inequality and zero Dirichlet boundary condition force , contradicting . Thus both and are positive-definite matrices.
For , symmetry of cancels the cross terms:
Therefore
This is the positivity of a quadratic form intended by the last sentence of the question. For , is a nonsymmetric matrix, since . Under the convention that “positive-definite matrix” includes symmetry, that last sentence needs this qualification: the symmetric part of a matrix is positive definite. The quadratic lower bound for a nonsymmetric matrix still implies that is an invertible matrix: would give , hence .
For , the centre and constant remain and . Its eigenvalues are , so rotated coordinates put the surface in the form . This is a one-sheet hyperboloid. Since , the nearest centre-to-surface distance is at least one, attained in the eigen-direction with eigenvalue three. The coordinate is unbounded, because arbitrarily large can be balanced by or . Thus the nearest distance is one, and there is no maximum value of .
For the printed nonsymmetric , use the symmetric part of a matrix:
The skew-symmetric part contributes zero to this scalar. The same centre solves , and again . Sylvester's positive principal minors are , so this surface is an ellipsoid.
Let be the largest eigenvalue of . Its characteristic equation is , and the Rayleigh quotient gives
For the maximum , the support function of a centred ellipsoid gives the bound below. Equivalently, apply the Cauchy-Schwarz inequality in the -weighted inner product: . The inverse entry is , and equality is attained for a centred vector proportional to . Thus
Using the eigenvalues of the raw nonsymmetric would be incorrect: it is its symmetric part that determines the surface and its Euclidean geometry.
A local Maxwellian can be written as , with and coefficients depending on . Its logarithm is a linear combination of collision invariants, so and at each spatial point.
Comparing powers of in gives
Here is the symmetric part of a matrix formed by the coefficients of the quadratic polynomial. For constants , choose , and . All four coefficient equations hold. The resulting expanding Gaussian solution of the Boltzmann equation is
Direct verification is particularly simple: and are constant along free characteristic curves, so the transport derivative is zero. At fixed its logarithm is the displayed Maxwellian quadratic, so the collision term is also zero. Its spatial dependence is nonconstant, it is positive and rapidly decaying, and its Gaussian velocity integral is finite because . It is not a compactly supported example, nor does this final part require one.
Differentiate the quadratic energy:
For , put . Immediate energy growth occurs precisely when . With both eigenvalues negative, such directions exist iff . Writing , the growing initial conditions are the two opposite open wedges
If , energy decreases. No energy growth at any time, for any initial condition, is possible exactly when
Indeed, this makes the symmetric part of a matrix a negative semidefinite matrix, so along every trajectory. If the product is smaller, the wedges already supply counterexamples at . This is the instantaneous energy-growth criterion for a linear system.
Write . Restriction to the plane gives
This is an equation of degree at most two in two Cartesian coordinates, the general algebraic form of a conic, with possible degenerate conics and an empty set of real points. No determinant hypothesis is needed for this substitution.
For an arbitrary plane, choose a point and an orthonormal basis of its direction linear subspace. Put and , where . With , the symmetric part of a matrix, the restricted equation is
This proves the plane-section result whenever “conic” allows the appropriate degeneracies. A rigid motion taking the chosen plane to gives the same argument.
The source's assumption does not guarantee a nondegenerate conic. Even with and , the section is a single point, and has no real points. With the nonsingular symmetric matrix giving , the section is the repeated straight line .
There is a further literal omission: the source does not assume is symmetric. For
one has but . Thus the section is the entire plane, rather than a conic. Only controls the quadratic form; invertibility of an arbitrary cannot remove this exception. If the intended hypothesis is that is symmetric and nonsingular, the quadratic restriction to a plane cannot vanish identically: otherwise , so would map a two-dimensional linear subspace injectively into its one-dimensional orthogonal complement, which is impossible. Degenerate and empty sections still remain possible.
Positive definiteness 2026-10-14
The strict positivity of a quadratic form on every nonzero vector. A real symmetric matrix has positive definiteness exactly when its associated quadratic form does, making it a positive-definite matrix. A Hermitian form is positive definite when its value on is real and strictly positive for every nonzero vector.
Think of a positive-definite quadratic form as an energy cost for a displacement: every direction costs something, and zero cost identifies the origin. For example, the real symmetric matrix
is a positive-definite matrix because the two squares can vanish together only at . The mixed term couples the coordinates, but cannot overwhelm their positive contributions: and . The graph is a bowl, and its positive level sets are ellipses with axes along the eigenvectors, rather than along the original coordinates.
Figure 1.
Positive quadratic energy bowl and elliptical level curves
. Details.
The real and complex settings require different symmetry assumptions. For a real symmetric matrix use with ; for a complex Hermitian matrix use with , where is the conjugate transpose. The latter expression is real, so strict positivity is meaningful. A complex quadratic form such as has no such positivity: it vanishes at and takes negative real values at . A Hermitian form uses complex conjugation, which changes this example to .
For a real matrix without a symmetry hypothesis, its quadratic form depends only on its symmetric part of a matrix:
Positive eigenvalues of alone do not establish positive definiteness of this quadratic form. For example, has both eigenvalues equal to , yet . The relevant test is positivity of the symmetric part of a matrix, not the spectrum of an arbitrary matrix.[ref]
Quadratic lower bound for a nonsymmetric matrix Created 2026-10-18 Updated 2026-10-25
Let be a real square matrix and suppose for every real vector , with . The Cauchy-Schwarz inequality gives , hence for all . In particular the kernel is zero, so is an invertible matrix. Applying the bound to gives the operator norm estimate in the Euclidean norm.
Symmetry of is unnecessary: for its symmetric part of a matrix . Thus the hypothesis is exactly a positive lower bound on that symmetric matrix, even when the antisymmetric part is nonzero.
For a real orthogonal matrix , . If for a nonzero complex eigenvector, then . Therefore the same eigenvector has eigenvalue for the symmetric part of a matrix . Orthogonality implies , so writing gives . The complete complex orthonormal eigenbasis of an orthogonal matrix shows that all the eigenvalues of its symmetric part lie in .