14.9  Alternating Forms and Darboux Bases

Almost every classification theorem so far in this chapter has carried the same asterisk — the exceptions being the crude invariants of Section 2, rank and the square class of the determinant, which need nothing of the field. Diagonalize a symmetric form: characteristic ≠2. Split a form into a symmetric and an alternating half: characteristic ≠2. Recover a form from its quadratic form: characteristic ≠2. This section has no asterisk. Alternating forms admit a complete classification over every field, with no hypothesis on the characteristic at all, and the classification is as clean as a classification gets: one congruence class for each even rank.

Throughout, F is an arbitrary field, V is a finite-dimensional vector space over F, and β is an alternating bilinear form on V (Definition 7.2.2), meaning β(v,v)=0 for every v∈V. Two facts from Section 3 are used constantly. First, β is then skew-symmetric, β(u,v)=−β(v,u), by Theorem 14.3.3 (a) — and that direction needs no hypothesis on F. Second, by Proposition 14.3.2 (b) the matrix of β in any basis is skew-symmetric with zero diagonal, and we call such a matrix alternating. Symmetry of the situation is worth noting once: since β(u,v)=0 if and only if β(v,u)=0, “orthogonal” needs no left or right, and the radical rad(β) of Definition 14.1.3 is what one would want it to be from either side.

14.9.1. The two-dimensional model

A symmetric form has a one-dimensional model to build from: on a line span(v) it is q(cv)=c2q(v), a scalar multiple of the squaring function, and Section 4 assembled a general symmetric form out of such lines. An alternating form offers nothing on a line at all. For any v and any scalars c,d, β(cv,dv)=cdβ(v,v)=0, so β restricted to any line is zero. The one-dimensional pieces are all identical and all trivial. The smallest place where an alternating form has something to say is a plane, and there is essentially only one thing it can say there.

Example (Alternating Forms on a Plane)

Describe all alternating bilinear forms on F2, and decide which are nondegenerate.

Solution. An alternating 2×2 matrix has zero diagonal and a21=−a12, so it is A=(0a−a0) for a single scalar a∈F, and every such matrix is alternating. By Theorem 14.1.1 the corresponding form is β(x,y)=a(x1y2−x2y1). Its determinant is a2, so by Proposition 14.1.2 the form is nondegenerate exactly when a≠0.

When a≠0, replacing the basis vector e2 by a−1e2 replaces a by 1. So up to a change of basis there are exactly two alternating forms on F2: the zero form and the one with matrix (01−10), whatever the field.

That last matrix is the atom of the theory, and the pair of vectors producing it deserves a name. It is the alternating counterpart of the hyperbolic plane of Section 7: a two-dimensional space carrying a nondegenerate form on which the associated quadratic function vanishes identically. Here the vanishing is automatic, because every alternating form vanishes on the diagonal, so the whole content is in the pairing.

A hyperbolic pair is two vectors that pair to 1 and to nothing else.

Definition 14.9.1 (Hyperbolic Pair)

Let β be an alternating form on V. A hyperbolic pair for β is an ordered pair (u,w) of vectors of V with β(u,w)=1. Its span H=span(u,w) is called a hyperbolic plane for β.

The definition looks as though it asks for one condition, but it quietly supplies three more. Alternation already gives β(u,u)=β(w,w)=0, and skewness gives β(w,u)=−1. So the matrix of β restricted to H in the ordered basis (u,w) is exactly (01−10). Also, u and w are automatically linearly independent: if w=cu then β(u,w)=cβ(u,u)=0≠1, and u≠0 for the same reason. So H really is a plane, dim⁡H=2, and β restricted to H is nondegenerate.

Warning. An alternating form is never diagonalizable, except when it is zero. Section 4 found an orthogonal basis for every symmetric form in characteristic ≠2; no such basis exists here. If B is any basis and [β]BB is diagonal, then its off-diagonal entries vanish by assumption and its diagonal entries vanish because β is alternating, so [β]BB=O and β=0. The standard form below is a block form, and it has to be: the 2×2 block is irreducible.

14.9.2. Splitting off a hyperbolic pair

The move that drives the whole section is the one Section 7 used for isotropic vectors: find a small nondegenerate piece, and cut the space along it. Here the small piece is a hyperbolic plane, and it can always be found as soon as β is not identically zero.

