14.10  Groups Defined by Forms

Chapter 11 defined the orthogonal and unitary groups by a sentence: they consist of the operators that preserve the inner product. Read that sentence again and notice that positivity never appears in it. “Preserves ⟨⋅,⋅⟩” makes sense for any bilinear or Hermitian form at all, and it always produces a group. This section takes the definition apart and puts it back together over an arbitrary form, so that the four families of classical groups — orthogonal, indefinite orthogonal, unitary, symplectic — become four instances of one construction, chosen by the four kinds of form this chapter has classified.

Everything is recalled, not reproved. O(n), SO(n), and U(n) were defined in Chapter 11 (Definition 11.7.2, Definition 11.7.3), shown there to be groups with the expected determinants (Proposition 11.7.4), and classified element by element in the real case in Chapter 12 (Theorem 12.6.1). None of that is repeated. What is new here is the pattern behind it.

14.10.1. The isometry group of a form

An operator preserves a form when applying it to both arguments changes nothing. This is the same idea as an isometry of an inner product space (Definition 11.7.1), with the norm removed from the statement because a general form has no norm.

The isometry group of a form is the set of invertible changes of coordinates that the form cannot detect.

Definition 14.10.1 (Isometry Group of a Form)

Let V be a finite-dimensional vector space over F and β a nondegenerate bilinear form on V (Definition 14.1.4). An operator T∈L(V) is an isometry of β if β(Tu,Tv)=β(u,v)for all u,v∈V, and the set of all of them is written Isom(β).

For a nonsingular A∈Mn(F), the corresponding matrix group is Isom(A):={P∈Mn(F):P⊤AP=A}. When F=C and A∗=A is nonsingular Hermitian, Isom(A) means instead {P:P∗AP=A}.

Read the clauses. The condition is required for all pairs, not just for a basis — though checking it on a basis is enough, since both sides are bilinear in u and in v. The matrix condition P⊤AP=A is the matrix condition of Theorem 14.2.1 with the new Gram matrix required to be the old one: an isometry is a change of basis that leaves the Gram matrix alone. And the two versions match, because if A=[β]BB then T∈Isom(β) if and only if [T]BB∈Isom(A), by Theorem 14.1.1 (a) applied twice.

Two clauses need defending. First, nondegeneracy. Without it the definition is worthless: for A=O the condition P⊤OP=O holds for every P, including P=O, and the “group” is all of Mn(F), which has no inverses. Second, the definition does not require P to be invertible. It does not have to: invertibility comes free, as the next result records, and this is exactly what nondegeneracy buys.

Theorem 14.10.1 (Isometry Groups Are Groups)

Let A∈Mn(F) be nonsingular. Then every P∈Isom(A) is invertible, and Isom(A) is a subgroup of GLn(F). The same holds for Isom(β) inside the group of invertible operators on V, and for the Hermitian version.

Proof. Let P∈Isom(A). Taking determinants in P⊤AP=A and using Theorem 7.5.4 and Theorem 7.4.5, (detP)2detA=detA. Since A is nonsingular, detA≠0 (Theorem 7.5.2), and canceling it in the field F gives (detP)2=1. Hence detP≠0 and P is invertible, again by Theorem 7.5.2.

Now the three subgroup checks. In⊤AIn=A, so In∈Isom(A). If P,Q∈Isom(A) then (PQ)⊤A(PQ)=Q⊤(P⊤AP)Q=Q⊤AQ=A, using Theorem 0.9.5 for the first equality, so PQ∈Isom(A). And if P∈Isom(A), multiply P⊤AP=A on the left by (P⊤)−1=(P−1)⊤ and on the right by P−1, which is legitimate because P is invertible; this gives A=(P−1)⊤AP−1, so P−1∈Isom(A). Associativity is inherited from Mn(F).

For the Hermitian version replace ⊤ by ∗ throughout; the determinant step becomes detP―detPdetA=detA, that is |detP|2=1, which again forces detP≠0. The operator version is the matrix version read through a basis. This proves the theorem.

