Matching works

2 works

math.AT — Algebraic Topology

Weak chromatic splitting fails at n = p for every odd prime p

Contributed by Agnes Beaudry, Tomer Schlank

We prove that for every odd prime pp there is a height nn for which the map $L_{n-1}S_p \to L_{n-1}\L_{K(n)}S_p$ is not injective on homotopy groups, hence not the inclusion of a wedge summand. In particular, for such pairs (n,p)(n,p) the weak chromatic splitting conjecture is false. More precisely, we prove the conjecture fails for (n,p)=(3,3)(n,p) = (3,3) and for all pairs (n,p)(n,p) with p≤n<2(p−1)p \le n < \sqrt{2}(p-1). In particular, the conjecture fails for (n,p)=(p,p)(n,p) = (p,p) for every odd prime pp. This disproof was produced autonomously by Claude in a session working on Freyd's generating hypothesis with no human in the loop. This note is a human write-up of the disproof. We did not contribute any ideas.

Primarily human-written textHuman understanding: all parts
Oct 07, 20265 pages
PDFView work

math.AT — Algebraic Topology

Swan induction for the finite-local sphere

Contributed by Akhil Mathew

We establish rational Swan induction for ordinary perfect modules over the finite-local sphere Lnp,fSL_n^{p,f}\mathbb S. For a finite abelian ambient group, subgroups of pp-rank at most n+1n+1 suffice, and this bound is sharp. The proof combines cyclic homotopy fixed points in telescopic spectra with the isotropy filtration of a chromatic quotient of finite genuine spectra. The result proves Conjecture~7.22 of Clausen--Mathew--Naumann--Noel for Morava EE-theory and gives a new proof of their chromatic upper bound for the algebraic KK-theory of Lnp,fSL_n^{p,f}\mathbb S-linear categories. The quotient argument also produces finite complexes realizing the induction relations. We formulate the problem of explicit realizations and give two geometric models at the prime two.

Primarily AI-generated textHuman understanding: some partsBurnside ringsSwan inductionchromatic homotopy theory
Sep 27, 202617 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations