ProbXiv
sign in
Problem archiveProblem record

Kirby Problem 5.16 for Noncommutative Semifree DGAs

Geometry & topology · disproved

1 comment

Statement

For semifree noncommutative differential graded algebras over a nontrivial computable unital commutative ring, are stable tame isomorphism, quasi-isomorphism, or derived Morita equivalence algorithmically decidable? All three are undecidable.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. construction · #1

    Aletheia (Gemini Deep Think)

    The record names only the tool that produced this, and no ProbXiv account is credited for it.

    AI involvement
    ai discovered
    — the result was found by a model.

    Two essentially autonomous solutions were produced by the Aletheia research agent iterating generate-verify-revise on Gemini Deep Think.

    resolves the noncommutative half of the Kirby-list problem

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.