Lemma 14.9.1 (Peeling Off a Hyperbolic Plane)

Let β be an alternating form on a finite-dimensional V, and suppose β≠0.

  • (a) There is a hyperbolic pair (u,w) for β.
  • (b) For any such pair, with H=span(u,w) and H⊥β={v∈V:β(u,v)=β(w,v)=0}, we have V=H⊕H⊥β and dim⁡H⊥β=dim⁡V−2.
  • (c) rad(β)=rad(β|H⊥β). In particular, if β is nondegenerate then so is its restriction to H⊥β.

Idea. For (a), the hypothesis β≠0 hands us two vectors pairing to something nonzero; divide one of them by that scalar. For (b), the two conditions cutting out H⊥β are two linear conditions, so the count should be dim⁡V−2, and Rank–Nullity will say so once we check that the two conditions are independent — which is exactly what β(u,w)=1 provides. Part (c) is the bookkeeping that lets the induction in the theorem keep its hypothesis.

Proof.

  • (a) Since β≠0 there are u0,w0∈V with c:=β(u0,w0)≠0. Put u=u0 and w=c−1w0, which is legitimate because c≠0 and F is a field. Then β(u,w)=c−1β(u0,w0)=1 by linearity in the second argument.

  • (b) Define φ:V→F2 by φ(v)=(β(u,v),β(w,v)). It is linear, because β is linear in its second argument, and kerφ=H⊥β by the definition of H⊥β. It is surjective: φ(w)=(β(u,w),β(w,w))=(1,0),φ(u)=(0,−1), using β(w,w)=β(u,u)=0 and β(w,u)=−1, and these two values span F2. Hence rankφ=2 and dim⁡H⊥β=dim⁡V−2 by Rank–Nullity (Theorem 2.3.1).

    Next, H∩H⊥β={0}. Let v=au+bw lie in H⊥β. Then 0=β(u,v)=aβ(u,u)+bβ(u,w)=b, and 0=β(w,v)=aβ(w,u)=−a, so a=b=0. Hence the sum H+H⊥β is direct (Theorem 1.7.4), and by Theorem 1.7.3 its dimension is 2+(dim⁡V−2)=dim⁡V, so it is all of V (Theorem 1.6.8).

  • (c) (⊇) Let v∈H⊥β satisfy β(z,v)=0 for every z∈H⊥β. Any y∈V decomposes as y=h+z with h∈H and z∈H⊥β by (b), and β(h,v)=−β(v,h)=0 because v∈H⊥β and h is a combination of u and w. Hence β(y,v)=0 for every y∈V, so v∈rad(β).

(⊆) Let v∈rad(β). Then in particular β(u,v)=β(w,v)=0, so v∈H⊥β, and β(z,v)=0 for every z at all, so v lies in the radical of the restriction. This proves the lemma.

Notice what the proof did not use: it never divided by 2, never distinguished β from −β, and never needed a vector with β(v,v)≠0 — which is fortunate, since no such vector exists. Compare the corresponding step for symmetric forms, Lemma 14.4.1 in Section 4: there the whole difficulty was producing a vector on which the quadratic form did not vanish, and producing it cost the hypothesis charF≠2. Here the quadratic form vanishes everywhere and we do not care.

14.9.3. The standard form

With the lemma in hand the classification is an induction that peels two dimensions at a time.

Theorem 14.9.2 (Standard Form of an Alternating Form)

Let F be any field, let V be a vector space over F with dim⁡V=n, and let β be an alternating bilinear form on V. Then there are an integer m≥0 with 2m≤n and a basis B=(u1,…,um,w1,…,wm,z1,…,zn−2m) of V such that, for all i,j, β(ui,wj)=δij,β(ui,uj)=β(wi,wj)=0, and β(zk,v)=0 for every k and every v∈V. Equivalently, in this basis

[β]BB=Ω2m⊕On−2m,Ω2m:=(OIm−ImO).
(14.9.1)

In particular:

  • (a) every alternating A∈Mn(F) is congruent to Ω2m⊕On−2m for exactly one m;
  • (b) if β is nondegenerate then n=2m is even and [β]BB=Ωn.

