Bourbaki

Exercise 10, § 10

Commutative Algebra, X

Let kk be a field, AA a regular local kk-algebra of dimension dd, such that the extension k→κAk \to \kappa_A is trivial. The AA-modules HAd(A)H^d_A(A) and A′=Homkcont(A,k)A' = \mathrm{Hom}_k^{cont}(A, k) are Matlis modules, hence isomorphic; we propose to make explicit an isomorphism between these two modules.

(a) Let x=(x1,…,xd)x = (x_1, \ldots, x_d) be a system of coordinates of AA. For every integer p⩾0p \geqslant 0, denote by ApA_p the kk-algebra A/(x1p,…,xdp)A/(x_1^p, \ldots, x_d^p). The classes of the monomials x1a1…xdadx_1^{a_1} \ldots x_d^{a_d} with 0⩽ai<p0 \leqslant a_i < p form a basis of ApA_p over kk; denote by ρp\rho_p the linear form on ApA_p which has value 1 on the class of x1p−1…xdp−1x_1^{p-1} \ldots x_d^{p-1} and 0 on the other elements of the basis. Prove that the kk-linear mapping ρ~p:Ap→Homk(Ap,k)\tilde{\rho}_p : A_p \to \mathrm{Hom}_k(A_p, k) deduced from the bilinear form (a,b)↦ρp(ab)(a, b) \mapsto \rho_p(ab) is an isomorphism (one may reason directly, or use exerc. 10 of § 5).

(b) For q⩾pq \geqslant p, let uqp:Ap→Aqu_{qp} : A_p \to A_q be the AA-linear homomorphism induced by the homothety of ratio (x1…xd)q−p(x_1 \ldots x_d)^{q-p}, and let πpq:Aq→Ap\pi_{pq} : A_q \to A_p be the mapping of passing to the quotient; prove that one has ρ~q∘uqp=tπpq∘ρ~p\tilde{\rho}_q \circ u_{qp} = {}^t \pi_{pq} \circ \tilde{\rho}_p. Deduce by passing to the inductive limit, taking into account exerc. 8, c), an AA-linear isomorphism ρ~:HAd(A)→A′\tilde{\rho} : H^d_A(A) \to A'.

(c) Suppose d=1d = 1, so that AA is a discrete valuation ring, and x1=xx_1 = x a uniformizer of AA. Show that the choice of the uniformizer xx permits identifying HA1(A)H^1_A(A) with K/AK/A; the isomorphism ρ:K/A→A′\rho : K/A \to A' is then defined by ρ(φ)(a)=Res(aφ)\rho(\varphi)(a) = \mathrm{Res}(a \varphi), where Res:K/A→k\mathrm{Res} : K/A \to k is the projection on the factor kx−1kx^{-1} in the canonical decomposition K/A=⨁n⩾1kx−nK/A = \bigoplus_{n \geqslant 1} kx^{-n}.

Solution

No solution has been written yet.

Machine translation of the English, by gpt-5-mini. Not checked by a person. That model is a cut down version of the one the rest of this language was written by.