The proof is the one Chapter 11 gave for O(n) and U(n) in Proposition 11.7.4 (a), with In replaced by A; nothing in it used what A was, only that it was nonsingular. That is the whole point of the section: the group structure never depended on positivity, on symmetry, or on the field.

14.10.2. Congruent forms give conjugate groups

Before listing the families, one observation makes the list a classification rather than a list of unrelated examples. Congruent matrices have the “same” isometry group, in the strongest sense available.

Proposition 14.10.2 (Congruence Conjugates the Isometry Group)

Let A,B∈Mn(F) be nonsingular with B=Q⊤AQ for an invertible Q (Definition 14.2.1). Then Isom(B)=Q−1Isom(A)Q, so the two groups are conjugate subgroups of GLn(F); in particular they are isomorphic as groups, by P↦QPQ−1.

Proof. Let P∈Mn(F). Substituting B=Q⊤AQ and writing R=QPQ−1, P⊤BP=B⟺P⊤Q⊤AQP=Q⊤AQ⟺(QPQ−1)⊤A(QPQ−1)=A, where the second step multiplies on the left by (Q⊤)−1 and on the right by Q−1 and uses Theorem 0.9.5; both operations are reversible because Q is invertible. So P∈Isom(B) if and only if R=QPQ−1∈Isom(A), which is the claimed equality of sets. Conjugation by Q is an isomorphism of groups, being a bijection that respects products.

So the isometry group depends only on the congruence class of the form, and this chapter has already listed the congruence classes. Over R, Corollary 14.5.2 says a nondegenerate symmetric form is congruent to exactly one In+⊕(−In−); over C, Corollary 14.4.4 says a nondegenerate symmetric form is congruent to In and nothing else; and Theorem 14.9.2 says a symplectic form is congruent to Ω2m and nothing else. Each classification theorem of this chapter therefore doubles as a list of groups.

14.10.3. The four families

Definition 14.10.2 (The Indefinite Orthogonal and Symplectic Groups)

For p,q≥0 with p+q=n, set Ip,q:=Ip⊕(−Iq)∈Mn(R) and O(p,q):=Isom(Ip,q)={P∈Mn(R):P⊤Ip,qP=Ip,q}, the indefinite orthogonal group of signature (p,q). For m≥1 and any field F, set Sp(2m,F):=Isom(Ω2m)={P∈M2m(F):P⊤Ω2mP=Ω2m}, the symplectic group, where Ω2m is the standard alternating matrix of Eq. 14.9.1.

With Chapter 11’s groups recalled, the four families line up as four choices of form.

Family Form preserved Kind of form Section
O(n) In over R symmetric, positive definite Ch 11 §07
O(p,q) Ip,q over R symmetric, signature (p,q) §05
U(n) In over C Hermitian, positive definite Ch 11 §07
Sp(2m,F) Ω2m over F alternating, nondegenerate §09

Two remarks on the list. O(n)=O(n,0), so the ordinary orthogonal group is the extreme case of the indefinite one; and O(p,q) and O(q,p) are conjugate, because negating a form does not change which maps preserve it, and −Ip,q=(−Ip)⊕Iq becomes Iq,p after a permutation of the coordinates, which is a congruence. There is no Sp for odd size: a nondegenerate alternating form exists only in even dimension (Theorem 14.9.2 (b)).

Example (Members of Each Family)

Verify the following memberships, with Ω2m as above.

  • (a) (cosh⁡tsinh⁡tsinh⁡tcosh⁡t)∈O(1,1) for every t∈R.
  • (b) (MOO(M⊤)−1)∈Sp(2m,F) for every invertible M∈Mm(F).
  • (c) (ImSOIm)∈Sp(2m,F) if and only if S⊤=S.

