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.
Admissible composites present the mod-two square algebra
Statement
Assume AC. The natural map is an isomorphism. In each degree , its admissible composites with form an -basis. Thus the Adem relations impose all algebraic relations among composites of the published Steenrod squares.
Facts & Assumptions
Given: AC; a total degree ; the quotient map ; the admissible composites of degree ; and the evaluation test of the leading-monomial lemma on in .
The definition of the square algebra makes the quotient-to-operation map well defined, and the admissible words of each degree span the quotient by the reduction lemma (The mod-two square algebra, admissible sequences, and excess, Adem reduction spans by admissible square composites).
Distinct admissible composites of a fixed degree have distinct leading monomials on with coefficient one, and squares are natural additive operations acting through the quotient (Admissible square actions have distinct leading monomials); the Adem relations hold in the square algebra (Adem relations for Steenrod squares) and normalization fixes the degree-zero operation (Steenrod normalization, instability, suspension, and top square).
AC is used only for the algebraic choices in the square-algebra presentation (The Axiom of Choice).
Proof
Surjectivity follows from the definition of the image algebra. The reduction lemma spans each homogeneous quotient by admissible words. Suppose a nontrivial linear combination of distinct degree- admissible composites were zero as a natural operation. Choose and . Every admissible sequence of degree has , so the leading-monomial lemma applies to the same class on the same finite CW product for all terms. Pick the largest leading monomial among the composites occurring with coefficient one. No composite with a smaller leading monomial contains it, and its coefficient in its own composite is one. The evaluation of the combination on is therefore nonzero, a contradiction. Degree zero is the nonzero identity operation. Since all relations in the abstract quotient are homogeneous, injectivity in each degree proves injectivity of the graded algebra map.
Boundary of the theorem. It does not yet identify the square algebra with all stable cohomology operations. Such a classification would additionally use the Eilenberg–Mac Lane surjectivity calculation and the published universal-operation corollary. No such classification is imported into the admissible-basis theorem's proof.
Depends on
Used by
- A strict metastable Eilenberg–Mac Lane range Example
- Low-degree admissible Steenrod monomials Example
- External evaluation detects tensor-square operations Lemma
- Metastable cohomology of mod-two Eilenberg–Mac Lane spaces Lemma
- The universal mod-two class detects admissible composites in the strict range Lemma
- The zero section proves injectivity of the Thom unit orbit Lemma
- The admissible square algebra is a connected bialgebra Theorem
Dependency tree · two levels
24 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)
- Tom Weston, An Introduction to Cobordism Theory (standard reference, not scraped)