How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Steenrod squares on complex projective space mod two
Example
Assume AC, and write with . For all integers ,
with the coefficient reduced modulo two, while for every odd integer . For the named class on , the same formulas hold in ; in particular the even formula vanishes when or .
Facts & Assumptions
Given: Integers and an odd integer , with used for the finite-dimensional assertion.
Under AC, Mod-two cohomology rings of complex projective spaces gives the finite and infinite polynomial rings on the degree-two classes , makes skeletal restrictions preserve them, and makes all odd cohomology groups zero.
Total Steenrod square defines as a finite sum.
Steenrod normalization, instability, suspension, and top square gives , for , and .
Cartan formula for Steenrod squares gives the finite component formula .
Steenrod squares commute with pullback by Steenrod squares are well-defined and natural.
Pullback preserves products and powers by Cup product is natural, unital and associative.
The Axiom of Choice is assumed exactly through [F1].
Verification
The total square of the degree-two generator is . [F1, F2, F3] Normalization gives the degree-two term , and the top square gives the degree-four term . The intermediate class lies in the zero group from [F1], and instability removes every higher component.
The total square is multiplicative on powers of . [F2, F4, step 1.1] Summing the finite Cartan identities and regrouping their finite terms gives
Starting with , finite induction yields .
Homogeneous components give both the even formula and odd vanishing. [F1, step 1.1, step 2.1] The binomial theorem gives
Every term on the right has degree . The degree- component is therefore , and every component of degree for odd is zero. When , the relevant binomial coefficient is zero, agreeing with instability since .
Restriction gives the finite formulas and their truncation. [F1, F5, F6, step 3.1] For , naturality gives
Facts [F1] and [F6] identify all powers under this pullback. Thus step 3.1 restricts to the two claimed formulas, and the relation makes the even right side zero when . If , the input and every displayed right side already vanish.
The boundary and choice conventions are complete. [F1, F2, F3, F5, F6, A1, step 1.1, step 2.1, step 3.1, step 4.1] For , only survives. For the formula is ; for it is the top square ; and is zero. Odd indices include and are zero even before finite truncation. The point case , the first truncated exponent , zero inputs, and nonemptiness are explicit. Degenerate singular simplices are included in the natural operations [F5]. AC is inherited only from [F1], while every sum and induction here is finite. No biconditional or converse is asserted. ∎
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Hatcher, Algebraic Topology (standard reference, not scraped)