Searching for fractal structures in the Universal Steenrod Algebra at odd primes
Maurizio Brunetti, Adriana Ciampella

TL;DR
This paper investigates the structure of the universal Steenrod Algebra at odd primes, revealing nested subalgebras that resemble initial elements, despite the absence of a fractal structure seen at p=2.
Contribution
It identifies and characterizes two distinct families of nested subalgebras within Q(p) at odd primes, highlighting structural differences from the p=2 case.
Findings
No fractal structure preserving monomial length at odd primes
Existence of two families of nested subalgebras in Q(p)
Subalgebras are isomorphic to initial elements of the sequence
Abstract
Unlike the p = 2 case, the universal Steenrod Algebra Q(p) at odd primes does not have a fractal structure that preserves the length of monomials. Nevertheless, when p is odd we detect inside Q(p) two different families of nested subalgebras each isomorphic (as length-graded algebras) to the respective starting element of the sequence
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFractal and DNA sequence analysis · Advanced Mathematical Theories and Applications · Advanced Combinatorial Mathematics
Searching for Fractal Structures in the Universal Steenrod Algebra at Odd Primes
Maurizio Brunetti
and
Adriana Ciampella
Dipartimento di Matematica e applicazioni,
Università di Napoli “Federico II”,
Piazzale Tecchio 80 I-80125 Napoli, Italy.
E-mail: [email protected], [email protected]
Abstract.
Unlike the case, the universal Steenrod Algebra at odd primes does not have a fractal structure that preserves the length of monomials. Nevertheless, when is odd we detect inside two different families of nested subalgebras each isomorphic (as length-graded algebras) to the respective starting element of the sequence.
Key words and phrases:
Universal Steenrod Algebra, Cohomology operations
2010 Mathematics Subject Classification:
13A50, 55S10
1. Introduction
Let be any prime. The so-called universal Steenrod algebra is an -algebra extensively studied by the authors (see, for instance, [2]-[12]). On its first appearance, it has been described as the algebra of cohomology operations in the category of -ring spectra (see [16]). Invariant-theoretic descriptions of can be found in [11] and [15]. When is an odd prime, the augmentation ideal of is the free -algebra over the set
[TABLE]
subject to the set of relations
[TABLE]
where
[TABLE]
and
[TABLE]
Such relations are known as generalized Adem relations.
The algebra is related to many Steenrod-like operations. For instance to those acting on the cohomology of a graded cocommutative Hopf algebra ([6], [14]), or the Dyer-Lashof operations on the homology of infinite loop spaces ([1] and [17]). Details of such connections, at least for , can be found in [5]. In particular, the ordinary Steenrod algebra is a quotient of . At odd primes, the algebra epimorphism is determined by
[TABLE]
The kernel of the map turns out to be the principal ideal generated by .
All monic monomials in , with the exception of have the form
[TABLE]
where the string is the label of the monomial . By length of a monomial of type (1.6) we just mean the integer , while the length of any is defined to be [math]. Since Relations (1.3) and (1.4) are homogeneous with respect to length, the algebra can be regarded as a graded object.
A monomial and its label are said to be admissible if for any . We also consider admissible. The set of all monic admissible monomials forms an -linear basis for (see [11]).
Through two different approaches, in [8] and [10] it has been shown that has a fractal structure given by a sequence of nested subalgras , each isomorphic to . The interest in searching for fractal structures inside algebras of (co-)homology operations initially arouse in [18], where such structures were used as a tool to establish the nilpotence height of some elements in . Results in the same vein are in [13].
Recently, in [7] the authors proved that no length-preserving strict monomorphisms turn out to exist in when is odd. Hence no descending chain of isomorphic subalgebras starting with exists for . Results in [7] did not exclude the existence of fractal structures for proper subalgebras of . As a matter of fact, the subalgebras and generated by the ’s and the ’s respectively (together with ) turn out to have self-similar shapes, as stated in our Theorem 1.1, our main result.
Theorem 1.1**.**
Let be any odd prime. For any there is a chain of nested subalgebras of
[TABLE]
each isomomorphic to as length-graded algebras.
Theorem 1.1 relies on the existence of two suitable algebra monomorphisms
[TABLE]
Indeed, we just set and , the restrictions and being the desired isomorphism between and .
For sake of completeness we point out that the algebra can also be filtered by the internal degree of its elements, defined on monomials as follows:
[TABLE]
In spite of its geometric importance, the internal degree will not play any role here.
2. A first descending chain of subalgebras
We first need to establish some congruential identities. Let denote the set of all non-negative integers. Fixed any prime , we write
[TABLE]
to denote the -adic expansion of a fixed . The following well-known Lemma is a stardard device to compute binomial coefficients.
Lemma 2.1** (Lucas’ Theorem).**
For any , the following congruential identity holds.
[TABLE]
Proof.
See [13, p. 260] or [19, I 2.6]. Equation 2.2 follows the usual conventions: , and if . ∎
Congruence (2.2) immediately yields
[TABLE]
since, in both cases, we find on the right side of (2.2) the same products of binomial coefficients, apart from extra factors all equal to .
Corollary 2.2**.**
For any , the following congruential identity holds.
[TABLE]
Proof.
Since , we have . Note also that . According to Lemma 2.1, we get
[TABLE]
We now use Congruence 2.3 for , and the fact that for all . ∎
In order to make notation less cumbersome, we set
[TABLE]
Corollary 2.3**.**
Let a couple of positive integers. Whenever , the binomial coefficient is divisible by .
Proof.
If a fixed positive integer is not divisible by , then there exists a unique couple such that . Hence, setting
[TABLE]
we get
[TABLE]
by Lemma 2.1 and Equation (2.3). Since , the first factor on the right side of Equation (2.7) is zero, so the result follows. ∎
Lemma 2.4**.**
Let a triple of positive integers. Whenever , the binomial coefficient is divisible by .
Proof.
We proceed by induction on . The case is essentially Corollary 2.3.
Suppose now . The hypothesis on is equivalent to the existence of a suitable such that . Likewise, we can write , for a certain .
We now distinguish two cases. If , the binomial coefficient has the form where
[TABLE]
By Corollary 2.2, we get
[TABLE]
and the latter is divisible by by the inductive hypothesis.
Assume now . In this case,
[TABLE]
where . Therefore, by Lemma 2.1 we get
[TABLE]
The right side of Equation 2.9 vanishes, since , and the proof is over. ∎
Lemmas and Corollaries proved so far will be helpful to reduce, in some particular cases, the number of potentially non-zero binomial coefficients in (1.3) and in (1.4). For instance, for any , relations of type , where
[TABLE]
only involve generators in the set
[TABLE]
as stated in the following Proposition.
Proposition 2.5**.**
Let a fixed -tuple in . The polynomial in (1.3) is actually equal to
[TABLE]
Proof.
By definition (see (1.3)), is equal to
[TABLE]
According to Lemma 2.4, the only possible non-zero coefficients in the sum above occur when . Thus, we set and write as
[TABLE]
In such polynomial we can replace and by
[TABLE]
respectively, since . Finally, applying Equation (2.4) as many times as necessary, and recalling that we are supposing odd, we get
[TABLE]
∎
As a consequence of Proposition 2.5, the admissible expression of any non-admissible monomial with label involves only generators in .
That’s the reason why, for any non-negative integer , there is a well-defined -algebra generated by the set and subject to relations
[TABLE]
Thus and are the subalgebras of generated by the sets
[TABLE]
respectively. The former has been simply denoted by in Section 1. The arithmetic identity
[TABLE]
implies that .
Lemma 2.6**.**
A monomial of type
[TABLE]
is admissible if and only if for any .
Proof.
Admissibility for a monomial of type (2.13) is tantamount to the condition
[TABLE]
Inequalities above are equivalent to
[TABLE]
and the ceiling of the real number on the right side is precisely . ∎
Proposition 2.7**.**
An -linear basis for is given by the set of its monic admissible monomials.
Proof.
In [11] it is explained the procedure to express any monomial in as a sum of admissible monomials. As Proposition 2.5 shows, the generalized Adem relations required to complete such procedure starting from a monomial in only involve generators actually available in the set at hands. ∎
So far, we have established the existence of the following descending chain of algebra inclusions:
[TABLE]
On the free -algebra we now define a monomorphism acting on the generators as follows
[TABLE]
We set and for .
Proposition 2.8**.**
For each ,
[TABLE]
and
[TABLE]
Proof.
Equations (2.15) and (2.16) are trivially true for . For use an inductive argument taking into account (2.12) and Proposition 2.5. ∎
Proposition 2.9**.**
Let be the quotient map.There exists an algebra monomorphism such that the diagram
[TABLE]
commutes.
Proof.
By Equation (2.16), it follows in particular that
[TABLE]
Therefore there exists a well-defined algebra map
[TABLE]
Such map is injective since the set – an -linear basis for according to Proposition 2.7 – is mapped onto admissibles by Lemma 2.6. ∎
Corollary 2.10**.**
The algebra is isomorphic to its subalgebra .
Proof.
By Propositions 2.8 and 2.9, we can argue that . Hence the map
[TABLE]
gives the desired isomorphism. ∎
Corollary 2.10 proves Theorem 1.1 for .
3. A second descending chain of subalgebras
The aim of this Section is to provide a proof for the case of Theorem 1.1. We choose to follow as close as possible the line of attack put forward in Section 2.
Proposition 3.1**.**
Let a fixed triple in . In (1.4) the polynomial is actually equal to
[TABLE]
Proof.
By definition (see 1.4),
[TABLE]
According to Lemma 2.4, the only possible non-zero coefficients in the sum above are those with mod . Setting , the polynomial (3.1) becomes
[TABLE]
The result now follows from Equation (2.11). ∎
Proposition 3.1 implies that relations of type only involve generators of type . therefore the admissible expression of any non-admissible monomial with label only involves generators in the set
[TABLE]
So it makes sense to define as the -algebra generated by the set and subject to relations
[TABLE]
Each is actually a subalgebra of . We have inclusions . In Section 1, the algebra has been simply denoted by .
Lemma 3.2**.**
A monomial of type
[TABLE]
in is admissible if and only if
Proof.
By definition, the monomial (3.3) is admissible if and only if
[TABLE]
Inequalities above are equivalent to
[TABLE]
and the ceiling of the real number on the right side is precisely . ∎
Proposition 3.3**.**
An -linear basis for is given by the set of its monic admissible monomials.
Proof.
Follows verbatim the proof of Proposition 2.7, just replacing “Proposition 2.5” by “Proposition 3.1” and by . ∎
We are now going to prove that the subalgebras in the descending chain
[TABLE]
are all isomorphic. To this aim we consider the injective endomorphism on the free -algebra by setting
[TABLE]
Proposition 3.4**.**
Let be the quotient map.There exists an algebra monomorphism such that the diagram
[TABLE]
commutes.
Proof.
Since , by Proposition 3.1 we argue that
[TABLE]
Therefore there exists a well-defined algebra map
[TABLE]
Such map is injective since the set – an -linear basis for according to Proposition 3.3 – is mapped onto admissibles by Lemma 3.2. ∎
Corollary 3.5**.**
The algebra is isomorphic to its subalgebra .
Proof.
By Equation (3.6) and Proposition 3.4, we can argue that . Thus, the desired isomorphism is given by
[TABLE]
∎
4. Further substructures
For each , we define to be the -vector subspace of generated by the set of monomials
[TABLE]
Equation 2.12 implies that . None of the ’s is a subalgebra of , nevertheless, by Proposition 2.5 and the nature of relations (1.3) it follows that can be endowed with a right -module structure just by considering multiplication in . By using once again Lemma 2.6 and the argument along the proof of Proposition 2.7, we get
Proposition 4.1**.**
An -linear basis for is given by the set of its monic admissible monomials.
Proposition 4.2**.**
The map between sets
[TABLE]
can be extended to a well-defined injective -linear map Moreover
[TABLE]
Proof.
As in the proof of Proposition 2.8, Equation 2.12 and Proposition 2.5 show that the polynomial in mapped onto through the -th power of the -linear map
[TABLE]
Hence there are two maps and suct that the diagram
[TABLE]
commutes, where is the quotient map. Finally, taking into account Equation 2.12, one checks that
[TABLE]
Since Equation (4.4) implies (4.1), the proof is over. ∎
We now introduce a category whose objects are couples , with being any ring, and any right -module. A morphism between two objects and is given by a couple where is group homomorphism and is a ring homomorphism, furthermore
[TABLE]
The category is partially ordered by “inclusions”. More precisely we say that
[TABLE]
if is a subgroup of and is a subring of .
Theorem 4.3**.**
The objects in of the descending chain
[TABLE]
are all isomorphic.
Proof.
By Proposition 4.2 it follows that is an isomorphism between -vector spaces. Thus, recalling Corollary 2.10, the desired isomorphism in is given by
[TABLE]
∎
5. A final remark
Theorem 1.1 in [7] says that no strict algebra monomorphism in exists when is odd. Hence there is no chance to find algebra endomorhisms over extending the maps and defined in Sections 2 and 3 respectively. Just to give an idea about the obstructions you come up with, consider the -linear map
[TABLE]
defined on monomials as follows
[TABLE]
Neither the map nor the map introduced in Section 4 stabilizes the entire set (1.2). Indeed, take for instance
[TABLE]
The polynomial
[TABLE]
does not belong to the set . In fact, the only polynomial in containing (5.1) as a summand is
[TABLE]
Similarly, the polynomial
[TABLE]
does not belong to the set , since it consists of a single admissible monomial, whereas each element in always contains a non-admissible monomial among its summands.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] S. Araki, T. Kudo, Topology of H n subscript 𝐻 𝑛 H_{n} -spaces and H 𝐻 H -squaring operations , Mem. Fac. Sci. Kyusyu Univ. Ser. A 10 (1956), 85–120.
- 2[2] M. Brunetti, A. Ciampella, L. A. Lomonaco, The Cohomology of the Universal Steenrod algebra , Manuscripta Math., 118 (2005), 271–282.
- 3[3] M. Brunetti, A. Ciampella, L. A. Lomonaco, An Embedding for the E 2 subscript 𝐸 2 E_{2} -term of the Adams Spectral Sequence at Odd Primes , Acta Mathematica Sinica, English Series 22 (2006), no. 6, 1657–1666.
- 4[4] M. Brunetti, A. Ciampella, A Priddy-type koszulness criterion for non-locally finite algebras , Colloquium Mathematicum 109 (2007), no. 2, 179–192.
- 5[5] M. Brunetti, A. Ciampella, L. A. Lomonaco, Homology and cohomology operations in terms of differential operators , Bull. London Math. Soc. 42 (2010), no. 1, 53–63.
- 6[6] M. Brunetti, A. Ciampella, L. A. Lomonaco, An Example in the Singer Category of Algebras with Coproducts at Odd Primes , Vietnam J. Math. 44 (2016), no. 3, 463–476.
- 7[7] M. Brunetti, A. Ciampella, L. A. Lomonaco, Length-preserving monomorphisms for some algebras of operations , Bol. Soc. Mat. Mex. 23 (2017), no. 1, 487–500.
- 8[8] M. Brunetti, A. Ciampella, The Fractal Structure of the Universal Steenrod Algebra: an invariant-theoretic description , Applied Mathematical Sciences, Vol. 8 no. 133 (2014), 6681–6687 .
