Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 AAdem→ASq is an isomorphism. In each degree N, its admissible composites SqI with ∣I∣=N form an F2-basis. Thus the Adem relations impose all algebraic relations among composites of the published Steenrod squares.

Facts & Assumptions

Given: AC; a total degree N≥0; the quotient map AAdem→ASq; the admissible composites SqI of degree N; and the evaluation test of the leading-monomial lemma on P in (RPN+1)N+1.

[F1]

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).

[F2]

Distinct admissible composites of a fixed degree have distinct leading monomials on P 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).

[F3]

AC is used only for the algebraic choices in the square-algebra presentation (The Axiom of Choice).

Proof

technique · direct
1.1givenF1F2F3

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-N admissible composites were zero as a natural operation. Choose r=N+1 and L=N+1. Every admissible sequence of degree N has e(I)≤N<r, so the leading-monomial lemma applies to the same class P 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 P 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.

2.1step 1.1∎

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

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