Solution.

  • (a) With A=I1,1=diag(1,−1), c=cosh⁡t, and s=sinh⁡t, (cssc)(100−1)(cssc)=(c2−s200s2−c2)=I1,1, using cosh2⁡t−sinh2⁡t=1 and the symmetry of the outer matrix.

  • (b) Write P=M⊕N with N=(M⊤)−1. Multiplying the blocks, P⊤Ω2mP=(M⊤OON⊤)(ON−MO)=(OM⊤N−N⊤MO), which equals Ω2m exactly when M⊤N=Im, that is N=(M⊤)−1.

  • (c) With P=(ImSOIm), P⊤Ω2mP=(ImOS⊤Im)(OIm−Im−S)=(OIm−ImS⊤−S), which equals Ω2m exactly when S⊤=S. Such a P is a symplectic shear; part (c) is the first sign that symmetric matrices appear inside the symplectic group, and the dimension count below will make that precise.

14.10.4. Determinants

For the orthogonal family the determinant argument is already inside the proof of Theorem 14.10.1, and it costs nothing to state it over any field.

Theorem 14.10.3 (Determinants in the Classical Groups)
  • (a) Let F be any field and A∈Mn(F) nonsingular. Then detP=±1 for every P∈Isom(A). In particular detP=±1 for P∈O(p,q), and both signs occur when n≥1.
  • (b) If A∈Mn(C) is Hermitian and nonsingular, then |detP|=1 for every P∈Isom(A); in particular for P∈U(n).
  • (c) Sp(2,F)=SL2(F). In particular every P∈Sp(2,F) has detP=1 exactly, and −1 does not occur.

Proof.

  • (a) The proof of Theorem 14.10.1 established (detP)2=1. The polynomial x2−1=(x−1)(x+1) has at most two roots in a field (Corollary 6.1.4), and 1 and −1 are roots, so detP∈{1,−1}. For O(p,q), the identity has determinant 1; and D:=diag(−1,1,…,1) satisfies D⊤Ip,qD=Ip,q, since D is diagonal and squaring its entries gives In, while detD=−1.

  • (b) Also established in that proof: |detP|2=1, and a nonnegative real with square 1 is 1. This is Proposition 11.7.4 (b) for A=In.

  • (c) Write J=Ω2=(01−10) and let P=(abcd) be arbitrary. Multiplying out, P⊤JP=(acbd)(cd−a−b)=(0ad−bcbc−ad0)=(detP)J. Since J≠O, the equation P⊤JP=J holds if and only if detP=1. This proves the theorem.

Warning. Every symplectic matrix has determinant +1, not ±1. The general argument of part (a) applies to Ω2m as well and gives only (detP)2=1, so it leaves −1 open. It is nevertheless true that Sp(2m,F)⊆SL2m(F) for every m, so −1 never occurs. Part (c) proves this for m=1; the general case is not proved in this book. The clean route runs through the Pfaffian of Section 9 and its transformation rule Pf(P⊤AP)=det(P)Pf(A): applied to A=Ω2m, whose Pfaffian is 1, it turns P⊤Ω2mP=Ω2m directly into detP=1. We stated that rule without proof, so we state its consequence without proof too. Do not use the statement as a step in an argument elsewhere in this book; treat it as information about the wider subject, like the fact that the general polynomial of degree five has no solution by radicals.

There is a consequence worth noticing. O(n) has the proper subgroup SO(n) cut out by det=1, and Chapter 12 made heavy use of it: rotations against reflections. The symplectic group has no such subgroup, because — by the fact just recorded, which this book does not prove — the determinant condition is already satisfied by everything in it. A symplectic form has no notion of reflection to detect.

14.10.5. Counting parameters

How big is each group? “Big” has an honest answer in this book only as a count, so here is the count, and here is what it does and does not mean.

