The graded algebra of Steenrod qth powers
Grant Walker
(email: [email protected]
2010 Mathematics Subject Classification: 55S10)
Abstract
The algebra Aq of Steenrod qth powers, where q=pe is a power of a prime p, is isomorphic to a subalgebra Aq′ of the algebra of Steenrod pth powers Ap. The filtration of Ap by powers of its augmentation ideal was studied by J. P. May in his Princeton thesis of 1964. We extend some of May’s results to Aq and obtain a convenient set of defining relations for the graded algebra E0(Aq). In the case q=p, we recover the observation of S. B. Priddy that the subalgebra E0(Ap(n−2)) of E0(Ap) generated by the elements Ppj for 0≤j≤n−2 is isomorphic to the graded algebra associated to the augmentation ideal filtration of the group algebra FpU(n), where U(n) is the group of upper unitriangular matrices over Fp.
The Arnon A basis of Ap is given by monomials which are minimal in the left lexicographic order on formal monomials in the Steenrod powers. K. G. Monks (for p=2) and D. Yu. Emelyanov and Th. Yu. Popelensky (for p>2) have found a triangular relation between this basis and the Milnor basis using a certain ordering on the Milnor basis. We introduce a variant of the Arnon A basis which is minimal for the right order, and show that this basis and Arnon’s original A basis are also triangularly related to the Milnor basis of Aq using the right order on the Arnon A basis.
1 Introduction
Given a prime p, we denote by Ap the algebra of Steenrod pth powers. As an algebra over the field of p elements Fp, Ap may be regarded as the subalgebra of the mod p Steenrod algebra Ap which is generated by the elements Pr, r≥0, subject to the relation P0=1 and the Adem relations
[TABLE]
where the binomial coefficients are taken mod p, or alternatively as the quotient algebra Ap/ApβAp, where β is the Bockstein. As a subalgebra of Ap, the element Pr is given the degree 2r(p−1), but for simplicity we regrade Ap by giving Pr the ‘reduced’ degree r. Thus when p=2, Pr will mean Sqr, and not Sq2r.
For a prime power q=pe, where e≥1, the algebra Aq of Steenrod qth powers [12, Chapter 11] can be defined as an algebra over the Galois field Fq by generators Pr, r≥0, subject to the relation P0=1 and the Adem relations
[TABLE]
where, as before, the binomial coefficients are taken mod p. As the coefficients lie in the prime subfield Fp, we have an algebra Aq′ defined over Fp by the same generators and relations, and an isomorphism ρ:Aq→Aq′⊗FpFq of Hopf algebras.
We introduce the algebras Aq and Aq′ in Section 2. The algebra Aq′ may be identified with the subalgebra of Ap with Milnor basis given by the elements P(R)=P(r1,r2,…) such that rj=0 when j=0 mod e [9, Section 12.3]. As for Ap, we grade Aq by assigning degree r to Pr. With this choice of gradings, the element Pr∈Aq corresponds to P(0,…,0,r)∈Aq′, with r in position e, and the map ρ multiplies the grading by (q−1)/(p−1). It can be verified as in [9, Proposition 3.2.1 or 12.3.3] that the relations (1) are satisfied in Aq′. As in [9, Chapter 3], it follows from the Adem relations and the action of Aq′ on the polynomial algebra Fp[x] that the elements P(0,…,0,ps) for s≥0 are indecomposable in Aq′, and form a minimal set of generators.
In Section 3 we discuss the filtration of Ap by powers of the augmentation ideal Ap+. This was studied by J. P. May in his Princeton thesis of 1964 [5], and is known as the May filtration. Thus an element θ∈Ap has May filtration M(θ)=m if θ∈(Ap+)m but θ∈(Ap+)m+1. Since the ideal Ap+ is generated by the indecomposable elements Ppj, j≥0, the elements of May filtration 1 in degree pj are the elements whose expansion in any basis containing Ppj contains Ppj as a term.
Example 1.1**.**
Since Sq2Sq2=Sq3Sq1=Sq1Sq2Sq1, M(Sq2Sq2)=3. Similarly M(Sq2Sq1Sq2)=3 and M(Sq2Sq1Sq2Sq1)=4.
**
Definition 1.2**.**
For an integer a≥0, let a=∑i=0raipi be the base p expansion of a, where 0≤ai≤p−1 for all i. We define α(a)=∑i=0rai.
**
The May filtration has some elementary properties.
Proposition 1.3**.**
(i)* If θ∈Apd, then M(θ)≥α(d).*
(ii)* For all θ1,θ2∈Ap, M(θ1θ2)≥M(θ1)+M(θ2).*
(iii)* For all θ∈Ap, M(χ(θ))=M(θ), where χ is the antipode of Ap.*
Proof.
For (i), an element θ∈Apd cannot be the product of <α(d) elements of the form Ppj. For (ii), we observe that (Ap+)r(Ap+)s⊆(Ap+)r+s. For (iii), we observe that χ(Ap+)=Ap+.
∎
May determined the filtration on Ap by evaluating it on the Milnor basis, and showing that for a general element θ∈Ap, M(θ) is the minimum of the filtrations of the terms in the expansion of θ in the Milnor basis.
Theorem 1.4**.**
(May)*
For any sequence R=(r1,r2,…,rℓ) of integers ≥0, M(P(R))=∑i=1ℓiα(ri).*
We give a proof of Theorem 1.4 in Section 3, and extend the result to the prime power case.
Given a filtered algebra A, we denote the associated graded algebra by E0(A). The following observation of S. B. Priddy relates the Steenrod algebra to the group algebra of the group U(n) of n×n upper unitriangular matrices over Fp. A proof of this result, based on [5], is given in [7]. The subalgebra Ap(n−2) of Ap is generated by the elements Ppi, 0≤i≤n−2, and has dimension pn(n−1)/2 as a vector space over Fp.
Theorem 1.5**.**
(Priddy)*
The algebras E0(FpU(n)) and E0(Ap(n−2)) are isomorphic as graded Hopf algebras.*
In Section 4 we give a convenient set of generators and relations for E0(Aq), and in Section 5 we use a theorem of Quillen [11] to prove Theorem 1.5. In Sections 6, 7 and 8 we extend the work of K. G. Monks (for p=2) and of D. Yu. Emelyanov and Th. Yu. Popelensky (for p>2) on the relation between various bases of Ap [3, 8]. In Section 6 we show that some of the bases known as Pts-bases coincide with the Milnor basis up to higher May filtration, and hence give the same basis of E0(Aq). In Sections 7 and 8, we introduce a variant of Arnon’s A basis, and show that this basis and the original A basis are triangular with respect to the Milnor basis of Aq, using the right lexicographic order on the A basis. This is a different ordering from the one used in [3, 8].
2 The algebras Aq and Aq′
Let p be a prime number and let q=pe, e≥1, be a power of p. The Milnor basis elements Per=P(0,…,0,r), with r≥1 in position e, generate a Hopf subalgebra Aq′ of Ap. This subalgebra has an additive basis given by Milnor basis elements P(R), where R=(r1,r2,…) is a finite sequence of integers ≥0 such that rj=0 if j is not a multiple of e. This is clear from Milnor’s product formula, since a Milnor matrix X=(xi,j) which arises when two such elements are multiplied must have entries xi,j=0 unless i and j are both divisible by e, so that i+j is divisible by e. Hence we make the following definition.
Definition 2.1**.**
For e≥1 and R=(r1,…,rℓ), let Re be the sequence whose jth term is rk if j=ke for k≥1, and is [math] otherwise, and let Pe(R)=P(Re) be the corresponding Milnor basis element of Ap. The algebra Aq′ is the subalgebra of Ap with Fp-basis elements Pe(R) for all finite sequences R of integers ≥0.
**
Proposition 2.2**.**
The Poincaré series Π(Aq′,τ)=∏j≥11/(1−τ(qj−1)/(p−1)).
Proof.
Since we use the reduced grading on Ap in which Pr has degree r, P(R) has degree ∑j≥1rj(pj−1)/(p−1), and Pe(R) has degree ∑j≥1rj(qj−1)/(p−1).
Thus dim(Aq′)d is the number of solutions R=(r1,r2,…) of the equation
[TABLE]
where rj≥0 for j≥1. A solution of (2) gives an expression for (p−1)d as the sum of ∣R∣=∑jrj terms, of which rj are equal to qj−1 for j≥1. Since
1/(1−τ(qj−1)/(p−1))=∑i≥0τi(qj−1)/(p−1), this corresponds to a term of degree d in the power series expansion of ∏j≥11/(1−τ(qj−1)/(p−1)).
∎
We show that Aq′ satisfies the Adem relations (1).
Proposition 2.3**.**
Let q=pe where e≥1, and for r≥0, let Per=P(0,…,0,r) in Ap, where r is in position e. Then for a<qb
[TABLE]
in Ap, where the binomial coefficient is taken mod p.
Proof.
By the Milnor product formula
[TABLE]
Using this to expand both sides of the required relation in the Milnor basis, and equating coefficients of Pe(a+b−(q+1)k,k), we see that the relation is equivalent to the identity
[TABLE]
of mod p binomial coefficients, where 0≤k≤b. The change of variables a′=a−qk, b′=b−k and j′=j−k reduces this to the case k=0, namely
[TABLE]
Replacing a′,b′ by a,b, we prove (3) by induction on a+b. The base case (a,b)=(0,0) holds since (0c)=1 for all integers c. We assume that the cases (a−1,b) and (a,b−1) hold, and prove the case (a,b). For this we use the identity
[TABLE]
for mod p binomial coefficients, which follows from (1+x)c=(1+x)q(1+x)c−q, since (1+x)q=1+xq mod p. Writing c=(q−1)(b−j) and d=a−qj, we can expand each term on the right of (3) in the form
[TABLE]
The alternating sum over j of the first term on the right is (b(a−1)+b) and that of the second term is (b−1a+(b−1)), by the inductive hypothesis. Since c−q=(q−1)(b−j−1)−1 and d−q=a−q(j+1), the third and fourth terms cancel on taking the alternating sums over j. Since (ba+b−1)+(b−1a+b−1)=(ba+b), this completes the inductive step.
∎
The Adem relations lead to a basis of admissible monomials for Aq′.
Definition 2.4**.**
For A=(a1,a2,…,aℓ), where ai≥0 for 1≤i≤ℓ, PeA=Pea1Pea2⋯Peaℓ is a monomial in Aq′. The sequence A=(a1,…,aℓ) and the monomial PeA are admissible if ai≥qai+1 for 1≤i<ℓ.
**
If ai=0 for all i then Pe0=1 is admissible. Otherwise it suffices to consider finite sequences A of positive integers. If A=(a1,a2,…,aℓ), with ai>0 for 1≤i≤ℓ, we define the length len(A)=ℓ and the modulus ∣A∣=∑i=1ℓai. By adding trailing zeros, we may identify A with the infinite sequence (a1,a2,…), where ai=0 for i>ℓ. We introduce two linear orders on such sequences, the left order <l and the right order <r.
Definition 2.5**.**
Let A=(a1,a2,…) and B=(b1,b2,…) be sequences of integers ≥0. Then A<lB if and only if, for some k, aj=bj for 1≤j<k and ak<bk, and A<rB if and only if, for some k, aj=bj for j>k and ak>bk.
**
Thus <l is the usual left lexicographic order, but <r is the reversal of the usual right lexicographic order.
Proposition 2.6**.**
Every element of Aq′ is a sum of admissible monomials.
Proof.
For d≥0, let Sd denote the set of sequences A=(a1,a2,…) such that ai>0 for i≤len(A) and ∣A∣=d. Each element of Sd gives a corresponding monomial PeA∈(Aq′)d. If A is not admissible, then 0<ak<qak+1 for some k.
Using the Adem relation (1) with a=ak and b=ak+1, we may write PeA as a sum of monomials PeB, where B is obtained from A by replacing (a,b) by (a+b−j,j) for some j such that 0≤j≤[a/q]<b. In the case j=0, we omit the corresponding term of B: this does not affect PB since Pe0=1. Then B>l,rA. Hence PeA can be written as a sum of monomials PeB which are greater than PeA in both the left and right orders. Iteration of this procedure must stop, since Sd is a finite set. Hence PeA can be expressed as a sum of admissible monomials.
∎
Definition 2.7**.**
Let A=(a1,…,aℓ) be an admissible sequence of length ℓ. The Milnor sequence of A, or of SqA, is R=(r1,…,rℓ), where rj=aj−qaj+1 for 1≤j<ℓ and rℓ=aℓ.
**
Proposition 2.8**.**
The map which sends an admissible sequence A to its Milnor sequence R is a bijection from the set of admissible sequences to the set of finite sequences of integers ≥0, and it preserves the length ℓ and the right order <r. If PeA∈(Aq′)d, then ∣R∣=qa1−d and d=∑j=1ℓ(qj−1)rj.
Proof.
Since rℓ=aℓ, the map A↦R preserves length. Given R=(r1,…,rℓ) of length ℓ, the linear equations rj=aj−qaj+1 can be solved recursively for j=ℓ,ℓ−1,…,1 to give aj=∑i=jℓqi−jri. In particular, a1=∑i=1ℓqi−1ri. Since A=(a1,a2,…) is admissible, these equations give an inverse map R↦A.
For the right order, it suffices to consider sequences of the same length ℓ, since A<rB when len(A)>len(B). Let A=(a1,…,aℓ) and B=(b1,…,bℓ) be admissible sequences of length ℓ, with corresponding Milnor sequences R=(r1,…,rℓ) and S=(s1,…,sℓ). If aj=bj for j>k and ak>bk, then rj=sj for j>k and rk>sk. Hence R<rS if A<rB. The sum of the equations rj=aj−qaj+1, 1≤j<ℓ, gives ∣R∣=a1−(a2+⋯+as)=qa1−d. With the jth equation weighted by qj−1, d=∑j=1ℓ(qj−1)rj.
∎
Proposition 2.9**.**
The set of admissible monomials is a Fp-basis for Aq′.
Proof.
By Proposition 2.6, the admissible monomials span Aq′, and it follows from Proposition 2.8 that there is a bijection between admissible monomials and Milnor basis elements in Aq′.
∎
Following [9], we denote by bin(a) the set of 2-powers in the base 2 decomposition of an integer a≥0. For an odd prime p, this becomes a multiset.
Definition 2.10**.**
For an integer a≥0, let a=∑i=0raipi, where 0≤ai≤p−1 for all i. We denote by pin(a) the multiset of α(d) powers of p whose sum is d.
**
When p=3, for example, pin(25)={1,3,3,9,9} and α(25)=5. Thus α(a) is the number of elements in pin(a), counted with multiplicity ≤p−1. The binomial coefficient (ba)=0 mod p if and only if pin(b) is a sub-multiset of pin(a).
Proposition 2.11**.**
The set of elements Pepj, j≥0, is a minimal generating set for Aq′ as an algebra over Fp.
Proof.
Since Pe0=1, Aq′ is generated by the elements Pek, k≥1. If k is not a power of p, then k=prs, where r≥0 and s≥1. Let a=pr and b=pr(s−1) in the Adem relation (1). We claim that pr∈pin((p−1)b−1). Since (p−1)b−1=−1 mod pr, this is equivalent to proving that (p−1)b−1=pr−1 mod pr+1. Since b=pr(s−1), (p−1)b−1=pr−1 mod pr+1 if and only if (s−1)(p−1)=1 mod p, and this is equivalent to s(p−1)=0 mod p. Since s=0 mod p, this proves the claim.
It follows that (a(p−1)b−1)=0 mod p, and so the last term Pea+b=Pek appears in the Adem relation. Hence Pek is in the subalgebra generated by the elements Pei for i<k. By iterating the argument, it follows that Aq′ is generated by the elements Pepj, j≥0.
If Pepj could be omitted from this generating set, then by considering the grading on Aq it would follow that Pepj is in the subalgebra generated by the elements Pei for i<pj. But this is false, since for the action of Ap on Fp[x], we have Pei(xpj)=0 for 0<i<pj, while Pepj(xpj)=xqpj. Hence the generating set is minimal.
∎
The next result shows that Aq′ is a Hopf subalgebra of Ap. The proof follows from the corresponding formulae in Ap.
Proposition 2.12**.**
The coproduct ϕ:Aq′→Aq′⊗Aq′ satisfies
(i)* ϕ(Pek)=∑i+j=kPei⊗Pej for all k≥0,*
(ii)* ϕ(Pe(R))=∑S+T=RPe(S)⊗Pe(T) for all sequences R.
∎*
The dual Hopf algebra Ap∗ of Ap is a polynomial algebra over Fp with generators ξj, j≥1, of degree pj−1 [6]. The dual algebra (Aq′)∗ is a quotient of Ap∗, and may be described as follows.
Proposition 2.13**.**
For e≥1 and q=pe, (Aq′)∗=Ap∗/Iq, where Iq is the Hopf ideal in Ap∗ generated by the elements ξj such that e does not divide j. The algebra
(Aq′)∗ is a polynomial algebra over Fp with generators ξke, k≥1 of degree qk−1. The coproduct in (Aq′)∗ is defined by ϕ(ξke)=∑i=0kξ(k−i)eqi⊗ξie, and the antipode by χ(ξke)=∑Aξ(A), where the sum is over compositions A=(a1,…,as) of k, and ξ(A)=ξa1eξa2eqa1ξa3eqa1+a2⋯ξaseqa1+⋯+as−1.
∎
We next introduce the algebra Aq of Steenrod qth powers [12, Chapter 11].
Definition 2.14**.**
Let q=pe be a prime power, where e≥1. The algebra Aq of Steenrod qth powers is the algebra over the Galois field Fq generated by elements Pr, r≥0, subject to the relation P0=1 and the Adem relations (1).
**
Note that the coefficients in the Adem relations lie in the prime subfield Fp, so that we also have an algebra defined over Fp with the same generators and relations. The preceding results allow us to identify this algebra with Aq′.
Proposition 2.15**.**
There is an isomorphism ρ:Aq→Aq′⊗FpFq of Hopf algebras defined by ρ(Pr)=Per, r≥0.
∎
As for Ap, we grade Aq by assigning degree r to Pr for r≥0. Since Per=P(0,…,0,r)∈Ap, with r in position e, has degree r(q−1)/(p−1), the map ρ multiplies the grading by (q−1)/(p−1). The algebra Aq has a Milnor basis given by elements P(R), where ρ(P(R))=Pe(R). The degree of P(R) in Aq is ∑iri(qi−1)/(q−1). Then Propositions 2.2 and 2.11 give the following result.
Proposition 2.16**.**
(i)* The elements Ppj, j≥0, form a minimal generating set for Aq as an algebra over Fq.*
(ii)* The Poincaré series of Aq is Π(Aq,τ)=∏j≥11/(1−τ(qj−1)/(q−1)).
∎*
The Milnor product formula holds in Aq as in Ap, with the row sum condition ri=∑j≥0pjxi,j on Milnor matrices replaced by ri=∑j≥0qjxi,j, the column and diagonal sum conditions unchanged, and the multinomial coefficients taken in Fp.
The standard action of Ap on the polynomial algebra Fp[x] is determined by the formula Pk(xd)=(kd)xd+(p−1)k, so that Pk(xd) is a nonzero multiple of xd+k if pin(k)⊆pin(d), and Pk(xd)=0 otherwise. It is usual to grade Fp[x] by giving x degree 2 if p>2, but we assign grading 1 to x in all cases, as we deal only with Ap and not the full Steenrod algebra Ap. Thus the action of Pk on a power of x raises the degree by k(p−1). The Milnor basis element P(0,…,0,k)∈Aq′, with k in position e, acts on Fp[x] by P(0,…,0,k)(xd)=(kd)xd+(q−1)k. We use the isomorphism ρ of Proposition 2.15 to transfer this action to Aq, so that (with notation in Aq) the corresponding statement is Pk(xd)=(kd)xd+(q−1)k. This action of Aq in Fp[x] can alternatively be defined directly, as in [9, Chapter 1], by defining a ‘total Steenrod qth power’ P=∑k≥0Pk acting on the polynomial algebra Fp[x1,…,xn] by the formulae P(1)=1, P(xi)=xi+xiq for 1≤i≤n and the Cartan formula P(fg)=P(f)P(g) for polynomials f and g.
For p=2 and k>0, the combinatorial description of the formula Sqk(xd)=xd+k given in [9, Proposition 6.1.2] shows that the (reverse) base 2 expansion of d+k is obtained from that of d by replacing at least one subsequence of the form 1⋯1 0 by a subsequence 0⋯0 1 of the same length. Hence the number of digits 1 in the sequence may be decreased, but not increased, and so α(d+k)≤α(d). A similar argument holds for an odd prime p, using the reversed base p expansions of d and d+k(p−1). We find that the expansion of d+k(p−1) is obtained from that of d by replacing at least one subsequence a1⋯ar−1 0, where 0≤ai≤p−1, by a subsequence 0 b2⋯br, with ∑ibi≤∑iai. The same is true for the action of a general element θ∈Ap, since θ is a sum of compositions of the elements Pk. The generalization to Aq behaves in the same way, using the mod p expansions of d and d+k(p−1), since the action of Aq on Fp[x1,…,xn] is the same as that of Aq′.
3 The May filtration of Aq
The May filtration of Aq is defined as the filtration by powers of the augmentation ideal Aq+. The following result extends Theorem 1.4 to Aq.
Proposition 3.1**.**
For R=(r1,r2,…,rℓ), the Milnor basis element P(R)∈Aq has May filtration M(P(R))=∑i=1ℓiα(ri). In particular, for s≥0 and t≥1 the element Pts=P(0,…,0,ps), where ps is in position t, has May filtration t.
The numerical function α is defined for Aq as for Ap (Definition 2.10). Thus if a=∑j≥0ajpj where 0≤aj≤p−1 for all j, then α(a)=∑j≥0aj, so that α(a) is the cardinality of the multiset pin(a) given by the base p digits of a. We note that the element Pe(R)∈Aq′⊂Ap has May filtration M(Pe(R))=e⋅M(P(R)).
We shall establish Proposition 3.1 by proving inequalities in each direction.
Proposition 3.2**.**
For R=(r1,r2,…,rℓ), the Milnor basis element P(R)∈Aq has May filtration M(P(R))≥∑i=1ℓiα(ri).
Proof.
We argue by induction on ∣R∣=∑i=1ℓri. In the base case ∣R∣=1, R=(0,…,0,1) with 1 in position t, say. Thus the degree of P(R) in Aq is d=(qt−1)/(q−1)=1+q+q2+⋯+qt−1. Since an element of degree d in Aq must have May filtration ≥α(d), M(P(R))≥t. Thus we assume, as main induction hypothesis, that for r≥2 the inequality holds for all Milnor basis elements P(S) in Aq with ∣S∣<r, and we consider P(R) with ∣R∣=r.
For the inductive step, we first deal with the case where R has only one nonzero term r, using a subsidiary induction on α(r). If α(r)=1, then R=(0,…,0,ps) with ps in position t, so that P(R)=Pts. Thus P(R) has degree d=ps(qt−1)/(q−1) and α(d)=t, so as before M(P(R))≥t. For the inductive step on α(r), let R=(0,…,0,r) where α(r)>1. Let r=a+b, where a,b>0 are chosen so that pin(r) is the disjoint union of pin(a) and pin(b). Then in the Milnor product formula for P(0,…,0,a)P(0,…,0,b) (both of length t) the initial Milnor matrix gives a nonzero multiple of P(R). Any other term P(S) in the product arises from a Milnor matrix of the form
[TABLE]
Thus S=(0,…,0,(a−qtc)+(b−c),0,…,0,c), where pin(a−qtc) and pin(b−c) are disjoint, and the nonzero terms are in positions t and 2t. Then ∣S∣=r−qtc<r, and so by the main induction hypothesis on ∣S∣, M(P(S))≥tα((a−qtc)+(b−c))+2tα(c). Since α(a)≤α(a−qtc)+α(qtc)=α(a−qtc)+α(c) and α(b)≤α(b−c)+α(c), M(P(S))≥t(α(a)+α(b))=tα(r). By the induction hypothesis on α(r), we also have M(P(0,…,0,a))≥tα(a) and M(P(0,…,0,b))≥tα(b), so M(P(0,…,0,a)P(0,…,0,b))≥tα(r) also. Hence the Milnor product formula implies that M(P(R))≥tα(r). This completes the induction on α(r), and the proof in the case R=(0,…,0,r).
We may now assume that R=(0,…,0,r1,r2,…,rℓ), where r1>0 is in position k, and where ri>0 for some i>1. Applying the Milnor product formula to P(0,…,0,r2,…,rℓ)P(0,…,0,r1), the initial Milnor matrix gives a nonzero multiple of P(R). Any other term P(S) in the product arises from a Milnor matrix of the form
[TABLE]
where the nonzero column is column k, the nonzero rows are rows k+1,…,k+ℓ−1, and some ci>0. Thus ∣S∣=∣R∣−qk∑i=2ℓci<∣R∣, and so by the induction hypothesis on ∣S∣
[TABLE]
where we have used the assumption that the coefficient b(X)=0 to deal with diagonals in X with two nonzero entries.
We use the inequalities
[TABLE]
Weighting and adding these inequalities, we obtain
[TABLE]
We conclude that if the term P(S) appears in the expansion of
[TABLE]
then M(P(S))≥∑i=1ℓ(k+i−1)α(ri). By the induction hypothesis, the product itself has May filtration ≥∑i=2ℓ(k+i−1)α(ri)+kα(r1)=∑i=1ℓ(k+i−1)α(ri), and so the same is true for the initial term P(R). This completes the induction.
∎
To complete the proof of Theorem 1.4, we use the standard action of Milnor basis elements on polynomials to prove the reverse inequality.
Proposition 3.3**.**
For R=(r1,r2,…,rℓ), the Milnor basis element P(R)∈Aq has May filtration M(P(R))≤∑i=1ℓiα(ri).
Proof.
We first consider two special cases. For the first case, let q=p and P(R)=Pts, so that Pts(xps)=xps+t∈Fp[x]. There is only one digit 1 in the (reversed) base p expansion of ps, which is moved from position s to position s+t. This move cannot be broken down into more than t steps by the action of Steenrod operations in Ap of positive degree, and so Pts cannot be expressed as an element of (Ap+)t+1. Hence M(Pts)≤t. For a general q=pe, the element Pts∈Aq corresponds via ρ to Pets∈Aq′, and the same argument holds with t replaced by et.
For the second case, consider the equation Pr(xr)=xpr. Each of the α(r) nonzero digits of the base p expansion of r is moved one place to the right to give the base p expansion of pr. This cannot be done by a sequence of more than α(r) moves, and so M(Pr)≤α(r). For a general q=pe, we have Pts(xqs)=xqs+t, where Pts=P(0,…,0,ps) with ps is in position t. Replacing the equation Pr(xr)=xpr by Pr(xr)=xqr, the effect on the base p expansion is to move all α(r) base p digits of r through e places to the right to give the base p expansion of qr.
For the general case, we combine these two examples, using the action of Aq on polynomials over Fp in variables x1,x2,…, and representing monomials by arrays called ‘blocks’ as in [9], where the rows of the block are formed by the reverse binary expansions of the exponents. Let R=(r1,r2,…,rℓ). Then P(R)∈Aq acts on a product x1x2⋯x∣R∣ to give the sum of all the monomials obtained by raising ri of the variables xj to xjqi for 1≤i≤ℓ. By specializing the first r1 variables to a new variable y1, the next r2 variables to a new variable y2, and so on, we find that P(R)(y1r1y2r2⋯yℓrℓ)=y1qr1y2q2r2⋯yℓqℓrℓ+ other terms, since no other specialization of the variables leads to the same monomial. This monomial y1qr1y2q2r2⋯yℓqℓrℓ has the same α-count as the original monomial y1r1y2r2⋯yℓrℓ, and its base p block is obtained by moving each of the nonzero digits in row i a total of ei places to the right, for 1≤i≤ℓ. This cannot be achieved by a sequence of more than ∑i=1ℓiα(ri) Steenrod operations of positive degree. The result follows.
∎
4 The graded algebra E0(Aq)
In this section we consider the graded algebra E0(Aq) associated to the May filtration of Aq. Given a filtered algebra A, We use the same notation ambiguously for elements of A and for the corresponding elements of the associated graded algebra E0(A).
Using Theorem 1.4, the structure of E0(Aq) can be described as follows. The Milnor basis elements P(R), R=(r1,r2,…) form a Fq-basis of E0(Aq), with P(R) in grading M(P(R))=∑i=1ℓiα(ri). The product in E0(Aq) is given by P(R)P(S)=∑TP(T), where this sum is obtained by deleting all terms P(T) in the corresponding product in Aq such that M(P(T))>M(P(R))+M(P(S)). For example, Sq(4,2)Sq(1,2)=Sq(1,3,1)+Sq(4,2,1) in A2, but Sq(4,2)Sq(1,2)=Sq(4,2,1) in E0(A2). By the ‘degree’ and ‘grading’ of θ∈E0(Aq) we mean the degree of θ as an element of Aq and its filtration M(θ).
Proposition 4.1**.**
Let Aq(n−2) be the subalgebra of Aq generated by Ppi, 0≤i<(n−1)e. The graded algebra E0(Aq(n−2)) associated to the May filtration of Aq(n−2) can be defined by generators and relations as follows.
1. There is one generator Pts=P(0,…,0,ps) in each q-atomic* degree*
[TABLE]
with s≥0, t≥1 and (s/e)+t<n. There are en(n−1)/2 such degrees a. We denote this generator by P[a], and if a and b are q-atomic we denote the commutator P[a]P[b]−P[b]P[a] by [P[a],P[b]].
2. The defining relations are the power relations P[a]p=0 for all a, and the commutator relations: for a>b,
[TABLE]
Thus a Fq-basis for E0(Aq(n−2)) is given by monomials with exponents ≤p−1 in the generators P[a], taken in a fixed but arbitrary order. The dimension of the Fq-algebra E0(Aq(n−2)) is pen(n−1)/2=qn(n−1)/2.
The q-atomic number a=ps(qt−1)/(q−1) has reversed base p expansion 0…0 1 0…0 1…0…0 1, where there are t equally spaced digits 1 in positions s,s+e,…,s+(t−1)e. By Proposition 3.1, P[a] has grading t in E0(Aq).
Example 4.2**.**
In the case q=p, n=4, E0(Ap(2)) has 6 generators P[1]=P(1), P[p]=P(p), P[p+1]=P(0,1), P[p2]=P(p2), P[p2+p]=P(0,p) and P[p2+p+1]=P(0,0,1). The nonzero commutators are [P[p],P[1]]=P[p+1], [P[p2],P[p]]=P[p2+p] and [P[p2+p],P[1]]=[P[p2],P[p+1]]=P[p2+p+1].
**
Example 4.3**.**
In the case q=4, n=3, E0(A4(1)) has 6 generators P[a], a=1,2,4,8,5,10 with relations P[a]2=0 and nonzero commutators [P[4],P[1]]=P[5] and [P[8],P[2]]=P[10]. The elements P[a]∈A4 correspond respectively to Sq(0,1), Sq(0,2), Sq(0,4), Sq(0,8), Sq(0,0,0,1) and Sq(0,0,0,2) in A4′⊂A2.
**
These power and commutator relations do not generally hold in Aq, but only in the graded algebra E0(Aq). For example, in A4 we have [P[8],P[1]]=P[5]P[4], [P[4],P[2]]=P[5]P[1] and [P[8],P[4]]=P[10]P[2], where in each case the right hand side has filtration 3, and P[4]P[4]=P(3,1) and P[8]P[8]=P(6,2), where in each case the right hand side has filtration 4.
The particular power relations (P1s)p=(Pps)p=0 in E0(Aq(n−2)) can be proved by observing that the expansion of (Pps)p in the admissible basis does not involve Pps+1. This is because Pps+1 is indecomposable in Aq (Proposition 2.16(i)), and since ps+1=ps+⋯+ps (p terms) is the unique minimal decomposition of ps+1 as the sum of more than one power of p, all other admissible monomials in degree ps+1 have May filtration ≥p+1. To prove the general power relation (Pts)p=0 and the commutator relations, we use the Milnor product formula.
Proof of Proposition 4.1.
Given a q-atomic number a=ps(qt−1)/(q−1), let P[a]=P(0,…,0,ps) be the corresponding element of Aq(n−2), where ps is in position t. Similarly let b=pu(qv−1)/(q−1) so that P[b]=P(0,…,0,pu) with pu in position v. Then we wish to prove that in E0(Aq(n−2)) we have P[a]p=0 for all a and [P[a],P[b]]=P[a+b] when a≥b and s=u+v or u=s+t, and [P[a],P[b]]=0 otherwise. Equivalently, P[a]p has May filtration >pt, [P[a],P[b]]−P[a+b] has May filtration >t+v when s=u+v or u=s+t, and otherwise [P[a],P[b]] has May filtration >t+v.
The calculation of P[a]P[b] and P[b]P[a] by the Milnor product formula produces Milnor matrices of the form
[TABLE]
We may assume that t≥v, and that if t=v then s≥u.
We first consider the case c>0. Since c appears in position t+v, by Proposition 3.2 the corresponding term in P[a]P[b] has May filtration ≥t+v, and is >t+v unless the array satisfies α(ps−pvc)+α(c)=α(ps)=1 and α(pu−c)+α(c)=α(pu)=1. Thus pu−c=0 and ps−pvc=0, i.e. s=u+v, c=pu. The corresponding element is P[a+b]=P(0,…,0,pu), where pu is in position t+v. The case u=s+t arises similarly by considering P[b]P[a].
Next we consider the initial term c=0, with a=b. The c=0 terms in P[a]P[b] and P[b]P[a] are equal (to P(0,…,0,pu,0,…,0,ps) if t>v, and to P(0,…,0,pu+ps) if t=v, s>u), and so they cancel in [P[a],P[b]].
Finally we consider the initial term c=0, with a=b, so that t=v and s=u. The c=0 term is 2P(0,…,0,2ps) since the binomial coefficient (ps2ps)=2 mod p. This gives the result P[a]2=0 in the case p=2. For p>2 we need to consider products P(0,…,0,ips)P(0,…,0,jps) for 0≤i,j≤p−1. These produce similar Milnor matrices to those shown above. Again the case c>0 gives terms of higher May filtration. The initial Milnor matrix c=0 gives a multiple (ips(i+j)ps)=(ii+j), which is nonzero mod p when i+j<p and is [math] mod p when i+j=p. It follows that P[a]p=0 in E0(Aq).
∎
Proposition 4.1 allows us to determine the dimension of the kth filtration quotient (Aq+)k/(Aq+)k+1 as a vector space over Fq for each degree d≥0. Since E0(Aq) has a basis given by taking the products of the generators P[a] in a fixed but arbitrary order, this dimension is the number of multisets A={a1,a2,…,aℓ} of q-atomic numbers with multiplicities ≤p−1, sum ∣A∣=∑i=1ℓai=d and filtration ∑i=1ℓM(P[ai])=k. Thus we have the following result.
Proposition 4.4**.**
The Poincaré series of the graded algebra E0(Ap(n−2)) is
[TABLE]
For q=pe, the Poincaré series of E0(Aq(n−2)) is the eth power of this series.
∎
Example 4.5**.**
The basis for E0(A2(1)) given by Proposition 4.1 is shown below, together with the grading, using the order 1,3,2 on 2-atomic numbers. Since Sq[1]=Sq(1), Sq[2]=Sq(2) and Sq[3]=Sq(0,1), this basis is the Milnor basis. The Poincaré series is (1+τ)2(1+τ2)=1+2τ+2τ2+2τ3+τ4.
[TABLE]
The corresponding series for E0(A4(1)) is (1+τ)4(1+τ2)2=1+4τ+8τ2+12τ3+14τ4+12τ5+8τ6+4τ7+τ8. It can be obtained by applying Proposition 3.1 to the Milnor basis elements P(r1,r2) with 0≤r1≤15 and 0≤r2≤3.
**
For M≥0, there is a natural bijection between monomials P[A] in the generators P[a] with exponents ≤p−1, degree d and grading M in E0(Aq), and Milnor basis elements P(R)=P(r1.r2,…) with degree d and May filtration M in Aq. This has been described, by K. G. Monks [8] for p=2 and by D. Yu. Emelyanov and Th. Yu. Popelensky [3] for p>2, as follows: if P[a]=Pts, so that a=ps(qt−1)/(q−1), then P[a] appears with exponent k in P[A] if and only if ps has coefficient k in the base p expansion of rt. Hence d=∑jkjaj=∑iri(qi−1)/(q−1), since if aj=psj(qtj−1)/(q−1) then ri=∑tj=ikjpsj and α(ri)=∑tj=ikj, and M=∑jkjtj=∑iiα(ri).
Example 4.6**.**
The first few 3-atomic numbers are shown below. The monomial P[1]P[4]2P[3]2 corresponds to the Milnor basis element P(7,2), with d=15 and M=7.
[TABLE]
Example 4.7**.**
The first few 4-atomic numbers are shown below. The monomial P[1]P[10]P[8] corresponds to the Milnor basis element P(9,2), with d=19 and M=4.
[TABLE]
A sum of elements of filtration M in a filtered algebra can have filtration >M, as the next example shows.
Example 4.8**.**
The following table shows the grading of the Milnor basis in E0(A2) for elements of degree 12.
[TABLE]
Thus for q=2 and degree d=12, (A2+)6/(A2+)7 is spanned by the elements
[TABLE]
But Sq8Sq3Sq1 and Sq9Sq2Sq1 have filtration 4, since their Milnor basis expansion involves Sq(9,1) in each case. It follows that there is no ‘admissible basis’ of the filtration quotients of A2.
**
If a similar situation were to occur for a sum of Milnor basis elements of the same May filtration in Aq, then, in view of the bijection described above, some filtration quotient of Aq would have dimension greater than that given by Proposition 4.4. Thus, by working down from the highest filtration in a given degree, we obtain the following result [5].
Proposition 4.9**.**
For any element θ∈Aq, the May filtration of θ is the minimum of the May filtrations of the terms in the expansion of θ in the Milnor basis. ∎
5 The graded algebra E0(FpU(n))
Given a group G and a field F, the augmentation ideal A of the group algebra FG is the kernel of the homomorphism FG→F which maps g↦1 for all g∈G. We filter FG by the powers Ai of A, and define the associated graded algebra E0(FG)=⊕i≥0Ai/Ai+1, where A0=FG and the product of a∈Ai and b∈Aj is defined by ab=ab∈Ai+j, where a and b are the cosets a+Ai+1 and b+Aj+1. In this section, we consider E0(FpU(n)) where p is prime and U(n)⊂GL(n,Fp) is the subgroup of upper unitriangular matrices, and we prove Theorem 1.5 by finding generators and defining relations for E0(FpU(n)) which correspond to those of Proposition 4.1 for E0(Ap(n−2)).
Example 5.1**.**
In the case p=2, the group U(3) is dihedral of order 8. It is generated by e1,e2,e3 where
[TABLE]
with defining relations e12=e22=e32=I, (e1,e3)=(e2,e3)=I and (e1,e2)=e3, where I is the identity matrix and (g1,g2)=g1−1g2−1g1g2 is the commutator. The augmentation ideal A of F2U(3) is given by formal sums of an even number of matrices, and is generated by f1=1+e1, f2=1+e2 and f3=1+e3, where 1=I. These satisfy the relations f12=f22=f32=0, [f1,f3]=[f2,f3]=0 and [f1,f2]=f3+f1f3+f2f3+f1f2f3, where [a1,a2]=a1a2+a2a1 is the commutator. The last relation shows that f3∈A2 and that [f1,f2]=f3 in the graded algebra E0(F2U(3)). This algebra has dimension 8 over F2, with basis {1,f1,f2,f3,f1f2,f1f3,f2f3,f1f2f3} and defining relations f12=f22=f32=0, [f1,f3]=[f2,f3]=0 and [f1,f2]=f3. The grading is shown by the diagram
[TABLE]
In this case, the corresponding basis for E0(A2(1)) obtained using f1↔Sq1 and f2↔Sq2 is the Milnor basis
[TABLE]
A theorem of Quillen [11] describes the structure of E0(FG) as the universal enveloping algebra of a Lie algebra L(G) associated to G. If F has prime characteristic p, then L(G) is a ‘restricted’ Lie algebra, as it has an additional structure map called a ‘pth power map’. The universal enveloping algebra is also taken in the restricted sense.
The construction of the Lie algebra L(G) is based on the dimension series of the group G. The kth dimension subgroup Dk(G) is the normal subgroup of G which consists of elements g∈G such that g−1∈Ak. In particular, D1(G)=G. The quotients Dk(G)/Dk+1(G) are Abelian, and, for the purpose of constructing L(G) as their direct sum, these quotients are written additively. Thus L(G)=⊕k≥1Dk(G)/Dk+1(G) is a graded Abelian group, and we define a Lie product on L(G) by [g1,g2]=(g1,g2), where (g1,g2)=g1−1g2−1g1g2 is the commutator in G. Various identities for commutators in G then translate into bilinearity, anti-commutativity and the Jacobi identity in L(G) [10].
We embed L(G) additively into E0(FG) by the map θ:g↦g−1+Ak+1, where g has grading k in L(G). As it is an associative algebra, E0(FG) also has a Lie product defined by [g1,g2]=g1g2−g2g1, and the map θ is a homomorphism of Lie rings. Finally we take coefficients in F, to get a map θ:L(G)⊗ZF→E0(FG) of Lie algebras over F. The pth power map on E0(FG) is defined by g[p]=gp.
Example 5.2**.**
In Example 5.1, D2={1,e3} is the centre of U(3), and D3={1}. Regarded as elements of L(U(3)), the cosets 1+D2, e1+D2, e2+D2, e1e2+D2 are written as [math], e1, e2 and e1+e2 respectively, and the cosets 1+D3, e3+D3 as [math], e3. The commutator relations in Example 5.1 show that the Lie product in L(U(3)) is given by [e1,e3]=[e2,e3]=0 and [e1,e2]=e3. The elements e1, e2 of L(U(3)) have grading 1, while e3 has grading 2.
The embedding θ:L(U(3))→E0(F2U(3)) maps ei to fi for i=1,2,3. The relations in E0(F2U(3)) of Example 5.1 show that θ is a map of Lie algebras, and that g↦g[2] is the zero map. The (ungraded) Lie algebra L(U(3)) is isomorphic to the Lie algebra of nilpotent upper triangular 3×3 matrices over F2 [7].
**
Given a restricted Lie algebra L over a field F of characteristic p, the restricted universal enveloping algebra U(L) is the quotient of the tensor algebra of L by the relations [a,b]=a⊗b−b⊗a and a[p]=a⊗a⊗⋯⊗a (p factors), for all a,b∈L. Then U(L) is an associative algebra, and has a Lie product defined by commutators. The natural map L→U(L) is then an embedding of restricted Lie algebras. By the Poincaré-Birkhoff-Witt theorem, if x1,x2,…,xm is an ordered F-basis for L, then a F-basis for U(L) is given by the monomials xi1α1xi2α2⋯xirαr with i1<i2<⋯<ir and 0≤αi<p.
Theorem 5.3**.**
(Quillen, [11])*
The map θ:L(G)⊗ZF→E0(FG) extends to an isomorphism*
[TABLE]
of graded algebras over F. If F has prime characteristic p, then U(L(G)⊗ZF) is taken in the restricted sense.
When G=U(n), the group of upper unitriangular n×n matrices over Fp, the dimension subgroups are the terms of its lower central series: Dk(U(n)) consists of all matrices U=(ui,j) with k−1 diagonals of zeros above the main diagonal, so that ui,j=0 for 1≤j−i<k. Thus Dk(U(n))/Dk+1(U(n)) is an elementary Abelian group of order pn−k. To construct the Lie algebra L(U(n)), we write the group Dk(U(n))/Dk+1(U(n)) additively, so as to regard it as vector space of dimension n−k over Fp.
For 1≤i<j≤n, let Ei,j∈U(n) be the elementary n×n matrix over Fp obtained by changing the (i,j)th entry of the identity matrix I from [math] to 1.
The commutator (Ei,j,Ek,ℓ)=Ei,j−1Ek,ℓ−1Ei,jEk,ℓ is Ei,ℓ if j=k, Ek,j if i=ℓ, and I otherwise.
We write Ei,j=ea, where a=(pj−1−pi−1)/(p−1) is a p-atomic number. The conditions 1≤i<j≤n on i and j then correspond to the conditions 1≤a≤(pn−1−1)/(p−1), and for p-atomic numbers a and b=(pk−1−pℓ−1)/(p−1) the commutator (ea,eb)=ec where c=a+b=(pℓ−1−pi−1)/(p−1) if j=k, (ea,eb)=ec′ where c′=a+b=(pj−1−pk−1)/(p−1) if i=ℓ, and (ea,eb)=I otherwise. Thus, in terms of the (reverse) base p expansions 0⋯0 1⋯1 of a and b, (ea,eb)=ea+b if a>b and the blocks of 1s in the expansions of a and b abut, so as to form a single block of 1s under base p addition, as shown below,
[TABLE]
and otherwise ea and eb commute. Thus (ea,eb)=ea+b if a>b and a+b is p-atomic and is not a power of p, and otherwise (ea,eb)=I.
The quotient group Dk(U(n))/Dk+1(U(n)) is generated by the cosets ea=ea+Dk+1(U(n)) of the elements ea with an entry 1 on the kth superdiagonal j−i=k. As a vector space over Fp, L(U(n)) is the direct sum of these quotients, and has dimension n(n−1)/2. Thus L(U(n)) is the graded elementary Abelian p-group generated by the elements ea for a≤(pn−1−1)/(p−1), and ea has grading k=j−i. Thus the elements of L(U(n)) are formal sums of elements ea corresponding to the matrices ea∈U(n).
The Lie product in L(U(n)) is defined by [ea,eb]=(ea,eb). It follows from the above discussion of commutators in U(n) that [ea,eb]=ea+b if a>b, a+b is p-atomic and is not a power of p, and otherwise [ea,eb]=0. Since ea+b has grading k+ℓ if ea has grading k and eb has grading ℓ, this product makes L(U(n)) into a graded Lie algebra.
For each ea∈U(n) as above, we define fa=1−ea in FpU(n). If ea has a 1 on the kth superdiagonal, then fa∈Ak, and so fa+Ak+1 is a well-defined element of the graded algebra E0(FpU(n)). Since the elements ea form a Fp-basis for L(U(n)), we can define a map θ:L(U(n))→E0(FpU(n)) of graded algebras by θ(ea)=fa+Ak+1, where ea has grading k=j−i in L(U(n)) and a=(pj−1−pi−1)/(p−1).
We shall show that θ is an embedding of Lie algebras, where the Lie product of x,y∈E0(FpU(n)) is defined by [x,y]=xy−yx. Thus we wish to prove
[TABLE]
where ea has grading k and eb has grading ℓ. Since products such as fa⋅Aℓ+1 are in Ak+ℓ+1, this simplifies to
[TABLE]
Since [ea,eb]=ea+b if a+b is p-atomic, and [ea,eb]=0 otherwise, θ([ea,eb])=1−ea+b+Ak+ℓ+1 if a+b is p-atomic, and θ([ea,eb])=0+Ak+ℓ+1 otherwise. The result holds in the second case since ea and eb commute in U(n). In the first case, ea−1eb−1eaeb=ea+b, so ebea=eaebea+b. Hence eaeb−ebea=eaeb(1−ea+b). Since 1−ea+b∈Ak+ℓ and eaeb∈1+A, eaeb−ebea+Ak+ℓ+1=1+ea+b+Ak+ℓ+1. Thus the result holds in the first case. It follows that θ is a Lie algebra homomorphism.
We next apply Theorem 5.3. The restricted universal enveloping algebra U(L(U(n))) is an associative algebra over Fp of dimension pn(n−1)/2. It has a basis given by products of the elements eak, where 0≤k≤p−1 and a=(pj−1−pi−1)/(p−1) for 1≤i<j≤n, the p-atomic numbers a being taken in a fixed but arbitrary order. The pth power map x↦x[p] is trivial since (ea+1)p=0 in Fp(U(n)). By Quillen’s theorem, the map θ:L(U(n))→E0(FpU(n)) extends to an isomorphism θ:U(L(U(n)))→E0(FpU(n)) of graded algebras over Fp. On basis elements we have
[TABLE]
where a1,a2,…,ar are taken in the preferred order, and k is the sum of the gradings of the elements eai.
In the associative algebra U(L(U(n))), the Lie bracket [x,y]=xy−yx, and so the relations eap=0 and eaeb−eaeb=[ea,eb]=ea+b or [math] can be regarded as power-commutator relations defining U(L(U(n))) as an algebra. Thus Quillen’s theorem provides us with a corresponding definition of the algebra E0(FpU(n)) by generators and relations. We write fa=1−ea∈Fp(U(n)) where a is p-atomic, and translate these relations as fap=0 and fafb−fbfa=fa+b if a>b and a+b is p-atomic, and fafb=fbfa otherwise.
Proof of Theorem 1.5.
The graded algebras E0(FpU(n)) and E0(Ap(n−2)) have the same dimension pn(n−1)/2 as vector spaces over Fp. The discussion above shows that the elements fa corresponding to the n(n−1)/2 p-atomic numbers a such that 1≤a≤(pn−1−1)/(p−1) generate E0(FpU(n)), and satisfy relations which correspond to those of Proposition 4.1 for the generators Pts of E0(Ap(n−2)). Hence the map E0(FpU(n))⟶E0(Ap(n−2)) which sends fa to Pts, where a=ps(pt−1)/(p−1), is an isomorphism of graded algebras.
Further, E0(FpU(n)) and E0(Ap(n−2)) are isomorphic as Hopf algebras. The generators P[a] of E0(Ap(n−2)) and fa of E0(FpU(n)) are coproduct primitives. Since P[a]=Pts=P(0,…,0,ps),
ϕ(P(0,…,0,k))=∑i+j=kP(0,…,0,i)⊗P(0,…,0,j).
With the nonzero elements in position t, the May filtration of P(0,…,0,k) is tα(k), and that of P(0,…,0,i)⊗P(0,…,0,j) is t(α(i)+α(j)), so in E0(Aq) the sum is over i,j such that i+j=k and α(i)+α(j)=α(k). Since α(k)=1 when k=ps, the only terms which survive are given by i=0, j=k and i=k, j=0.
The coproduct in FpU(n) is given by ϕ(g)=g⊗g for all g∈U(n). Hence ϕ(fa)=ϕ(1−ea)=ϕ(1)−ϕ(ea)=1⊗1−ea⊗ea=1⊗1−(1−fa)⊗(1−fa)=fa⊗1+1⊗fa−fa⊗fa for the coproduct in FpU(n). Hence in E0(FpU(n)) we have ϕ(fa)=fa⊗1+1⊗fa. It follows that the isomorphism fa↔P[a] preserves coproducts. The antipodes are also preserved: since P[a] and fa are primitive, χ(P[a])=−P[a] and χ(fa)=−fa.
∎
Remark 5.4**.**
By Definition 2.1, for q=pe the subalgebra Aq′(n−2) of Aq′ is contained in the subalgebra Ap(ne−2) of Ap. The isomorphism E0(FpU(n))⟶E0(Ap(n−2)) of Theorem 1.5 maps E0(Aq′(n−2)) to the subalgebra of E0(FpU(n)) generated by matrices U=(ui,j) in U(n) with non-zero entries only on every eth superdiagonal, so that ui,j=0 if e does not divide j−i. Using Proposition 2.15, we have a corresponding description of E0(Aq(n−2)).
**
6 Pts bases for E0(Aq)
Let p be a prime and let q=pe be a power of p. Following Wood [13], we define the Y- and Z- orders on p- and q-atomic numbers as follows.
Definition 6.1**.**
The Y-order on p-atomic numbers ps(pt−1)/(p−1) is the left lexicographic order on pairs (s,t), while the Z-order is the left lexicographic order on pairs (s+t,s), where s≥0 and t≥1. More generally, the Y- and Z- orders on q-atomic numbers ps(qt−1)/(q−1) are the left lexicographic orders on the triples (s′,t,s′′) and (s′+t,s′,s′′) respectively, where s=s′e+s′′, 0≤s′′<e.
**
Example 6.2**.**
Example 4.6 shows the first few 3-atomic numbers. The Y-order 1,4,13,40,…,3,12,39,…,9,36,…,27,… takes rows left to right and upwards. The Z-order 1,4,3,13,12,9,40,39,36,27,… takes diagonals right to left and upwards.
**
Example 6.3**.**
Example 4.7 shows the first few 4-atomic numbers. Since e=2, we apply the previous recipes to rows taken in pairs. The Y-order is thus 1,2,5,10,21,42,85,…,4,8,20,40,…,16,32,…, while the Z-order is 1,2,5,10, 4,8,21,42,20,40,16,32,85,….
**
The Pts bases of Ap defined by Monks [8] and Emelyanov-Popelensky [2] are obtained by fixing an arbitrary order on the set of p-atomic numbers, and then taking products of the elements Pts in weakly increasing order, with each such element being repeated up to p−1 times. The bijection described in Section 4 gives a triangular relation between these products and the Milnor basis. This relationship is sharpened in Proposition 6.5.For the Y- and Z-Pts bases, which are defined using the Y- and Z- orders).
Given such a basis for Ap, the basis elements which are products of elements Pts such that e divides t give a basis for the subalgebra Aq′, where q=pe. The corresponding elements of Aq give a Pts-basis for Aq, whose elements are products of the elements P[a]=Pts=P(0,…,0,ps), with one such element in each q-atomic degree a=ps(qt−1)/(q−1), each being repeated up to p−1 times.
Example 6.4**.**
Let p=2, so that Pts=Sq(0,…,0,2s) has degree a=2s(2t−1). We denote this element alternatively by Sq[a], and use the Z-order. The table below augments that of Example 4.8 by showing the Z-Pts elements corresponding to the Milnor basis, abbreviating a product Sq[a1]Sq[a2]⋯Sq[ar] as Sq[a1,a2,…,ar], with the ai in increasing Z-order 1,3,2,7,6,4,15,14,12,8,….
[TABLE]
In this example, the Y-Pts basis is obtained from the Z-Pts basis by replacing Sq[2]Sq[7] by Sq[7]Sq[2]. Since Sq(2)Sq(0,0,1)=Sq(2,0,1)=Sq(0,0,1)Sq(2), these bases coincide in degree 12. (They differ in degree 18, as Sq(4)Sq(0,0,2)=Sq(0,0,2)Sq(4), but the ‘error term’ Sq(3,0,0,1) has higher May filtration.) The transition matrix from either Pts basis to the Milnor basis in degree 12 is shown below. Note that the diagonal submatrices corresponding to filtrations 2,4,5 and 6 are identity matrices. We show that this situation holds more generally.
[TABLE]
Proposition 6.5**.**
The Y- and Z-Pts bases of Aq coincide with the Milnor basis up to elements of higher May filtration, so that all three bases give the same basis of E0(Aq).
Proof.
Let a and b be q-atomic numbers. In the cases where P[a] and P[b] do not commute in E0(Aq), a and b occur in the same order in the Y- and Z-orderings. Hence the Y- and Z-Pts bases of Aq coincide up to elements of higher May filtration.
To prove that the Milnor basis of E0(Aq) also coincides with these, we consider a Z-basis element P[a1]P[a2]⋯P[ak], where a1,a2,…,ak is a weakly increasing sequence of q-atomic numbers with ai+p−1>Zai for all i. We assume by induction on k that P[a2]⋯P[ak]=P(R) in E0(Aq), where R is the sequence corresponding to a2,…,ak as in Section 4 (see Examples 4.6 and 4.7). For the inductive step, let a=ps(qt−1)/(q−1). We use the Milnor product formula to show that P[a]P(R)=P(R′) in E0(Aq) where R′=R+(0,…,0,ps), with ps in position t. We have to consider Milnor matrices
[TABLE]
where ∑ipici=ps.
We argue as in the proof of Proposition 3.2. By considering row t, all such matrices except the initial matrix c0=ps, ci=0 for i>0 and the final matrix cs=1, ci=0 for i=s give elements of higher May filtration. By considering column s, the same is true for the final matrix.
∎
7 The Arnon A basis of Ap
Monks [8] has compared a number of bases for A2 with the Milnor basis [6], and has shown that several of them are triangularly related to the Milnor basis for a suitable bijection between the two bases and for suitable orderings on them. His results have been generalized to Ap by Emelyanov and Popelensky [3].
For example, the admissible basis of Ap is triangularly related to the Milnor basis as follows. Recall that admissible monomials in Ap are elements PA=Pa1Pa2⋯Paℓ, where ai≥pai+1 for 1≤i<ℓ, and that they form a Fp-basis for Ap. A triangular relation between this basis and the Milnor basis is obtained by associating to A the sequence R=(r1,r2,…,rℓ), where ri=ai−pai+1, and using the right lexicographic order on the sequences A and R. The table below shows the result in degree 9 when p=2.
[TABLE]
When comparing two bases in this way, we need only specify the bijection and the ordering on one of them, as the ordering on the other is defined by the bijection. Alternatively, we could use orderings on both bases to define the bijection.
The Arnon A basis of Ap [1, 2] is defined as follows. We begin with the admissible monomials Xkn=PpnPpn−1⋯Ppk, n≥k≥0, one in each p-atomic degree pk(pn−k+1−1)/(p−1). A general Arnon A basis element is a product of these elements taken in Z-order, with each factor Xkn repeated no more than p−1 times. Thus the Arnon A basis is constructed in the same way as the Z-Pts basis, but using the elements Xkn instead of the elements Pts. The basis elements have the form Xk1n1⋅Xk2n2⋯Xkℓnℓ, where (ni,ki)<l(ni+p−1,ki+p−1) for all i. In particular, the factors are distinct when p=2.
In the case p=2, the bijection defined by Monks [8] between the Arnon A basis and the Milnor basis can be described as follows. Given a Milnor basis element Sq(R)=Sq(r1,r2,…), the corresponding Arnon A basis element has one factor Xkn corresponding to each element in the binary decompositions of the terms of the sequence R. For each i and j such that 2i∈bin(rj) we take Xkn, where k=i and n=i+j−1, and multiply these elements in Z-order to form the required Arnon A basis element. Conversely, given an Arnon A basis element Xk1n1⋅Xk2n2⋯Xkℓnℓ, let rj be the sum of the 2-powers 2i where j=nt−kt+1 is the length of one of the elements Xktnt and i=kt, and form the Milnor basis element Sq(R)=Sq(r1,r2,…). For a general prime p, bin(r) is replaced by the multiset pin(r) (Definition 2.10). For example if p=3 then the Milnor basis element P(7,2) corresponds to the Arnon A basis element P1⋅P3P1⋅P3P1⋅P3⋅P3, since 7=1+3+3 and 2=1+1 give the weakly Z-increasing sequence (1,4,4,3,3).
Monks (for p=2) and Emelyanov-Popelensky (for p>2) show that the Arnon A basis and the Milnor basis are triangularly related using this bijection between the two bases and the following ordering on the Arnon A basis. Each Arnon A basis element is defined by a non-decreasing sequence of p-atomic numbers. These sequences are placed in decreasing left lexicographic order <Z, taken with respect to the Z-order and not the usual increasing order on p-atomic numbers. For example, for p=2 and degree d=9, the change of basis matrix is as follows.
[TABLE]
Here the 2-atomic sequences giving the Arnon A elements are ordered as follows:
[TABLE]
Our main result, Theorem 8.1, states that the Arnon A basis and the Milnor basis are also triangularly related using the same bijection, but with a different choice of orderings. The ordering on the Arnon A basis is the reversed right lexicographic order <r, where these elements are treated simply as monomials in the generators Ppj, j≥0 of Ap. This ordering ignores the factorization of Arnon A basis elements as products of p-atomic basis elements. For example, for p=2 and d=9 the change of basis matrix is as follows.
[TABLE]
Remark 7.1**.**
The ordering ≤R which appears in [1, 2] is not the same as ≤r: it is obtained by first right-justifying the exponent sequences and then taking lexicographic order from the right. For example, (1,1,2)>R(3,1)=(0,3,1), since 2>1. However, (3,1)=(3,1,0)>r(1,1,2) since 0<2.
**
In order to establish the A basis of A2, Arnon [1] considers the set of all formal monomials in the elements Sq2j, j≥0, by which we mean elements of the free algebra A generated by these symbols. Thus A2 is the quotient algebra of A by the two-sided ideal generated by the Adem relations and Sq0=1. As for A2, A is graded by giving Sq2j degree 2j. When the formal monomials of a given degree are taken in increasing left order ≤l, Arnon shows that the minimal monomials form the A basis [1, Theorem 5(A)].
If the left lexicographic order ≤l is replaced by ≤r, then the minimal monomials do not in general give the A basis. For p=2, the first counterexample is in degree 9, where the ≤r-minimal basis is obtained from the A basis by replacing Sq2⋅Sq4Sq2Sq1 with Sq4Sq2Sq1Sq2, which is lower in the (reversed) right order ≤r. The relation
[TABLE]
shows that Sq2⋅Sq4Sq2Sq1 is reducible in the right order.
We define a variant of the A basis by replacing the Z-order on 2-atomic degrees by the Y-order, and we refer to the original Arnon A basis as the Z-Arnon A basis, the new basis as the Y-Arnon A basis. The Y-Arnon A basis elements have the form Xk1n1⋅Xk2n2⋯Xkℓnℓ, where (n1,k1)<r(n2,k2)<r⋯<r(nℓ,kℓ). Thus the elementary Arnon A monomials Xkn are multiplied in Y-order of their degrees. The Y- and Z-Arnon A bases first differ in degree (p+1)2, by replacing Pp⋅Pp2PpP1 by Pp2PpP1⋅Pp. For p=2 this is illustrated by (5).
8 The Arnon A basis of Aq
In this section we generalize the Y- and Z-Arnon A bases to Aq and prove our main result, Theorem 8.1. For q=pe, the elementary Arnon A monomial Xkn=PpnPpn−e⋯Ppk is defined when n≥k≥0 and n=k mod e, and its degree is the q-atomic number pk(qt+1−1)/(q−1), where n=k+te. A general Y- or Z-Arnon A basis element is a product of these elements taken in Y- or Z-order, with each factor Xkn repeated no more than p−1 times. In other words, the Y- or Z-Arnon A basis is constructed in the same way as the corresponding Pts basis, with the elements Pts replaced by the elements Xkn. Thus the basis elements have the form Xk1n1⋅Xk2n2⋯Xkℓnℓ,(n1,k1)≤l(n2,k2)≤l⋯≤l(nℓ,kℓ), where (ni,ki)<l(ni+p−1,ki+p−1) for all i.
Theorem 8.1**.**
(i)* The Y-Arnon A monomials in Aq are the minimal Steenrod monomials in increasing ≤r order.*
(ii)* The Y-Arnon A monomials form a basis of Aq.*
(iii)* The Y- and Z-Arnon A bases of Aq are triangular with respect to the Milnor basis, using the ≤r order on the Arnon A basis and the bijection with the Milnor basis given by the q-atomic sequences.*
Statement (ii) follows at once from (i). It follows from (iii) that the Z-Arnon A basis is a basis for Aq, and that it is triangular with respect to the Y-Arnon A basis when both are in the ≤r order.
The proof of Theorem 8.1 will occupy the rest of this section. We begin by expressing the particular elements X0n of the Arnon A basis, regarded as elements of the graded algebra E0(Aq), in the Z-Pts basis. A typical Z-Pts basis element has the form P[a1]P[a2]⋯P[ar], where (a1,a2,…,ar) is a sequence of q-atomic numbers in increasing Z-order, and has May filtration ∑i=1rα(ai).
Proposition 8.2**.**
Let q=pe where p is prime, and let n=te+k, where 0≤k<e. Then in E0(Aq)
[TABLE]
When k=0, t=1 this states that PqP1=P1P[q]+P[q+1], and when k=0, t=2 that Pq2PqP1=PqP1P[q2]+P1P[q2+q]+P[q2+q+1]. Recall that P[q]=Pq, P[q2]=Pq2, P[q+1]=P(0,1), P[q2+q]=P(0,q) and P[q2+q+1]=P(0,0,1).
Proof.
We first establish the case k=0, namely
[TABLE]
by induction on t. Thus let t≥2, and assume that the above formula holds for t−1 in place of t. Since X0te=PqtX0(t−1)e, the induction hypothesis gives X0te=Pqt∑r=0t−1X0(r−1)eP[(qt−qr)/(q−1)]. Since Pqt and Pqr commute in E0(Aq) for 0≤r≤t−2, this gives X0n=∑r=0t−1X0(r−1)ePqtP[(qt−qr)/(q−1)]. Using the relation [Pqt,P[(qt−qr)/(q−1)]]=P[(qt+1−qr)/(q−1)], it follows that
[TABLE]
Applying the induction hypothesis again, this gives
[TABLE]
This completes the induction, and the proof for k=0. The general case follows, as the relations in E0(Aq) are unchanged when all exponents are multiplied by p.
∎
As in [1], to prove parts (i) and (ii) of Theorem 8.1 it suffices to show that any monomial in Aq which is not of the required form is reducible in the ≤r order, and that the number of monomials of the required form in each degree d is the dimension of Aqd. The second statement is clear since, as for the Pts bases, there is one elementary Arnon A monomial in each q-atomic degree, and these are used to form monomials with exponents <p. For the first statement, we observe that a formal monomial PA=Ppj1⋯Ppjr is not a Y-Arnon A basis element if and only if at least one of the following cases occurs:
(1) for some k, jk>jk+1 and jk−jk+1=e;
(2) the sequence P[pm]Xkn with k<m′e, m≤n and m=m′e+m′′, 0≤m′′<e, appears in PA;
(3) the sequence XknP[pk] with k<n appears in PA;
(4) the sequence Xkn⋯Xkn (p factors) appears in PA.
To prove these statements, it is sufficient to work in E0(Aq). Case (1) is resolved immediately, since P[ps] and P[pt] commute in E0(Aq) if t=s+e.
We deal next with Case (2). For p=2, the minimal case Sq2⋅Sq4Sq2Sq1 is lowered in the ≤r order by relation (5) above. We use Proposition 8.2 to obtain a similar reduction in general.
Proposition 8.3**.**
In E0(Aq), PpmXkn can be reduced in the ≤r order for k<m′e, m≤n and m=m′e+m′′, 0≤m′′<e.
Proof.
We can immediately reduce to k=m−1, since for k<m−1 we have PpmXkn=PpmXm−1n⋅Xkm−2, and a reduction of PpmXm−1n in the right order gives a reduction of PpmXm−1n⋅Xkm−2 in the right order.
Similarly, we can reduce to n=m or n=m+e using Case (1). For example, suppose that we wish to reduce Pp⋅Pp3Pp2PpP1 in the ≤r order. Since PpPp3=Pp3Pp in E0(Ap), it is sufficient to lower Pp⋅Pp2PpP1 in the ≤r order.
Thus let n=m, k=m−e. We have Ppm⋅PpmPpm−e=Ppm(Ppm−ePpm+P[pm+pm−e]) in E0(Aq). The first term is <rPpm⋅PpmPpm−e. The second term reduces to P[pm+pm−e]Ppm in E0(Aq). On expanding P[pm+pm−e] as PpmPpm−e−Ppm−ePpm, we obtain two terms, and both are <rPpm⋅PpmPpm−e.
Finally let n=m+e, k=m−e. By Proposition 8.2, we have PpmXm−em+e=Ppm(PpmPpm−eP[pm+e]+Ppm−eP[pm+e+pm]+P[pm+e+pm+pm−e]). The first term can be lowered in the ≤r order by the previous case, and the second by expanding P[pm+e+pm] as Ppm+ePpm−PpmPpm+e. The third term PpmP[pm+e+pm+pm−e]=P[pm+e+pm+pm−e]Ppm in E0(Aq). The expansion P[pm+e+pm+pm−e]=[Ppm+e,[Ppm,Ppm−e]] gives four terms, which are all <rPpmXm−em+e=Ppm⋅Ppm+ePpmPpm−e.
∎
We next treat case (3) by the same method.
Proposition 8.4**.**
In E0(Aq), XknPpk can be reduced in the ≤r order for k<n, n=k+te.
Proof.
We can immediately reduce to the case n=k+e, since for n>k+e we have XknPpk=Xk+2enXkk+ePpk, and a reduction of Xkk+ePpk in the right order gives a reduction of Xk+2enXkk+ePpk in the right order.
For n=k+e, we have Xkk+ePpk=Ppk+ePpkPpk=(PpkPpk+e+P[pk+e+pk])Ppk in E0(Aq). The first term is <rPpk+ePpkPpk, and the second term P[pk+e+pk]Ppk=PpkP[pk+e+pk]=Ppk[Ppk+e,Ppk] in E0(Aq), and both terms are <rPpk+ePpkPpk.
∎
The following example illustrates the proof of case (4), using the same method.
Example 8.5**.**
Let p=3 and consider X12X12X12=P3P1P3P1P3P1. We reduce this in the right order in E0(A3) as follows. Recalling that P[4]=P(0,1), we have P3P1P3P1P3P1=P3P1P3P1(P1P3+P[4]). The first term is <rP3P1P3P1P3P1, and the second is equal to P[4]P3P1P3P1=P[4]P3P1(P1P3+P[4]). Since P[4]=[P3,P1], the first term is again <rP3P1P3P1P3P1. The second term P[4]P3P1P[4]=P[4]P[4]P3P1=P[4]P[4](P1P3+P[4]). The first term is again <rP3P1P3P1P3P1, and the second P[4]P[4]P[4]=0 in E0(A3).
**
Proposition 8.6**.**
In E0(Aq), Xkn⋯Xkn (p factors) can be reduced in the ≤r order for k≤n, n=k+te.
Proof.
We first expand the last factor Xkn as ∑r=ktXk(r−1)e+kP[pk(qt+1−qr)/(q−1)] using Proposition 8.2. This gives n−k+1 terms, of which all but the last term Xkn⋯XknP[pn+pn−e+⋯+pk] (with p−1 factors Xkn) are shown to be <rXkn⋯Xkn (with p factors) by expanding P[(pn+e−pr)/(p−1)] as an iterated commutator. The last term is equal to P[pn+pn−e+⋯+pk]Xkn⋯Xkn since P[pn+pn−e+⋯+pk] commutes with Xkn in E0(Aq). We repeat this process by expanding the last factor Xkn using Proposition 8.2, and observe that all terms but the last are <rXkn⋯Xkn (p factors), while the last term is equal to P[pn+pn−e+⋯+pk]P[pn+pn−e+⋯+pk]Xkn⋯Xkn (p−2 factors Xkn). Iterating this process a further p−2 times, we are left with the term P[pn+pn−e+⋯+pk]⋯P[pn+pn−e+⋯+pk] (p factors), which is [math] in E0(Aq).
∎
This completes the proof of parts (i) and (ii) of Theorem 8.1. We turn to part (iii).
Proposition 8.7**.**
The Y- and Z-Arnon A bases of Aq are triangular with respect to the Milnor basis, when the Arnon bases are taken in ≤r order.
Proof.
By Proposition 6.5, it suffices to show that the Y- and Z-Arnon A bases are triangular with respect to the corresponding Pts bases. Again it suffices to work in E0(Aq). We consider the expression of Pts basis elements in the Arnon A basis.
We begin by showing that Pts=Xss+(t−1)e+ ≤r-lower terms in the Arnon A basis. The general case follows by taking products. For example, Sq(0,1)=Sq2Sq1+Sq1⋅Sq2 and Sq(0,2)=Sq4Sq2+Sq2⋅Sq4 in the Arnon A basis. Hence Sq(0,1)Sq(0,2)=Sq2Sq1⋅Sq4Sq2+Sq2Sq1⋅Sq2⋅Sq4+Sq1⋅Sq2⋅Sq4Sq2+Sq1⋅Sq2⋅Sq2⋅Sq4. The first term on the right is the Arnon A basis element corresponding to the Pts basis element Sq(0,1)Sq(0,2), and the other terms are ≤r-lower.
As an example, when p=2 we have P2s=Sq[3⋅2s]=[Sq[2s+1],Sq[2s]]=Sq2s+1Sq2s+Sq2s⋅Sq2s+1 in the Arnon A basis for E0(A2). In A2 itself, there are terms of higher May filtration, for example when s=2, Sq(0,4)=Sq8Sq4+Sq4⋅Sq8+Sq(3,3), and M(Sq(3,3))=6. In the general case, we can express Pts as the iterated commutator
[TABLE]
of length t in the generators Ppj. The ≤r-maximal term in the expansion of the iterated commutator is the Arnon A element Xss+t−1.
∎