The theory of representations of finite groups, discovered by Frobenius toward the end of the 19th century, consists in analyzing the properties and structure of a finite group (G,⋅) by making it act linearly on a vector space. In this post, we use representation theory to prove a theorem about Frobenius groups. In the appendix, we gather some prerequisites that we will use without further mention in this text. This work was originally a TIPE (Travail d'Initiative Personnelle Encadré) for the Ecole Normale Supérieure and was given the grade 18/20.
The Frobenius Theorem
Definition 1.
Let (G,⋅) be a finite group with identity e and H a proper subgroup of G (i.e. H={e} and H=G). We say that G is a Frobenius group, that H is a Frobenius complement, and that (G,H) is a Frobenius pair if
∀g∈G∖H,gHg−1∩H={e}.
Note that this is equivalent to
∀(x,y)∈G2,y−1x∈/H⟹xHx−1∩yHy−1={e}.
Intuitively, this means that the conjugates of H cover G "as much as possible."
One can show that for any subgroup H the above equality is in fact an inequality (≤). It also shows that the conjugates of a proper subgroup never cover G (recall that G is finite, otherwise G=GLn(C) and H=Tn(C)∩GLn(C) the group of invertible triangular matrices produce a counter-example).
Example 1.
Let G be a finite group acting transitively on a set X such that for every g∈G∖{e}, g fixes at most one point of X. Then, if α∈X is such that Stab(α)={e}, the pair (G,Stab(α)) is a Frobenius pair.
Proof.
We have Stab(α)=G (by transitivity). If g∈G∖Stab(α), then g⋅α=α; hence g⋅α and α are simultaneously fixed only by e. Therefore, Stab(g⋅α)∩Stab(α)={e}, i.e. gStab(α)g−1∩Stab(α)={e}□.
One can in fact show that every Frobenius group is of this form. Here are some examples:
Example 2.
If K is a finite field and
G=Aff(1,K)={τa,b:x∈K↦ax+b,(a,b)∈K∗×K}
is the group of affine bijections of K onto itself, and
H(K)={τa,0:x∈K↦ax,a∈K∗}
(the subgroup of those that fix 0), then (G,H) is a Frobenius pair. (Note: τa,b fixes exactly b/(1−a) for a=1; fixes no point of K for a=1 and b=0; and fixes all of K for a=1 and b=0 — i.e. for τa,b=id; finally, H(K)=Stab(0).)
If G=A4 (the alternating group) and γ is a 3-cycle, then (G,⟨γ⟩) is a Frobenius pair.
If n∈N∗ is odd, Dn is the dihedral group (the group of affine transformations of the plane preserving the regular n-gon centered at the origin), and s is an orthogonal symmetry in Dn, then (Dn,⟨s⟩) is a Frobenius pair.
Theorem 1 (Frobenius).
Let (G,H) be a Frobenius pair. Define
N=(G∖(g∈G⋃gHg−1))∪{e},
called the Frobenius kernel. Then N is a normal subgroup of G, and N∩H={e}, and G=NH (we say that G is the semidirect product of N by H).
The fact that N∩H={e} is evident; moreover, by Proposition 1,
∣N∣=∣G∣−g∈G⋃gHg−1+1=∣H∣∣G∣.
Assuming that N is a subgroup of G, the map
φ:(n,h)∈N×H↦nh
is injective (if nh=n′h′ then n′−1n=h′h−1∈N∩H={e}, hence (n,h)=(n′,h′)) and, by cardinality, surjective; thus, G=NH. Moreover, if g∈G, then gNg−1⊆N (otherwise an element of N∖{e} would be conjugate to an element of H, contradicting the definition of N); hence, N is normal. The difficult part of the theorem lies in proving that N is a subgroup. This will be demonstrated in Section 5.
Example 3.
Revisiting the pairs from Example 2 in the “group action” formulation of Example 1, the Frobenius kernel is the set of elements of G acting without fixed points, to which the identity e is added. Thus:
The kernel of (A4,⟨γ⟩) is the Klein group
V={id,(12)(34),(13)(24),(14)(23)}.
The kernel of (Aff(1,K),H(K)) is the subgroup
{τ1,b:b∈K}
of translations in Aff(1,K).
The Frobenius kernel of Dn is the group of rotations centered at the origin by an angle in n2πZ (naturally isomorphic to Un).
Representations of a Finite Group
To prove the Frobenius theorem, we will try to express N as the kernel of a representation.
Definition 2.
Let (G,⋅) be a finite group. A representation of G is a pair (ρ,V) where V is a finite-dimensional C-vector space and ρ is a homomorphism from G to GL(V). We will sometimes denote it simply by ρ. The degree of ρ is the integer dim(V).
Thus, we view the elements of G as linear transformations on V.
Example 4.
Representations of degree 1 correspond to homomorphisms from G to C∗. In particular, the trivial representation is the one corresponding to the trivial homomorphism from G to C∗.
A more elaborate example: if (fg)g∈G is a basis of a vector space V of dimension ∣G∣ indexed by G, and for each g∈G we define ρ(g) as the unique element of GL(V) such that
∀h∈G,ρ(g)(fh)=fgh,
then we have defined a representation of G called the regular representation. Moreover, it is said to be faithful because ker(ρ)={e}.
If (ρ,V) and (ρ′,V′) are two representations of G, then by setting, for g∈G, one defines a representation on the space L(V,V′) (the space of linear maps from V to V′) by
∀u∈L(V,V′),(ρ,ρ′)(g)(u)=ρ′(g)∘u∘ρ(g−1).
Let (ρ,V) and (ρ′,V′) be as above. Then one defines a representation (ρ⊕ρ′,V⊕V′) by
∀(g,v,v′)∈G×V×V′,(ρ⊕ρ′)(g)((v,v′))=(ρ(g)(v),ρ′(g)(v′)).
This construction also works for direct sum decompositions in which ρ and ρ′ are defined: in a basis adapted to this decomposition, the matrices of (ρ⊕ρ′)(g) will consist of two square diagonal blocks of sizes dim(V) and dim(V′).
Definition 3.
If (ρ,V) and (ρ′,V′) are two representations of G, we say that ρ is equivalent to ρ′ (and write ρ∼ρ′) if dim(V)=dim(V′) and if there exist bases e of V and e′ of V′ such that
∀g∈G,Mat(ρ(g))=Mat(ρ′(g)).
In other words, if there exists an isomorphism u∈L(V,V′) such that
∀g∈G,u∘ρ(g)=ρ′(g)∘u.
Moreover, for any ρ,ρ′ we denote
Hom(ρ,ρ′)={u∈L(V,V′)∣∀g∈G,u∘ρ(g)=ρ′(g)∘u},
which is clearly a subspace of L(V,V′).
Definition 4.
A representation ρ of G is said to be irreducible if the only subspaces of V that are stable under all ρ(g) for g∈G are {0} and V.
These representations cannot be “broken” into subrepresentations; this is the case, for example, for representations of degree 1. In fact, we have the following proposition:
Proposition 2 (Maschke).
Let (ρ,V) be a representation of G and U a subspace of V that is stable under all ρ(g) for g∈G. Then there exists a supplementary subspace S of U that is also stable under all ρ(g).
Proof.
It suffices to construct a projector with image U that commutes with all ρ(g); its kernel will then be the desired supplementary subspace. Let p be any projector with image U. Modify it by averaging over G:
q=∣G∣1g∈G∑ρ(g)∘p∘ρ(g−1).
This is an endomorphism whose image is contained in U and such that q∣U=idU (since the ρ(g) stabilize U) and which commutes with all ρ(g) (because ρ(g)∘q∘ρ(g−1)=q, as the map g↦hg is bijective). □
By induction on the dimension of V, one shows the following reduction result:
Proposition 3.
If (ρ,V) is a representation, then there exists k∈N∗ and subspaces V1,V2,…,Vk of V such that
V=i=1⨁kVi,
and there exist irreducible representations (ρ1,V1),…,(ρk,Vk) such that
ρ=ρ1⊕ρ2⊕⋯⊕ρk.
Finally, here is one last proposition that will prove very useful:
Proposition 4 (Schur).
Let (ρ,V) and (ρ′,V′) be two irreducible representations of G. Then
dimHom(ρ,ρ′)={10if ρ∼ρ′,if ρ∼ρ′.
Proof.
Suppose ρ∼ρ′. Up to transporting ρ′ via the isomorphism given by the equivalence, assume V=V′ and ρ=ρ′. Let u∈Hom(ρ,ρ). Since C is algebraically closed, u has an eigenvalue λ. Then for all g∈G, u and ρ(g) commute, hence the eigenspace Eλ(u)=ker(u−λid) is stable under ρ(g). By the irreducibility of ρ, since Eλ(u) is nonzero, it must equal V, so that u=λid. Conversely, every map of the form λid (with λ∈C) belongs to Hom(ρ,ρ). Hence, Hom(ρ,ρ)=Cid has dimension 1.
Suppose ρ∼ρ′. Let u∈Hom(ρ,ρ′). For any g∈G, we have ρ′(g)∘u=u∘ρ(g). Thus, the image im(u) is stable under ρ′(g). By irreducibility, im(u) is either V′ or {0}. Similarly, ker(u) is either V or {0}. Therefore, if u is not an isomorphism, then ker(u)=V and im(u)={0}, so that u=0. This completes the proof. □
Characters
A large part of the information contained in a representation is actually stored in its character:
Definition 5.
Let (ρ,V) be a representation of G. The character of ρ is the function
χρ:G→C,g↦Tr(ρ(g)).
A character is any function in CG that is the character of some representation. We say that a character is irreducible if it comes from an irreducible representation.
Example 5.
χ(e)=Tr(id) is the degree of the representation.
Two equivalent representations have the same character (i.e. the same matrices in well-chosen bases).
If g,h∈G and χ is a character, then
χ(ghg−1)=Tr(ρ(g)ρ(h)ρ(g)−1)=Tr(ρ(h))=χ(h).
We denote by Cent(G) the subspace of central functions on G (i.e. functions constant on the conjugacy classes of G; its dimension is the number of such classes). Then χ∈Cent(G).
Trivially, χρ1⊕ρ2=χρ1+χρ2.
For any g∈G, since g∣G∣=e, the polynomial
X∣G∣−1=ω∈U∣G∣∏(X−ω)
annihilates ρ(g) and splits with simple roots. Hence, ρ(g) is diagonalizable with spectrum contained in U∣G∣. If {λ1,…,λd} is the spectrum of ρ(g), then {λ1−1,…,λd−1} is the spectrum of
ρ(g)−1=ρ(g−1),
so that, since the eigenvalues lie in U∣G∣,
χ(g−1)=λ1−1+⋯+λd−1=λ1+⋯+λd=χ(g).
Using the notations of Example 4, one has
χρ,ρ′=χρχρ′,
which is a consequence (via the previous point and the definition of (ρ,ρ′)) of the fact that for A,B∈Mn(C), the linear map M∈Mn(C)↦AMB∈Mn(C) has trace Tr(A)Tr(B).
Definition/Proposition 1.
We endow CG with the Hermitian inner product (see Appendix) defined by
∀(u,v)∈CG×CG,⟨u,v⟩=∣G∣1g∈G∑u(g)v(g).
To compute the Hermitian inner product of two characters, we again use the “averaging technique”:
Lemma 1.
Let ρ be a representation. Then
∣G∣1g∈G∑ρ(g)
is a projector onto
VG:=g∈G⋂ker(ρ(g)−id).
Proof.
If x∈VG, then
∣G∣1g∈G∑ρ(g)(x)=∣G∣1g∈G∑x=x(1).
Moreover, if x∈V and
y=∣G∣1g∈G∑ρ(g)(x),
then for any h∈G
ρ(h)(y)=∣G∣1g∈G∑ρ(hg)(x)=y,
(since the map g↦hg is bijective) hence y∈VG (2).
With (1) and (2), the result follows. □
Proposition 5.
If (ρ,V) and (ρ′,V′) are two representations of G, then
⟨χρ,χρ′⟩=dimHom(ρ,ρ′).
Proof.
Define (ρ,ρ′) as in Example 4. Apply Lemma 1 to this representation.
On one hand,
g∈G⋂ker((ρ,ρ′)(g)−idL(V,V′))=Hom(ρ,ρ′),
so that
Tr(∣G∣1g∈G∑(ρ,ρ′)(g))=dimHom(ρ,ρ′),
(since for a projector its trace equals its rank). On the other hand, by linearity and Example 5,
Combining with Schur’s lemma (Proposition 4) completes the proof. □
Corollary 1.
If (ρ,V) and (ρ′,V′) are two irreducible representations of G, then
⟨χρ,χρ′⟩={10if ρ∼ρ′,if ρ∼ρ′.
Thus, the family of irreducible characters is orthonormal and finite (since CG is finite-dimensional). Moreover, two non-equivalent irreducible representations have distinct characters; hence there are as many irreducible representations (up to equivalence) as there are irreducible characters.
Denote by ρ1,…,ρr a complete set of irreducible representations and by χ1,…,χr the associated characters. Combining with Proposition 3, we obtain:
Corollary 2.
If ρ is a representation, then there exist (n1,…,nr)∈Nr such that
Proposition 6.
If ρ and ρ′ are two representations, then
ρ∼ρ′⟺χρ=χρ′.
Proof.
The direct implication is clear. Suppose χρ=χρ′=:χ. Write
ρ∼n1ρ1⊕⋯⊕nrρrandρ′∼n1′ρ1⊕⋯⊕nr′ρr.
By orthonormality, ⟨χi,χρ⟩=ni and similarly ⟨χi,χρ′⟩=ni′. Thus, ni=ni′ for each i, and so ρ∼ρ′. □
One can in fact show a stronger result than the orthonormality of characters (we will not prove it here):
Proposition 7.
The irreducible characters χ1,…,χr form an orthonormal basis of Cent(G). Thus, r is the number of conjugacy classes in G and if f∈Cent(G),
f=i=1∑r⟨χi,f⟩χi.
Induced Representations
Let H be a subgroup of G. Starting from a representation (ρ,V) of G, one can easily obtain the representation (ρ∣H,V) of H, denoted ρ∣H. Conversely, the purpose of this section is to give a natural way to extend a representation (ρ0,W) of H to a representation (ρ,V) of G (with W⊆V). Denote
G=i=1⨆lgiH,
the partition of G into left cosets modulo H (with g1H=H).
Definition 6.
Let (ρ,V) be a representation of G and let W be a subspace of V that is stable under ρ(h) for all h∈H. Let ρ0=ρ∣H,W be the restriction of ρ to H and the subspace W. We say that ρ is induced from ρ0 and write
ρ=IndHG(ρ0)
if
V=i=1⨁lρ(gi)(W).(*)
Note that under the assumptions of Definition 6, if g∈G can be written as g=gih with h∈H, then
ρ(g)(W)=ρ(gih)(W)=ρ(gi)∘ρ(h)(W)=ρ(gi)(W).
Thus, the subspaces ρ(gi)(W) do not depend on the choice of representatives of the left cosets modulo H. We have the following proposition:
Proposition 8.
If ρ′ is a representation of H, there exists (up to equivalence) a unique representation ρ of G such that
ρ=IndHG(ρ′).
We do not prove this (although the proof is quite strait-forward once you read the following): let's just observe that if (ρ0,W) and the action of the ρ(gi) on W are fixed, then the induced representation is uniquely determined. Indeed, it is enough that it be so on the subspaces ρ(gi)(W) (by direct sum) and if g∈G, 1≤i≤l, w∈W, one has
ρ(g)(ρ(gi)(w))=ρ(gj)(ρ0(h)(w))
where ggi=gjh (we take the representative of the class of ggi modulo H).
Proposition 9.
Let (ρ,V) and (ρ′,V′) be two representations of G and let (ρ0,W) be a representation of H. Suppose that ρ=IndHG(ρ0) (in particular, ρ0=ρ∣H,W). Then
Hom(ρ,ρ′)≃Hom(ρ0,ρ′∣H).
Proof.
The map
u∈Hom(ρ,ρ′)⊂L(V,V′)⟼u∣W∈Hom(ρ0,ρ′∣H)⊂L(W,V′)
is linear. For bijectivity, one shows that any element v∈Hom(ρ0,ρ′∣H) extends uniquely to an element u∈Hom(ρ,ρ′) on V via the direct sum decomposition (*). □
Translating Proposition 9 into an equality of dimensions (using Proposition 5), we have:
Corollary 3.
Using the notations of Proposition 9 and denoting IndHG(χρ0)=χρ, and letting ⟨⋅,⋅⟩G (resp. ⟨⋅,⋅⟩H) be the canonical inner product on Cent(G) (resp. Cent(H)), we have
⟨IndHG(χρ0),χρ′⟩G=⟨χρ0,χρ′∣H⟩H.
Thus, by Proposition 6, one may speak of the "induced character" of χρ0 for IndHG(χρ0).
Proposition 10.
If χ is a character of H, then for every g∈G,
IndHG(χ)(g)=∣H∣1k∈Gkgk−1∈H∑χ(kgk−1).
Proof.
Let (ρ,V) and (ρ′,W) be such that χ=χρ′ and ρ=IndHG(ρ′). For g∈G, ρ(g) permutes the subspaces ρ(gi)(W). In a basis adapted to the decomposition
V=i=1⨁lρ(gi)(W),
to compute the trace of ρ(g) it suffices to consider those indices i such that
ρ(g)(ρ(gi)(W))=ρ(gi)(W),
i.e. such that gi−1ggi∈H. Thus, by the invariance of trace under change of basis (transporting ρ(gi)(W) to W via the isomorphism ρ(gi)),
Since χ is central on H and each right coset of H has cardinality ∣H∣, the result follows. □
This formula allows us to define IndHG(f) for any central function f (replacing χ by f in the formula). As the characters linearly generate the central functions, we deduce from Corollary 3:
Proposition 11.
If f1∈Cent(H) and f2∈Cent(G), then
⟨IndHG(f1),f2⟩G=⟨f1,f2∣H⟩H.
Proof of the Frobenius Theorem
Now we present the proof of Theorem 1. Fix a Frobenius pair (G,H). Let N be the corresponding Frobenius kernel. The central result in the proof is the following proposition:
Proposition 12.
Let χ be an irreducible character of H. There exists an irreducible character χ of G such that χ∣H=χ and χ is constant on N.
Remark 1.
It is easy to see that any central function on H extends in a unique way to a central function on G which is constant on N. What matters here is that this extension is a (irreducible) character.
Here is a lemma that will allow us to produce characters constant on N:
Lemma 2.
Let f∈Cent(H) such that f(e)=0 and let f=IndHG(f). Then f∣H=f and f∣N=0.
Proof.
It is immediate from the definition of the induced function that f(e)=0=f(e).
Let g∈H∖{e}. Note that if k∈G then kgk−1∈H if and only if g∈k−1Hk∩H. By the definition of a Frobenius complement, k∈H. Hence,
Now, let g∈N∖{e}. For any k∈G, kgk−1∈/H (otherwise g∈k−1Hk, contradicting the definition of N). Thus, f(kgk−1)=0 and so f(g)=0. □
Proof of Proposition 12.
Let d=χ(e) be the degree of χ, l=∣G∣/∣H∣∈N, θH the trivial character of H and θG the trivial character of G. If χ is the trivial character, simply take χ as the trivial character of G, which is irreducible.
Otherwise, to apply Lemma 2, consider χ−d⋅θH∈Cent(H) which vanishes at e.
Then, set
ψ:=IndHG(χ−d⋅θH).
By Lemma 2, ψ vanishes on N and restricts to χ−d⋅θH on H (denoted by (∗)). However, ψ is not a character (since ψ(e)=0). In order to obtain an irreducible character, we need a central function of Hermitian norm 1. Compute, using Proposition 11,
Moreover, χ is clearly a Z-linear combination of characters. Hence, there exist integers n1,…,nr such that
χ=i=1∑rniχi.
Then
1=⟨χ,χ⟩=n12+⋯+nr2,
so that, as the ni are integers, only one of them is nonzero and equals ±1. Since χ(e)=d>0, that nonzero ni equals 1 and χ is an irreducible character.
Finally, χ remains constant on N (because we added d⋅θG to ψ, which was constant on N), and for h∈H,
χ(h)=ψ(h)+d⋅θG(h)=(χ−d⋅θH)(h)+d=χ(h).
Thus, χ∣H=χ, which completes the proof. □
Remark 2.
We actually know all the values taken by χ. Indeed, one has
G=N∪(g∈G⋃gHg−1),
and no element of N is conjugate to an element of ⋃g∈GgHg−1∖{e} (otherwise it would be conjugate to an element of H∖{e}). Moreover, every element of ⋃g∈GgHg−1∖{e} is conjugate to an element of H. If we denote by A1,…,Am the conjugacy classes in G of the elements of ⋃g∈GgHg−1∖{e}, then
g∈G⋃gHg−1∖{e}=i=1⨆mAi,
and we choose h1∈A1∩H,…,hm∈Am∩H. Then, since characters are central, one obtains the following table:
e
A1
…
Am
N∖{e}
ψ
0
χ(h1)−d
…
χ(hm)−d
0
θG
1
1
…
1
1
χ=ψ+dθG
d
χ(h1)
…
χ(hm)
d
(with d=χ(e)=χ(e)).
The decomposition of a character into irreducible characters yields the following corollary:
Corollary 4.
Let χ be a character of H. There exists a character χ of G such that χ∣H=χ and χ is constant on N. The table above remains valid.
One last lemma will allow us to conclude.
Lemma 3.
Let χ be a character of G coming from a representation ρ. Then
χ(g)=χ(e)if and only ifg∈ker(ρ).
Proof.
Let d=χ(e) be the degree of ρ. For g∈G, as seen in Example 5, ρ(g) is diagonalizable with spectrum {λ1,…,λd} in U. Then by the triangle inequality,
∣χ(g)∣=∣λ1+⋯+λd∣≤∣λ1∣+⋯+∣λd∣=d=χ(e),
with equality if and only if λ1,…,λd are positively collinear, i.e. if they are all equal (since they are of modulus 1). Therefore, χ(g)=χ(e) if and only if λ1=⋯=λd=1, that is, if and only if ρ(g)=id. □
At this point, all the ingredients are in place to conclude.
Conclusion of the Proof of Theorem 1.
Take ρ a faithful representation of H (for example, the regular representation) and χ its character. Let χ be as in Corollary 4 and ρ the associated representation. We now show that
N=ker(ρ).
From the table in Remark 2 and Lemma 3, we have
ker(ρ)={x∈G∣χ(x)=χ(e)}=N,
(where the last equality uses the fact that for the chosen h1,…,hm we have χ(hi)=χ(e) by Lemma 3 and the faithfulness of ρ).
Thus, N is indeed a (normal) subgroup of G, which completes the proof.
□
Appendix: Useful Prerequisites
In this section, let (G,⋅) be a finite group.
Definition A.
Let X be a set. An action of the group G on X is any homomorphism φ from G to S(X). We denote
g⋅x:=φ(g)(x)for (g,x)∈G×X.
If x∈X, the stabilizer of x is the set
Stab(x)={g∈G∣g⋅x=x}.
It is straightforward to verify that this is a subgroup of G. The action is said to be faithful if φ is injective, and transitive if for all x∈X,
{g⋅x,g∈G}=X.
Proposition A.
Suppose that G acts on X. Then for any g∈G and x∈X,
Stab(g⋅x)=gStab(x)g−1.
Proof.
If h∈Stab(g⋅x), then
h⋅(g⋅x)=g⋅x⟺(g−1hg)⋅x=x⟺g−1hg∈Stab(x),
i.e. h∈gStab(x)g−1. □
Definition B.
Let (G,⋅) be a group.
For g∈G, the map
φg:x∈G↦gxg−1∈G
is an automorphism of the group, called the conjugation automorphism; and the map g↦φg∈Aut(G) defines an action of G on itself.
Two elements x,y∈G are said to be conjugate if there exists g∈G such that x=φg(y). This defines an equivalence relation on G whose equivalence classes are called conjugacy classes. Similarly, one defines the conjugates of a subset of G. If H is a subgroup of G, then for every g∈G, φg(H) is a subgroup of G (being the image of a subgroup by a homomorphism) of cardinality ∣H∣ (since φg is injective).
Definition C.
Let H be a subgroup of G. We say that H is normal if
∀g∈G,∀h∈H,ghg−1∈H.
Definition D.
Let H be a subgroup of G. Two elements x,y∈G are said to be congruent modulo H if y−1x∈H. This defines an equivalence relation on G whose equivalence classes (the left cosets) are the sets
gH,g∈G.
We denote
G/H={gH∣g∈G}.
Since for any g∈G the map τg:h↦gh is injective, every coset has cardinality ∣H∣ and since their union is G,
∣G/H∣=∣H∣∣G∣,
which in particular shows that ∣H∣ divides ∣G∣ (this is Lagrange's Theorem).
Finally, we define the notion of a Hermitian space, which generalizes that of a Euclidean space:
Definition E.
Let V be a C-vector space. A Hermitian inner product on V is a function
⟨⋅,⋅⟩:V×V→C,
which is linear in the second variable (i.e. for all x,y,z∈V and λ∈C, ⟨x,y+λz⟩=⟨x,y⟩+λ⟨x,z⟩), Hermitian symmetric (i.e. ⟨x,y⟩=⟨y,x⟩), positive (i.e. ⟨x,x⟩∈R+ for all x∈V), and definite (i.e. ⟨x,x⟩=0 if and only if x=0). As in the Euclidean case, one defines the notion of orthogonality and orthonormal families.
Here is the translated bibliography from the French PDF document, formatted in clean Markdown:
📚 Bibliography
Gaëtan Chenevier Algebra I Course (Chapter 7, Linear Representations of Finite Groups)
William Fulton and Joe Harris Representation Theory: A First Course.
Springer, 2004.
Gérard Rauch Finite Groups and Their Representations.
Ellipses, 2000.
ISBN: 978-2-7298-0180-9
Jean-Pierre Serre Finite Groups: An Introduction.
International Press, 2016.
ISBN: 978-1-57146-327-2