Orthogonality Depends on the Form
For the usual dot product, the statement that two vectors are orthogonal does not depend on their order. A general bilinear form need not have that property. Its value on \((\mathbf{x},\mathbf{y})\) may differ from its value on \((\mathbf{y},\mathbf{x})\), so it is useful to distinguish which argument is being varied. The vectors that pair to zero with every vector form the radical, or, for a nonsymmetric form, the left and right radicals. These ideas can be studied by solving homogeneous matrix equations.
Throughout this tutorial, \(V=\mathbb{R}^n\) is finite-dimensional, and \(B:V\times V\to\mathbb{R}\) is a bilinear form: it is linear in each argument when the other is held fixed. In the standard basis, there is a matrix \(\mathbf{A}\in\mathbb{R}^{n\times n}\) such that \(B(\mathbf{x},\mathbf{y})=\mathbf{x}^{\top}\mathbf{A}\mathbf{y}\). The matrix need not be symmetric. The form is symmetric when \(B(\mathbf{x},\mathbf{y})=B(\mathbf{y},\mathbf{x})\) for all \(\mathbf{x},\mathbf{y}\), equivalently when \(\mathbf{A}^{\top}=\mathbf{A}\).
The labels record which argument is fixed as the vector in the radical: the left radical occupies the first argument, and the right radical occupies the second. For a symmetric form the two radicals coincide, but that is not true for an arbitrary bilinear form. Likewise, for a nonsymmetric form, \(B(\mathbf{x},\mathbf{y})=0\) does not in general imply \(B(\mathbf{y},\mathbf{x})=0\).
Radicals as Matrix Equations
Proof. Fix \(\mathbf{x}\in V\). It belongs to the left radical exactly when \(\mathbf{x}^{\top}\mathbf{A}\mathbf{y}=0\) for every \(\mathbf{y}\in V\). Since \(\mathbf{x}^{\top}\mathbf{A}\mathbf{y}=(\mathbf{A}^{\top}\mathbf{x})^{\top}\mathbf{y}\), this holds exactly when \(\mathbf{A}^{\top}\mathbf{x}=\mathbf{0}\): if this vector is zero, every product is zero; if it is nonzero, choosing \(\mathbf{y}=\mathbf{A}^{\top}\mathbf{x}\) gives the positive number \(\|\mathbf{A}^{\top}\mathbf{x}\|^2\), not zero. Thus \(\operatorname{Rad}_L(B)=\operatorname{Nul}(\mathbf{A}^{\top})\). Similarly, \(\mathbf{y}\) belongs to the right radical exactly when \(\mathbf{x}^{\top}\mathbf{A}\mathbf{y}=0\) for every \(\mathbf{x}\). This holds exactly when \(\mathbf{A}\mathbf{y}=\mathbf{0}\), by choosing \(\mathbf{x}=\mathbf{A}\mathbf{y}\) if that vector is nonzero. Hence \(\operatorname{Rad}_R(B)=\operatorname{Nul}(\mathbf{A})\). Each null space is a subspace, so both radicals are subspaces. \(\square\)
This result gives a practical distinction: use \(\mathbf{A}^{\top}\mathbf{x}=\mathbf{0}\) for the left radical and \(\mathbf{A}\mathbf{y}=\mathbf{0}\) for the right radical. Row-reducing \(\mathbf{A}\) answers the right-radical question; row-reducing \(\mathbf{A}^{\top}\) answers the left-radical question. If \(B\) is symmetric, these equations are the same.
Proof. The matrix equations show that the right radical is \(\operatorname{Nul}(\mathbf{A})\) and the left radical is \(\operatorname{Nul}(\mathbf{A}^{\top})\). By the Invertible Matrix Theorem for square matrices, \(\operatorname{Nul}(\mathbf{A})=\{\mathbf{0}\}\) exactly when \(\mathbf{A}\) is invertible. The transpose of an invertible matrix is invertible, since \((\mathbf{A}^{-1})^{\top}\mathbf{A}^{\top}=(\mathbf{A}\mathbf{A}^{-1})^{\top}=\mathbf{I}_n\); the reverse implication follows by applying the same fact to \(\mathbf{A}^{\top}\). Thus \(\mathbf{A}\) is invertible exactly when both null spaces are trivial. This proves all the stated equivalences. \(\square\)
Finding Radicals in Examples
Worked Example: A Nondegenerate Symmetric Form
Let \(B(\mathbf{x},\mathbf{y})=\mathbf{x}^{\top}\mathbf{A}\mathbf{y}\) on \(\mathbb{R}^2\), where $$ \mathbf{A}=\begin{bmatrix}2&1\\1&1\end{bmatrix}. $$ Find both radicals and determine whether \(B\) is nondegenerate.
The matrix is symmetric, so the left- and right-radical equations are the same. Row-reduce \(\mathbf{A}\):
The equation \(\mathbf{A}\mathbf{y}=\mathbf{0}\) therefore has only \(\mathbf{y}=\mathbf{0}\). Because \(\mathbf{A}^{\top}=\mathbf{A}\), the left-radical equation has only \(\mathbf{x}=\mathbf{0}\) as well. Both radicals are trivial, so the form is nondegenerate.
Check: For the only proposed radical vector, \(\mathbf{A}\mathbf{0}=\mathbf{0}\) and \(\mathbf{A}^{\top}\mathbf{0}=\mathbf{0}\). The row reduction also shows there can be no nonzero solution to either homogeneous system.
Worked Example: A Degenerate Symmetric Form
Let $$ \mathbf{A}=\begin{bmatrix}1&2&0\\2&4&0\\0&0&0\end{bmatrix}. $$ Find the left and right radicals of the associated form on \(\mathbb{R}^3\).
Since \(\mathbf{A}^{\top}=\mathbf{A}\), the two radical equations agree. Reduce the matrix:
Writing \(\mathbf{y}=(y_1,y_2,y_3)^{\top}\), the system \(\mathbf{A}\mathbf{y}=\mathbf{0}\) reduces to \(y_1+2y_2=0\). Thus \(y_1=-2y_2\), while \(y_2\) and \(y_3\) are free. Every solution has the form $$ \mathbf{y}=y_2\begin{bmatrix}-2\\1\\0\end{bmatrix} +y_3\begin{bmatrix}0\\0\\1\end{bmatrix}. $$
Therefore \(\operatorname{Rad}_R(B)=\operatorname{Rad}_L(B)=\operatorname{span}\{(-2,1,0)^{\top},(0,0,1)^{\top}\}\), and the form is degenerate.
Check: Multiplying each displayed spanning vector by \(\mathbf{A}\) gives $$ \begin{bmatrix}1&2&0\\2&4&0\\0&0&0\end{bmatrix} \begin{bmatrix}-2\\1\\0\end{bmatrix} =\begin{bmatrix}0\\0\\0\end{bmatrix},\qquad \begin{bmatrix}1&2&0\\2&4&0\\0&0&0\end{bmatrix} \begin{bmatrix}0\\0\\1\end{bmatrix} =\begin{bmatrix}0\\0\\0\end{bmatrix}. $$ The matrix is symmetric, so these checks also verify the left-radical equation.