Idea. Induction on n, two dimensions at a time. ① If β=0, take m=0 and any basis; this is the base case and also the case that stops the recursion. ② Otherwise Lemma 14.9.1 produces a hyperbolic pair (u1,w1) and splits V=H⊕H⊥β with dim⁡H⊥β=n−2; apply the induction hypothesis to β restricted to H⊥β, and put the pieces together. ③ Finally reorder the basis so that all the u’s come before all the w’s, which turns a string of 2×2 blocks into the one block matrix displayed. The radical, by part (c) of the lemma, is exactly what the last stage of the recursion leaves behind.

Proof. Existence, by induction on n=dim⁡V. For n=0 and n=1 every alternating form is zero: in dimension 1, β(cv,dv)=cdβ(v,v)=0. Take m=0.

Let n≥2 and assume the statement for all spaces of dimension less than n.

Case 1: β=0. Take m=0 and any basis of V; every required equation reads 0=0.

Case 2: β≠0. By Lemma 14.9.1 (a) there is a hyperbolic pair (u1,w1), and by (b) we have V=H⊕W with H=span(u1,w1) and W=H⊥β of dimension n−2. The restriction β|W is again alternating, being a restriction of an alternating form, so the induction hypothesis applies to it: there is a basis (u2,…,um, w2,…,wm, z1,…,zn−2m) of W in which β|W(ui,wj)=δij, all other pairings among the u’s and w’s vanish, and each zk lies in rad(β|W).

Putting u1 and w1 in front gives a basis of V=H⊕W. The required equations hold: within H they are the definition of a hyperbolic pair together with alternation; within W they are the induction hypothesis; and across the two, every pairing of u1 or w1 with a vector of W vanishes because W=H⊥β and β is skew-symmetric. Finally each zk lies in rad(β|W)=rad(β) by Lemma 14.9.1 (c), which is the last assertion.

The matrix. Order the basis as B=(u1,…,um,w1,…,wm,z1,…,zn−2m). By Definition 14.1.2 the (i,j) entry of [β]BB is the pairing of the i-th and j-th basis vectors, and the equations above say precisely that the top-left m×m block and the w-w block are O, the u-w block is Im, the w-u block is −Im, and every row and column indexed by a zk is zero. That is Eq. 14.9.1.

(a). Given alternating A∈Mn(F), let β(x,y)=x⊤Ay on Fn; it is alternating by Proposition 14.3.2 (b). The basis just constructed gives P⊤AP=Ω2m⊕On−2m with P the matrix whose columns are the basis vectors, by Theorem 14.2.1, so A≃Ω2m⊕On−2m. Uniqueness of m: congruence preserves rank (Theorem 14.2.3), and rank(Ω2m⊕On−2m)=2m because Ω2m is invertible, its square being −I2m. So 2m=rankA is determined by A.

(b). If β is nondegenerate then rad(β)={0} by Definition 14.1.4, so there are no zk, that is n=2m. This proves the theorem.

Definition 14.9.2 (Symplectic Basis)

A basis of V as in Theorem 14.9.2 is a symplectic basis, or a Darboux basis, for the alternating form β. A nondegenerate alternating form on a finite-dimensional space is called a symplectic form, and the pair (V,β) a symplectic vector space.

Now read the hypotheses of the theorem again, and notice what is missing. There is no “charF≠2”, and there is no place one could be inserted, because no step of the proof divided by 2. Compare the statements this chapter has accumulated:

Over F2, where every one of the first four statements is false, the last one is true and gives a complete classification. The reason is visible in the proof: the symmetric theory needs a vector with q(v)≠0, and that vector is manufactured by a polarization identity that divides by 2. The alternating theory needs a pair with β(u,w)≠0, and a pair is handed over by the assumption β≠0 itself, free of charge. Symmetric forms are hard in characteristic 2; alternating forms are not hard anywhere.

Quick check. Over F2 we have −1=1, so Ω2m=(OImImO), which is a symmetric matrix. Does that contradict the warning above, that an alternating form is never diagonalizable?

