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.
Sq^1 is the mod-two Bockstein
Statement
For every space , every , and every ,
where is the Bockstein of
This equality, including its residue-lift calculation, requires no AC.
Facts & Assumptions
Given: A space , a nonnegative degree , and .
The displayed cyclic coefficient sequence defines the mod-two Bockstein, and least residue representatives supply its lifts without AC (Bockstein connecting operation).
The choice-free parity recurrence gives when is even (Bockstein parity recurrence for Steenrod squares).
The zero square is the identity in every degree (Steenrod normalization, instability, suspension, and top square).
Proof
Proof technique: specialize the proved Bockstein recurrence at the zero square.
Apply the parity recurrence at .
This is the claimed equality of operations.
Both operations vanish on the empty space and zero class, and the canonical lifts use no choice. [F1, F2, F3, step 1.1] For the empty space or zero class, both sides vanish. On a point and, more generally, in degree zero, [F3] makes zero by instability, so step 1.1 makes the Bockstein zero as well. The index is included explicitly in [F2], and no negative degree or converse assertion occurs. Ordinary unnormalized singular cochains, including degenerate simplices, are inherited from [F1] and [F2]. The only lift used in [F2] is the valuewise zero/one residue lift described in [F1], so the equality is choice-free and assumes no AC. ∎
Depends on
Used by
Dependency tree · two levels
14 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
- N. E. Steenrod and D. B. A. Epstein, Cohomology Operations (standard reference, not scraped)
- Mosher and Tangora, Cohomology Operations and Applications in Homotopy Theory (standard reference, not scraped)