

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Tensor products,Chevalley’s Theorem,basics on tensor, products of algebras, isomorphic, polynomial equations,vector space.
Typology: Exercises
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Math 250a: Higher Algebra Problem Set #8 (29 November 2004): Tensor products etc.; Chevalley’s Theorem
Some overdue basics on tensor products of algebras:
An instructive example of a division algebra in positive characteristic:
Let k be a finite field, and A the noncommuting k-algebra generated by two indeterminates x, y satisfying xy − yx = 1.
Can you find, at least for p = 2 or p = 3, an explicit isomorphism by finding endomorphisms x, y of K′p^ satisfying xp^ = X, yp^ = Y , and xy − yx = 1?
Finally, we obtain Chevalley’s theorem on solutions of polynomial equations in many variables over a finite field, and deduce the triviality of Br(k).
Fix a finite field k = Fq , and let p be its characteristic, so q is some power of p.
x∈k x m (^) = 0 for all nonnegative integers m < q − 1. What is ∑ x∈k x m (^) for an arbitrary nonnegative m ∈ Z?
It follows that
x∈k P^ (x) = 0 for any polynomial^ P^ ∈^ k[X] of degree less than q − 1. We next extend this to polynomials in several variables X 1 ,... , Xn. The “degree” of a nonzero monomial c
∏n i=1 X
mi i is^
i mi; the degree of a sum of distinct monomials is the largest of those monomials’ degrees. This defines the degree on k[X 1 ,... , Xn]. (Note that this degree is invariant under an invertible linear change of variables; thus we may speak of a polynomial of degree m on an n-dimensional vector space over k without specifying which coordinates on that space we use.)
ii) Prove that (^) ∑
(x 1 ,...,xn)∈kn
P (x 1 ,... , xn) = 0
for every polynomial P ∈ k[X 1 ,... , Xn] of degree less than n(q − 1).
iii) Now let f ∈ k[X 1 ,... , Xn] be a polynomial of degree less than n. Take P = f q−^1 in (ii) to prove that the number of solutions in kn^ of the equation f (x 1 ,... , xn) = 0 is a multiple of p.
As noted class the degree bound in (iii) is sharp. As also noted, it follows from (iii) that every finite skew field is commutative. Indeed, let K be such a field, and k its center. Then K is a vector space over k, of dimension n^2 for some positive integer n. The reduced norm is a polynomial of degree n on that vector space that vanishes only at the origin. Hence n ≥ n^2. Therefore n = 1, and K = k as claimed.
Can you generalize Chevalley’s theorem to simultaneous solutions of several poly- nomials of low degree? Can you get a formula for the enumeration mod p of solutions of x^3 + y^3 + z^3 = 0 and x^4 + y^4 = z^2 in k^3 , or x^3 − x = y^2 in k^2?
Problems 1–3 are due in class Monday, December the 6th.