Let n≥2 and let f:GLn(R)→R× be a continuous group homomorphism. Show that there is a real number c such that either f(A)=∣detA∣c for all A, or f(A)=sgn(detA)∣detA∣c for all A.
Hint
Show f is trivial on SLn(R) (which equals its own commutator subgroup, while R× is abelian). Then f depends only on detA.
Show solutionHide solution
Solution
Idea. A homomorphism to an abelian group kills commutators. Since SLn(R) is generated by commutators, f factors through the determinant. The problem then reduces to continuous homomorphisms R×→R×.
Step 1: f is trivial on commutators. For A,B in GLn, f(ABA−1B−1)=f(A)f(B)f(A)−1f(B)−1=1, because R× is abelian.
Step 2: SLn(R) is generated by commutators.SLn(R) is generated by elementary matrices Eij(t)=I+tEij (i=j) (row reduction). For n≥3 and distinct i,j,k, [Eik(a),Ekj(b)]=Eij(ab), so every Eij(t) is a commutator (take a=t, b=1). For n=2, let D=diag(2,21)∈GL2; then DE12(s)D−1=E12(4s), so E12(3s)=DE12(s)D−1E12(−s)=[D,E12(s)] is a commutator in GL2, and so is every E12(t) (take s=t/3); similarly E21(t). In all cases the generators of SLn lie in the commutator subgroup of GLn. By Step 1, f≡1 on SLn(R).
Step 3: factorisation through det. Let Δ(d)=diag(d,1,…,1). For A∈GLn with detA=d, AΔ(d)−1∈SLn, so f(A)=f(AΔ(d)−1)f(Δ(d))=g(d),g(d):=f(Δ(d)). Since Δ(d)Δ(d′)=Δ(dd′), g:R×→R× is a continuous homomorphism.
Step 4: continuous homomorphisms R×→R×. For x>0, g(x)=g(x)2>0. So h(s)=lng(es) is a continuous additive function R→R, hence h(s)=cs for some c (Cauchy's equation with continuity). Thus g(x)=xc for x>0. Finally g(−1)2=g(1)=1 gives g(−1)=±1, and g(−x)=g(−1)g(x). So g(d)=∣d∣c (if g(−1)=1) or g(d)=sgn(d)∣d∣c (if g(−1)=−1).
Conclusion.f(A)=g(detA) is of the stated form.
Remark. Continuity is needed only to exclude pathological homomorphisms (as for Cauchy's equation). For n=1 the same classification holds for continuous homomorphisms of R× to itself, but the factorisation argument is not needed.
Lesson. Homomorphisms into abelian groups factor through the abelianisation; GLn(R)ab≅R× via det.