Skip to content

Chapter 102. Bilinear Forms

A bilinear form is a scalar-valued bilinear map. It takes two vector inputs and returns a scalar, while remaining linear in each input separately.

Bilinear forms generalize dot products, inner products, area forms, symplectic forms, and quadratic forms. They provide a bridge between linear algebra, geometry, and tensor theory. In finite dimensions, a bilinear form is represented by a matrix once a basis is chosen. The same form may then be studied through algebraic equations, geometric orthogonality, and matrix invariants. A bilinear form on a vector space VV over a field FF is commonly defined as a map V×VFV \times V \to F that is linear in each coordinate.

102.1 Definition

Let VV be a vector space over a field FF.

A bilinear form on VV is a map

B:V×VF B : V \times V \to F

such that BB is linear in each argument separately.

Thus, for all u,u1,u2,v,v1,v2Vu,u_1,u_2,v,v_1,v_2\in V and all scalars a,bFa,b\in F,

B(au1+bu2,v)=aB(u1,v)+bB(u2,v), B(au_1+bu_2,v) = aB(u_1,v)+bB(u_2,v),

and

B(u,av1+bv2)=aB(u,v1)+bB(u,v2). B(u,av_1+bv_2) = aB(u,v_1)+bB(u,v_2).

The first identity says that BB is linear in the first argument. The second says that BB is linear in the second argument.

The value B(u,v)B(u,v) is often called the pairing of uu and vv.

102.2 Examples

The standard dot product on Rn\mathbb{R}^n is a bilinear form:

B(u,v)=uv. B(u,v)=u\cdot v.

In coordinates,

B(u,v)=u1v1++unvn. B(u,v) = u_1v_1+\cdots+u_nv_n.

Another example on R2\mathbb{R}^2 is

B(u,v)=u1v2u2v1. B(u,v)=u_1v_2-u_2v_1.

If

u=[u1u2],v=[v1v2], u= \begin{bmatrix} u_1\\ u_2 \end{bmatrix}, \qquad v= \begin{bmatrix} v_1\\ v_2 \end{bmatrix},

then

B(u,v)=u1v2u2v1. B(u,v) = u_1v_2-u_2v_1.

This is the determinant of the 2×22\times 2 matrix with columns uu and vv. It measures signed area.

The two examples behave differently. The dot product is symmetric. The signed area form changes sign when the two inputs are exchanged.

102.3 Matrix Representation

Let VV have basis

e1,,en. e_1,\ldots,e_n.

A bilinear form BB is determined by the scalars

bij=B(ei,ej). b_{ij}=B(e_i,e_j).

These scalars form the matrix

A=[b11b12b1nb21b22b2nbn1bn2bnn]. A= \begin{bmatrix} b_{11} & b_{12} & \cdots & b_{1n}\\ b_{21} & b_{22} & \cdots & b_{2n}\\ \vdots & \vdots & \ddots & \vdots\\ b_{n1} & b_{n2} & \cdots & b_{nn} \end{bmatrix}.

If

u=ixiei,v=jyjej, u= \sum_i x_i e_i, \qquad v= \sum_j y_j e_j,

then bilinearity gives

B(u,v)=i,jxiyjB(ei,ej). B(u,v) = \sum_{i,j} x_i y_j B(e_i,e_j).

In matrix notation,

B(u,v)=xTAy. B(u,v)=x^T A y.

Here xx and yy are the coordinate column vectors of uu and vv.

Thus every bilinear form on a finite-dimensional vector space is represented by a matrix.

102.4 Dependence on Basis

The matrix of a bilinear form depends on the chosen basis.

Suppose AA is the matrix of BB in one basis, and suppose a change of basis is given by an invertible matrix PP. Then the matrix in the new basis is

A=PTAP. A' = P^T A P.

This transformation differs from similarity transformation

A=P1AP. A' = P^{-1}AP.

Similarity is used for linear maps. Congruence,

A=PTAP, A' = P^TAP,

is used for bilinear forms.

This distinction is important. Bilinear forms are classified by congruence, not by similarity.

102.5 Symmetric Bilinear Forms

A bilinear form BB is symmetric if

B(u,v)=B(v,u) B(u,v)=B(v,u)

for all u,vVu,v\in V.

In matrix form, this means

AT=A. A^T=A.

The dot product is symmetric:

uv=vu. u\cdot v=v\cdot u.

Symmetric bilinear forms are central in geometry because they define notions of length, angle, orthogonality, and curvature.

If a symmetric bilinear form is positive definite over R\mathbb{R}, then it is an inner product.

102.6 Alternating Bilinear Forms

A bilinear form BB is alternating if

B(v,v)=0 B(v,v)=0

for every vVv\in V.

Alternating forms encode oriented area rather than length.

For example,

B(u,v)=u1v2u2v1 B(u,v)=u_1v_2-u_2v_1

