Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

The admissible square algebra is a connected bialgebra

Statement

Assume AC. The mod-two algebra A generated by the Steenrod squares is a connected nonnegatively graded bialgebra. Its coproduct is the algebra homomorphism Δ(Sqⁿ)=Σ_{i+j=n}Sqⁱ⊗Sqʲ, with counit ε(Sq⁰)=1 and ε(Sqⁿ)=0 for n>0.

Facts & Assumptions

Given: AC; the free associative graded algebra T on the symbols sn, n>0, with s0=1; its quotient AAdem=A by the two-sided Adem ideal I; and the tensor-product algebra structures with the Koszul sign rule (all signs trivial over F2).

[F1]

The square algebra is the quotient of the free algebra by the homogeneous two-sided Adem ideal, and the quotient-to-operation map is well defined (The mod-two square algebra, admissible sequences, and excess, Adem relations for Steenrod squares); external evaluation is faithful on the tensor product of square operations (External evaluation detects tensor-square operations).

[F3]

The admissible-basis theorem gives A0=F2⋅1 and Ai=0 for i<0, and AC supplies the complementary subspace used in the kernel computation (Admissible composites present the mod-two square algebra, Every vector space has a basis, The Axiom of Choice).

Proof

technique · direct
1.1givenF2

Let T be the free associative graded algebra on symbols s_n, n>0, with s₀=1. Define an algebra homomorphism Δ̃:T→T⊗T, Δ̃(s_n)=Σ_{i+j=n}s_i⊗s_j, using the graded tensor-product multiplication; over F₂ all Koszul signs equal 1. Define ε̃(s₀)=1 and ε̃(s_n)=0 for n>0, extending multiplicatively. On generators, Δ̃ is coassociative because both iterates sum once over triples i+j+k=n. The two counit identities also hold on generators. Since all maps in these identities are algebra homomorphisms, the identities hold on T.

2.1step 1.1F1F2

Let R₀ be the set of displayed Adem relation generators, and let I=(R₀) be their two-sided ideal. The admissible-basis identification T/I→A identifies each R∈R₀ with the zero natural operation. For spaces X,Y and classes x∈H*(X), y∈H*(Y), repeated application of the published Cartan formula gives R(x×y)= (q⊗q)(Δ̃R)·(x⊗y), where q:T→A is the quotient map and the tensor action means external product after applying the two factors. The left side is zero because R∈R₀ is an Adem relation. Tensor faithfulness therefore gives (q⊗q)(Δ̃R)=0. To compute the kernel, use AC and basis extension to choose a complement C with T=I⊕C. Distribution of tensor products over this finite direct sum gives T⊗T=(I⊗I)⊕(I⊗C)⊕(C⊗I)⊕(C⊗C).

3.1step 2.1F1F3∎

The map q⊗q kills the first three summands and restricts to the isomorphism C⊗C→(T/I)⊗(T/I) on the last. Hence ker(q⊗q)=I⊗T+T⊗I; write J for this kernel. Since I is a two-sided ideal, J is a two-sided ideal in T⊗T. We have Δ̃(R)∈J for each R∈R₀. Every element of I is a finite sum of terms xRy with x,y∈T and R∈R₀, so multiplicativity gives Δ̃(xRy)=Δ̃(x)Δ̃(R)Δ̃(y)∈J. Therefore Δ̃(I)⊂J, and Δ̃ descends to Δ_A:A→A⊗A. Also ε̃(R)=0 for every R∈R₀ because each generator is homogeneous of positive degree. Since ε̃ is multiplicative, it vanishes on all of I and descends to A. The descended maps remain algebra homomorphisms, coassociative and counital. The basis theorem gives A₀=F₂·1 and A_d=0 for d<0. Thus A is a connected nonnegatively graded bialgebra, with Δ_A(Sqⁿ)=Σᵢ₌₀ⁿ Sqⁱ⊗Sqⁿ⁻ⁱ. No antipode is required by the Hopf-freeness supplier.

Depends on

Used by

Dependency tree · two levels

48 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