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. , and 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.
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.
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 and in . The matrix condition
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
then if and only if , by Theorem 14.1.1 (a) applied
twice.
Two clauses need defending. First,
non-degeneracy. Without it the
definition is worthless: for the condition
holds for every ,
including ,
and the “group” is all of , which has no
inverses. Second, the definition does
not require to be invertible. It
does not have to: invertibility comes free, as the next
result records, and this is exactly what non-degeneracy
buys.
Theorem
14.10.1 (Isometry Groups Are Groups)
Let be non-singular. Then every is invertible, and
is a subgroup of . The same holds
for
inside the group of invertible operators on , and for the Hermitian
version.
Proof. Let . Taking determinants in
and
using Theorem 7.5.4 and Theorem 7.4.5, Since
is non-singular, (Theorem 7.5.2), and
canceling it in the field gives . Hence
and
is invertible,
again by Theorem 7.5.2.
Now the three subgroup checks. , so
. If then using Theorem 0.9.5 for the
first equality, so . And if , multiply on the
left by and on the right by , which is
legitimate because is invertible; this
gives , so . Associativity is
inherited from .
For the Hermitian version replace by throughout; the
determinant step becomes , that is ,
which again forces . The operator version is the matrix
version read through a basis. This proves the
theorem.
The proof is the one Chapter 11 gave for and in Proposition 11.7.4
(a), with
replaced by ;
nothing in it used what was, only that it was
non-singular. That is the whole point of the section:
the group structure never depended on positivity, on
symmetry, or on the field.
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.
Proof. Let .
Substituting and writing , where the second step multiplies on the left
by and
on the right by and uses Theorem 0.9.5; both
operations are reversible because is invertible. So
if and only if , which is the claimed
equality of sets. Conjugation by 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 , Corollary 14.5.2 says a
non-degenerate symmetric form is congruent to exactly
one ;
over , Corollary 14.4.4 says a
non-degenerate symmetric form is congruent to and nothing else;
and Theorem 14.9.2 says a
symplectic form is congruent to and nothing
else. Each classification theorem of this chapter
therefore doubles as a list of groups.
The four
families
Definition
14.10.2 (The Indefinite Orthogonal and
Symplectic Groups)
For
with , set
and the indefinite orthogonal
group of signature . For and any field
, set the symplectic group, where
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.
|
over |
symmetric, positive definite |
Ch 11 §07 |
|
over
|
symmetric, signature |
§05 |
|
over |
Hermitian, positive definite |
Ch 11 §07 |
|
over |
alternating, non-degenerate |
§09 |
Two remarks on the list. ,
so the ordinary orthogonal group is the extreme case of
the indefinite one; and and are conjugate,
because negating a form does not change which maps
preserve it, and becomes after a
permutation of the coordinates, which is a congruence.
There is no for
odd size: a non-degenerate alternating form exists only
in even dimension (Theorem 14.9.2 (b)).
Example
(Members of Each Family)
Verify the following memberships, with as
above.
- (a) for every .
- (b) for every invertible .
- (c) if and only if .
Solution.
(a) With , and , using and the symmetry of the outer
matrix.
(b) Write with
.
Multiplying the blocks, which equals exactly when
,
that is .
(c) With ,
which equals exactly when
. Such a
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.
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 be any field and
non-singular. Then for every . In particular
for
,
and both signs occur when .
- (b) If is
Hermitian and non-singular, then
for every ; in particular for
.
- (c) . In
particular every has exactly, and does not occur.
Proof.
(a) The proof of
Theorem 14.10.1 established
. The
polynomial has at most two roots in a field (Corollary 6.1.4), and
and are roots, so . For
, the
identity has determinant ; and satisfies , since is diagonal and
squaring its entries gives , while .
(b) Also
established in that proof: ,
and a non-negative real with square is . This is Proposition 11.7.4
(b) for .
(c) Write and let be arbitrary.
Multiplying out, Since , the equation holds if
and only if . This proves the theorem.
Warning. Every symplectic
matrix has determinant , not . The
general argument of part (a) applies to as well and
gives only , so it leaves open. It is
nevertheless true that for every , so never occurs. Part (c)
proves this for ; the general case is not proved in
this book. The clean route runs through the
Pfaffian of Section 9 and its transformation rule : applied to , whose
Pfaffian is , it
turns directly into . 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. has the proper
subgroup cut
out by ,
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.
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 is a system of scalar equations in the unknown entries of
. If the system
consisted of
independent equations we would expect the solutions to
form a family described by free parameters,
and that number is what everybody calls the
dimension of the group. The key
observation is that the equations are far
from independent, because the matrix is not an
arbitrary matrix: it has the same symmetry type as , by Proposition 14.2.4. So the
equations repeat, and only the independent ones should
be counted.
- If is
symmetric, then is
symmetric, and a symmetric matrix has
independent entries. Expected dimension: .
- If is
alternating, then is
alternating, and an alternating matrix has
independent entries. Expected dimension: .
- If is
Hermitian over , count real
parameters: has
of them, and a
Hermitian matrix has real diagonal entries
and
complex entries above the diagonal, in total real conditions.
Expected real dimension: .
| , , |
|
|
|
| (real
parameters) |
|
|
|
|
|
|
|
Small cases are a sanity check. comes out at
dimension , and
Chapter 11 found that its elements are described by a
single angle. comes out at
, matching the
axis-and-angle description of Corollary 12.6.2:
two parameters for the axis direction, one for the
angle.
comes out at , and
is the
unit circle in .
And comes out at , which is right: four
entries subject to the single equation .
Compare the orthogonal and symplectic rows of the
table at .
The orthogonal group is smaller than the symplectic
group of the same size, by exactly . The gap is the gap between symmetric and
alternating matrices, which is the 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 “ independent-looking
equations” to “ parameters” is not justified by anything
proved above; for a non-linear 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 is indexed by
two integers, yet the table gives it a dimension
depending only on , not on how splits. Does that mean
and
are the
same group?
Solution. No. The count of
conditions only sees that is symmetric,
not which symmetric matrix it is, so it cannot
distinguish the two. They are genuinely different
groups: consists of matrices all of whose
entries have absolute value at most , since its columns are
unit vectors, whereas contains
matrices with arbitrarily large entries, as the next
warning shows. Conjugate groups come from
congruent forms (Proposition 14.10.2), and
and are not
congruent, because their signatures differ (Corollary 14.5.2).
Boundedness and its absence
Warning. is not compact
when ,
unlike .
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
non-degenerate symmetric real form of signature , hence congruent to
. For every
real , so lies in ,
and its entries are unbounded as . By Proposition 14.10.2 the same
unbounded family sits inside , and padding
with an identity block puts it inside every with . By contrast
every entry of a matrix in has absolute
value at most ,
because each column is a unit vector for the Euclidean
norm.
The same phenomenon shows up in , by Example (Members of Each Family)
(b) with :
the symplectic group is unbounded too. Only the two
positive definite families, and , 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 , and works out what
its isometry group does to the geometry of
spacetime.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) Define
for a non-singular , and explain why its elements are
automatically invertible.
- (b) Which form does
preserve, and which does preserve?
- (c) Determine
whether the following is correct: if , then . Justify your
answer.
- (d) State what is
known here about for ,
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) (Definition 14.10.1). Taking
determinants gives , and , so and (Theorem 14.10.1).
(b) preserves the
real symmetric form with matrix , of signature . preserves the
standard alternating form with matrix (Definition 14.10.2).
(c) Incorrect as
stated: the two groups are conjugate,
, not equal (Proposition 14.10.2). For a
witness take and with . Then
, but the corresponding
element of
is not in .
What is always true is that the two groups are
isomorphic.
(d) Proved here:
,
hence , for every (Theorem 14.10.3 (a)); and
exactly,
for , since
(part (c)). Recorded but not proved: for every
, which follows
from the transformation rule of the Pfaffian.
(e) The number of
free parameters expected in the solution set of , computed
as 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 , in , in — where the
relevant forms are ,
and —
listing all that apply. Justify each answer.
- (a) .
- (b) .
- (c) .
- (d) .
Solution. Throughout, membership in
is
decided by alone (Theorem 14.10.3 (c)), and
membership in by
orthonormality of the columns.
(a) : yes, the
columns are
and ,
orthonormal. : yes, is diagonal with
entries , so
. : no, .
(b) : yes, a rotation
by . : no — .
: yes,
.
(c) : no, the first
column has norm .
: no —
for diagonal the condition is , that is , and . : yes, .
(d) : no, the first
column has norm . : yes — this is
with , and , so
Example (Members of Each Family)
(a) applies. : yes, .
Exercise
(B2: A symplectic matrix of size four)
Let and , and put
- (a) Write out explicitly and
verify directly from the definition.
- (b) Explain why
without computing the product.
- (c) Compute and , and check them
against Theorem 14.10.3.
Solution.
(a) , so
and By the block computation of Example (Members of Each Family)
(b), with , and
. So .
(b) is symmetric, so by Example (Members of Each Family)
(c). A product of two elements of a group is again in
the group, and is a group by
Theorem 14.10.1.
(c) is block diagonal, so by Theorem 7.8.4 and Corollary 7.5.6,
using (Theorem 7.4.5). And
is block upper
triangular with both diagonal blocks equal to , so by Theorem 7.8.4. Both
equal ,
consistent with the recorded fact ; part (a) of the theorem only
guarantees .
Exercise
(B3: Counting parameters)
- (a) Compute the
expected dimensions of , , and .
- (b) For which and do and have the same
expected dimension? Solve the resulting equation.
- (c) The group is cut out of
by the
single equation . Why does this not reduce
the expected dimension by one?
Solution.
(a) and both have
, so . : real parameters.
: , so .
(b) The equation
is , that is .
Reading the right-hand side as with shows that is a solution
for every , and it is the only
one: is strictly increasing for , so it takes each
value at most once. Hence and no other pairing of the two families
matches. The smallest case is and ,
both of dimension .
(c) Because already,
by Theorem 14.10.3 (a). The
condition does not shrink a continuum of possibilities
to a smaller one; it selects one of two discrete
alternatives. So has the same
expected dimension as , 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 and let , the set produced by
dropping the non-degeneracy hypothesis from Definition 14.10.1.
- (a) Determine explicitly.
- (b) Exhibit an
element of 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 do form a group.
Solution.
(a) Write . Then so the condition is , , . The last two say
, and the
first says . Hence
(b) Take and : the matrix lies in and has determinant
. The step it
defeats is the cancellation of in . Here , the equation reads , and it says
nothing about .
(c) Let be the set of
invertible elements of ; from (a) these are the
matrices above with . It contains . It is closed under
products, since
is (the computation in Theorem 14.10.1 needs only
and
, not
invertibility) and a product of invertible matrices is
invertible. And it is closed under inverses: if then
multiplying by and gives , and is invertible. So
is a
group — but it is not all of , which is the reason Definition 14.10.1 assumes
non-degeneracy rather than repairing the damage
afterwards.
Exercise
(C2: The symplectic group of a two-dimensional form,
revisited)
Let be any
field and let
be a non-degenerate alternating form on a
two-dimensional vector space over .
- (a) Prove that .
- (b) Deduce that for
the group
has
exactly elements,
and that .
- (c) Is ? Justify your answer by a
count.
Hint for (b) and (c): count the invertible
matrices over
by choosing the columns in turn.
Solution.
(a) Choose a
symplectic basis for , which exists by Theorem 14.9.2 (b); then
. By the correspondence after Definition 14.10.1, if and only if lies in , which by Theorem 14.10.3 (c) says
. Finally
by
Definition 7.5.1,
since the determinant of an operator is that of its
matrix in any basis.
(b) By (a), . Count first: the
first column may be any of the non-zero
vectors, and the second any of the vectors outside
the span of the first, giving . Over the only non-zero
scalar is , so
every invertible matrix has ; hence has elements.
(c) No. The same
count over
gives . The determinant is a
surjective homomorphism , whose target has elements, and its
fibers all have the same size; so . Concretely is
invertible with determinant , so it lies in
and
not in .
Exercise
(C3: Bounded and unbounded)
- (a) Prove that every
entry of a matrix satisfies .
- (b) Prove that for
every and
every real , the
group
contains a matrix with an entry larger than .
- (c) Explain in two
sentences why (a) and (b) together make it plausible
that is
compact and is not, and
say precisely what has and has not been proved.
Solution.
(a) The columns
of
are orthonormal in (Theorem 11.7.3
(f)), so for each
we have . Each term of a sum of non-negative reals is
at most the sum, so and .
(b) Put , which lies in
for
every real by Example (Members of Each Family)
(a), and consider (For read .) As a block diagonal matrix , and each block of preserves its own
block of the form: , and by Example (Members of Each Family)
(a). Multiplying block by block gives , so . Its entry is , and grows without bound,
so some makes
this entry exceed the given .
(c) A compact
subset of must be bounded, so (b) rules out
compactness for , while (a)
supplies half of what would need. What
has been proved here is only the
statement about entries: is bounded and
is
not. That “bounded and closed implies compact” in , and that is closed, are
theorems of analysis that this book does not prove, so
the compactness claim itself remains recorded rather
than established.