The equation P⊤AP=A is a system of scalar equations in the n2 unknown entries of P. If the system consisted of k independent equations we would expect the solutions to form a family described by n2−k free parameters, and that number is what everybody calls the dimension of the group. The key observation is that the n2 equations are far from independent, because the matrix P⊤AP−A is not an arbitrary matrix: it has the same symmetry type as A, by Proposition 14.2.4. So the equations repeat, and only the independent ones should be counted.

  • If A is symmetric, then P⊤AP−A is symmetric, and a symmetric n×n matrix has 12n(n+1) independent entries. Expected dimension: n2−12n(n+1)=12n(n−1).
  • If A is alternating, then P⊤AP−A is alternating, and an alternating n×n matrix has 12n(n−1) independent entries. Expected dimension: n2−12n(n−1)=12n(n+1).
  • If A is Hermitian over C, count real parameters: P has 2n2 of them, and a Hermitian matrix has n real diagonal entries and 12n(n−1) complex entries above the diagonal, in total n2 real conditions. Expected real dimension: 2n2−n2=n2.
Group Entries in P Independent conditions Dimension
O(n), O(p,q), p+q=n n2 12n(n+1) 12n(n−1)
U(n) (real parameters) 2n2 n2 n2
Sp(2m,R) 4m2 m(2m−1) m(2m+1)

Small cases are a sanity check. O(2) comes out at dimension 1, and Chapter 11 found that its elements are described by a single angle. O(3) comes out at 3, matching the axis-and-angle description of Corollary 12.6.2: two parameters for the axis direction, one for the angle. U(1) comes out at 1, and U(1) is the unit circle in C. And Sp(2,R)=SL2(R) comes out at 3, which is right: four entries subject to the single equation ad−bc=1.

Compare the orthogonal and symplectic rows of the table at n=2m. The orthogonal group is smaller than the symplectic group of the same size, by exactly 12n(n+1)−12n(n−1)=n. The gap is the gap between symmetric and alternating matrices, which is the n diagonal entries — the same diagonal that Section 3 found separating the two notions in the first place.

Warning. This count is a heuristic, not a theorem of this book. “Dimension” here means the number of free parameters one expects a solution set to have, and the step from “k independent-looking equations” to “n2−k parameters” is not justified by anything proved above; for a nonlinear system it can fail. Making it precise requires the notion of a smooth manifold and the implicit function theorem, which belong to analysis and differential geometry, not here. What is proved here is only the count of conditions. Every number in the table is nevertheless correct.

Quick check. The family O(p,q) is indexed by two integers, yet the table gives it a dimension depending only on n=p+q, not on how n splits. Does that mean O(3,0) and O(2,1) are the same group?

Solution. No. The count of conditions only sees that Ip,q is symmetric, not which symmetric matrix it is, so it cannot distinguish the two. They are genuinely different groups: O(3)=O(3,0) consists of matrices all of whose entries have absolute value at most 1, since its columns are unit vectors, whereas O(2,1) contains matrices with arbitrarily large entries, as the next warning shows. Conjugate groups come from congruent forms (Proposition 14.10.2), and I3,0 and I2,1 are not congruent, because their signatures differ (Corollary 14.5.2).

14.10.6. Boundedness and its absence

Warning. O(p,q) is not compact when p,q≥1, unlike O(n). Compactness is a topological notion that this book does not develop, so the statement is recorded here, not proved. What can be seen without topology is the underlying reason, which is that the entries are unbounded. Take the hyperbolic plane A=(0110), a nondegenerate symmetric real form of signature (1,1), hence congruent to I1,1. For every real t≠0, (t00t−1)⊤(0110)(t00t−1)=(0110), so diag(t,t−1) lies in Isom(A), and its entries are unbounded as t→∞. By Proposition 14.10.2 the same unbounded family sits inside O(1,1), and padding with an identity block puts it inside every O(p,q) with p,q≥1. By contrast every entry of a matrix in O(n) has absolute value at most 1, because each column is a unit vector for the Euclidean norm.

The same phenomenon shows up in Sp(2m,R), by Example (Members of Each Family) (b) with M=[t]: the symplectic group is unbounded too. Only the two positive definite families, O(n) and U(n), are bounded, and positivity is exactly why — the form itself controls the size of the columns. Definiteness, which this chapter spent nine sections learning to do without, turns out to be what made Chapter 11’s groups small.

