An introduction to p-adic L-functions — Lean blueprint

11.1. Equivariance properties of the Coleman map🔗

Iwasawa's theorem is a statement about \Lam(\GGam^+)-modules, so it is essential to work over the full Iwasawa algebra rather than just \Zp. Since \Lam(\GGam) is the completed group ring of \GGam over \Zp, giving \sU_\infty a \Lam(\GGam)-module structure amounts to equipping it with compatible actions of \Zp and of \GGam. The Galois group acts naturally; the obstruction is the \Zp-action, since the integer power map u\mapsto u^a does not extend continuously from \Z to \Zp on all of \sU_\infty.

Proposition11.1.1
uses 0used by 1XL∃∀N

The Coleman map restricts to a \Zp-equivariant map \Col : \sU_{\infty,1} \longrightarrow \Lam(\Zpx), where a\in\Zp acts on u\in\sU_{\infty,1} by the convergent binomial series u^a := \sum_{k\ge 0}\binom{a}{k}(u-1)^k.

Proof for Proposition 11.1.1
Proof uses 2
Proof dependency previews
Preview
Theorem 9.2.2
Loading preview
Proof dependency preview content is loaded from the Blueprint HTML cache.

It suffices to check \Zp-equivariance of each map in the composition defining \Col, depending on Definition 9.5.1. The point is that the binomial series converges precisely on \sU_{\infty,1}. Writing f_u=\sum_{k\ge 0}a_k(u)T^k for the Coleman power series of u, one checks a_0(u)\equiv 1 \pmod{p}: indeed f_u(\pi_n)=u_n\equiv 1 \pmod{\pri_n} and, \pi_n being a uniformiser, this forces a_0(u)\equiv 1 \pmod{\pri_n}; as a_0(u)\in\Zp we get the congruence. Hence f_u-1\in(p,T), and by (p,T)-adic completeness of \Zp[[T]] the series f_u^a=\sum_{j\ge 0}\binom{a}{j}(f_u-1)^j converges. Since f_u(\pi_n)^a=u_n^a, the uniqueness of Coleman power series Theorem 9.2.2 gives f_u^a=f_{u^a}, so u\mapsto f_u is \Zp-equivariant. The logarithmic derivative satisfies \dlog(f_u^a)=a\,\dlog(f_u), hence is equivariant for the natural \Zp-action on \Zp[[T]]; and 1-\varphi\circ\psi, \partial^{-1} and \sA^{-1} are \Zp-linear by definition. Composing, \Col is \Zp-equivariant on \sU_{\infty,1}.

Lemma11.1.2
uses 0
Used by 2
Reverse dependency previews
Preview
Lemma 11.1.3
Loading preview
Reverse dependency preview content is loaded from the Blueprint HTML cache.
XL∃∀N

There is a direct product decomposition \sU_\infty = \mu_{p-1}\times\sU_{\infty,1}.

Proof for Lemma 11.1.2
uses 0

At each finite level n, since p is totally ramified in K_n there is a unique prime \pri_n above p, and reduction modulo \pri_n gives a short exact sequence 1\to\sU_{n,1}\to\sU_n\to\mu_{p-1}\to 1. The Teichmüller lift splits it, so \sU_n=\mu_{p-1}\times\sU_{n,1}. Passing to the inverse limit over n gives the claim.

Lemma11.1.3
uses 0used by 1L∃∀N

The subgroup \mu_{p-1}\subset\sU_\infty is killed by the Coleman map. In particular no information is lost in restricting \Col to \sU_{\infty,1}.

