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 .
Hermitian form Created 2026-09-24 Updated 2026-10-14
A Hermitian form is a sesquilinear form on a complex vector space satisfying conjugate symmetry,
Hence is a real number for every vector. In a basis, the matrix of a Hermitian form has and obeys , equivalently : it is a Hermitian matrix. The coordinate rule remains . Conjugate symmetry does not imply positivity.[ref]
The diagonal contains more information than might be expected. For any complex sesquilinear form , put . Expanding four expressions gives the complex polarization identity in the linear-first convention:
This is an algebraic identity, with no positivity assumption. If every is real, interchanging preserves the first difference and negates the second: use for . The identity then gives . Thus a complex sesquilinear form is a Hermitian form if and only if all its diagonal values are real. Testing only the basis vectors is insufficient: the off-diagonal example in sesquilinear form has zero diagonal entries in its matrix but a nonreal value at .
Consider the indefinite Hermitian form
Its values at are . Moreover and are nonzero isotropic vectors: , yet . These vectors do not belong to the radical of a Hermitian form, and the usual Cauchy-Schwarz inequality would incorrectly require . An indefinite Hermitian form records signed geometry rather than defining a norm by .
There is a separate boundary case: is a positive semidefinite Hermitian form, since , but . Its radical of a Hermitian form is the entire second coordinate line. Positive definiteness is exactly the additional condition in a Hermitian inner product. The three examples below show why these distinctions matter: on the real slice , has an ellipse as its unit level, has hyperbolas, and has two parallel lines. These are slices of the complex examples, not drawings of their full four-dimensional domains.
Figure 1.
Analytical illustration: real slices of positive definite, indefinite, and positive semidefinite Hermitian forms
. Details.
In a two-dimensional nondegenerate Hermitian form over a quadratic finite field, choose an orthonormal basis and with . Then is an isotropic vector. Choose with , and choose with . The vector satisfies and . Thus give the displayed matrix, including in characteristic two. Iterating on nondegenerate orthogonal complement for a sesquilinear form leaves only a unit-norm line in odd dimension.
Nondegenerate bilinear form Created 2026-09-24 Updated 2026-10-14
A bilinear form is nondegenerate when its left radical and right radical are both zero: every nonzero vector can be detected by some pairing, whichever input slot it occupies. On a finite-dimensional vector space, either condition implies the other, and the following tests are equivalent:
Here is the matrix of a bilinear form, and is the dual space. The linear map has matrix in the chosen basis and its dual basis, so its kernel is the right radical. The map has matrix . An invertible matrix has zero kernel on both sides, proving the finite-dimensional equivalence. In infinite dimensions, zero left radical and right radical imply these maps are injective, but do not generally make them surjective.[ref]
For the real symmetric bilinear form , the determinant is . Its isotropic vector has zero self-pairing but pairs to with , so it is detected. The alternating bilinear form with matrix has determinant and detects every nonzero vector even though all self-pairings vanish. Neither zero self-pairings nor the absence of positive definiteness implies degeneracy.
Nondegeneracy is useful because it turns a linear functional into a unique vector. For , the linear functional is ; solving for that representing vector amounts to solving an invertible system of linear equations. The analogous identification underlies bilinear orthogonal complements and the dual isomorphisms induced by a nondegenerate pairing.
The group of invertible linear maps preserving a specified quadratic form over a finite field. In characteristic two one must preserve the quadratic form itself, not merely its polar alternating bilinear form. For a nonsingular form, any two nonzero isotropic vectors can be incorporated into hyperbolic pairs and standard adapted bases, producing an isometry between them.
No. On the real vector space , use the symmetric bilinear form
Its matrix of a bilinear form is , whose determinant is , so it is a nondegenerate bilinear form. Let
A vector belongs to the bilinear orthogonal complement exactly when . Hence
In particular, the claimed direct sum fails. The isotropic vector has zero self-pairing, although it pairs nontrivially with other vectors of .
The dimension identity in part (i) counts both vector subspaces but does not force their intersection of vector subspaces to be zero. For a symmetric bilinear form, is the radical of a bilinear form restricted to . Thus the precise criterion is
Indeed, trivial intersection of vector subspaces and part (i) give a sum of vector subspaces of dimension . A positive-definite bilinear form would guarantee this for every ; symmetry alone does not.
We construct a Hermitian hyperbolic plane over a finite field inside each successive two-dimensional piece. By the field norm surjectivity proved above, choose with . From two vectors in an orthonormal basis, form . Then , so is a nonzero isotropic vector. Nondegeneracy supplies with ; rescaling the second argument achieves this normalization. In fact already works in this two-dimensional piece. By quadratic finite-field norm and trace surjectivity, choose with and put . Direct expansion gives
Thus are linearly independent, and their Gram matrix is , which is invertible even in characteristic two. Their span is nondegenerate, so its orthogonal complement for a sesquilinear form is again nondegenerate. Repeat the construction there. In even dimension this exhausts ; in odd dimension the final one-dimensional complement has a nonzero diagonal value, which can be normalized to one using the field norm. Calling its vector , we obtain
with the terms present only in odd dimension. This proves all the requested pairings and the basis assertion.
The printed hint needs a qualification. If is irreducible over , its two roots are conjugate, so and ; the hinted vectors then do work. They need not work when it splits. For example, over its roots are , fixed by conjugation in . For either choice the proposed has norm , respectively or , rather than zero. The norm-and-trace construction above proves the assertion without that restriction.
A finite two-transitive group action is transitive on ordered pairs of distinct points. Equivalently, the action is transitive and a point stabilizer subgroup is transitive on the remaining points. Its rank of a transitive permutation group is two, and the orbit-stabilizer theorem gives for degree . Such an action is primitive: a block containing a point and another point must, by the transitivity of the stabilizer subgroup, contain every point.
These groups illustrate two quite different sources of symmetry. The structural theorem for finite two-transitive groups says that they have either a regular elementary-abelian normal subgroup, giving the affine case, or a nonabelian simple normal subgroup, giving the almost simple case. The full classification of the second case depends on the classification of finite simple groups; the useful point here is to describe the constructions, actions, and representative families rather than treat two-transitivity as an abstract property of a group without a specified action.
In the affine case let be a finite vector space over and let act transitively on . The affine two-transitive group
is transitive by translations, and the stabilizer subgroup of zero is exactly , so it is two-transitive. Conversely, if a two-transitive group has an abelian minimal normal subgroup , normal-subgroup orbits and primitivity make transitive. An abelian transitive faithful permutation subgroup is regular: an element fixing one point commutes with every element moving that point and hence fixes them all. Minimal normality makes elementary abelian, since its prime-primary subgroups and its subgroup of pth powers are characteristic. Conjugation by the stabilizer subgroup acts faithfully as linear automorphisms of , and regularity gives . This recovers precisely the construction above.
Many examples follow at once. The group acts on the vectors of ; sends any nonzero vector to any other by a basis map. For , the subgroup also gives a two-transitive action, since the determinant of a basis map can be adjusted on a second basis vector while retaining the prescribed first vector. The affine group with linear part gives another family: the nonzero-vector transitivity was proved using symplectic transvections in part 4(ii). Here the additive group of , for , is an elementary abelian p-group of rank .
In particular consists of with . Given distinct and distinct , the equations , have the unique solution , . Thus this action is sharply two-transitive, of degree and order . Adding field automorphisms gives , still two-transitive, with elements .
An almost simple group lies between a nonabelian simple group and its automorphism group. One must still specify an action: a group can have several permutation representations with different degrees or different transitivity properties. The natural actions of for and for are the most familiar examples of a two-transitive group action. For , the simple group , a normal subgroup, places these groups in the almost simple case; the smaller two-transitive examples belong to the affine case. The symmetric group sends any ordered distinct pair to any other; for the alternating group one can adjust an odd map by swapping two letters outside the target pair. Thus both are two-transitive in the indicated ranges.
The projective linear examples are just as concrete. The groups and act two-transitively on
points, by the basis and determinant adjustment argument of part 4(i). Their field-automorphism extensions are also two-transitive. On the projective line, is sharply three-transitive: three distinct points determine a unique Möbius transformation. Its degree is and its order is . For even , ; for odd the special projective group has half that order and remains two-transitive, but cannot be three-transitive. In projective dimension at least two, triples of distinct points may be collinear or noncollinear, so the natural action is not three-transitive.
The projective special unitary group over a finite field , for , acts on the isotropic points of a space with a nondegenerate Hermitian form of dimension three over . Its degree and order are
For two distinct isotropic lines the Hermitian form pairing is nonzero, since a three-dimensional nondegenerate Hermitian space has maximal totally isotropic dimension one. Scale their representatives to form a hyperbolic pair and extend to a basis adapted to the Hermitian form. The corresponding isometry sends one ordered pair to another, and a norm-one scalar on the orthogonal one-dimensional complement adjusts its determinant without moving the two lines. Thus the special projective unitary action is two-transitive.
Two further families of simple groups have analogous rank-two actions:
The Suzuki group of Lie type and the Ree group of type G2 have stabilizer subgroups containing subgroups acting regularly on all the other points in these actions; this gives two-transitivity. For example has degree 65 and order 29120. These are exceptional Lie-type families, distinct from the preceding linear and unitary constructions.
The symplectic group over a finite field in characteristic two has a particularly illuminating pair of two-transitive actions which are not their projective-vector actions. For , acts on the two classes of quadratic forms whose polar form is the given alternating bilinear form, distinguished by the Arf invariant of a quadratic form. Their degrees are
Transitivity on each class follows by choosing symplectic bases giving the standard quadratic-form normal forms. Fix a form . Every other form with the same polar form is , and has the same Arf invariant of a quadratic form exactly when . The stabilizer subgroup of , an orthogonal group over a finite field, is transitive on its nonzero isotropic vectors: extend such a vector to a hyperbolic pair and map adapted quadratic-form bases. It is therefore transitive on the other forms of the same type. This proves two-transitivity of both actions. In particular has actions of degrees 28 and 36. The degree-six action of in part 4(ii) is the smaller-dimensional precursor.
Finally the Mathieu groups supply exceptional examples with even higher transitivity:
In particular all five natural actions are two-transitive. Together these examples exhibit affine spaces, projective and Hermitian geometries, symplectic quadratic forms, and exceptional finite simple groups as different sources of the same pair symmetry.
The organizing distinction is affine versus almost simple; the action, its degree, and its stabilizer subgroup are essential data. The explicitly verified affine, symmetric, alternating, projective, unitary, and symplectic actions already give many infinite families, while the exceptional families show why no single matrix construction covers every example.
Associate to the symmetric bilinear form . If is identically zero, every basis is diagonal. Otherwise choose with . Every has the decomposition
whose second term lies in . Thus , with no cross term in . Induction on dimension gives a diagonal basis. Rescaling its nonzero entries reduces the form to
with additional zero coordinates. Define the rank of a quadratic form and its signature . Rank is intrinsic, since it is the rank of , equivalently . Also is the greatest dimension of a subspace on which the restriction of is a positive-definite quadratic form: any such subspace intersects the negative-plus-zero coordinate space only at zero, so its dimension is at most , while the positive coordinate space attains . The corresponding negative statement identifies . This proves the basis independence of and , the Sylvester's law of inertia conclusion.
For a totally isotropic subspace on which vanishes, polarization identity also makes vanish on . Quotient by the radical of a bilinear form. In the resulting nondegenerate form, projection of an isotropic subspace to either the positive or negative coordinate space is injective, so its dimension is at most . Consequently . The radical of a bilinear form together with the vectors , , attains this bound. The maximum dimension of a totally isotropic subspace is therefore
The criterion for membership in a diagonal basis follows similarly: a nonzero vector can belong to a diagonal basis if it has nonzero quadratic value, by the same orthogonal splitting, or if it lies in the radical of a bilinear form, by choosing a radical basis containing it. An isotropic vector in a diagonal basis must be orthogonal to every basis vector, and hence must lie in that radical. For the specified form, its radical is the -axis, giving exactly
The zero vector never belongs to a basis.
Let satisfy for every vector . If there is nothing to prove. Otherwise choose with . For every and every real number ,
so the hypothesis gives . Taking two values of shows that . Since
we obtain . Thus one of the two linear functionals is zero.
Sylvester's law of inertia says that, in a suitable basis, every real quadratic form is
The rank is , and the signature is ; both are independent of the chosen basis.
If , its polar form has image contained in , so . If , the two functionals must be independent and, after taking their sum and difference, is a difference of two squares. Hence . If , then . In every case,
Conversely, this inequality leaves only
up to a linear change of coordinates. These factor respectively as , , and . Therefore
Finally suppose that takes both positive and negative values. Sylvester's law supplies normalized basis vectors
with , , and the spanning the radical. The vectors
are linearly independent and all satisfy . They form the required basis of isotropic vectors.
The symmetric bilinear form associated with a real quadratic form is obtained by polarization identity:
In coordinates , replacing by its symmetric part does not change , and the formula gives ; this proves existence. A symmetric form is positive semidefinite when for every , and positive definite when the inequality is strict for every .
The diagonalization theorem for real quadratic forms says that some basis puts any symmetric form into
with further zero coordinates. Sylvester's law of inertia says that is independent of the diagonalizing basis. To prove this, let be the span of the positive coordinate vectors and let be the span of the negative and zero vectors. If is positive definite for another diagonalization and , then
so the two spaces intersect nontrivially. A vector in the intersection would have both positive and nonpositive square, a contradiction. Thus ; symmetry gives . Applying the same argument to gives , and then .
For the nondegenerate form on , write its inertia as , so . The restriction vanishes identically on : polarization gives for . Projection of to the positive coordinate space is injective, since a vector with zero positive projection cannot be isotropic unless it is zero. Hence ; projection to the negative space likewise gives . Therefore .
The matrix of is . If , it has rank one and inertia , hence signature one; if , its rank and signature are zero. The coefficientwise product has matrix , where , so it has the same rank-one conclusion when and is zero otherwise.
Finally, diagonalization writes every positive semidefinite form as a sum of squares, say and . Bilinearity of coefficientwise multiplication gives
a sum of positive semidefinite rank-at-most-one forms. Thus is positive semidefinite.
Symmetric bilinear form Created 2026-10-03 Updated 2026-10-14
A bilinear form is symmetric when for every pair of vectors . Equivalently, its matrix of a bilinear form in any basis is a symmetric matrix, since . Symmetry makes the relation reciprocal, giving the bilinear orthogonal complement a geometric interpretation.
Over the real numbers, set . The polarization identity
recovers the symmetric bilinear form from its quadratic form: expand and use symmetry to combine the two cross terms. For , take and . Then , , and , so . The same formula works whenever the characteristic is not two.[ref]
Three real diagonal matrices show how much variety symmetry allows. The identity matrix gives the positive-definite bilinear form . The matrix gives and is nondegenerate despite the isotropic vector . The matrix gives and is a degenerate bilinear form with radical of a bilinear form . Their level sets make the distinction visible: a circle, two branches of a hyperbola, and two parallel lines for .
Figure 1.
Unit and zero level sets distinguish positive, indefinite nondegenerate, and degenerate symmetric forms
. Details.
The inertia of a bilinear form records the numbers of positive, negative, and zero directions after matrix congruence diagonalization. By Sylvester's law of inertia, these counts survive change of basis; the three examples have inertia of a bilinear form , , and . Historically, Sylvester stated this invariance in an 1852 paper on reducing real quadratic forms to sums of positive and negative squares. Ghys and Ranicki reproduce his statement and distinguish it from his subsequent 1853 proof.[ref]