-
Notifications
You must be signed in to change notification settings - Fork 3
/
representation_theory.tex
1066 lines (846 loc) · 29.3 KB
/
representation_theory.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
\documentclass[avery5371,grid]{flashcards}
%% Packages
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{ccicons}
\usepackage[mathscr]{euscript}
\usepackage{url}
% for saving the enumerate counter over minipages
\newcounter{mytemp}
%% Math macros
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\B}{\mathscr{B}}
\newcommand{\st}{\textrm{ such that }}
\renewcommand{\le}{\leqslant}
\renewcommand{\theta}{\vartheta}
\newcommand{\iso}{\cong}
\newcommand{\abs}[1]{\ensuremath{\left| #1 \right|}}
\newcommand{\set}[2]{\ensuremath{\left\{ #1 \, : \, #2 \right\}}}
\newcommand{\presentation}[2]{\ensuremath{\left< #1 \, : \, #2 \right>}}
\newcommand{\GLnF}[2]{\ensuremath{\textrm{GL} \left( #1 \, , \, #2 \right)}}
\newcommand{\normal}{\ensuremath{\lhd}}
\DeclareMathOperator{\Ker}{\ensuremath{\textrm{Ker}}}
\DeclareMathOperator{\Img}{\ensuremath{\textrm{Im}}}
\DeclareMathOperator{\End}{\ensuremath{\textrm{End}}}
%% Text macros
\newcommand{\defn}[1]{\textbf{#1}}
%% Layout of flash cards
\cardfrontstyle[\large\slshape]{headings}
\cardbackstyle{empty}
\cardfrontfoot{Representation Theory}
\begin{document}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{flashcard}[Copying]
{ Flash Cards for the Book:
\begin{center}
``Representations and Characters of Groups'' \\
by Gordon James and Martin Liebeck
\end{center}
}
\vspace*{\stretch{1}}
\copyright\ 2017 Jason Underdown \\
These flash cards are licensed under the:
\begin{center}
Creative Commons Attribution 4.0 \\
International License \\
\ccby
\end{center}
\url{https://creativecommons.org/licenses/by/4.0/}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{group}
\vspace*{\stretch{1}}
A \defn{group} consists of a set $G$, together with a rule for
combining any two elements $g, h \in G$ to form another element of
$G$ satisfying:
\begin{enumerate}
\item $\forall g,h,k \in G, (gh)k = g(hk)$
\item $\exists e \in G \st \forall g \in G, eg=ge=g$
\item $\forall g \in G, \exists g^{-1} \in G \st gg^{-1} = g^{-1}g = e$
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{subgroup}
\vspace*{\stretch{1}}
Let $G$ be a group. A subset $H$ of $G$ is a \defn{subgroup} if $H$ is
itself a group under the operation inherited from $G$.
\[
H \le G
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{dihedral group $D_{2n}$}
\vspace*{\stretch{1}}
\[
D_{2n} = \presentation{a,b}{a^n=1, b^2=1, b^{-1}ab=a^{-1}}
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{cyclic group $C_n$}
\vspace*{\stretch{1}}
\[
C_n = \left\{ 1, a, a^2, \ldots, a^{n-1} \right\}
\]
\[
C_n = \presentation{a}{a^n=1}
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{quaternion group $Q_8$}
\vspace*{\stretch{1}}
\[
Q_8 = \presentation{a,b}{a^4 = 1, a^2 = b^2, b^{-1}ab = a^{-1}}
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{alternating group $A_n$}
\vspace*{\stretch{1}}
\[
A_n = \left\{ g \in S_n : g \text{ is an even permutation} \right\}
\]
Recall that every permutation $g \in S_n$ can be expressed as a
product of transpositions. An \defn{even} permutation has an even
number of transpositions, and an \defn{odd} permutation has an odd
number of transpositions.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{direct product}
\vspace*{\stretch{1}}
Let $G$ and $H$ be groups, consider
\[
G \times H = \set{(g,h)}{g \in G \text{ and } h \in H}.
\]
Define a product operation on $G \times H$ by
\[
(g,h)(g',h') = (gg', hh').
\]
The group $G \times H$ is called the \defn{direct product} of $G$ and
$H$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{homomorphism / isomorphism}
\vspace*{\stretch{1}}
If $G$ and $H$ are groups, then a \defn{homomorphism} from $G$ to
$H$ is a map $\vartheta : G \to H$, which for all $g_1, g_2 \in G$
satisfies:
\[
(g_1 g_2) \vartheta = (g_1 \vartheta)(g_2 \vartheta).
\]
If $\vartheta$ is also invertible, then $\vartheta$ is called an
\defn{isomorphism}. \vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{coset}
\vspace*{\stretch{1}}
Let $G$ be a group and $H$ a subgroup of $G$. For $x \in G$, the subset
\[
Hx = \set{hx}{h \in H}
\]
of $G$ is called a \defn{right coset} of $H$ in $G$. The distinct
right cosets of $G$ partition $G$.
\vspace*{\stretch{1}}
\end{flashcard}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{flashcard}[Theorem 1.6]{Lagrange's theorem}
\vspace*{\stretch{1}}
If $G$ is a finite group and $H$ is a subgroup of $G$, then
$\abs{H}$ divides $\abs{G}$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{index}
\vspace*{\stretch{1}}
Suppose $H$ is a subgroup of $G$. The number of distinct right
cosets of $H$ in $G$ is written as $\abs{G : H}$. If $G$ is finite,
then
\[
\abs{G : H} =\abs{G}/\abs{H}
\]
by Lagrange's theorem.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{normal subgroup}
\vspace*{\stretch{1}}
A subgroup $N$ of a group $G$ is said to be a \defn{normal} subgroup
of $G$ if $g^{-1}Ng = N$ for all $g \in G$, where
\[
g^{-1}Ng = \set{g^{-1}ng}{n \in N}.
\]
We indicate that $N$ is a normal subgroup of $G$ by writing:
\[
N \normal G.
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{factor group}
\vspace*{\stretch{1}}
If $N \normal G$, then define $G/N$ to be the set of right cosets of
$N$ in $G$. This set is made into a group via the multiplication
operation:
\[
(Ng)(Nh) = Ngh \qquad \forall g, h \in G.
\]
This operation makes $G/N$ into a group called the \defn{factor
group} of $G$ by $N$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{simple group}
\vspace*{\stretch{1}}
A group $G$ is said to be \defn{simple} if $G \ne \{ 1 \}$ and the
only normal subgroups of $G$ are $\{ 1 \}$ and $G$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{kernel / image}
\vspace*{\stretch{1}}
Let $G$ and $H$ be groups. Suppose that \[\theta : G \to H\] is a
homomorphism then the \defn{kernel} of $\theta$ and \defn{image}
of $\theta$ are defined to be:
\begin{alignat*}{4}
&\Ker \theta
&&= \set{g \in G}{g\theta = 1} \quad
&& \Ker \theta &&\normal G \\
&\Img \theta
&&= \set{g\theta}{g \in G} \quad
&& \Img \theta &&\le H
\end{alignat*}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 1.10]{first isomorphism theorem}
\vspace*{\stretch{1}}
Suppose that $G$ and $H$ are groups and let $\theta: G \to H$ be a
homomorphism. Then
\[
G / \Ker \theta \iso \Img \theta.
\]
An isomorphism is given by the function
\[
Kg \to g\theta \quad (g \in G)
\]
where $K = \Ker \theta$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{vector space}
\vspace*{\stretch{1}}
A \defn{vector space} over a field $F$ is a set $V$, equipped with
addition and scalar multiplication satisfying:
\begin{enumerate}
\item $V$ is an abelian group under addition;
\item $\forall \, u,v \in V$ and $\forall \, \lambda, \mu \in F$,
\begin{enumerate}
\item $\lambda(u + v) = \lambda u + \lambda v$
\item $(\lambda + \mu)v = \lambda v + \mu v$
\item $(\lambda \mu) v = \lambda (\mu v)$
\item $1 v = v$
\end{enumerate}
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{linear dependence / linear independence}
\vspace*{\stretch{1}}
We say that $v_1, \ldots, v_n$ are \defn{linearly dependent} if
\[
\lambda_1 v_1 + \cdots + \lambda_n v_n = 0
\]
for some $\lambda_1, \ldots, \lambda_n \in F$ not all zero,
otherwise the vectors $v_1, \ldots, v_n$ are \defn{linearly
independent}. \vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{linear combination / span}
\vspace*{\stretch{1}}
Let $v_1, \ldots, v_n$ be vectors in a vector space $V$ over $F$. A
vector $v$ in $V$ is a \defn{linear combination} of
$v_1, \ldots, v_n$ if
\[
v = \lambda_1 v_1 + \cdots + \lambda_n v_n
\]
for some $\lambda_1, \ldots, \lambda_n \in F$.
\vfill
The vectors $v_1, \ldots, v_n$ \defn{span} $V$ if every vector in
$V$ is a linear combination of $v_1, \ldots, v_n$.
\vspace*{\stretch{1}}
\end{flashcard}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{flashcard}[Definition]{basis}
\vspace*{\stretch{1}}
The vectors $v_1, \ldots , v_n \in V$ form a \defn{basis} of V if
they
\begin{enumerate}
\item \emph{span} V, and are
\item \emph{linearly independent}.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 2.4]{a set of linearly independent vectors
can be extended to a basis}
\vspace*{\stretch{1}}
If $v_1, \ldots, v_k$ are linearly independent vectors in $V$, then
there exist $v_{k+1}, \ldots, v_n$ in $V$ such that
$v_1, \ldots, v_n$ form a basis of $V$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition / Theorem 2.5]{subspace / conditions for a subspace}
\vspace*{\stretch{1}}
A \defn{subspace} of a vector space $V$ over $F$ is a subset of $V$
which is itself a vector space under the operations inherited from
$V$.
\vfill
A subset $U$ of a vector space $V$ is a subspace iff
\begin{enumerate}
\item $0\in U$;
\item if $u,v \in U$ then $u+v \in U$;
\item if $\lambda \in F$ and $u \in U$ then $\lambda u \in U$.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{sum / direct sum}
\vspace*{\stretch{1}}
If $U_1, \ldots, U_r$ are subspaces of a vector space $V$, then
define the \defn{sum of subspaces} to be
\[
U_1 + \cdots + U_r = \set{u_1 + \cdots + u_r}{u_i \in U_i \text{
for } 1 \le i \le r}.
\]
\vfill
If every element in $U_1 + \cdots + U_r$ can be written in a unique
way as $u_1 + \cdots + u_r$ with $u_i \in U_i$ for $1 \le i \le r$,
then the sum is called a \defn{direct sum} and is denoted:
\[
U_1 \oplus \cdots \oplus U_r
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 2.9]{conditions for a direct sum}
\vspace*{\stretch{1}}
Suppose that $V = U + W$, with $u_1, \ldots, u_r$ a basis of $U$ and
$w_1, \ldots, w_s$ a basis of $W$, then the following three
conditions are equivalent:
\begin{enumerate}
\item $V = U \oplus W$,
\item $u_1, \ldots, u_r, w_1, \ldots, w_s$ is a basis of $V$,
\item $U \cap W = \{ 0 \}$.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 2.10]{direct sum of direct sums}
\vspace*{\stretch{1}}
Suppose $U, W, U_1, \ldots, U_a, W_1, \ldots, W_b$ are subspaces of
the vector space $V$. If $V = U \oplus W$ and also
\begin{align*}
U &= U_1 \oplus \cdots \oplus U_a \\
W &= W_1 \oplus \cdots \oplus W_b
\end{align*}
then
\[
V = U_1 \oplus \cdots \oplus U_a\oplus W_1 \oplus \cdots \oplus W_b.
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{external direct sum}
\vspace*{\stretch{1}}
Let $U_1, \ldots, U_r$ be vector spaces over $F$, and let
\begin{align*}
V &= \set{(u_1, \ldots, u_r)}{u_i \in U_i \text{ for } 1 \le i \le r},\\
U'_i &= \set{(0, \ldots, u_i, \ldots, 0)}{u_i \in U_i}.
\end{align*}
Then $V = U'_1 \oplus \cdots \oplus U'_r$ is a vector space. Abusing
notation slightly, we write
\[
V = U_1 \oplus \cdots \oplus U_r
\]
and call it the \defn{external direct sum} of $U_1, \ldots, U_r$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{linear transformation}
\vspace*{\stretch{1}}
Let $V$ and $W$ be vector spaces over $F$. A \defn{linear
transformation} from $V$ to $W$ is a function
\[
\theta : V \to W
\]
which satisfies
\begin{enumerate}
\item $(u + v)\theta = u\theta + v\theta$ for all $u,v \in V$, and
\item $(\lambda u)\theta = \lambda (v\theta)$ for all
$\lambda \in F$ and $v \in V$.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem]{rank--nullity theorem}
\vspace*{\stretch{1}}
Suppose $V$ and $W$ are vector spaces and
\[
\theta : V \to W
\]
is a linear transformation, then
\[
\dim V = \dim(\Ker \theta) + \dim(\Img \theta)
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 2.14]{invertibility of linear
transformations}
\vspace*{\stretch{1}}
Let $\theta$ be a linear transformation from $V$ to itself, then the
following conditions are equivalent:
\begin{enumerate}
\item $\theta$ is invertible,
\item $\Ker \theta = \{ 0 \}$,
\item $\Img \theta = V$.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{endomorphism}
\vspace*{\stretch{1}}
A linear transformation from a vector space $V$ to itself is called
an \defn{endomorphism} of $V$.
\vspace*{\stretch{1}}
\end{flashcard}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{flashcard}[Definition 2.17]{matrix of an endomorphism \\ $[\theta ]_{\B}$}
\vspace*{\stretch{1}}
Let $V$ be a vector space over $F$, and let $\theta$ be an
endomorphism of $V$. Once a basis $\B = \{ v_1, \ldots, v_n \}$ for
$V$ is chosen, then there are $n^2$ scalars
$a_{ij} \in F \; (1 \le i,j \le n)$ such that for all $i$:
\[
v_i \theta = a_{i1}v_1 + \cdots + a_{in}v_n.
\]
The $n\times n$ matrix $(a_{ij})$ is called the \defn{matrix of
$\theta$ relative to the basis $\B$}, and is denoted by
$[\theta ]_{\B}$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{endomorphism algebra \\$\End(V)$}
\vspace*{\stretch{1}}
If $V$ is a vector space over $F$, then the set of endomorphisms of
$V$ denoted $\End(V)$ form an algebra. Suppose
$\theta, \phi \in \End(V)$ and $\lambda \in F$, then we
define the functions $\theta + \phi$, $\theta \phi$ and
$\lambda \theta$ from $V$ to $V$ by
\begin{align*}
v(\theta + \phi) &= v\theta + v\phi, \\
v(\theta \phi) &= (v \theta) \phi, \\
v(\lambda \theta) &= \lambda (v \theta),
\end{align*}
for all $v \in V$. Then $\theta + \phi$, $\theta \phi$ and
$\lambda \theta$ are endomorphisms of $V$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem]{$\theta \to [\theta]_{\B}$\\ is an algebra homomorphism}
\vspace*{\stretch{1}}
Suppose that $\B$ is a basis of the vector space $V$, and $\theta$
and $\phi$ are endomorphisms of $V$, then
\begin{align*}
[\theta + \phi]_{\B} &= [\theta]_{\B} + [\phi]_{\B} \\
[\theta \phi]_{\B} &= [\theta]_{\B} [\phi]_{\B} \\
[\lambda \theta]_{\B} &= \lambda[\theta]_{\B}
\end{align*}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 2.23]{change of basis matrix}
\vspace*{\stretch{1}}
Let $\B = \{v_1, \ldots, v_n \}$ be a basis of the vector space V,
and let $\B' = \{v'_1, \ldots, v'_n \}$ be another basis of $V$.
Then for $1 \le i \le n$,
\[
v'_i = t_{i1} v_1 + \cdots + t_{in} v_n
\]
for certain scalars $t_{ij}$. The $n\times n$ matrix $T=(t_{ij})$ is
invertible and is called the \defn{change of basis matrix} from $\B$
to $\B'$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 2.24]{change of basis}
\vspace*{\stretch{1}}
If $\B$ and $\B'$ are bases of $V$ and $\theta$ is an endomorphism
of $V$, then
\[
[\theta]_{\B} = T^{-1}[\theta]_{\B'}T,
\]
where $T$ is the change of basis matrix from $\B$ to $\B'$.
\vspace*{\stretch{1}}
\end{flashcard}
%%%%%%% Eigenvalue material should go here
\begin{flashcard}[Theorem 2.26]{endomorphism of a vector space and
eigenvalues}
\vspace*{\stretch{1}}
Let $V$ be a non--zero vector space over $\C$, and let $\theta$ be
an endomorphism of $V$, then $\theta$ has an eigenvalue.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Proposition 2.29]{direct sums induce projections}
\vspace*{\stretch{1}}
Suppose that $V = U \oplus W$. Define $\pi : V \to V$ by
\[
(u+w)\pi = u \qquad \text{ for all } u\in U, w \in W.
\]
Then $\pi$ is an endomorphism of $V$. Further
\[
\Img \pi = U, \quad \Ker \pi = W, \, \text{ and } \, \pi^2 = \pi.
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 2.30]{projection}
\vspace*{\stretch{1}}
An endomorphism $\pi$ of a vector space $V$ satisfying $\pi^2 = \pi$
is called a \defn{projection} of $V$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Proposition2.32]{projections induce direct sum
decomposition}
\vspace*{\stretch{1}}
Suppose that $\pi$ is a projection of a vector space $V$. Then
\[
V = \Img \pi \oplus \Ker \pi
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 3.1]{representation of a group / degree}
\vspace*{\stretch{1}}
A \defn{representation} of $G$ over $F$ is a homomorphism
\[
\rho : G \to GL(n, F) \quad \text{ for some } n.
\]
The \defn{degree} of $\rho$ is the integer $n$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 3.3]{equivalent representations}
\vspace*{\stretch{1}}
Let $\rho : G \to GL(m, F)$ and $\sigma : G \to GL(n, F)$ be
representations of $G$ over $F$. We say that $\rho$ is
\defn{equivalent} to $\sigma$ if $n=m$ and there exists an
invertible $n\times n$ matrix $T$ such that for all $g \in G$,
\[
g\sigma = T^{-1}(g\rho)T.
\]
Equivalence of representations is an equivalence relation.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 3.5]{trivial representation}
\vspace*{\stretch{1}}
The representation $\rho: G \to \GLnF{1}{F}$ defined by
\[
g \rho = (1)\qquad \text{ for all } g \in G,
\]
is called the \defn{trivial representation} of $G$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition3.6]{faithful representation}
\vspace*{\stretch{1}}
A representation $\rho : G \to \GLnF{n}{F}$ is said to be
\defn{faithful} if $\Ker{\rho} = \{ 1 \}$; that is, if the identity
element of $G$ is the only element $g$ for which $g\rho = I_n$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Proposition 3.7]{$\rho$ faithful $\Leftrightarrow$
$\Img \rho \iso G$ }
\vspace*{\stretch{1}}
A representation $\rho$ of a finite group is faithful if and only if
$\Img \rho$ is isomorphic to $G$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 4.2]{$FG$-module}
\vspace*{\stretch{1}}
Let $V$ be a vector space over $F$ and $G$ a group. Then $V$ is an
\defn{$FG$-module} if a multiplication $vg$ is defined and satisfies,
for all $u,v \in V, \lambda \in F$ and $g, h \in G$:
\begin{enumerate}
\item $vg \in V$
\item $v(gh) = (vg)h$
\item $v1 = v$
\item $(\lambda v)g = \lambda(vg)$
\item $(u+v)g = ug + vg$
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 4.3]{matrix of an endomorphism}
\vspace*{\stretch{1}}
Let $V$ be an $FG$-module, and let $\B$ be a basis of $V$. For each
$g\in G$, let
\[
[g]_{\B}
\]
denote the matrix of the endomorphism $v \mapsto vg$ of $V$,
relative to the basis $\B$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 4.4]{representations induce $FG$-modules \\
and vice versa}
\vspace*{\stretch{1}}
\begin{enumerate}
\item If $\rho: G \to \GLnF{n}{F}$ is a representation of $G$ over
$F$, $V=F^n$, then $V$ becomes an $FG$-module by defining the
multiplication to be $vg = v(g\rho)$. Moreover there exists a
basis $\B$ of $V$ such that $g\rho = [g]_{\B}$.
\item If $V$ is an $FG$-module and $\B$ a basis of $V$, then
$\rho: g \mapsto [g]_{\B}$ is a representation of $G$ over $F$.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Proposition 4.6]{defining the action of $G$ on a basis of $V$\\
induces an $FG$-module}
\vspace*{\stretch{1}}
Let $\B=\{v_1, \ldots , v_n\}$ be a basis for a vector space $V$
over $F$. If $v_i g$ is defined for all $v_i \in \B$ and for all
$g\in G$ and satisfies $\forall \, g, h\in G$, and
$\forall \, \lambda_1, \ldots, \lambda_n \in F$:
\begin{enumerate}
\item $v_i g \in V$
\item $v_i(gh) = (v_i g)h$
\item $v_i 1 = v_i$
\item $(\lambda_1 v_1 + \cdots + \lambda_n v_n)g =
\lambda_1(v_1 g) + \cdots + \lambda_n (v_n g)$
\end{enumerate}
Then $V$ is an $FG$-module.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 4.8 (1)]{the trivial $FG$-module}
\vspace*{\stretch{1}}
The \defn{trivial} $FG$-module is the 1-dimensional vector space $V$
over $F$ with
\[
vg = v \quad \text{ for all } \quad v\in V, \: g\in G.
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 4.8 (2)]{faithful $FG$-module}
\vspace*{\stretch{1}}
An $FG$-module $V$ is \defn{faithful} if the identity element of $G$
is the only element of $G$ for which
\[
vg = v \quad \text{for all} \quad v\in V.
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 4.10]{permutation module}
\vspace*{\stretch{1}}
Let $G$ be a subgroup of $S_n$. The $FG$-module $V$ with basis
$v_1, \ldots, v_n$ such that
\[
v_i g = v_{ig} \quad \text{for all } i, \text{ and all } g\in G,
\]
is called the \defn{permutation module} for $G$ over $F$. We call
$v_1, \ldots, v_n$ the \defn{natural basis} of $V$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{permutation matrix}
\vspace*{\stretch{1}}
A \defn{permutation matrix} is any square matrix which has precisely
one nonzero entry in each row and each column and that entry is 1.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 4.12]{$FG$-modules and equivalent representations}
\vspace*{\stretch{1}}
Suppose that $V$ is an $FG$-module with basis $\B$ and
$\rho : g \mapsto [g]_{\B}$ is a representation of $G$ over $F$.
\begin{enumerate}
\item If $\B'$ is a basis of $V$, then the representation
$\phi : g \mapsto [g]_{\B'}$ is equivalent to $\rho$.
\item If $\sigma$ is a representation of $G$, equivalent to $\rho$,
then there is a basis, $\B''$ of $V$ such that:
$\sigma : g \mapsto [g]_{\B''}$.
\end{enumerate}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 5.1]{$FG$-submodule}
\vspace*{\stretch{1}}
Let $V$ be an $FG$-module. A subset $W$ of $V$ is said to be an
\defn{$FG$-submodule} of $V$ if $W$ is a subspace and $wg \in W$ for
all $w\in W$ and for all $g\in G$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 5.3]{irreducible / reducible $FG$-module}
\vspace*{\stretch{1}}
An $FG$-module $V$ is said to be \defn{irreducible} if it is
non--zero and it has no $FG$-submodules apart from $\{0\}$ and $V$.
\bigskip
If $V$ has an $FG$-submodule $W$ with $W$ not equal to $\{0\}$ or
$V$, then $V$ is \defn{reducible}.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{the vector space $FG$}
\vspace*{\stretch{1}}
Let $G$ be a finite group whose elements are $g_1, \ldots, g_n$ and
let $F$ be $\R$ or $\C$. We can define a \defn{vector space $FG$} over
$F$ with basis, $\{g_1, \ldots, g_n \}$. The elements of $FG$ are
all expressions of the form:
\[
\lambda_1 g_1 + \cdots + \lambda_n g_n \qquad (\lambda_i \in F)
\]
where for $u=\sum \lambda_i g_i, v = \sum \mu_i g_i \in FG$ and
$\alpha \in F$
\[
u+v = \sum_{i=1}^n (\lambda_i + \mu_i)g_i \qquad
\alpha u = \sum_{i=1}^n (\alpha \lambda_i) g_i
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition]{group algebra multiplication}
\vspace*{\stretch{1}}
$FG$ carries more structure than just that of a vector space---we
can use the product of $G$ to define multiplication in $FG$:
\begin{align*}
\left( \sum_{g\in G} \lambda_g g \right) \left( \sum_{h\in G} \mu_h h \right)
&= \sum_{g,h \in G} \lambda_g \mu_h (gh) \\
&= \sum_{g \in G} \sum_{h \in G} (\lambda_g \mu_{h^{-1}g}) g
\end{align*}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 6.3]{group algebra}
\vspace*{\stretch{1}}
The vector space $FG$, with multiplication defined by
\[
\left( \sum_{g\in G} \lambda_g g \right) \left( \sum_{h\in G}
\mu_h h \right) = \sum_{g,h \in G} \lambda_g \mu_h (gh)
\]
($\lambda_g, \mu_h \in F$), is called the \defn{group algebra} of
$G$ over $F$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 6.5]{regular $FG$-module}
\vspace*{\stretch{1}}
Let $G$ be a finite group and $F$ be $\R$ or $\C$. The vector space
$FG$ with the natural multiplication $vg$ ($v \in FG, g \in G$), is
called the \defn{regular} $FG$-module.
\bigskip
Note that the regular $FG$-module has dimension equal to $\abs{G}$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 6.5]{regular representation of $G$ over
$F$}
\vspace*{\stretch{1}}
The representation $g \mapsto [g]_{\B}$ obtained by taking $\B$ to
be the natural basis of $FG$ is called the \defn{regular
representation} of $G$ over $F$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Proposition 6.6]{faithfulness of regular
$FG$-modules}
\vspace*{\stretch{1}}
The regular $FG$-module is faithful.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 6.8]{how an $FG$ module acts on itself
via multiplication}
\vspace*{\stretch{1}}
Let $V$ be an $FG$-module, $v \in V$ and $r \in FG$, suppose
$r = \sum_{g\in G} \mu_g g$, then we define $vr$ to mean
\[
vr = \sum_{g \in G} \mu_g(vg).
\]
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Proposition 6.10]{multiplication and distributivity
in an $FG$-module}
\vspace*{\stretch{1}}
Suppose that $V$ is an $FG$-module. The following properties hold
for all $u, v \in V$, for all $\lambda \in F$, and for all
$r, s \in FG$:
\begin{minipage}{0.4\linewidth}
\begin{enumerate}
\item $vr \in V$,
\item $v(rs) = (vr)s$,
\item $v1 = v$,
\setcounter{mytemp}{\value{enumi}}
\end{enumerate}
\end{minipage}%
\begin{minipage}{0.6\linewidth}
\begin{enumerate}
\setcounter{enumi}{\value{mytemp}}
\item $(\lambda v)r = \lambda (vr) = v(\lambda r)$,
\item $(u + v)r = ur + vr$,
\item $v(r + s) = vr + vs$,
\item $v0 = 0r = 0$.
\end{enumerate}
\end{minipage}
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 7.1]{$FG$-homomorphism}
\vspace*{\stretch{1}}
Let $V$ and $W$ be $FG$-modules. A function $\theta: V \to W$ is
said to be an \defn{$FG$-homomorphism} if $\theta$ is a linear
transformation and
\[
(vg)\theta = (v \theta)g \qquad \text{for all } v \in V, g \in G.
\]
In other words, if $\theta$ sends $v$ to $w$ when it sends $vg$ to
$wg$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Propostion 7.2]{kernel and image of $FG$-homomorphism}
\vspace*{\stretch{1}}
Let $V$ and $W$ be $FG$-modules and let $\theta : V \to W$ b an
$FG$-homomorphism. Then $\Ker \theta$ is an $FG$-submodule of $V$
and $\Img \theta$ is an $FG$-submodule of $W$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Definition 7.4]{isomorphic $FG$-modules}
\vspace*{\stretch{1}}
Let $V$ and $W$ be $FG$-modules. We call $\theta : V \to W$ an
$FG$-isomorphism if $\theta$ is an $FG$-homomorphism and $\theta$ is
invertible. In this case we say $V$ and $W$ are \defn{isomorphic}
$FG$-modules and write $V \iso W$.
\vspace*{\stretch{1}}
\end{flashcard}
\begin{flashcard}[Theorem 7.6]{isomorphic $FG$-modules correspond to
equivalent representations}
\vspace*{\stretch{1}}
Suppose that $V$ is an $FG$-module with basis $\B$ and $W$ is an