Statement

Let kk be a field of characteristic zero and let (g,F)(\mathfrak g,F^\bullet) be a with g=F1g\mathfrak g=F^1\mathfrak g and [Fpg,Fqg]Fp+qg[F^p\mathfrak g,F^q\mathfrak g]\subseteq F^{p+q}\mathfrak g. The converges in the filtration and defines

xy=BCH(x,y)=x+y+12[x,y]+112[x,[x,y]]+112[y,[y,x]]+.x*y = \operatorname{BCH}(x,y) = x+y+\frac12[x,y] +\frac1{12}[x,[x,y]] +\frac1{12}[y,[y,x]]+\cdots.

With this product, identity 00, and inverse x1=xx^{-1}=-x, the set underlying g\mathfrak g is a group, denoted BCH(g)\operatorname{BCH}(\mathfrak g) or exp(g)\exp(\mathfrak g). Every continuous filtration-preserving Lie-algebra homomorphism f:ghf:\mathfrak g\to\mathfrak h is a homomorphism of the corresponding BCH groups.

Convergence and associativity

Every Lie monomial of bracket length nn in x,yF1gx,y\in F^1\mathfrak g lies in FngF^n\mathfrak g. Modulo FrgF^r\mathfrak g, only finitely many terms of the BCH series survive. These finite values are compatible as rr varies, and completeness supplies their unique inverse-limit value in g\mathfrak g.

The formal identity

BCH(BCH(x,y),z)=BCH(x,BCH(y,z))\operatorname{BCH}(\operatorname{BCH}(x,y),z) = \operatorname{BCH}(x,\operatorname{BCH}(y,z))

then proves associativity. This is a formal-algebraic argument; no norm, analytic convergence, or ambient matrix exponential is required.

Filtration on the group

Set FnBCH(g)=FngF^n\operatorname{BCH}(\mathfrak g)=F^n\mathfrak g as sets. The BCH formula gives

[FpBCH(g),FqBCH(g)]Fp+qBCH(g).[F^p\operatorname{BCH}(\mathfrak g), F^q\operatorname{BCH}(\mathfrak g)] \subseteq F^{p+q}\operatorname{BCH}(\mathfrak g).

Moreover,

BCH(g)/FnBCH(g/Fng),\operatorname{BCH}(\mathfrak g)/F^n \cong \operatorname{BCH}(\mathfrak g/F^n\mathfrak g),

and the group on the right is nilpotent. Thus the construction is compatible with all nilpotent truncations and exhibits the BCH group as their inverse limit.

Functorial form

The assignment

gBCH(g)\mathfrak g\longmapsto\operatorname{BCH}(\mathfrak g)

is a functor from complete bracket-filtered over kk to complete filtered groups. In formulations using prounipotent affine group schemes, exponential and logarithm give an equivalence between pronilpotent Lie algebras and prounipotent groups over a characteristic-zero field. For abstract groups, an inverse equivalence requires the corresponding Malcev or unique-divisibility hypotheses; it is not an equivalence with all complete filtered groups.

Relation to finite-dimensional formal groups

An arbitrary finite-dimensional Lie algebra need not be nilpotent and does not itself carry a filtration on which the full BCH series converges. Its associated formal group is instead read order by order in formal coordinates: equivalently, one may insert a formal parameter and apply this theorem to the complete Lie algebra

tg[[t]]t2g[[t]].t\mathfrak g[[t]] \supseteq t^2\mathfrak g[[t]] \supseteq\cdots.

The resulting formal BCH law is the local construction used in the .

When g\mathfrak g is nilpotent, its terminates and the BCH expression truncates to a finite Lie polynomial. In that special case the construction agrees with the usual exponential group of a nilpotent Lie algebra.

Characteristic warning

The rational coefficients in the BCH series require characteristic zero (or a base in which all relevant denominators are invertible). In positive characteristic, truncations of sufficiently small nilpotency class can still work under additional denominator bounds, but the unrestricted statement above is false.

References
  1. Nicolas Bourbaki, Lie Groups and Lie Algebras, Chapters 1–3, Springer, 1989. Publisher record. Relevant: Chapter II, §§6–7 on formal Lie series, complete algebras, and the Campbell–Hausdorff formula.
  2. Jean-Pierre Serre, Lie Algebras and Lie Groups, Lecture Notes in Mathematics 1500, Springer, 1992. Publisher record. Relevant: Part II, Chapters IV–V.
  3. Daniel Quillen, “Rational homotopy theory,” Annals of Mathematics 90 (1969), 205–295. Journal record. Relevant: complete Lie algebras and the exponential correspondence in characteristic zero.