AIProofWatch
← Archive

OpenAI reports: Rigidity of the Turing degrees

OpenAI reports that every order automorphism of the full Turing-degree partial order is the identity in ZFC, without a definability or regularity restriction on the automorphism.

Sources for this record

What was already known

Fixing a cone of degrees or preserving definable operations does not by itself imply that every degree is fixed. The target is rigidity of the entire ordering.

What changed and why it matters

Extends partial rigidity phenomena to every degree in the full stated ordering.

The AI contribution

OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.

Limitations

The statement concerns the full order of Turing degrees. It should not be transferred to arbitrary degree structures or weaker background theories without an argument. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.

Verification evidence

Evidence labels show what supports the claim. Importance rates its impact if correct.

Author claim

The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.

Accessible artifact / proof

The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.

Correction and publication history

2026-10-11 · publication

Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.

Read this published revision