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.
Low-degree admissible Steenrod monomials
Example
Assume AC. The admissible bases in degrees 0–4 are respectively {1}, {Sq¹}, {Sq²}, {Sq³,Sq²Sq¹}, and {Sq⁴,Sq³Sq¹}. The Adem relations give Sq¹Sq¹=0, Sq¹Sq²=Sq³, and Sq²Sq²=Sq³Sq¹.
Facts & Assumptions
Given: AC; the admissible words of the mod-two square algebra in total degrees through ; and the three displayed composite pairs , , .
The Adem-reduction lemma spans each homogeneous degree by admissible words, and the admissible composites form a basis of the square algebra in each degree (Adem reduction spans by admissible square composites, Admissible composites present the mod-two square algebra).
The Adem relations hold in the square algebra for , and the square algebra and its excess calculus are the local definition.
Verification
List the positive sequences of each total degree and retain those satisfying i_j≥2i_{j+1}; this gives exactly the displayed rows. The Adem-reduction item shows every other word reduces to an admissible combination.
The basis theorem proves the listed words are independent, so the table is a basis calculation rather than a dimension guess. Substitution in the displayed Adem relation gives the three sample reductions.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- Allen Hatcher, Algebraic Topology (standard reference, not scraped)