Steenrod Squares over an Infinite Projective Space

Click For Summary
SUMMARY

The discussion focuses on proving the relations for Steenrod squares over infinite projective space, specifically showing that for a generator ##u## of ##H^1(\mathbb{R} P^\infty; \mathbb{F}_2)##, the formula $$\text{Sq}^i(u^n) =\binom{n}{i} u^{n+i}$$ holds true. This relation is essential for understanding the action of Steenrod squares in cohomology theories. The proof utilizes combinatorial arguments involving binomial coefficients and properties of cohomology classes.

PREREQUISITES
  • Understanding of cohomology theories, particularly in the context of algebraic topology.
  • Familiarity with Steenrod squares and their properties.
  • Knowledge of binomial coefficients and their combinatorial significance.
  • Basic concepts of infinite projective spaces, specifically ##\mathbb{R} P^\infty##.
NEXT STEPS
  • Study the properties of Steenrod squares in detail, focusing on their applications in algebraic topology.
  • Explore the cohomology of infinite projective spaces, particularly ##\mathbb{R} P^\infty##.
  • Investigate combinatorial proofs involving binomial coefficients in algebraic topology.
  • Learn about the implications of Steenrod operations in stable homotopy theory.
USEFUL FOR

Mathematicians, algebraic topologists, and graduate students focusing on cohomology theories and Steenrod operations in algebraic topology.

Euge
Gold Member
MHB
POTW Director
Messages
2,072
Reaction score
245
Let ##u## be a generator of ##H^1(\mathbb{R} P^\infty; \mathbb{F}_2)##. Prove the relations $$\text{Sq}^i(u^n) =\binom{n}{i} u^{n+i}$$
 
  • Like
Likes   Reactions: VETTE888
Physics news on Phys.org
We can induct on ##n.## The base case is clear. Next, assuming the formula to be true for exponent ##n## (and for all ##i##), we have:

$$\text{Sq}^i(u^{n+1})=\text{Sq}^i(u^n\cup u)=\sum_{a+b=i} Sq^a(u^n) \cup Sq^b(u).$$

Since ##Sq^b(u)## vanishes when ##b>1##, the only terms in the sum are ##\text{Sq}^i(u^n)\cup \text{Sq}^0(u)+\text{Sq}^{i-1}(u^n) \text{Sq}^1(u)=\binom{n}{i}u^{n+i+1}+\binom{n}{i-1}u^{n+i+1}.## So we just need to verify that ##\binom{n}{i}+\binom{n}{i-1}=\binom{n+1}{i}## (in fact we only need to check that it is true mod 2, but it is true over the integers). The number of ways of picking ##i## items from ##n+1## items is the number of ways of picking ##i## items where the first item is included (## \binom{n}{i-1} ## ways) plus the number of ways of picking ##i## items from ##n+1## where the first item is not picked (## \binom{n}{i}## ways).
 
Last edited:

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K