Plectis Atlas
Search

↑ and ↓ move, Enter opens, Esc closes.

Show on the map

Chromatic splitting: filtrations and counterexamples

OpenAI groups related papers into a “family”. OpenAI’s catalogue describes this one:

Disproves strong chromatic splitting at height three for primes p ≥ 5, and weak splitting for the derived p-completed sphere at heights p (p ≥ 5) and \(p+1\) (p ≥ 7). Nevertheless, for n ≥ 1 and \(p\gt n+1\), the overlap \(L_{n-1}L_{K(n)}S_p^\wedge\) admits a \(2^n\)-stage filtration by the predicted localized-sphere pieces. At height three and prime three, even finite assembly from such pieces fails in the category of \(E(2)\)-local modules over the derived completed sphere.

The release has no Lean statement for this family, so there is no formal statement to compare with the result described above.

What the papers state

Theorem 1.1

In Filtered chromatic splitting at generic primes, 25 September 2026

The paper’s main theorem is shown as a possible match to OpenAI’s description. No review confirming the selection is recorded.

Let n\geq1 and let p>n+1 be prime. There exist an enumeration I_1,\ldots,I_{2^n} of the subsets of \{1,\ldots,n\}, a filtration F_\bullet, and a family of classes y_i\in\pi_{1-2i}D, 1\leq i\leq n, with the following properties.

  1. (a)

    Filtration and unit. The enumeration has I_1=\varnothing and \max I_j nondecreasing for j\geq2. The filtration is

    0=F_0\longrightarrow F_1\longrightarrow\cdots \longrightarrow F_{2^n}\xrightarrow{\simeq}X_{n,p}

    with \operatorname{cofib}(F_{j-1}\to F_j)\simeq C_{I_j}, where

    \begin{aligned} C_\varnothing&=L_{n-1}S,\\ C_I&=\Sigma^{-d(I)}L_{n-\max I}S \quad(I\ne\varnothing). \end{aligned}

    Under F_1=C_\varnothing, the composite F_1\to X_{n,p} is the canonical localization unit.

  2. (b)

    Simultaneous product bases. For this one family, set y_\varnothing=1 and y_I=y_{i_1}\cdots y_{i_r} for I=\{i_1<\cdots<i_r\}. For every 1\leq t<n, the specified map

    L_{K(t)} \left(\bigvee_{I\subseteq\{1,\ldots,n-t\}} \Sigma^{-d(I)}S\xrightarrow{(y_I)}D\right) \quad\text{is an equivalence}.

Corollary 1.2

In A rational obstruction to strong chromatic splitting at height three, 25 September 2026

Possible match to OpenAI’s description, selected because it shares the most wording. No review confirming the selection is recorded.

For every prime p\geq5, there is no equivalence of E(2)-local spectra L_2L_{K(3)}S\simeq\mathcal W_3, with \mathcal W_3 as in (1.1). Thus the height-three strong chromatic splitting formula is false in this range, whether or not an equivalence is required to preserve its specified unit summand.

The release does not say which paper theorem its catalogue describes. Both statements above are shown whole: the paper’s main theorem first, then the statement that shares the most wording with the description. The atlas has not reviewed either choice.

Seven more possible matches

  • Theorem 1.1 in Failure of finite assembly for a chromatic overlap at the prime three, 25 September 2026.
  • Theorem 1.1 (Explicit height-three filtration) in The height-three chromatic overlap, 27 September 2026.
  • Theorem 1.4 (Incompatible descent exponents) in Counterexamples to weak chromatic splitting, 27 September 2026.
  • Theorem 1.1 (A named kernel at height p) in Counterexamples to weak chromatic splitting, 27 September 2026.
  • Theorem 1.2 (The same kernel at height p+1) in Counterexamples to weak chromatic splitting, 27 September 2026.
  • Theorem 1.1 in A rational obstruction to strong chromatic splitting at height three, 25 September 2026.
  • Corollary 1.3 (The prime-five class) in Counterexamples to weak chromatic splitting, 27 September 2026.
Reported proof verification
The release has no Lean statement for this family. The papers are available to read and assess.

Papers

Each paper opens as a reading page in the browser, with the PDF beside it. The statements each paper opens with are on its reading page.

Filtered chromatic splitting at generic primes

25 September 2026, current edition.

Read it herePDF

For every n ≥ 1 and prime \(p\gt n+1\), we construct a \(2^n\)-stage ordered filtration of \(L_{n-1}L_{K(n)}S_p^\wedge\) with the classical chromatic-splitting cofibers. The map from the first stage to the target is the canonical localization unit.

The height-three chromatic overlap: an explicit filtration and its attachments

27 September 2026, current edition.

Read it herePDF

For every prime p ≥ 5, we construct an explicit eight-stage filtration of \(L_2L_{K(3)}\mathbb S_p^\wedge\) by the local-sphere layers in the height-three chromatic-splitting pattern. The map from its first stage to the overlap is the canonical unit, and two signed fracture formulas identify all attachments for the chosen local maps and compatibility homotopy. A companion canonical-map theorem further implies that the first height-one attachment is nonzero.

A rational obstruction to strong chromatic splitting at height three

25 September 2026, current edition.

Read it herePDF

For every prime p ≥ 5, the canonical map \(L_0L_{K(3)}S\to L_0L_{K(2)}L_{K(3)}S\) for the sphere spectrum S is nonzero on π−3. Consequently, the height-three strong chromatic splitting formula is false in this range, even as an equivalence of underlying \(E(2)\)-local spectra without specified summand maps.

Failure of finite assembly for a chromatic overlap at the prime three

25 September 2026, current edition.

Read it herePDF

At the prime three and height three, the chromatic overlap cannot be constructed from the rational, height-one, and height-two local spheres by finitely many sums, shifts, cofibers, and retracts in the category of \(E(2)\)-local modules over the derived 3-complete sphere. This gives a negative answer to the ordinary finite-assembly question for chromatic overlaps.

Lean statements

The release has no Lean statement for this family. Its papers remain available to read, and contributors can propose a formal statement of a result. Suggest a change

Independent comparisons and proof-verification reports

Does the Lean express the advertised result?

The release contains no Lean statement for this family, so there is no formal statement to compare with OpenAI’s description.

What these papers cite in the release, and what cites them

These links come from the papers’ bibliographies. A citation records that one paper cites another; how each cited result is used has not been examined here.

Within this family

Papers elsewhere in the release that this family’s papers cite

This family’s papers cite no paper elsewhere in the release.

Papers elsewhere in the release that cite this family’s papers

No paper elsewhere in the release cites this family’s papers.

Explain a result, compare statements or propose a correction

Atlas has no contributed explanation for this family yet. You can offer one with a GitHub account. You receive named credit and disclose any AI assistance.

Each button opens a GitHub form with this page and its source version filled in. Opening the form does not reserve the work.

Offer to write an explanationSuggest a source attributionSuggest a change

What people have said

Commentary on this family by others, dated and credited. It is commentary, not a finding.

  • An unsigned public tier list, the OpenAI Math Tier List, classes it as a counterexample and rates its significance, if it holds up, as “Solid publication, could lead to tenure”. The page says that nothing on it is verified.

    Author not stated. Source

Questions awaiting review

Each item identifies a statement, definition or report that needs further review. Its link opens a GitHub form with the source version already recorded.

Identify the theorem the catalogue describes

  • Family 318 The theorem shown was selected from shared wording with OpenAI’s description. Atlas records no review confirming that it is the theorem the description means. Open the form

State the result in Lean

  • Family 318 The release has no Lean statement for this family. Open the form