Solution. No. Over F2 every alternating matrix is symmetric, since skew-symmetric and symmetric are the same condition there (Theorem 14.3.3 and the warning after it). What distinguishes alternating from merely symmetric over F2 is the zero diagonal, and Ω2m does have a zero diagonal. The warning says a diagonal alternating matrix must be O, and Ω2m is symmetric but not diagonal. Concretely, over F2 the matrix (0110) is the Gram matrix of the alternating form β(x,y)=x1y2+x2y1, and no change of basis makes it diagonal.

14.9.4. Running the algorithm

The proof is an algorithm, and it is short enough to carry out by hand. Each round of the induction does three things: find a pair with β(u,w)≠0, rescale to make the value 1, and then correct every remaining basis vector so that it becomes orthogonal to both. The correction is a formula worth recording. If β(u,w)=1, put

v′:=v−β(v,w)u+β(v,u)w.
(14.9.2)

Expanding and using β(u,u)=β(w,w)=0, β(u,w)=1, and β(w,u)=−1, β(v′,u)=β(v,u)−β(v,w)⋅0+β(v,u)⋅(−1)=0,β(v′,w)=β(v,w)−β(v,w)⋅1+β(v,u)⋅0=0, so v′∈H⊥β. It is the alternating analogue of subtracting a projection in Gram–Schmidt, with one difference: nothing is divided by a length, so it works over any field.

Example (A Symplectic Basis for a 4 × 4 Form)

Let β(x,y)=x⊤Ay on Q4, where A=(0123−1011−2−100−3−100). Find a symplectic basis, and the matrix P with P⊤AP=Ω4.

Solution. The matrix is skew-symmetric with zero diagonal, so β is alternating (Proposition 14.3.2 (b)).

Round 1. The entry a12=β(e1,e2)=1 is already 1, so (u1,w1)=(e1,e2) is a hyperbolic pair and no rescaling is needed. Correct e3 and e4 by Eq. 14.9.2, reading the needed values off the matrix: β(e3,e2)=a32=−1, β(e3,e1)=a31=−2, β(e4,e2)=a42=−1, β(e4,e1)=a41=−3. So v3=e3+e1−2e2=(1,−2,1,0),v4=e4+e1−3e2=(1,−3,0,1).

Round 2. Both v3 and v4 pair to zero with e1 and e2, as the formula guarantees, so the recursion continues inside span(v3,v4). Compute Av4 row by row with v4=(1,−3,0,1): row 1 gives 0−3+0+3=0, row 2 gives −1+0+0+1=0, row 3 gives −2+3+0+0=1, row 4 gives −3+3+0+0=0. So Av4=(0,0,1,0)⊤, and β(v3,v4)=v3⊤(Av4)=1⋅0+(−2)⋅0+1⋅1+0⋅0=1. The pair (u2,w2)=(v3,v4) is therefore hyperbolic, and the recursion stops: the two remaining dimensions are used up.

The answer. The symplectic basis is B=(e1,v3,e2,v4), listing the u’s first and then the w’s. The matrix whose columns are these four vectors is P=(11010−21−301000001),P⊤AP=Ω4. A check of two entries confirms the pattern: the (1,3) entry of P⊤AP is β(e1,e2)=1 and the (2,4) entry is β(v3,v4)=1, while the (1,2) entry is β(e1,v3)=a11+a12(−2)+a13=0−2+2=0.

14.9.5. What the standard form classifies

The theorem is a classification, and it is worth reading off exactly what it classifies and how coarsely.

Corollary 14.9.3 (Alternating Matrices Are Classified by Rank)

Let F be any field and let A,B∈Mn(F) be alternating.

  • (a) rankA is even.
  • (b) A≃B if and only if rankA=rankB.
  • (c) There are exactly ⌊n/2⌋+1 congruence classes of alternating matrices in Mn(F), one for each even rank 0,2,4,… up to n.
  • (d) If n is odd, every alternating A∈Mn(F) is singular.

Proof.

  • (a) By Theorem 14.9.2 (a), A≃Ω2m⊕On−2m for some m, and congruence preserves rank (Theorem 14.2.3), so rankA=2m.

  • (b) (⇒) is Theorem 14.2.3. (⇐) If rankA=rankB=2m then by (a) and Theorem 14.9.2 both are congruent to Ω2m⊕On−2m, and congruence is an equivalence relation (Proposition 14.2.2), so A≃B.

  • (c) By (a) and (b) the classes are in bijection with the even integers 2m satisfying 0≤2m≤n, and there are ⌊n/2⌋+1 of those.

  • (d) By (a), rankA is even and at most n; since n is odd, rankA≤n−1<n, so A is not invertible.

Part (d) deserves a second look, because there is a one-line proof of it that works only half the time. If A⊤=−A with n odd, then detA=det(A⊤)=det(−A)=(−1)ndetA=−detA, so (1+1)detA=0 and detA=0 — provided 1+1≠0. In characteristic 2 that argument collapses, and it collapses for a real reason: over F2 the matrix diag(1,0,0) is skew-symmetric (because skew means symmetric there) and has odd rank 1. Part (d) survives because it is a statement about alternating matrices, and the standard form proves it without ever touching the determinant.

Warning. “Skew-symmetric” is not enough. Every statement in Corollary 14.9.3 is about alternating matrices: skew-symmetric with zero diagonal. Over F2, I2 is skew-symmetric and has rank 2, which is harmless; but diag(1,0)∈M2(F2) is skew-symmetric of rank 1, and I3∈M3(F2) is skew-symmetric and invertible. Both would contradict the corollary if “skew-symmetric” could be substituted for “alternating”. In characteristic ≠2 the two words agree (Theorem 14.3.3 (b)) and the distinction can be forgotten; nowhere else.

14.9.6. The determinant, and the Pfaffian

Part (a) of Theorem 14.9.2 says that in even size an invertible alternating matrix is congruent to Ωn. Congruence multiplies the determinant by a square (Theorem 14.2.5), so the determinant of an alternating matrix is heavily constrained.

Corollary 14.9.4 (The Determinant of an Alternating Matrix Is a Square)

Let F be any field and let A∈Mn(F) be alternating. Then detA is a square in F: there is c∈F with detA=c2.

Proof. If A is singular then detA=0=02. So assume A is invertible. Then rankA=n is even by Corollary 14.9.3 (a), say n=2m, and Theorem 14.9.2 (a) supplies an invertible P with P⊤AP=Ω2m. Taking determinants and using Theorem 14.2.5, detΩ2m=(detP)2detA. Now detΩ2m=1. Indeed, performing the m row swaps Ri↔Rm+i for i=1,…,m turns Ω2m into (−Im)⊕Im, so by Theorem 7.5.1 (a) and Theorem 7.8.4, (−1)mdetΩ2m=det((−Im)⊕Im)=(−1)m, and (−1)m is invertible, so detΩ2m=1. Hence detA=(detP)−2=((detP)−1)2, a square, since detP≠0. This proves the corollary.

The corollary says a square root of detA exists; it does not produce one. In fact there is a canonical choice. For every even n there is a polynomial Pf in the entries aij with i<j, with integer coefficients, called the Pfaffian, satisfying detA=Pf(A)2 for every alternating A. Constructing it in general is a piece of multilinear algebra that we do not carry out, so we record only the name and the two smallest cases, both of which can be checked by expanding the determinant.

Example (The Pfaffian in Sizes 2 and 4)

For n=2, A=(0a−a0),detA=a2,Pf(A)=a. For n=4, write the six independent entries as a=a12, b=a13, c=a14, d=a23, e=a24, f=a34. Expanding the 4×4 determinant gives detA=(af−be+cd)2,Pf(A)=af−be+cd. The three terms pair up {1,2}{3,4}, {1,3}{2,4}, and {1,4}{2,3}: the Pfaffian sums over the ways of splitting {1,2,3,4} into two pairs, with a sign. For the matrix A of Example (A Symplectic Basis for a 4 × 4 Form) this reads Pf(A)=1⋅0−2⋅1+3⋅1=1, and indeed detA=1.

Remark. The Pfaffian is not merely a square root: it is the one that behaves well under congruence, satisfying Pf(P⊤AP)=det(P)Pf(A). That identity is the reason the Pfaffian matters. Section 10 records one of its consequences for the symplectic group, without proof and without leaning on it. We do not prove the identity either.

14.9.7. Symmetric against alternating

Put the two halves of the chapter side by side. Both are theories of a bilinear form under congruence; the answers could hardly be more different.

Symmetric forms Alternating forms
Field hypothesis charF≠2 for every theorem none
Canonical form diagonal, entries not canonical Ω2m⊕On−2m
Complete invariants rank and more: over R the signature, over Q the discriminant and local data rank alone
Classes in Mn(R) 12(n+1)(n+2) ⌊n/2⌋+1
Classes in Mn(C) n+1 ⌊n/2⌋+1
Classes in Mn(Q) infinitely many already for n=1 ⌊n/2⌋+1
Possible ranks every r with 0≤r≤n even r only
Effect of the field decisive none

Two entries carry the point. Over Q, the 1×1 symmetric matrices [1],[2],[3],[5],… are pairwise noncongruent, because congruence in size 1 multiplies by a nonzero square (Theorem 14.2.5) and distinct squarefree positive integers lie in distinct classes of Q×/(Q×)2. So the symmetric classification over Q is an infinite problem in number theory — Section 4 said as much. The alternating classification over Q has four classes in size 6, and the same four over F2, over R, and over any field whatsoever.

The reason, one last time, is the two-dimensional model. A symmetric form on a line is c↦ac2, and rescaling changes a by a square, so the diagonal entry carries the field’s arithmetic with it. An alternating form on a plane is (0a−a0), and rescaling one of the two basis vectors changes a to ca for any c≠0 — an arbitrary nonzero scalar, not a square. There is nothing left for the field to remember.

14.9.8. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define a hyperbolic pair for an alternating form, and say why its two vectors are automatically linearly independent.
  • (b) State Theorem 14.9.2, and say which hypothesis on F it needs.
  • (c) Determine whether the following is correct: every skew-symmetric matrix over every field has even rank. Justify your answer.
  • (d) Why can an alternating form never have a diagonal Gram matrix, unless the form is zero?
  • (e) How many congruence classes of alternating matrices are there in M5(R)? In M5(F7)?

Solution.

  • (a) A pair (u,w) with β(u,w)=1 (Definition 14.9.1). If w=cu, then β(u,w)=cβ(u,u)=0≠1, so w∉span(u); and u≠0 since β(0,w)=0. Two vectors, neither in the span of the other, are independent.

  • (b) Every alternating form on an n-dimensional V has a basis in which its matrix is Ω2m⊕On−2m, with 2m=rankβ; equivalently every alternating matrix is congruent to exactly one such matrix. No hypothesis on F is needed — in particular none on charF.

  • (c) Incorrect. Over F2, diag(1,0) is skew-symmetric, because −1=1 makes skew-symmetric and symmetric the same condition, and it has rank 1. The correct statement is about alternating matrices, Corollary 14.9.3 (a). In characteristic ≠2 the two notions coincide (Theorem 14.3.3 (b)) and the statement is true.

  • (d) The off-diagonal entries of a diagonal matrix are 0 by definition, and the diagonal entries of the Gram matrix of an alternating form are β(vi,vi)=0. So the whole matrix is O, and then β=0 by Theorem 14.1.1 (b).

  • (e) ⌊5/2⌋+1=3 in both cases, by Corollary 14.9.3 (c): the ranks 0,2,4. The field makes no difference.

B. Practice

Exercise (B1: A symplectic basis)

Let β(x,y)=x⊤By on Q4, with B=(00110021−1−200−1−100). Find a symplectic basis for β and an invertible P∈M4(Q) with P⊤BP=Ω4.

Solution. B is skew-symmetric with zero diagonal, hence alternating (Proposition 14.3.2 (b)).

Round 1. Here β(e1,e2)=0, so the first two standard basis vectors are not a hyperbolic pair; this is the step the worked example did not need. Look for any nonzero entry: β(e1,e3)=1. Take u1=e1, w1=e3.

Correct the other two by Eq. 14.9.2, using β(e2,e3)=2, β(e2,e1)=0, β(e4,e3)=0, β(e4,e1)=−1: v2=e2−2e1+0⋅e3=(−2,1,0,0),v4=e4−0⋅e1−e3=(0,0,−1,1).

Round 2. Compute Bv4 with v4=(0,0,−1,1): row 1 gives −1+1=0, row 2 gives −2+1=−1, rows 3 and 4 give 0. So Bv4=(0,−1,0,0)⊤ and β(v2,v4)=v2⊤(Bv4)=(−2)⋅0+1⋅(−1)=−1. This is nonzero but not 1, so rescale: replace v4 by w2:=−v4=(0,0,1,−1), giving β(v2,w2)=1. Set u2=v2.

The answer. The symplectic basis is (u1,u2,w1,w2)=(e1, (−2,1,0,0), e3, (0,0,1,−1)), so P=(1−20001000011000−1),P⊤BP=Ω4. P is invertible, being block upper triangular with invertible diagonal blocks, and detP=−1≠0.

Exercise (B2: Pfaffians and determinants)

For each matrix below, compute the Pfaffian using the formula of Example (The Pfaffian in Sizes 2 and 4), and verify that its square is the determinant. A1=(0201−20100−103−10−30),A2=(0111−1011−1−101−1−1−10). Hence write down, for each, an invertible matrix congruence class in the sense of Corollary 14.9.3.

Solution. For A1: a=2, b=0, c=1, d=1, e=0, f=3, so Pf(A1)=af−be+cd=6−0+1=7 and detA1=49. Expanding the determinant along the first row confirms 49.

For A2: a=b=c=d=e=f=1, so Pf(A2)=1−1+1=1 and detA2=1.

Both determinants are nonzero, so both matrices have rank 4, and by Corollary 14.9.3 (b) both lie in the single congruence class of invertible alternating matrices in M4(Q): each is congruent to Ω4, and therefore A1≃A2. Note that the two have different determinants, 49 and 1; congruence changes the determinant by a square (Theorem 14.2.5), and 49=72.

Exercise (B3: Determine which of the following)

Determine which of the following matrices are alternating, and for those that are, give the rank and the standard form Ω2m⊕On−2m it is congruent to. Justify your answer.

  • (a) (05−50) over Q.
  • (b) (0110) over Q.
  • (c) (0110) over F2.
  • (d) The 5×5 matrix with aij=j−i over Q.

Solution.

  • (a) Alternating: zero diagonal and a21=−a12. Its determinant is 25≠0, so the rank is 2 and it is congruent to Ω2. (Explicitly, scaling the second basis vector by 1/5 does it.)

  • (b) Not alternating. It is symmetric with a12=1≠−1=−a21, so it is not even skew-symmetric over Q.

  • (c) Alternating. Over F2 we have 1=−1, so the matrix is skew-symmetric, and its diagonal is zero. Its determinant is −1=1≠0, so the rank is 2 and it is congruent to Ω2=(0110) — it is Ω2, since −1=1. Comparing (b) and (c): the same array of symbols is alternating over one field and not over another.

  • (d) Alternating: aii=0 and aji=i−j=−aij. Its rank is even by Corollary 14.9.3 (a), and it is not zero, so the rank is 2 or 4. Every row is a combination of (1,2,3,4,5) and (1,1,1,1,1): indeed row i is (j−i)j=(1,2,3,4,5)−i(1,1,1,1,1). So the row space has dimension at most 2, and rows 1 and 2 are independent, giving rank exactly 2. Hence the matrix is congruent to Ω2⊕O3. In particular it is singular, as Corollary 14.9.3 (d) requires for odd size.

C. Going deeper

Exercise (C1: Lagrangian subspaces)

Let β be a symplectic form on V with dim⁡V=2m (Definition 14.9.2), and call a subspace U⊆V totally isotropic if β(u,u′)=0 for all u,u′∈U.

  • (a) Prove that span(u1,…,um) is totally isotropic, for any symplectic basis.
  • (b) Prove that every totally isotropic subspace satisfies dim⁡U≤m.
  • (c) Deduce that a symplectic form on a space of dimension 2m has a totally isotropic subspace of dimension exactly m, and no larger one. (These are the Lagrangian subspaces.)

Hint for (b): compare U with U⊥β of Exercise (C2: Orthogonal complements for a form).

Solution.

  • (a) By Theorem 14.9.2, β(ui,uj)=0 for all i,j. A general pair of elements of the span is ∑iciui and ∑jdjuj, and bilinearity gives ∑i,jcidjβ(ui,uj)=0.

  • (b) Let U be totally isotropic. By definition β(u,v)=0 for all u∈U and all v∈U, so U⊆U⊥β. Since β is nondegenerate, dim⁡U⊥β=2m−dim⁡U by Exercise (C2: Orthogonal complements for a form) (b). Therefore dim⁡U≤2m−dim⁡U, that is 2dim⁡U≤2m. Both sides are integers, so dim⁡U≤m. (No division by 2 inside the field occurs here: the inequality is between integers, not field elements, so the argument is valid in every characteristic.)

  • (c) The subspace of (a) has dimension m, since the ui are part of a basis, and it is totally isotropic; by (b) no totally isotropic subspace has dimension greater than m.

Exercise (C2: The inverse of an alternating matrix)

Let F be any field.

  • (a) Prove that every alternating matrix of odd size over F is singular, without using determinants.
  • (b) Let A∈Mn(F) be alternating and invertible. Prove that A−1 is alternating.

Hint for (b): the adjugate. The (i,i) entry of adjA is a minor of A of size n−1.

Solution.

  • (a) This is Corollary 14.9.3 (d): by Theorem 14.9.2 the rank is even, and an even number that is at most an odd n is at most n−1, so the matrix is not invertible. The proof of the standard form uses no determinants.

  • (b) Since A is invertible, Theorem 7.6.2 gives A−1=(detA)−1adjA. First, skewness: (A−1)⊤=(A⊤)−1=(−A)−1=−A−1, using Theorem 0.9.5 and the fact that inversion turns −A=(−1)A into (−1)−1A−1=−A−1.

Now the diagonal. By Definition 7.6.2 the (i,i) entry of adjA is the cofactor Cii=(−1)2iMii=Mii, the determinant of the matrix obtained from A by deleting row i and column i. Deleting a row and the matching column of an alternating matrix leaves an alternating matrix, since the surviving entries keep their positions relative to the diagonal. Its size is n−1, and n is even by Corollary 14.9.3 (a) applied to the invertible A; so n−1 is odd and Mii=0 by (a). Hence every diagonal entry of A−1 is 0, and with skewness this makes A−1 alternating.

Exercise (C3: Counting over a finite field)

Let q be a power of an odd prime.

  • (a) How many alternating bilinear forms are there on Fq2m? How many symmetric ones?
  • (b) How many of the alternating forms on Fq2 are nondegenerate, and how many congruence classes do they fall into?
  • (c) How many of the symmetric forms on Fq1 are nondegenerate, and how many congruence classes do they fall into? Hint: the squaring map Fq×→Fq× has kernel {1,−1}.
  • (d) Explain in one or two sentences why the answers to (b) and (c) differ, in terms of what a change of basis can do to the single free parameter in each case.

Solution.

  • (a) By Theorem 14.1.1 (c), forms correspond bijectively to matrices, so we count matrices. An alternating matrix of size n=2m is determined freely by its entries above the diagonal, of which there are (n2)=m(2m−1); so there are qm(2m−1) alternating forms. A symmetric matrix is determined freely by its entries on and above the diagonal, (n2)+n=m(2m+1) of them, giving qm(2m+1).

  • (b) The alternating forms on Fq2 have matrices (0a−a0), so there are q of them, and the nondegenerate ones are those with a≠0, of which there are q−1. By Corollary 14.9.3 (b) all of these have rank 2 and so lie in a single congruence class.

  • (c) A symmetric form on Fq1 has matrix [d] and is nondegenerate exactly when d≠0, so there are q−1 of them. Congruence in size 1 replaces d by p2d with p≠0 (Definition 14.2.1), so the classes are the cosets of the subgroup of squares in Fq×. The squaring homomorphism Fq×→Fq× has kernel {x:x2=1}={1,−1}, which has two elements because q is odd; so its image has index 2, and there are exactly two congruence classes. For q=5, for instance, the squares are {1,4} and the nonsquares {2,3}, and [1]≄[2].

  • (d) In the alternating case a change of basis may replace a by ca for any c≠0, because the two slots of β(u,w) hold different basis vectors and only one of them need be rescaled. In the symmetric case the parameter sits in β(v,v), where both slots hold the same vector, so rescaling changes d to c2d — by a square only. The square class then survives as an invariant, and over Fq it has two values.

Found a typo or a mistake? Report it, or read this page’s source

The text of this book is licensed under CC BY-NC-SA 4.0.