Author verified Collaborative

SOP₂ and SOP₃ theories shown to coincide

The classes of SOP2\mathrm{SOP}_2 and SOP3\mathrm{SOP}_3 first-order theories are the same, answering a 2004 question of Džamonja and Shelah and collapsing the bottom of the SOP hierarchy to a single class.

Model
ChatGPT 5.6
Field
Mathematics
Date
2026-08-13
Human collaborators
Artem Chernikov
Problem posed
2004 · open 22 yrs

Sources

Original work

What was found

Džamonja and Shelah introduced the tree configurations SOP1\mathrm{SOP}_1 and SOP2\mathrm{SOP}_2 in 2004 and asked whether either implication in the chain from SOP3\mathrm{SOP}_3 to SOP2\mathrm{SOP}_2 to SOP1\mathrm{SOP}_1 reverses. Mutchnik answered the second, proving SOP1\mathrm{SOP}_1 equals SOP2\mathrm{SOP}_2, and the surviving half organised much of the subsequent NSOP1\mathrm{NSOP}_1 literature, with partial results by Conant, by Kaplan, Ramsey and Simon, and by Mutchnik. This five-page paper proves that SOP2\mathrm{SOP}_2 implies SOP3\mathrm{SOP}_3, the converse having been known from the start, which collapses the bottom of the hierarchy to a single class and carries consequences for Keisler-order maximality. The SOPn\mathrm{SOP}_n hierarchy for nn at least three is untouched, as is everything above it.

Novelty check

The question is one of the two 2004 Džamonja–Shelah questions that organised two decades of classification theory, and the paper's own introduction traces it as open through Mutchnik's celebrated resolution of the other half and the partial results that followed. It is repeatedly highlighted in the NSOP1\mathrm{NSOP}_1 literature as the surviving open case. No prior proof appears. The result is new.

Caveats and known objections

A preprint one day old at entry, not peer-reviewed and not formalized. The acknowledgements record comments from Itay Kaplan and Scott Mutchnik on a preliminary version, which is expert attention on a draft rather than independent verification, so the entry stays at author verified. Autonomy graded collaborative: the entire disclosure is one sentence, that the proof was found using ChatGPT 5.6 and simplified and streamlined by the author, which is ambiguous between the model supplying the key insight and the author using it as a tool. The weaker defensible reading applies.

Also recorded at

vibemathedsop-2-sop-3

Nothing mechanically. It is a parallel listing of the same result, carrying its own verification label rather than an independent check.

Nobody outside the lab has checked this yet.

Reading the primary source closely enough to say whether it supports the claim counts as a check, and you are credited on the entry.

Or on GitHub: submit a check challenge the grade send a correction or send a pull request

History of this entry

  1. CorrectedRecorded the vibemathed record for this result as a registration. The vibemathed link it replaces was classified as commentary, which a registry listing is not.
  2. AddedEntered the registry graded Author verified and Collaborative.

Entries are never deleted. A grade that does not hold up is downgraded on the record, with the reason beside it.

Graded author verified for verification and collaborative for autonomy. What these mean.

Cite this entry

Plain text
whataifound.org. (2026). SOP₂ and SOP₃ theories shown to coincide. whataifound.org: A Registry of AI Scientific and Mathematical Discoveries. https://whataifound.org/finding/2026-08-13-sop2-sop3
BibTeX
@misc{whataifound-independent-2026-sop3,
  title        = {SOP₂ and SOP₃ theories shown to coincide},
  author       = {{whataifound.org}},
  year         = {2026},
  howpublished = {whataifound.org: A Registry of AI Scientific and Mathematical Discoveries},
  note         = {Result by Independent. Verification: Author verified. Autonomy: Collaborative.},
  url          = {https://whataifound.org/finding/2026-08-13-sop2-sop3}
}

Related findings

← All mathematics findings in the registry