Section 11 takes the indefinite case that physics uses, signature (1,3), and works out what its isometry group does to the geometry of spacetime.

14.10.7. Exercises

A. Check your understanding

Exercise (A1)
  • (a) Define Isom(A) for a nonsingular A∈Mn(F), and explain why its elements are automatically invertible.
  • (b) Which form does O(p,q) preserve, and which does Sp(2m,F) preserve?
  • (c) Determine whether the following is correct: if A≃B, then Isom(A)=Isom(B). Justify your answer.
  • (d) State what is known here about detP for P∈Sp(2m,F), distinguishing what is proved from what is only recorded.
  • (e) In the parameter count, what exactly does the word “dimension” mean, and what is not being claimed?

Solution.

  • (a) Isom(A)={P:P⊤AP=A} (Definition 14.10.1). Taking determinants gives (detP)2detA=detA, and detA≠0, so (detP)2=1 and detP≠0 (Theorem 14.10.1).

  • (b) O(p,q) preserves the real symmetric form with matrix Ip,q=Ip⊕(−Iq), of signature (p,q). Sp(2m,F) preserves the standard alternating form with matrix Ω2m (Definition 14.10.2).

  • (c) Incorrect as stated: the two groups are conjugate, Isom(B)=Q−1Isom(A)Q, not equal (Proposition 14.10.2). For a witness take A=I2 and B=diag(1,4)=Q⊤AQ with Q=diag(1,2). Then (01−10)∈O(2)=Isom(A), but the corresponding element Q−1(01−10)Q=(02−1/20) of Isom(B) is not in O(2). What is always true is that the two groups are isomorphic.

  • (d) Proved here: (detP)2=1, hence detP=±1, for every m (Theorem 14.10.3 (a)); and detP=1 exactly, for m=1, since Sp(2,F)=SL2(F) (part (c)). Recorded but not proved: detP=1 for every m, which follows from the transformation rule of the Pfaffian.

  • (e) The number of free parameters expected in the solution set of P⊤AP=A, computed as n2 minus the number of independent scalar conditions. It is not claimed that the solution set really is a family described by that many free parameters; that statement needs the implicit function theorem and is not proved here.

B. Practice

Exercise (B1: Determine which of the following)

For each matrix, determine whether it lies in O(2), in O(1,1), in Sp(2,R) — where the relevant forms are I2, I1,1=diag(1,−1), and Ω2 — listing all that apply. Justify each answer.

  • (a) (100−1).
  • (b) (0−110).
  • (c) (3001/3).
  • (d) (5/34/34/35/3).

Solution. Throughout, membership in Sp(2,R) is decided by detP=1 alone (Theorem 14.10.3 (c)), and membership in O(2) by orthonormality of the columns.

  • (a) O(2): yes, the columns are e1 and −e2, orthonormal. O(1,1): yes, P is diagonal with entries ±1, so P⊤I1,1P=I1,1. Sp(2,R): no, detP=−1.

  • (b) O(2): yes, a rotation by π/2. O(1,1): no — P⊤I1,1P=(−1001)=−I1,1≠I1,1. Sp(2,R): yes, detP=1.

  • (c) O(2): no, the first column has norm 3. O(1,1): no — for diagonal P=diag(s,t) the condition is diag(s2,−t2)=diag(1,−1), that is s,t=±1, and 3≠±1. Sp(2,R): yes, detP=3⋅13=1.

  • (d) O(2): no, the first column has norm 25/9+16/9=41/3≠1. O(1,1): yes — this is (cosh⁡tsinh⁡tsinh⁡tcosh⁡t) with cosh⁡t=5/3, sinh⁡t=4/3, and (5/3)2−(4/3)2=1, so Example (Members of Each Family) (a) applies. Sp(2,R): yes, detP=25/9−16/9=1.

Exercise (B2: A symplectic matrix of size four)