Lean code for Lemma11.1.31 theorem
  • theoremdefined in PadicLFunctions/IwasawaProof/Equivariance.lean
    complete
    theorem PadicLFunctions.Coleman.Col_eq_zero_of_torsion (p : )
      [hp : Fact (Nat.Prime p)]
      (u : PadicLFunctions.Coleman.NormCompatUnits p)
      (htor :  (n : ), u.elems n ^ (p - 1) = 1) :
      PadicLFunctions.Coleman.Col p u = 0
    theorem PadicLFunctions.Coleman.Col_eq_zero_of_torsion
      (p : ) [hp : Fact (Nat.Prime p)]
      (u :
        PadicLFunctions.Coleman.NormCompatUnits
          p)
      (htor :
         (n : ), u.elems n ^ (p - 1) = 1) :
      PadicLFunctions.Coleman.Col p u = 0
    **RJW §12.1 Lemma (TeX 3170–3178)**: `μ_{p−1} ⊂ 𝒰_∞` is killed by `Col` (constant
    Coleman series are killed by `∂log`). Stated for a `(p−1)`-torsion tower.
    
    Proof (homomorphism route, TeX 3174–3178): elementwise `(p−1)`-torsion gives
    `u^{p−1} = 1` in `𝒰_∞`, so `(f_u)^{p−1} = f_{u^{p−1}} = f_1 = 1` (`colemanSeries_pow`,
    `colemanSeries_one`). Hence `(p−1)·∂log f_u = ∂log((f_u)^{p−1}) = ∂log 1 = 0`
    (`dlog_pow`, `dlog_one`); as `p − 1 ≠ 0` and `ℤ_p⟦T⟧` is torsion-free,
    `∂log f_u = 0`. The Coleman map is `∂log f_u ↦ 𝒜⁻¹ ↦ Res ↦ x⁻¹·`, all linear, so
    `Col u = 0` (`map_zero`/`LinearMap.zero_comp`). 
Proof for Lemma 11.1.3

A root of unity v\in\mu_{p-1}\subset\Zpx, viewed as the constant tower (v)_n, has constant Coleman power series f_v(T)=v. Constant series are killed by the logarithmic derivative \dlog, which differentiates. Hence v maps to 0 under \Col. Using Lemma 11.1.2, this shows the restriction to \sU_{\infty,1} loses nothing.

Lemma11.1.4
uses 0used by 1L∃∀N

The kernel of \dlog on \Zp[[T]]^\times consists of the constant series. Consequently the kernel of \dlog restricted to \WW=(\Zp[[T]]^\times)^{\cN=\mathrm{id}} is exactly \mu_{p-1}.

Lean code for Lemma11.1.41 theorem
  • theoremdefined in PadicLFunctions/IwasawaProof/LogDerivative.lean
    complete
    theorem PadicLFunctions.Coleman.dlog_eq_zero_normOp_fixed (p : )
      [hp : Fact (Nat.Prime p)] {g : PowerSeries ℤ_[p]} (hg : IsUnit g)
      (hN : PadicLFunctions.Coleman.normOp g = g)
      (hd : PadicLFunctions.Coleman.dlog p g = 0) :
       c, c ^ p = c  g = PowerSeries.C c
    theorem PadicLFunctions.Coleman.dlog_eq_zero_normOp_fixed
      (p : ) [hp : Fact (Nat.Prime p)]
      {g : PowerSeries ℤ_[p]} (hg : IsUnit g)
      (hN :
        PadicLFunctions.Coleman.normOp g = g)
      (hd :
        PadicLFunctions.Coleman.dlog p g =
          0) :
       c, c ^ p = c  g = PowerSeries.C c
    The kernel of `Δ = ∂log` on `𝒩`-fixed units is `μ_{p−1}` (RJW rem:ker Δ, TeX
    3176–3178): a constant `𝒩`-fixed unit `f` satisfies `f^p = f`. Stated as: `dlog g = 0`
    and `𝒩 g = g` ⟹ `g` is a `(p−1)`-th root of unity (constant). 
Proof for Lemma 11.1.4
uses 0

Since \dlog f=(1+T)f'/f, we have \dlog f=0 iff f'=0 iff f is a constant c. For a constant, the defining relation of the norm operator, \varphi(\cN f)=\prod_{\eta\in\mu_p}f((1+T)\eta-1), reads \varphi(\cN c)=c^p; as \varphi is the identity on constants this gives \cN(c)=c^p. Hence \cN-invariance forces c^p=c, and since c is a unit this means c\in\mu_{p-1}. Conversely every c\in\mu_{p-1} is a constant, lies in \WW, and is killed by \dlog. Therefore \ker(\dlog|_\WW)=\mu_{p-1}.

The Galois group \GGam=\Gal(F_\infty/\Q)\cong\Gal(K_\infty/\Qp) acts on \sU_\infty. For a\in\Zpx we write \sigma_a\in\GGam for the element with \chi(\sigma_a)=a.

Proposition11.1.5
uses 0used by 1L∃∀N

The Coleman map \Col : \sU_\infty \to \Lam(\GGam) is \GGam-equivariant: for all a\in\Zpx and u\in\sU_\infty, \Col(\sigma_a u) = \sigma_a\,\Col(u).

Lean code for Proposition11.1.51 theorem
  • theoremdefined in PadicLFunctions/IwasawaProof/GaloisAction.lean
    complete
    theorem PadicLFunctions.Coleman.Col_galNCU (p : ) [hp : Fact (Nat.Prime p)]
      (a : ℤ_[p]ˣ) (u : PadicLFunctions.Coleman.NormCompatUnits p) :
      PadicLFunctions.Coleman.Col p (PadicLFunctions.Coleman.galNCU p a u) =
        (PadicMeasure.pushforward p
            (PadicLFunctions.Coleman.unitsMulLeftCM p a))
          (PadicLFunctions.Coleman.Col p u)
    theorem PadicLFunctions.Coleman.Col_galNCU (p : )
      [hp : Fact (Nat.Prime p)] (a : ℤ_[p]ˣ)
      (u :
        PadicLFunctions.Coleman.NormCompatUnits
          p) :
      PadicLFunctions.Coleman.Col p
          (PadicLFunctions.Coleman.galNCU p a
            u) =
        (PadicMeasure.pushforward p
            (PadicLFunctions.Coleman.unitsMulLeftCM
              p a))
          (PadicLFunctions.Coleman.Col p u)
    **RJW §12.1 Proposition (TeX 3193–3236)**: the Coleman map is `𝒢`-equivariant.
    Here `σ_a` acts on `Λ(ℤ_[p]ˣ)` by the pushforward along multiplication by `a`.
    
    Statement note (T1201): the RHS is finalised to the genuine `σ_a` pushforward
    `PadicMeasure.pushforward p (unitsMulLeftCM a)` (the skeleton carried the placeholder
    `unitsCmul p 1`); this is the authorised statement-fix (RJW TeX 3217–3234: `∂log(σ_a f)
    = a·σ_a ∂log f`, `∂⁻¹∘σ_a = a⁻¹σ_a∘∂⁻¹`, restriction equivariant, so the measure-side
    action is pushforward along `v ↦ a·v`). 
Proof for Proposition 11.1.5

One checks equivariance map-by-map, using that \sigma_a acts on a power series by f(T)\mapsto f((1+T)^a-1). For u\mapsto f_u: evaluating (\sigma_a f_u)(\pi_n)=f_u((1+\pi_n)^a-1)=f_u(\xi_{p^n}^a-1)=\sigma_a(u_n), so it is equivariant. The logarithmic derivative satisfies the twisted relation \dlog(\sigma_a f)=a\,\sigma_a(\dlog f). On measures, restriction to \Zpx commutes with \sigma_a since multiplying the variable by a\in\Zpx stabilises both \Zpx and p\Zp. The operator \partial^{-1} obeys \partial^{-1}\circ\sigma_a=a^{-1}\sigma_a\circ\partial^{-1}, checked on measures via \int_{\Zpx} f\,\partial^{-1}\sigma_a\mu=\int_{\Zpx}\tfrac{f(ax)}{ax}\mu. Finally \sA^{-1} is equivariant by definition. The factor a from \dlog cancels the factor a^{-1} from \partial^{-1}, leaving \Col equivariant. This depends on Definition 9.5.1.

