Anisotropic vector for a form 2026-10-14
A vector is anisotropic for a quadratic form if , and for a Hermitian form if . The complementary zero-value condition is isotropy. For a symmetric bilinear form in odd characteristic of a field, this agrees with the associated quadratic form. A nondegenerate alternating bilinear form has all self-pairings zero, so nondegeneracy must not be confused with the existence of anisotropic vectors.
BDF2 discrete energy identity Created 2026-10-06 Updated 2026-10-14
For three vectors in an inner product space, expansion of each squared norm provesTherefore the second-order backward differentiation formula with a dissipative operator decreases the discrete energy . This quadratic form is equivalent to the product norm of the two time levels with constants independent of and . It proves uniform stability even when amplification roots of a polynomial coalesce inside the unit disk, where an eigenvector-separation proof may lose its bound.
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
Binary quadratic optimization Created 2026-10-06 Updated 2026-10-14
Optimization of a quadratic form over binary choices, here using signs . Lifting turns the objective into a matrix trace; dropping the rank-one condition gives a semidefinite relaxation of binary quadratic optimization.
In a constant-shear Eady model with slopes and , set and . The interior potential vorticity obeys . In the zero-interior-PV subspace, integrating by parts and using the two buoyancy boundary equations proves conservation of the displayed boundary quadratic form. Opposite signs of make it definite and exclude growing normal modes. For arbitrary nonzero interior PV, its derivative is and need not vanish. The restriction to zero interior PV is automatic for a growing smooth mode with complex phase speed.
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.
Butcher contractivity theorem 2026-10-14
An algebraically stable Runge-Kutta method is B-stable: for a dissipative vector field, a well-defined step cannot increase the distance between two starting values. This assumes that the compared stage equations have solutions, as required by stage solvability of an implicit Runge-Kutta method. The Runge-Kutta contractivity identity expresses the distance change as a nonpositive weighted term coming from the dissipative vector field minus a nonnegative quadratic form involving the matrix defining algebraic stability. Positive weights also rule out stage poles in the open left half-plane on the scalar test equation, giving A-stability there; zero-weight redundant stages need separate solvability attention.
Canonical-height lattice-point growth Created 2026-10-03 Updated 2026-10-06
If an elliptic curve over has Mordell-Weil group of rank , then its canonical height of an elliptic curve is a positive-definite quadratic form on the free lattice. Consequently
Cholesky decomposition as a sum of squares Created 2026-10-18 Updated 2026-10-31
For any real vector , a Cholesky decomposition gives the quadratic form identitySince is an invertible matrix, this squared Euclidean norm is positive whenever . The factorization thus certifies positive definiteness and gives coordinates in which the quadratic form is a sum of ordinary squares. For the matrix above,The level set is an ellipse; the linear map sends it to the unit circle. The points and go to and , respectively.
The same factor works in the reverse direction for Gaussian random vectors. If has independent unit-variance, zero-mean Gaussian random variables as coordinates, has covariance matrix . In this example and : their variances are and , while their covariance is . This is a concrete way to generate specified correlations from independent draws.
A triangular factor is not generally a square root of a matrix in the sense . Here . The Cholesky decomposition uses the product with the transpose, which is also what makes the quadratic form a squared Euclidean norm.
Clifford algebra bundle 2026-10-14
A vector bundle with a fibrewise quadratic form defines a bundle whose fibre over is the Clifford algebra . When the polar form is a nondegenerate bilinear form, local orthonormal frames identify its fibres with a fixed Clifford algebra, and orthogonal transition maps induce the algebra transition maps. A Clifford module bundle is a bundle of modules over these algebras, rather than the algebra bundle itself. For a Riemannian manifold, use its cotangent bundle and the metric quadratic form, with the sign convention specified.
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. Common zero of complex quadratic forms 2026-10-14
Any quadratic forms on have a common nonzero zero when . Choose a totally isotropic subspace for the first form, of dimension at least . Restrict the remaining forms to it and repeat by induction. After stages at least one dimension remains. This elementary sufficient bound does not assert that is the best possible threshold.
For the dimensionless quantum harmonic oscillator , use the compactly supported trial on and zero elsewhere, with . It is continuous and belongs to the oscillator energy quadratic form domain: its weak derivative is square-integrable even though its ordinary derivative jumps at the endpoints. Exact integration givesThe minimum occurs at , giving the displayed upper bound, approximately , compared with exact ground state value . This illustrates why Rayleigh-Ritz variational principle trials need the energy form domain rather than the smaller operator domain.
For the dimensionless quantum harmonic oscillator , the normalized compact trial function is on and zero elsewhere. Its kinetic and potential contributions to the energy quadratic form are and . Minimizing their sum gives and the displayed upper bound, approximately , compared with exact ground state eigenvalue . The weak derivative is square-integrable because the trial is continuous at its endpoints. Jumps in the ordinary first derivative do not invalidate the Rayleigh-Ritz variational principle: it requires the energy form domain, rather than the smaller operator domain.
A quadratic form of rank on is congruent to . Pair its nonzero coordinates into vectors , and include the radical of a bilinear form. Their span is a totally isotropic subspace and has dimension . The form vanishes on every vector of this subspace, not merely on its basis vectors.
Along an affinely parametrized geodesic, differentiating the contraction of a vector field with its tangent gives . If this is zero along every timelike geodesic, arbitrary timelike initial tangents at each point make the symmetric quadratic form vanish on the whole timelike cone. That cone is open, so its quadratic polynomial must vanish identically. Thus is a Killing vector. The converse follows directly from the same identity. One selected orbit cannot establish the converse; the quantifier over all initial timelike directions is essential.
Copositive matrix Created 2026-10-05 Updated 2026-10-06
A real symmetric matrix is copositive if its quadratic form satisfies for every in the nonnegative orthant. Every positive semidefinite matrix and every symmetric nonnegative matrix is copositive, as is their sum. The converse fails for the Horn copositive matrix.
Criterion for membership in a diagonal basis 2026-10-05
A vector can be included in a diagonal basis for a real quadratic form precisely when and either its quadratic value is nonzero or it lies in the radical of a bilinear form. A nonzero quadratic value gives the direct splitting and induction. A nonzero radical vector can be included in a radical basis. Conversely, an isotropic vector in a diagonal basis is orthogonal to every basis vector, and must lie in the radical.
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 .