Let M=(1201) and S=(0110), and put P1=(MOO(M⊤)−1),P2=(I2SOI2).

  • (a) Write out P1 explicitly and verify P1∈Sp(4,Q) directly from the definition.
  • (b) Explain why P1P2∈Sp(4,Q) without computing the product.
  • (c) Compute detP1 and detP2, and check them against Theorem 14.10.3.

Solution.

  • (a) M⊤=(1021), so (M⊤)−1=(10−21) and P1=(12000100001000−21). By the block computation of Example (Members of Each Family) (b), P1⊤Ω4P1=(OM⊤N−N⊤MO) with N=(M⊤)−1, and M⊤N=M⊤(M⊤)−1=I2. So P1⊤Ω4P1=Ω4.

  • (b) S is symmetric, so P2∈Sp(4,Q) by Example (Members of Each Family) (c). A product of two elements of a group is again in the group, and Sp(4,Q) is a group by Theorem 14.10.1.

  • (c) P1=M⊕(M⊤)−1 is block diagonal, so by Theorem 7.8.4 and Corollary 7.5.6, detP1=detMdet((M⊤)−1)=detM(detM)−1=1, using detM⊤=detM (Theorem 7.4.5). And P2 is block upper triangular with both diagonal blocks equal to I2, so detP2=1 by Theorem 7.8.4. Both equal +1, consistent with the recorded fact Sp(2m,F)⊆SL2m(F); part (a) of the theorem only guarantees ±1.

Exercise (B3: Counting parameters)
  • (a) Compute the expected dimensions of O(4), O(2,2), U(3), and Sp(4,R).
  • (b) For which n and m do O(n) and Sp(2m,R) have the same expected dimension? Solve the resulting equation.
  • (c) The group SO(n) is cut out of O(n) by the single equation detP=1. Why does this not reduce the expected dimension by one?

Solution.

  • (a) O(4) and O(2,2) both have n=4, so 12⋅4⋅3=6. U(3): 32=9 real parameters. Sp(4,R): m=2, so m(2m+1)=10.

  • (b) The equation is 12n(n−1)=m(2m+1), that is n(n−1)=(2m+1)(2m). Reading the right-hand side as n(n−1) with n=2m+1 shows that n=2m+1 is a solution for every m, and it is the only one: n↦n(n−1) is strictly increasing for n≥1, so it takes each value at most once. Hence dim⁡O(2m+1)=dim⁡Sp(2m,R)=m(2m+1), and no other pairing of the two families matches. The smallest case is O(3) and Sp(2,R)=SL2(R), both of dimension 3.

  • (c) Because detP=±1 already, by Theorem 14.10.3 (a). The condition detP=1 does not shrink a continuum of possibilities to a smaller one; it selects one of two discrete alternatives. So SO(n) has the same expected dimension 12n(n−1) as O(n), and the two groups differ only in how many separate pieces they have — which is a topological statement of the kind this section does not prove.

C. Going deeper

Exercise (C1: Isometries of a degenerate form)

Let A=(1000)∈M2(R) and let G={P∈M2(R):P⊤AP=A}, the set produced by dropping the nondegeneracy hypothesis from Definition 14.10.1.

  • (a) Determine G explicitly.
  • (b) Exhibit an element of G that is not invertible, and explain which step of the proof of Theorem 14.10.1 it defeats.
  • (c) Prove that the invertible elements of G do form a group.

Solution.

  • (a) Write P=(abcd). Then P⊤AP=(acbd)(ab00)=(a2ababb2), so the condition is a2=1, ab=0, b2=0. The last two say b=0, and the first says a=±1. Hence G={(±10cd):c,d∈R}.

  • (b) Take c=d=0 and a=1: the matrix (1000) lies in G and has determinant 0. The step it defeats is the cancellation of detA in (detP)2detA=detA. Here detA=0, the equation reads 0=0, and it says nothing about detP.

  • (c) Let G× be the set of invertible elements of G; from (a) these are the matrices above with d≠0. It contains I2. It is closed under products, since G is (the computation in Theorem 14.10.1 needs only P⊤AP=A and Q⊤AQ=A, not invertibility) and a product of invertible matrices is invertible. And it is closed under inverses: if P∈G× then multiplying P⊤AP=A by (P−1)⊤ and P−1 gives P−1∈G, and P−1 is invertible. So G× is a group — but it is not all of G, which is the reason Definition 14.10.1 assumes nondegeneracy rather than repairing the damage afterwards.

