Conference topic
Here we solve some problems from the 2016 West Coast Algebraic Topology Summer School (WCATSS) at The University of Oregon. Thanks to Piotr Pstragowski and Carolyn Yarnall for the solutions. First we recall some definitions.
Definition: Let R be a commutative ring with unit. A formal group law F over R is an element F∈R[[x,y]] satisfying
Proposition: For any formal group law F(x,y) over R, x has a formal inverse. That is, there exists an element i(x)∈R[[x]] such that F(x,i(x))=0.
Proof: Consider F(x,y+z), with |z|=n. Note that
F(x,y+z)=x+y+z+∑i,j⩾1aijxi(y+z)j=x+y+z+∑i,j⩾1aijxij∑k=0(jk)ykzj−k=x+y+z+∑i,j⩾1aijxi(yj+j−1∑k=0(jk)ykzj−k)=x+y+z+∑i,j1aijxiyj+∑i,j⩾1aijxi⏟deg ⩾ 1j−1∑k=0(jk)ykzj−k⏟deg = k+n(j−k)⩾n=F(x,y)+z+(terms of deg ⩾ n+1).
First choose z1 to be the negative of all the degree-1 terms of F(x,0), so that F(x,z1) has terms of degree 2 and higher. Now choose z2 to be the negative of all the degree-2 terms of F(x,z1), so F(x,z1+z2) has terms of degree 3 and higher. Continue in this manner ad infinitum to get a formal inverse ∑izi (this will be a power series) of x. ◻
Recall that we call fa(x,y)=x+y the additive formal group law and Fm(x,y)=x+y+xy the multiplicative formal group law. Via the universal Lazard ring of formal group laws, these turn out to be the formal group laws of ordinary singular cohomology theory (additive) and complex K-theory KU (multiplicative). Recall also nested notation: for F a formal group law, we write
[1]F(x)=x,[2]F(x)=F(x,x),[3]F(x)=F(F(x,x),x),[4]F(x)=F(F(F(x,x),x),x),
and so on.
Definition: Let F be a formal group law over R. A morphism of formal group laws is an element φ∈R[[u]], giving a formal group law φF∈R[[x,y]] by φF(x,y):=F(φ(x),φ(y)).
An isomorphism of formal group laws is a morphism where the formal power series φ is an isomorphism.
Proposition: The additive formal group law and the multiplicative formal group law are not isomorphic over Fp.
Proof: We compare [p]Fm(x) and [p]Fa(x) and show they are not the same. If there were an isomorphism φ between Fa and Fm, we should have that
Fm(x,x)=Fa(φ(x),φ(x))=φ(Fa(x,x)) ⟹ [p]Fm(x)=φ([p]Fa(x)),
since φ is a homomorphism. However, we first see that
[1]Fa(x)=x,[2]Fa(x)=Fa(x,x)=2x,[3]Fa(x)=Fa(Fa(x,x),x)=3x,
and so continuing this pattern we get that [p]Fa(x)=px=0 in Fp. Next, for the multiplicative formal group law we find that
[1]Fm(x)=x,,[2]Fm(x)=Fm(x,x)=2x+x2,[3]Fm(x)=Fm(2x+x2,x)=3x+3x2+x3.
Here the pattern is not immediate, but continuing these small examples we find that [p]Fm(x)=(x+1)p−1=1+xp−1=xp in Fp. An isomorphism sends only 0 to 0, but in this case φ should send xp≠0 to 0, a contradiction. Hence no such isomorphism exists over Fp. ◻
Definition: Let R be a commutative ring with unit. A formal group law F over R is an element F∈R[[x,y]] satisfying
- F(x,y)=F(y,x) (symmetry),
- F(x,0)=x and F(0,y)=y (uniticity),
- F(F(x,y),z)=F(x,F(y,z)) (associativity).
Proposition: For any formal group law F(x,y) over R, x has a formal inverse. That is, there exists an element i(x)∈R[[x]] such that F(x,i(x))=0.
Proof: Consider F(x,y+z), with |z|=n. Note that
F(x,y+z)=x+y+z+∑i,j⩾1aijxi(y+z)j=x+y+z+∑i,j⩾1aijxij∑k=0(jk)ykzj−k=x+y+z+∑i,j⩾1aijxi(yj+j−1∑k=0(jk)ykzj−k)=x+y+z+∑i,j1aijxiyj+∑i,j⩾1aijxi⏟deg ⩾ 1j−1∑k=0(jk)ykzj−k⏟deg = k+n(j−k)⩾n=F(x,y)+z+(terms of deg ⩾ n+1).
First choose z1 to be the negative of all the degree-1 terms of F(x,0), so that F(x,z1) has terms of degree 2 and higher. Now choose z2 to be the negative of all the degree-2 terms of F(x,z1), so F(x,z1+z2) has terms of degree 3 and higher. Continue in this manner ad infinitum to get a formal inverse ∑izi (this will be a power series) of x. ◻
Recall that we call fa(x,y)=x+y the additive formal group law and Fm(x,y)=x+y+xy the multiplicative formal group law. Via the universal Lazard ring of formal group laws, these turn out to be the formal group laws of ordinary singular cohomology theory (additive) and complex K-theory KU (multiplicative). Recall also nested notation: for F a formal group law, we write
[1]F(x)=x,[2]F(x)=F(x,x),[3]F(x)=F(F(x,x),x),[4]F(x)=F(F(F(x,x),x),x),
and so on.
Definition: Let F be a formal group law over R. A morphism of formal group laws is an element φ∈R[[u]], giving a formal group law φF∈R[[x,y]] by φF(x,y):=F(φ(x),φ(y)).
An isomorphism of formal group laws is a morphism where the formal power series φ is an isomorphism.
Proposition: The additive formal group law and the multiplicative formal group law are not isomorphic over Fp.
Proof: We compare [p]Fm(x) and [p]Fa(x) and show they are not the same. If there were an isomorphism φ between Fa and Fm, we should have that
Fm(x,x)=Fa(φ(x),φ(x))=φ(Fa(x,x)) ⟹ [p]Fm(x)=φ([p]Fa(x)),
since φ is a homomorphism. However, we first see that
[1]Fa(x)=x,[2]Fa(x)=Fa(x,x)=2x,[3]Fa(x)=Fa(Fa(x,x),x)=3x,
and so continuing this pattern we get that [p]Fa(x)=px=0 in Fp. Next, for the multiplicative formal group law we find that
[1]Fm(x)=x,,[2]Fm(x)=Fm(x,x)=2x+x2,[3]Fm(x)=Fm(2x+x2,x)=3x+3x2+x3.
Here the pattern is not immediate, but continuing these small examples we find that [p]Fm(x)=(x+1)p−1=1+xp−1=xp in Fp. An isomorphism sends only 0 to 0, but in this case φ should send xp≠0 to 0, a contradiction. Hence no such isomorphism exists over Fp. ◻
No comments:
Post a Comment