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.
The mod-two square algebra, admissible sequences, and excess
Definition
Assume AC, inherited from the cited bundle, cohomology, or operation suppliers. Let be the vector space with basis the finite words in the symbols for , including the empty word, and with multiplication the bilinear extension of concatenation. Concatenation is associative and the empty word is its unit, so this explicitly constructs the free associative graded algebra, with and . Define as its quotient by the two-sided ideal generated by
A normalized sequence has positive entries; the empty sequence denotes the unit. It is admissible if . Write , put , and define
For the empty sequence set . The square algebra is the image of the free algebra under in natural mod-two cohomology operations, allowing every nonnegative input degree. The published Adem theorem makes the induced map well defined. The admissible-composites theorem proves it is an isomorphism.
Every relation is homogeneous. A quotient by a two-sided ideal is a unital associative graded algebra: products of cosets are independent of representatives since multiplying an ideal element on either side remains in the ideal. Its grading is the direct sum of homogeneous quotient spaces since the generating relations are homogeneous. The displayed finite sums defining degree and excess are unambiguous; admissibility makes each nonnegative. Composition and addition of the published natural linear operations preserve naturality, so the image algebra exists. Each square commutes with suspension by the published normalization/suspension proposition, so the resulting composites are stable wherever their source degrees are defined. No assertion that every stable operation is such a composite is needed for this definition.
Depends on
Used by
- Finite Thom classifying detector map Definition
- Adem reduction spans by admissible square composites Lemma
- Admissible square actions have distinct leading monomials Lemma
- Stable Steenrod squares on universal Thom cohomology Lemma
- The finite Thom classifying detector map exists and is continuous Lemma
- Polynomial mod-two cohomology of Eilenberg–Mac Lane spaces Proposition
- Admissible composites present the mod-two square algebra Theorem
- The admissible square algebra is a connected bialgebra Theorem
Dependency tree · two levels
18 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)