POTW Steenrod Squares over an Infinite Projective Space

Click For Summary
The discussion focuses on proving the relations involving Steenrod squares in the context of infinite projective space. Specifically, it addresses the generator of the first cohomology group, H^1(ℝP^∞; ℱ₂), denoted as u. The key relation to prove is that the Steenrod square operation satisfies the equation Sq^i(u^n) = binom(n, i) u^(n+i). This highlights the combinatorial nature of Steenrod squares and their interaction with cohomology classes. The proof and its implications for algebraic topology are central to the conversation.
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}$$
 
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
Views
2K
Replies
3
Views
2K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
2
Views
2K
Replies
3
Views
3K
Replies
1
Views
2K
Replies
1
Views
2K
Replies
2
Views
2K