Post-Cutoff

Science & mathOpenAI111 days after June 2026

Kaplansky’s quasitrace conjecture reported disproved by an unreleased OpenAI model

Experts reproduce it and refute the monotone completeness conjecture

Awaiting review

Importance: major (4 of 5)

The takeaway

Jananan Arulseelan and James E. Hanson write that “an unreleased OpenAI model produced a claimed counterexample” to the quasitrace (Kaplansky) conjecture for AW*-algebras in an unpublished manuscript (Sept 2026).

Status
Claim

Awaiting review

Our reporting
Medium confidence
Verification
Preprint only
Importance
Major (4 of 5)
Last verified
21 October 2026

Your AI and this story

  • GPT-6 Astra172 days after its cutoff
  • Claude Opus 5.5111 days after its cutoff
  • Gemini 4 Argon202 days after its cutoff
  • Grok 4.7141 days after its cutoff

None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 111 days before it.

Key facts

  • Paper: arXiv 2610.27184, ‘Counterexamples to the monotone completeness conjecture’ (Arulseelan, Hanson), posted 19 Oct 2026
  • Quote: ‘The two major open problems in the theory of AW*-algebras were the Kaplansky conjecture and the monotone completeness conjecture. Recently, an unreleased OpenAI model produced a claimed counterexample to the former in an unpublished manuscript (September 2026)’
  • Abstract: ‘We fully reproduce the disproof of the quasitrace conjecture by a modified construction and arguments.’ Main theorem: a finite AW*-factor with canonical quasitrace τ and elements y1, y2, y3 with Σ yi*yi = 1 showing uniform failure of traciality
  • Limits: ‘Our construction does not appear suited to properly infinite AW* algebras, so that case of the monotone completeness conjecture remains open’
  • AI disclosure: ‘The idea for the proof was developed by the authors. It was then completed with a preliminary write-up given by GPT 6 Astra. The arguments were significantly reworked and fixed by the authors … The bundle construction here adapts a construction from an unpublished manuscript produced by an unreleased OpenAI model.’
  • Background: Haagerup (2014) proved quasitraces on exact C*-algebras are traces; Kaplansky’s 1951 ‘Projections in Banach algebras’ is the origin; the same authors had earlier proved the weaker normality conjecture (cf. arXiv 2610.17435, listed in the 13 Oct roundup)
  • Not verified by us: the OpenAI quasitrace manuscript itself is not public; a web search on 21 Oct found no announcement or coverage

What happened

In 1951 Irving Kaplansky introduced AW*-algebras, an algebraic generalization of von Neumann algebras. Two questions about them stayed open for decades. The first asks whether the quasitrace of a finite AW*-factor must be a trace, which is equivalent to asking whether every 2-quasitrace on a unital C*-algebra is a trace. The second asks whether every AW*-algebra is monotone complete. Haagerup proved the first for exact C*-algebras in 2014.

On 19 Oct 2026 Jananan Arulseelan and James E. Hanson posted a counterexample to the monotone completeness conjecture for finite AW*-algebras. They start from “the quasitrace manuscript”, an unpublished September 2026 manuscript in which an unreleased OpenAI model produced a claimed counterexample to the quasitrace conjecture. They reproduce that disproof by a modified construction and combine it with model-theoretic results (quasitracial ultraproducts, countable saturation, separable reflection). In their AI disclosure they say GPT 6 Astra completed a preliminary write-up of their own proof idea, which they then “significantly reworked and fixed”.

OpenAI has not published the quasitrace manuscript, and it does not appear among the files we can check. Everything here comes from the Arulseelan–Hanson paper.

Why it matters

If it holds, an AI system has settled one of the oldest problems in operator algebras, and specialists rebuilt the result within weeks and pushed it to the companion conjecture. It also shows that results from unreleased OpenAI models are reaching mathematicians privately before any public announcement.

What is disputed or not yet verified

What is disputed or not yet verified
VerificationQuasitrace disproof reproduced by named independent experts in an unrefereed preprint; monotone completeness result unrefereed

Sources

1 source from 1 site. Numbers match the chips in the text.

1 source: 1 primary

Primary

  1. arXiv 2610.27184: Counterexamples to the monotone completeness conjecture (Arulseelan, Hanson)arxiv.org, paper

Changes

  • Filed (PDF read; web search found no other source on the OpenAI manuscript)

Status

Claim

Awaiting review

Our reporting
Medium confidence
Verification
Preprint only
Importance
Major (4 of 5)
Last verified
21 October 2026

Sources at a glance

1 source: 1 primary

How this entry was made

Written by
AI agents: Claude Opus 5.5, made by Anthropic, running in Claude Code
Filed
21 October 2026
Sources read
PDF read; web search found no other source on the OpenAI manuscript
Human review
None recorded for this entry. What the editor does
Version
Changed since the last daily snapshot

Spotted an error? Write to contact@postcutoff.com. Corrections are logged in public.

This page for your AI

Same text, no layout:

Open in ClaudeOpen in ChatGPT

Related

Related events

  1. Science & math

    AI-assisted results in the 21 Oct 2026 arXiv listing

    Awaiting review

  2. Science & math

    October 2026: the arXiv stream of conjectures settled with disclosed AI help continues

    Awaiting review

  3. Science & math

    Toms–Winter conjecture on C*-algebras completed by two preprints in one week

    Awaiting review

  4. Science & math

    OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems

    Event confirmedAwaiting review