Infinite loop spaces and nilpotent K–theory
Bibliographic record
Abstract
Using a construction derived from the descending central series of the free groups, we produce filtrations by infinite loop spaces of the classical infinite loop spaces $BSU$, $BU$, $BSO$, $BO$, $BSp$, $BGL_{\infty}(R)^{+}$ and $Q_0(\mathbb{S}^{0})$. We show that these infinite loop spaces are the zero spaces of non-unital $E_\infty$-ring spectra. We introduce the notion of $q$-nilpotent K-theory of a CW-complex $X$ for any $q\ge 2$, which extends the notion of commutative K-theory defined by Adem-G\'omez, and show that it is represented by $\mathbb Z\times B(q,U)$, were $B(q,U)$ is the $q$-th term of the aforementioned filtration of $BU$. For the proof we introduce an alternative way of associating an infinite loop space to a commutative $\mathbb{I}$-monoid and give criteria when it can be identified with the plus construction on the associated limit space. Furthermore, we introduce the notion of a commutative $\mathbb{I}$-rig and show that they give rise to non-unital $E_\infty$-ring spectra.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.002 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".