is alternating because

B(u,u)=u1u2u2u1=0. B(u,u)=u_1u_2-u_2u_1=0.

Over fields whose characteristic is not 22, alternating forms satisfy

B(u,v)=B(v,u). B(u,v)=-B(v,u).

Thus swapping the inputs reverses the sign.

In matrix form, an alternating bilinear form has a skew-symmetric matrix with zero diagonal entries.

102.7 Skew-Symmetric Forms

A bilinear form BB is skew-symmetric if

B(u,v)=B(v,u) B(u,v)=-B(v,u)

for all u,vVu,v\in V.

Every alternating form is skew-symmetric. If the field has characteristic not equal to 22, the converse also holds. This distinction matters over fields of characteristic 22, where signs behave differently.

The matrix of a skew-symmetric form satisfies

AT=A. A^T=-A.

For real vector spaces, skew-symmetric forms appear in mechanics, symplectic geometry, and Hamiltonian systems.

102.8 Orthogonality

A bilinear form defines an orthogonality relation.

Vectors u,vVu,v\in V are orthogonal with respect to BB if

B(u,v)=0. B(u,v)=0.

This generalizes the usual perpendicularity defined by the dot product.

However, for general bilinear forms, orthogonality may fail to be symmetric. It may happen that

B(u,v)=0 B(u,v)=0

but

B(v,u)0. B(v,u)\ne 0.

For symmetric and alternating forms, orthogonality behaves more regularly.

If SVS\subseteq V, its orthogonal complement is

S={vV:B(s,v)=0 for all sS}. S^\perp = \{v\in V : B(s,v)=0\text{ for all }s\in S\}.

For non-symmetric forms, one must distinguish left and right orthogonal complements.

102.9 Radical

The right radical of BB is

radR(B)={vV:B(u,v)=0 for all uV}. \operatorname{rad}_R(B) = \{v\in V : B(u,v)=0\text{ for all }u\in V\}.

The left radical is

radL(B)={uV:B(u,v)=0 for all vV}. \operatorname{rad}_L(B) = \{u\in V : B(u,v)=0\text{ for all }v\in V\}.

If BB is symmetric or alternating, these two radicals coincide. The common radical is denoted

rad(B). \operatorname{rad}(B).

A vector in the radical is invisible to the form. It pairs to zero with every vector.

102.10 Nondegenerate Forms

A bilinear form is nondegenerate if its radical is zero.

Equivalently, for every nonzero uVu\in V, there exists vVv\in V such that

B(u,v)0. B(u,v)\ne 0.

In finite dimensions, if AA is the matrix of BB, then BB is nondegenerate exactly when

detA0. \det A\ne 0.

Thus nondegeneracy of a bilinear form corresponds to invertibility of its matrix. This condition does not depend on the chosen basis.

The standard dot product on Rn\mathbb{R}^n is nondegenerate. The zero form is maximally degenerate.

102.11 Bilinear Forms and Dual Spaces

Every bilinear form defines a linear map

ΦB:VV \Phi_B : V \to V^*

by

ΦB(u)(v)=B(u,v). \Phi_B(u)(v)=B(u,v).

Thus a vector uu is sent to the linear functional

vB(u,v). v\mapsto B(u,v).

The form BB is nondegenerate exactly when ΦB\Phi_B is an isomorphism in finite dimensions.

This identifies VV with its dual space VV^*, but the identification depends on BB. Different bilinear forms produce different identifications.

102.12 Quadratic Forms

A quadratic form is a function

Q:VF Q : V \to F

that can be written as

Q(v)=B(v,v) Q(v)=B(v,v)

for some bilinear form BB.

If BB is represented by a matrix AA, then

Q(x)=xTAx. Q(x)=x^TAx.

Only the symmetric part of AA contributes to QQ when the field has characteristic not equal to 22. Indeed,

xTAx=xT(A+AT2)x. x^TAx = x^T\left(\frac{A+A^T}{2}\right)x.

Thus quadratic forms are naturally associated with symmetric bilinear forms in the usual real and complex settings.

Examples include:

Quadratic formMatrix
x2+y2x^2+y^2[1001]\begin{bmatrix}1&0\\0&1\end{bmatrix}
x2y2x^2-y^2[1001]\begin{bmatrix}1&0\\0&-1\end{bmatrix}
2xy2xy[0110]\begin{bmatrix}0&1\\1&0\end{bmatrix}

102.13 Positive Definite Forms

Over R\mathbb{R}, a symmetric bilinear form BB is positive definite if

B(v,v)>0 B(v,v)>0

for every nonzero vVv\in V.

Positive definite symmetric bilinear forms are exactly real inner products.

They define norms by

v=B(v,v). \|v\|=\sqrt{B(v,v)}.

They also define angles through

cosθ=B(u,v)B(u,u)B(v,v). \cos\theta = \frac{B(u,v)} {\sqrt{B(u,u)}\sqrt{B(v,v)}}.

Positive definiteness is stronger than nondegeneracy. A positive definite form is nondegenerate, but a nondegenerate form may have both positive and negative directions.

102.14 Indefinite Forms

A symmetric bilinear form is indefinite if it takes both positive and negative values on diagonal inputs.

For example, on R2\mathbb{R}^2,

B(u,v)=u1v1u2v2 B(u,v)=u_1v_1-u_2v_2

has

B(e1,e1)=1 B(e_1,e_1)=1

and

B(e2,e2)=1. B(e_2,e_2)=-1.

The associated quadratic form is

Q(x,y)=x2y2. Q(x,y)=x^2-y^2.

Indefinite forms occur in relativity, hyperbolic geometry, and optimization. They define geometry, but not Euclidean distance.

102.15 Signature

For a real symmetric bilinear form, a suitable basis can diagonalize the form as

B(x,y)=x1y1++xpypxp+1yp+1xp+qyp+q. B(x,y) = x_1y_1+\cdots+x_py_p - x_{p+1}y_{p+1} -\cdots- x_{p+q}y_{p+q}.

There may also be zero directions if the form is degenerate.

The triple

(p,q,r) (p,q,r)

is called the inertia of the form, where:

SymbolMeaning
ppNumber of positive squares
qqNumber of negative squares
rrNumber of zero directions

For nondegenerate forms, r=0r=0. The pair (p,q)(p,q) is called the signature.

Sylvester’s law of inertia states that these numbers are invariant under change of basis.

102.16 Symplectic Forms

A symplectic form is a nondegenerate alternating bilinear form.

The standard symplectic form on R2n\mathbb{R}^{2n} is

ω(u,v)=uTJv, \omega(u,v)=u^T J v,

where

J=[0InIn0]. J= \begin{bmatrix} 0 & I_n\\ -I_n & 0 \end{bmatrix}.

This matrix satisfies

JT=J. J^T=-J.

Symplectic forms appear in Hamiltonian mechanics. They measure oriented phase-space area rather than length.

Unlike inner products, symplectic forms satisfy

ω(v,v)=0 \omega(v,v)=0

for every vector vv.

102.17 Change of Coordinates

Let BB have matrix AA in basis e1,,ene_1,\ldots,e_n.

If a vector has old coordinates xx and new coordinates xx', with

x=Px, x=Px',

then

B(u,v)=xTAy. B(u,v)=x^TAy.

Substituting x=Pxx=Px' and y=Pyy=Py', we get

B(u,v)=(x)TPTAPy. B(u,v) = (x')^T P^T A P y'.

Thus the new matrix is

A=PTAP. A'=P^TAP.

This formula explains why bilinear forms are studied under congruence transformations.

102.18 Example

Let V=R2V=\mathbb{R}^2, and define

B(u,v)=2u1v1+u1v2+u2v1+3u2v2. B(u,v)=2u_1v_1+u_1v_2+u_2v_1+3u_2v_2.

Then

A=[2113]. A= \begin{bmatrix} 2 & 1\\ 1 & 3 \end{bmatrix}.

Thus

B(u,v)=uTAv. B(u,v)=u^TAv.

For

u=[12],v=[31], u= \begin{bmatrix} 1\\ 2 \end{bmatrix}, \qquad v= \begin{bmatrix} 3\\ -1 \end{bmatrix},

compute

Av=[2113][31]=[50]. Av= \begin{bmatrix} 2 & 1\\ 1 & 3 \end{bmatrix} \begin{bmatrix} 3\\ -1 \end{bmatrix} = \begin{bmatrix} 5\\ 0 \end{bmatrix}.

Therefore,

B(u,v)=[12][50]=5. B(u,v) = \begin{bmatrix} 1 & 2 \end{bmatrix} \begin{bmatrix} 5\\ 0 \end{bmatrix} = 5.

The associated quadratic form is

Q(x,y)=2x2+2xy+3y2. Q(x,y)=2x^2+2xy+3y^2.

Since

detA=5>0 \det A=5>0

and the leading entry is positive, this form is positive definite.

102.19 Summary

Bilinear forms are scalar-valued maps that are linear in two arguments.

ConceptMeaning
Bilinear formMap V×VFV\times V\to F, linear in each input
Matrix representationB(u,v)=xTAyB(u,v)=x^TAy
Symmetric formB(u,v)=B(v,u)B(u,v)=B(v,u)
Alternating formB(v,v)=0B(v,v)=0
Nondegenerate formZero radical
Quadratic formQ(v)=B(v,v)Q(v)=B(v,v)
Symplectic formNondegenerate alternating form

Bilinear forms make it possible to define orthogonality, length-like quantities, area-like quantities, dual-space identifications, and quadratic expressions. They are one of the main algebraic structures connecting linear algebra with geometry.