Группа авторов

Algebra and Applications 2


Скачать книгу

graded bialgebra, or the Hopf algebra, is obviously filtered by the canonical filtration associated with the grading:

      [1.16]image

      and in that case, if x is a homogeneous element, x is of degree n if and only if |x| = n.

      An important result is that any connected filtered bialgebra is indeed a filtered Hopf algebra, in the sense that the antipode comes for free. We give a proof of this fact as well as a recursive formula for the antipode using the convolution product: let ℋ be a (connected filtered) bialgebra, and let image be any k-algebra (which will be called the target algebra): the convolution product on image is given by:

image

      PROPOSITION 1.8.– The map image, given by image and e(x) = 0 for any xKer ε, is a unit for the convolution product. Moreover, the set image endowed with the convolution product is a group.

      PROOF.– The first statement is straightforward. To prove the second, let us consider the formal series:

image

      Using (eφ)(1) = 0, we have (eφ)*k(1) = 0 immediately, and for any xKer ε:

      [1.17]image

      When x ∈ ℋn, this expression vanishes and then for kn + 1. The formal series then ends up with a finite number of terms for any x, which proves the result. □

      [1.18]image

      It is given by S(1) = 1 and recursively by any of the two formulae for xKer ε:

      PROOF.– The antipode, when it exists, is the inverse of the identity for the convolution product on image. We then just need to apply Proposition 1.8 with image. The two recursive formulas come directly from the two equalities:

image

      fulfilled by any x ∈ Kerε.

      Let image be the subspace of image formed by the elements α, such that α(1) = 0. It is clearly a subalgebra of image for the convolution product. We have:

image

      From now on, we will suppose that the ground field k is of characteristic zero. For any x ∈ ℋn, the exponential:

      [1.21]image

      is a finite sum (ending up at k = n). It is a bijection from image onto image. Its inverse is given by:

      [1.22]image

      This sum again ends up at k = n for any x ∈ ℋn. Let us introduce a decreasing filtration on image:

      [1.23]image

      For any image let [α, β] = α * ββ * α.

      [1.25]image

      PROOF.– Take any x ∈ ℋp+q − 1, and any image and image. We have:

image

      Recall that we denote by |x| the minimal n, such that x ∈ ℋn. Since |x1| + |x2| = |x| ≤ p + q — 1, either |x1| ≤ p – 1 or |x2| ≤ q — 1, so the expression vanishes. Now, if (ψn) is a Cauchy sequence in