Practice Final

Question 0

Top

Pasted image 20250510173203.png

a:

A Ideal in a commutative ring R with identity is a subring where for all i in the ideal{riIrR}.

b.

A group action on this map can be defined as Φ(g,x)=gx for all gG and xX.

Bottom

Pasted image 20250510173513.png

a.

A Hcoset in G for some gG is gH={ghhH}.

b.

For Z[i] the division algo can be formulated as the following:

For any p(i),g(i)Z[i] there exists q(i) and r(i) where

p(i)=q(i)g(i)+r(i)

And N(r(i)) is less then N(g(i)) or is zero. Note the norm function here is N(a+bi)=a2+b2

For Q[i] the division algo can be formulated as the following:

For any p(x),g(x)Q[x] there exists q(x) and r(x) where

p(x)=q(x)g(x)+r(x)

And the degree of r(x) is less then g(x) or is zero.

Question 1

Top

Pasted image 20250510175436.png

a.

Q=G and Z=H. This will be proved again later.

b.

Proof:

  1. Lets first prove Q(a+b)Q(a)(b).
    1. This is easy as we have additive closure, so if both a,b are in Q(a)(b) we have it so (a+b)Q(a)(b) and this direction is proved.
  2. Q(a)(b)Q(a+b)
    1. We have to prove that (a),(b)Q(a+b)
    2. Notice, 1a+b=baQ(a+b).
    3. a+b+ba=2b and similarly a+b(ba)=2a
    4. From here, we know 12QQ(a+b)
    5. So, 122b=bQ(a+b) and 122a=aQ(a+b).

Bottom

Pasted image 20250510175756.png

a.

#fields

b.

The norm of Z[5] is defined as N(a+b5)=a2+5b2. This exists in the natural numbers, and notice that a2 or b2 can never be negative. Thus all norms less then 5 have to be able to be written as a square of integers a2. Both 2,3Z and this norm is not possible.

Question 2

Top

Pasted image 20250510180136.png

a.

Proof:

  1. Let gGH. and hH. We have to show hGH.
  2. First, lets see where gh is. Notice that if ghH then we would have ghh1=gH which is a contradiction. So ghGHGH.
  3. This is good because we know that g and all its powers are also in GH. Thus g1gh=hGH and we have proved that we can generate every element of H with GH.

b.

Proof:

  1. For the sake of contradiction, assume that ψ:QZ was an injective homomorphism.
  2. Then, let ψ(1)=a. As the homomorphism is injective, is the case only ψ(0)=0
  3. Then, we knowa=ψ(1)=ψ(1n)1+ψ(1n)2+....+ψ(1n)n=(an)1+(an)2+....+(an)n$$.

Problem 2

Top

Pasted image 20250510183503.png

a.

#review

b.

The largest possible order in S8 is the highest possible LCM with integers that add up to 8
This is LCM(3,5)=15 and are the elements that are the products of disjoin 3 and 5 cycles.

Problem 3

Top

Pasted image 20250510190658.png

a

g is power 4 as it gets the identity when multiplied to itself 4 times.

h is power 3

You can not use the LCM rule for the order here because that only works if the elemets commute. The order is infinate if you multiply it out

b

Proof:

  1. The only subgroups of Zp are trivial via langranges. So Zp can either be iso to {e} or Zp. Zp will always have p1 elements, so the only case is that it is iso to e which only happens when p is 2.

Bottom

Pasted image 20250510191619.png

a

Problem 4

Top

Pasted image 20250511010029.png

a

Lets define ψ:R[x]R where ψ(p(x))=p(2). The kernel of this is exactly x2 as all these will go to zero when evaluated at 2, thus by first isomorphism theorem R[x]/Ker(ψ)=R[x]/x2

Lets define ψ:R[x]R where ψ(p(x))=p(π). The kernel of this is exactly xπ as all these will go to zero when evaluated at π, thus by first isomorphism theorem R[x]/Ker(ψ)=R[x]/xπ

Evaluation homomorphisms are surjective as the integers alone get every single real number R

Bottom

Pasted image 20250511010038.png

b.

Notice that the ideal 7 contains elements

(a+b7)(7)=(a7+(7)b)=(7b+a7)

Then, you can get every element in Z[7] with integer multiples of 7.
Now notice, this leaves all integers such that
This leaves mod 0,1,2,3,4,5,6 or more precisely has elements

0+7,1+7,2+7,3+7,4+7,5+7,6+7

This is just the ring Z7 which is a field as 7 is prime. Thus we have it so 7 is maximal.

Problem 6

Pasted image 20250512154439.png

c.

We know that [L:K]=2.

Letting L=K[d] we know that [L:K]=2 as the minimal polynomial is (x2d)

Now assume d=c2 for some ck. then L=K[d]=K[c] and then as C is already in K we simply get [K(c):K]=1 which is a contradiction.

Pasted image 20250512160008.png

a.

We know [Q(3):Q]=2 as the minimal polynomial in Q[x] is x23.

By tower rule, another supposed subfield between Q and Q(3) would have to divide 2 in the natural numbers. However this is not possible as 2 is prime thus the only possible subfields are Q(3) and Q.