Since the \GGam-action fixes 1\in\mu_{p-1} it stabilises \sU_{\infty,1}, and this action commutes with the \Zp-action there. Hence \sU_{\infty,1} is a \Lam(\GGam)-module, and we may summarise the section as follows.

Corollary11.1.6
uses 0
Used by 2
Reverse dependency previews
Preview
Theorem 10.3.4
Loading preview
Reverse dependency preview content is loaded from the Blueprint HTML cache.
L∃∀N

The Coleman map restricts to a homomorphism of \Lam(\GGam)-modules \Col : \sU_{\infty,1} \longrightarrow \Lam(\GGam).

Lean code for Corollary11.1.61 theorem
  • theoremdefined in PadicLFunctions/IwasawaProof/Equivariance.lean
    complete
    theorem PadicLFunctions.Coleman.Col_lambdaG_equivariant (p : )
      [hp : Fact (Nat.Prime p)] (a : ℤ_[p]ˣ)
      (u : PadicLFunctions.Coleman.NormCompatUnits p)
      (_hu : u  PadicLFunctions.Coleman.unitsTower1 p) :
      PadicLFunctions.Coleman.Col p (PadicLFunctions.Coleman.galNCU p a u) =
        (PadicMeasure.pushforward p
            (PadicLFunctions.Coleman.unitsMulLeftCM p a))
          (PadicLFunctions.Coleman.Col p u)
    theorem PadicLFunctions.Coleman.Col_lambdaG_equivariant
      (p : ) [hp : Fact (Nat.Prime p)]
      (a : ℤ_[p]ˣ)
      (u :
        PadicLFunctions.Coleman.NormCompatUnits
          p)
      (_hu :
        u 
          PadicLFunctions.Coleman.unitsTower1
            p) :
      PadicLFunctions.Coleman.Col p
          (PadicLFunctions.Coleman.galNCU p a
            u) =
        (PadicMeasure.pushforward p
            (PadicLFunctions.Coleman.unitsMulLeftCM
              p a))
          (PadicLFunctions.Coleman.Col p u)
    **RJW cor:G-eq (TeX 3241–3243)**: `Col` restricts to a map `𝒰_{∞,1} → Λ(𝒢)` of
    `Λ(𝒢)`-modules (the `ℤ_p`- and `𝒢`-actions commute and assemble to `Λ(𝒢)`). Stated as
    the conjunction of `ℤ_p`- and `𝒢`-equivariance already established: the `𝒢`-action `σ_a`
    on `Λ(𝒢) = Λ(ℤ_[p]ˣ)` is the pushforward of measures along `v ↦ a·v`
    (`PadicMeasure.pushforward p (unitsMulLeftCM p a)`), and `Col (σ_a u) = σ_a (Col u)`. 
Proof for Corollary 11.1.6
Proof uses 2
Proof dependency previews
Preview
Proposition 11.1.1
Loading preview
Proof dependency preview content is loaded from the Blueprint HTML cache.

Combine Proposition 11.1.1 (\Zp-equivariance on \sU_{\infty,1}) with Proposition 11.1.5 (\GGam-equivariance). The two actions commute and together generate the \Lam(\GGam)-action, so \Col is \Lam(\GGam)-linear.

Remark. The renormalisation "divide by x" used in constructing \zeta_p reappears here as \partial^{-1}. The relation \partial^{-1}\circ\sigma_a=a^{-1}\sigma_a\circ\partial^{-1} shows \partial^{-1} is exactly what makes \Col \GGam-equivariant. Conceptually \zeta and \zeta_p are the L-functions of the trivial Galois representation, the cyclotomic units form an Euler system for the twist \Qp(1), and \partial^{-1} bridges the two.