Processing math: 100%

User Tools

Site Tools


people:fer:402ws:spring2019:previous_homework

Math 402 - 01 Previous Homework (Spring 2019)


Problem Set 07 (complete) Due: 04/17/2019 Board presentation: 04/26/2019

  1. Let E be a field, G a finite subgroup of Aut(E), F=EG, and LSubF(E). Show that L=AutL(E), and it is a subgroup of G.
  2. Let E be a field, G a subgroup of Aut(E), and F=EG. Prove that for any H,H1,H2Sub(G), and any L,L1,L2SubF(E)
    1. If H1H2, then H2H1. (i.e. is order reversing)
    2. If L1L2, then L2L1. (i.e. is order reversing)
    3. HH (i.e. 1)
    4. LL (i.e. 1)
  3. Let E/L/F be a field tower.
    1. Prove that if E/F is a normal extension then so is E/L.
    2. Prove that if E/F is a Galois extension then so is E/L.

Problem Set 06 (complete) Due: 04/12/2019 Board presentation: 04/17/2019

  1. Let F be a field, α1,,αn elements from some extension E of F, and R a commutative ring with unity. If φ1,φ2:F(α1,,αn)R are homomorphisms such that φ1(a)=φ2(a) for all aF and φ1(αi)=φ2(αi) for i=1,,n, then φ1=φ2.
  2. Let f(x)=x52Q[x], and E the splitting field of f(x). Consider the group G=AutQ(E).
    1. What is the order of G?
    2. Is it abelian?
    3. What are the orders of elements in G?
  3. Let F=Fp(t) be the field of rational functions on t with coefficients in Fp. Consider the polynomial f(x)=xptF[x].
    1. Show that f(x) has no root in F.
    2. Show that the Frobeni\us endomorphism Φ:FF is not surjective.
    3. Show that f(x) has exactly one root, and that root has multiplicity p.
    4. Show that f(x) is irreducible over F.

Problem Set 05 (complete) Due: 03/25/2019 Board presentation: 04/02/2019

  1. Let F be a field and f(x),g(x)F[x]. Prove:
    1. (f(x)+g(x))=f(x)+g(x)
    2. (f(x)g(x))=f(x)g(x)+f(x)g(x)
  2. Let F be a field, and φ:FF an endomorphism of F. Prove that the set Fφ={aFφ(a)=a} is a subfield of F.
  3. How many monic irreducible polynomials of degree 4 are there over F5?
  4. Let E be a field extension of F. Prove that E is an algebraic closure of F iff E is minimal with the property that every polynomial f(x)F[x] splits over E.

Problem Set 04 (complete) Due: 03/11/2019 Board presentatiion: 03/25/2019

  1. Let E/F be a field extension. Prove that [E:F]=1 iff E=F.
  2. Let E and K be field extensions of F and φ:EK an F-extension homomorphism. Show that φ is a linear transformation of F-vector spaces.
  3. Write  2 as a polynomial expression on α= 2+ 3.
  4. Find the minimal polynomial of u=(32+ω) over Q.

Problem Set 03 (complete) Due: 02/18/2019 Board presentation: 02/20/2019

  1. Let V be a vector space and BV. Show that the following are equivalent
    1. B is a basis for V,
    2. B is maximal linearly independent set,
    3. B is minimal spanning set.
  2. Let V be a vector space and W a subspace of V.
    1. Prove that dim(W)dim(V).
    2. Prove that if V is finite dimensional and dim(W)=dim(V) then W=V
    3. Show, with a counterexample, that the finite dimensional hypothesis is necessary in part b.
  3. In regards to the Universal Mapping Property for vector spaces discussed in class today:
    1. Complete the proof of it.
    2. Prove that the set {α(v)vB} is linearly independent in W iff ˆα is injective.
    3. Prove that the set {α(v)vB} is a spanning set for W iff ˆα is surjective.
  4. Let V be a vector space over F, and W a subspace of V. Let B1 be a basis for W and B a basis for V such that B1B. Prove that the set {v+WvBB1} is a basis for the quotient space V/W.

Problem Set 02 (complete) Due: 02/11/2019 Board presentation: 02/18/2019

  1. Let D be a UFD. a,b,cD, and f(x)D[x]. a,b are said to be ”relatively prime” if gcd(a,b) is a unit.
    1. Prove that if a,b are relatively prime and a|bc then a|c.
    2. Prove that if ab is a root of f(x), and a,b are relatively prime, then a divides the constant term of f(x) and b divides the leading term of f(x).
  2. Let D be an ED, a,bD, with b0. Consider the sequence r0,r1,r2,,rn defined recursively as follows: r0=a,r1=b, and using the propery of an Euclidean Domain, until obtaining a residue 0, r0=q1r1+r2 andδ(r2)<δ(r1),r1=q2r2+r3 andδ(r3)<δ(r2),rn3=qn2rn2+rn1 andδ(rn1)<δ(rn2),rn2=qn1rn1+rn andrn=0. Why does the sequence r1,r2,,rn have to eventually attain the value rn=0? Prove that the last non-zero entry in the residues list, i.e. rn1gcd(a,b).
  3. Let D be a PID, a,bD. Let d be a generator of the ideal a+b. Show that dgcd(a,b).
  4. Let D be an ID, a,bD. Prove that if a and b have a least common multiple lD, then abl is a greatest common divisor of a and b in D.
  5. (Optional) Let γ=1+192 and consider the subring of C given by: R={a+bγa,bZ} Prove that R is a PID but not an ED. A detailed proof can be found in Mathematics Magazine, Vol. 46, No. 1 (1973), pp 34-38. If you choose to work on this problem, do not consult this reference, or any other reference. Hand-in only your own work, even it it is only parts of the solution.

Problem Set 01 (complete) Due: 02/01/2019 Board presentation: 02/08/2019

  1. Let D be an integral domain. Consider the following two properties that D and a function δ:D{0}N0 may have:
    1. For any a,dD with d0, there are q,rD such that
      a=qd+r and ( r=0 or δ(r)<δ(d))
    2. For any a,bD{0}, δ(a)δ(ab).
      Prove that if there is a function δ satisfying the first condition, then there is a function γ satisfying both of them. Hint: consider γ defined by: γ(a):=minxD{0}δ(ax)
  2. Chapter 18, problem 22.
  3. Chapter 16, problem 24. Can you weaken the assumption “infinitely many”?
  4. Show that an integral domain D satisfies the ascending chain condition ACC iff every ideal of D is finitely generated. (Hint: one direction is similar to the proof that every PID satisfies the ACC).

Home

people/fer/402ws/spring2019/previous_homework.txt · Last modified: 2019/04/30 14:18 by fer