Exercise (C2: The symplectic group of a two-dimensional form, revisited)

Let F be any field and let β be a nondegenerate alternating form on a two-dimensional vector space V over F.

  • (a) Prove that Isom(β)={T∈L(V):detT=1}.
  • (b) Deduce that for F=F2 the group Sp(2,F2) has exactly 6 elements, and that Sp(2,F2)=GL2(F2).
  • (c) Is Sp(2,F3)=GL2(F3)? Justify your answer by a count.

Hint for (b) and (c): count the invertible matrices over Fq by choosing the columns in turn.

Solution.

  • (a) Choose a symplectic basis B for β, which exists by Theorem 14.9.2 (b); then [β]BB=Ω2. By the correspondence after Definition 14.10.1, T∈Isom(β) if and only if P:=[T]BB lies in Isom(Ω2)=Sp(2,F), which by Theorem 14.10.3 (c) says detP=1. Finally detT=detP by Definition 7.5.1, since the determinant of an operator is that of its matrix in any basis.

  • (b) By (a), Sp(2,F2)=SL2(F2). Count GL2(F2) first: the first column may be any of the 4−1=3 nonzero vectors, and the second any of the 4−2=2 vectors outside the span of the first, giving 6. Over F2 the only nonzero scalar is 1, so every invertible matrix has det=1; hence SL2(F2)=GL2(F2) has 6 elements.

  • (c) No. The same count over F3 gives |GL2(F3)|=(9−1)(9−3)=48. The determinant is a surjective homomorphism GL2(F3)→F3×, whose target has 2 elements, and its fibers all have the same size; so |SL2(F3)|=24≠48. Concretely diag(1,−1) is invertible with determinant −1≠1, so it lies in GL2(F3) and not in Sp(2,F3).

Exercise (C3: Bounded and unbounded)
  • (a) Prove that every entry of a matrix P∈O(n) satisfies |pij|≤1.
  • (b) Prove that for every n≥2 and every real M, the group O(n−1,1) contains a matrix with an entry larger than M.
  • (c) Explain in two sentences why (a) and (b) together make it plausible that O(n) is compact and O(n−1,1) is not, and say precisely what has and has not been proved.

Solution.

  • (a) The columns of P∈O(n) are orthonormal in Rn (Theorem 11.7.3 (f)), so for each j we have ∑ipij2=1. Each term of a sum of nonnegative reals is at most the sum, so pij2≤1 and |pij|≤1.

  • (b) Put Bt:=(cosh⁡tsinh⁡tsinh⁡tcosh⁡t), which lies in O(1,1) for every real t by Example (Members of Each Family) (a), and consider Pt:=In−2⊕Bt∈Mn(R). (For n=2 read Pt=Bt.) As a block diagonal matrix In−1,1=In−2⊕I1,1, and each block of Pt preserves its own block of the form: In−2⊤In−2In−2=In−2, and Bt⊤I1,1Bt=I1,1 by Example (Members of Each Family) (a). Multiplying block by block gives Pt⊤In−1,1Pt=In−1,1, so Pt∈O(n−1,1). Its (n,n) entry is cosh⁡t=12(et+e−t)≥12et, and et grows without bound, so some t makes this entry exceed the given M.

  • (c) A compact subset of Mn(R)≅Rn2 must be bounded, so (b) rules out compactness for O(n−1,1), while (a) supplies half of what O(n) would need. What has been proved here is only the statement about entries: O(n) is bounded and O(n−1,1) is not. That “bounded and closed implies compact” in Rn2, and that O(n) is closed, are theorems of analysis that this book does not prove, so the compactness claim itself remains recorded rather than established.

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.