Here a formal group means a one-dimensional commutative formal group law. Over a ring , it is a formal power series satisfying
In particular, terms of total degree at least . A formal inverse with is obtained recursively. An isomorphism of formal group laws from to is a series with invertible linear coefficient and
Its compositional inverse exists over by coefficient recursion.
For , all these series converge on ; the operations preserve that set and make it the group . Use the uniformizer and normalize the valuation by , and write .
We explicitly construct its formal logarithm. Define
Then put
This is a formal series over with linear coefficient . Differentiating associativity in its last variable at gives
It follows that the -derivative of is , the same as that of . Evaluating at therefore proves
The differential is the invariant differential of a formal group law.
Choose an integer . In degree , the coefficient of has valuation at least . Thus the scaled series
has
Here , and the coefficient valuations tend to infinity. Consequently with a convergent integral power series on . Such a series is -Lipschitz. For any , the equation is equivalent to , a strict contraction, to which the contraction mapping theorem applies on the complete ring . It has exactly one solution.
The deep logarithm subgroup of a formal group is obtained as follows. The formal group exponential is the formal compositional inverse of , obtained recursively; equivalently it solves , with . The preceding contraction, applied to the scaled series, constructs its convergent inverse on and agrees with that formal inverse. This supplies the required convergence sketch for as well as a bijectivity proof for the logarithm.
The integral formal law and inverse preserve , so this is a subgroup. The logarithm identity and bijectivity give
Reduction of the formal law modulo has kernel . Its underlying image set is , which has size , where . Thus this subgroup has finite index, explicitly .

Articles by others on the same topic (0)

There are currently no matching articles.