Skip to main content Link Search Menu Expand Document (external link) Copy Copied

Homework Set 4

Instructions: These problems are due November 20.

Problem 1.

In Z[5], the ideal p=(2,1+5) is maximal (and thus prime), and Z[5]/p is isomorphic to Z/2Z.

  1. Show that X35X+125 is irreducible mod p in Z[5].

  2. Show that p2={a+b5:a,b both even}.

  3. Show that X4+2(15)X26X+3+5 is an Eisenstein polynomial in Z[5][X] at the prime p.

  4. Show that Xn(7+35) is Eisenstein at p for every n1.

  5. If n2 and d1, prove that X1d+X2d+Xnd1 is irreducible in Q[X1,,Xn]. (Hint: For fixed d, use induction on n and the Eisenstein Criterion in its more general form as in DF Proposition 13 pg. 309.)

Problem 2.

Compute the matrix representation of the following linear maps with respect to the indicated ordered basis. In each case the field is R.

  1. V=C; m:VV is m(x)=(2i)x; B={1+i,3i}.

  2. V=R[x]/(x31); m:VV is m(v)=xv; B={1,x,x2}.

  3. V is the space of solutions to the differential equation y+y+y=0; m:VV is m(y)=y; you choose your basis.

Problem 3.

DF Problem 12 on page 302. This problem constructs an integral domain R which has the property that any finitely generated ideal in R is principal; but R has some ideals which are not finitely generated. Such a ring is called a Bezout ring. In such a ring, any two elements a and b have a gcd d such that ax+by=d, but you don’t have unique factorization because the other requirement – that every element is a finite product of irreducibles – fails. In the ring you construct in this problem, there is an element x which is not a unit but has roots of arbitrarily high order.

See Theorem 14 in DF on page 287 to see how, in the case when R is a PID (in which every ideal is principal, not just the finitely generated ones), one has to use Zorn’s lemma to prove that every non-zero non-unit in R is a finite product of irreducibles.

Problem 4.

For n1, Let Poln(R) be the space of polynomials with real coefficients and degree at most n. So Poln is a vector space of dimension n over R. Let D:Poln(R)Poln(R) be the map ddx, let Dj be the jth derivative, and let Dn(R) be the vector space of linear differential operators in one variable with constant coefficients over R. So an element of Dn(R) is a polynomial in D of degree at most n. Note for the sake of clarity that D0 is the identity map, so

(2D+D2)(x3)=2x33x2+6x

with the initial 2 acting on a polynomial just by multiplication.

  1. For f=a0+a1X++anXn, and L=b0+b1D++bnDn, compute (Lf)(0) in terms of the coefficients of f and L.

  2. For LDn(R), define L0:Poln(R)R by L0(f)=(Lf)(0). Show that the map LL0 is an isomorphism of vector spaces from Dn to the dual space Poln(R). (Check the dimension of Dn(R); prove the map is linear; check its kernel.)

  3. Find the basis of Dn(R) dual to the standard basis 1,X,,Xn of Poln(R).

  4. Let H(f)=f(1) and G(f)=01f(X)dX. Both H and G are elements of the dual space to Poln(R) and therefore correspond to elements of Dn(R). What are those elements?

Problem 5.

Let V be a vector space of dimension n over a field F. A complete flag in V is a sequence of subspaces Z:W0=(0)W1W2Wn1Wn=V where Wi has dimension i. So for example, in R3, one could choose W1 to be the span of the vector i (the x-axis) and W2 to be the span of the x and y axes (the xy-plane).

The group GL(V) acts on the flags in V by acting on the subspaces:

gZ=gW0=(0)gW1gWn1Wn=V.
  1. Prove that the action of GL(V) on the flags is transitive.

  2. Fix a basis a1,,an for V and let Z be the standard flag where W0=0 and Wi=span(a1,,ai) for i=1,,n. Prove that gGL(V) stabilizes Z if and only if g is upper triangular in the matrix representation coming from the choice of basis {ai}.

  3. Use the orbit stabilizer theorem for GL(V) to give a formula for the number of flags in a vector space of dimension n over a field with q elements.

  4. Find the number of flags in the three dimensional vector space over Z/2Z.