Permutation cycle Created 2026-09-24 Updated 2026-10-03
A permutation cycle sends to , sends to , and fixes every other element. Its order is .
Let be a complete discrete valuation ring of residue characteristic of a field , with maximal ideal , and let be a one-dimensional formal group law over . Its multiplication series is . If , the invertible morphism criterion for formal group laws constructs its inverse with coefficients in . Both formal power series converge on , since their coefficients are integral and the powers of an element of tend to zero. Their compositions are the identity there. Thus multiplication by is bijective, including when and is odd. Every finite-order element of consequently has order of a group element equal to a prime power with prime .
Torsion-free group 2026-10-03
A torsion-free group is a group in which the identity element is the only element of finite order of a group element.
A nonidentity rational point in the formal kernel of a minimal Weierstrass equation at two distinct primes has infinite order of a group element. Indeed, the prime-to-residue-characteristic multiplication on a formal group implies that a finite order in the kernel at must be a power of . Membership in the kernel at a different prime also forces a power of . The only common possibility is order one, contradicting nonidentity. For an integral model, negative valuations of the affine coordinates provide a convenient kernel-membership test.