Algebra general exam. January 11 2022, 9am-1pm

Your UVa ID Number:

Sign below the pledge:
"On my honor, I pledge that I have neither given nor received help on this assignment."

    Problem 1

  1. ( 14 pts ) Let pp be a prime and G=GL2(𝔽p)G=G L_{2}\left(\mathbb{F}_{p}\right), the group of invertible 2×22 \times 2 matrices over 𝔽p\mathbb{F}_{p}.
    (a) ( 6 pts) Find the order of GG (with proof).
    (b) (2 pts) Show that U={(1a01):aF}U=\left\{\left(\begin{array}{ll}1 & a \\ 0 & 1\end{array}\right): a \in F\right\} is a Sylow pp-subgroup of GG
    (c) ( 6 pts ) Find the normalizer N=NG(U)N=N_{G}(U) and the number of Sylow pp subgroups of GG (with proof).
    Hint: In (c) one can solve either part of the problem first and then use the answer to solve the other part.

  2. Problem 2

  3. ( 14 pts) Show that there exist precisely 3 isomorphism classes of groups GG that contain a subgroup HH of index 2 which is infinite cyclic (i.e., is isomorphic to \mathbb{Z} ).
    Hint: Consider separately the cases where GG is abelian and GG is non-abelian. In the non-abelian case consider a natural action of GG on HH and use it to show that GG must have an element of order 2 .

  4. Problem 3

  5. (12 pts) Let f(x,y),g(x,y)[x,y]f(x, y), g(x, y) \in \mathbb{C}[x, y] be two polynomials that do not have a (non-constant) common factor.
    (a) ( 7 pts) Show that ff and gg are relatively prime as elements of (x)[y]\mathbb{C}(x)[y] and (y)[x]\mathbb{C}(y)[x] (where (x)\mathbb{C}(x) and (y)\mathbb{C}(y) are the fields of rational functions, i.e. the fraction fields of [x]\mathbb{C}[x] and [y]\mathbb{C}[y], respectively). Give a detailed argument.
    (b) ( 5 pts) Show that the system of polynomial equations f(x,y)=0f(x, y)=0 and g(x,y)=0g(x, y)=0 has finitely many solutions in 2\mathbb{C}^{2}. Hint: Use (1) and the fact that (x)[y]\mathbb{C}(x)[y] and (y)[x]\mathbb{C}(y)[x] are PIDs (make sure to explain why the latter is true).

  6. Problem 4

  7. (12 pts) Let R=[11]={a+b11:a,b}R=\mathbb{Z}[\sqrt{-11}]=\{a+b \sqrt{-11}: a, b \in \mathbb{Z}\} \subset \mathbb{C}, and let I=I= ( 3,1+113,1+\sqrt{-11} ) be the ideal of RR generated by 3 and 1+111+\sqrt{-11}.
    (a) ( 6 pts) Prove that II is maximal.
    (b) ( 6 pts) Prove that II is not principal.

  8. Problem 5

  9. (10 pts) Let VV be a finite-dimensional vector space over an arbitrary field FF (not necessarily algebraically closed!) and T:VVT: V \rightarrow V an FF-linear map. Prove that the following two conditions on TT are equivalent:

    (1) The characteristic polynomial and the minimal polynomial of TT coincide

    (2) There exists vVv \in V such that VV is spanned by the set {v,T(v),T2(v),}\left\{v, T(v), T^{2}(v), \ldots\right\}

Hint: Consider VV as an F[x]F[x]-module with xx acting as TT and use a suitable structure theorem for such modules.

Problem 6

(14 pts) In each part determine whether the statement is TRUE (in all cases) or FALSE (in at least one case) and prove your claim. An answer (correct or incorrect) without explanation will not receive any credit.
(a) ( 3 pts) Let RR be a commutative domain with 1 and MM an RR-module. If xMx \in M and yMy \in M are both torsion elements, then x+yx+y is also a torsion element.
(b) ( 3 pts) If KK and LL are fields, then KLK \otimes_{\mathbb{Z}} L is nonzero.
(c) ( 4 pts ) If RR is a commutative ring with 1 and every RR-module is free, then RR is a field.
(d) ( 4 pts ) If RR is a commutative ring with 1 and MM is a finitely generated RR-module, then every submodule of MM is finitely generated.

Problem 7

(10 pts) Let pp be a prime and let FF be a field of order p6p^{6}. Let

Prim(F)={αF:𝔽p(α)=F}.\operatorname{Prim}(F)=\left\{\alpha \in F: \mathbb{F}_{p}(\alpha)=F\right\} .

(a) (5 pts) Find (with proof) an explicit formula for |Prim(F)||\operatorname{Prim}(F)|.
(b) ( 5 pts ) Let Irr6(p)\operatorname{Irr}_{6}(p) denote the set of all monic irreducible polynomials of degree 6 over 𝔽p\mathbb{F}_{p}. Find (with proof) a simple relation between |Irr6(p)|\left|\operatorname{Irr}_{6}(p)\right| and |Prim(F)||\operatorname{Prim}(F)|. Note: You are not allowed to use the general formula for the number of irreducible polynomials of a given degree over 𝔽p\mathbb{F}_{p}.

Problem 8

(14 pts) Let FF be a field, and let f(x)F[x]f(x) \in F[x] be a separable irreducible polynomial of degree nn.
(a) ( 5 pts) Let αβ\alpha \neq \beta be distinct roots of FF (in some fixed field extension KK of F)F). Prove that [F(α,β):F]n(n1)[F(\alpha, \beta): F] \leq n(n-1).
(b) ( 5 pts) Let α\alpha and β\beta be as in (a). Prove that

[F(α+β):F](n2)=n(n1)2.[F(\alpha+\beta): F] \leq\binom{ n}{2}=\frac{n(n-1)}{2} .

Hint: Use the action of a suitable Galois group.
(c) (4 pts) Assume that F=F=\mathbb{Q} and nn is prime. Give an explicit example of ff and α\alpha and β\beta satisfying the above conditions such that the equality in (a) holds (you are NOT allowed to choose your prime nn ). Prove that your example has the required properties.