Alphabeta Math
PropositionStatement: 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.

Polynomial mod-two cohomology of Eilenberg–Mac Lane spaces

Statement

Assume AC. For q≥1,

H∗(Kq;F2)≅F2[SqIιq∣I admissible, e(I)<q],

including the empty sequence, with the indicated classes as actual polynomial generators of degree q+∣I∣.

Facts & Assumptions

Given: AC; q≥1; a based CW model Kq=K(F2,q) with normalized fundamental class ιq; the marked weak equivalence h:Kq→ΩKq+1 of the path-loop input lemma; and the admissible-basis calculus of the square algebra.

[F1]

The base case q=1 is the marked infinite real projective space with cohomology F2[ι1] (Infinite real projective space is a marked mod-two Eilenberg–Mac Lane space); instability gives SqIιq=0 for admissible I with excess greater than q (Steenrod normalization, instability, suspension, and top square, The mod-two square algebra, admissible sequences, and excess).

[F2]

The path-loop input lemma identifies the strict loop fiber's mod-two cohomology ring with that of Kq through the marked weak equivalence (Local path-fibration and cohomology inputs for mod-two Eilenberg–Mac Lane induction), and the relative-lifts lemma computes the transgression and survival of the corresponding classes (Relative lifts produce cohomological transgressions).

[F3]

The Borel polynomial base theorem applies to the actual fibration once its simple system and transgression data are supplied (A transgressive simple fiber system gives a polynomial base); AC underpins the basis and model choices (The Axiom of Choice), and squares are natural; the top-square identity identifies the indicated powers (Steenrod squares are well-defined and natural).

Proof

technique · direct
1.1givenF1

First establish the excess bookkeeping. If I=(i1,…,ik) is admissible, then i1=e(I)+i2+⋯+ik. Thus when e(I)>q, instability gives SqIιq=0. When e(I)=q, the outermost square is the top square of its input, so SqIιq=(Sq(i2,…,ik)ιq)2. The tail's excess is at most e(I), because subtracting the tail excess gives i1−2i2≥0. Continue deleting heads whenever the excess remains q; length strictly decreases, and the empty tail has excess zero. This expresses the class uniquely as a 2tth power of an admissible class with excess less than q. Conversely, if a tail J is admissible with e(J)≤q, prepend q+∣J∣. This new head is at least twice the first tail entry, since that inequality is equivalent to e(J)≤q. The new sequence is admissible, has excess exactly q, and represents the square of SqJιq. Iterating gives precisely all these powers. The deletion/prepending constructions are inverse on sequences; they do not rely on an unproved independence of their values.

2.1step 1.1F1F3

Induct on q. The marked projective-space model proves the base q=1, where the only admissible excess-zero sequence is the empty sequence. Suppose the polynomial statement holds for Kq. A monomial in its polynomial generators has a unique expression as a product of distinct elements (SqJιq)2t,e(J)<q,t≥0, by writing each exponent in binary. Hence these classes form a simple system of generators: their distinct finite products are a vector-space basis. The preceding inverse constructions index this simple system bijectively by all admissible I with e(I)≤q. It is degreewise finite because there are finitely many finite positive integer sequences of each fixed sum and each power has positive degree.

3.1step 2.1F2F3

Apply the actual path fibration supplied by the path-loop input lemma with strict fiber F=ΩKq+1. Its marked weak equivalence h:Kq→F identifies their mod-two cohomology rings. Transfer the polynomial generators and simple system from Kq to F by the inverse of h∗; this inverse commutes with squares because h∗ is a natural cohomology isomorphism. Write ιq for the resulting marked fundamental fiber class, as in the normalized-relative-lift lemma. The normalized-relative-lift lemma gives διq=p∗ιq+1. Repeated use of the connector-compatibility lemma and square naturality gives, for every admissible I, δ(SqIιq)=p∗(SqIιq+1). Therefore each simple-system element, of degree m=q+∣I∣, survives every earlier page and has its cohomological transgression on the exact page m+1=q+∣I∣+1, with representative SqIιq+1, by the relative-lifts lemma. This includes all top-square powers; no unsupported assertion about a square's “expected” differential is needed.

4.1step 3.1F3

All hypotheses of the Borel polynomial-base theorem now hold: the total path space is contractible, the base is simply connected, the actual strict fiber cohomology ring and marking are computed by the local weak-equivalence argument of the path-loop input lemma, the simple system is degreewise finite, and all its elements have the exhibited relative lifts. That theorem identifies base cohomology as the polynomial algebra on SqIιq+1 indexed by e(I)≤q, which is exactly e(I)<q+1. This proves the induction step, simultaneously proving generation and algebraic independence. All infinite index sets are used degree by degree with finite support, and strong Serre convergence is the actual published convergence statement.

5.1step 4.1F1∎

Explicit fiber boundary check. In the step with base Kq, the fiber is Kq−1. Its degree 2q−2 is not dropped. By the proved full polynomial statement it consists of the degree-2q−2 generators (admissible sequences of operation degree q−1 and excess less than q−1) together with the single product ιq−12. The latter is the simple-system element Sqq−1ιq−1, of excess q−1. Its relative lift is Sqq−1ιq, so the relative-lifts lemma places its differential on page 2q−1, from (0,2q−2) to (2q−1,0). Thus the previously missing fiber boundary class supplies the necessary base-degree-2q−1 generator. For q=2 this says that the square of the degree-one fiber class transgresses on page three. The polynomial induction handles this class and all other powers before any strict-range truncation is made.

Depends on

Used by

Dependency tree · two levels

61 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