Sabok's S-Prime Simplex Questions
Sabok asked whether the compact convex set attached to a separable metric space of diameter at most one is always a simplex, and whether is the Poulsen simplex. Both answers are negative, with obstructions already visible for finite and for the Urysohn space.
- Result
- Disproved
- Status
- Resolved
- AI contribution
- AI-assisted
- Method
- Construction
- Field
- Convex geometry
- Posed by
- Marcin Sabok
- Year posed
- —
- Years open
- —
- Solved
- 2026-06-18
- Model
- GPT-based models
- Vendor
- OpenAI
- Collaborators
- Yutong Zhang, Yaoran Yang
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 10 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The acknowledgement says the authors used GPT-based large language models to generate and compare possible proof strategies. Same authors as the Baker anti-Bertini entry in this catalog.
Verification
arXiv preprint; not yet peer-reviewed.
Source
arXiv:2607.27215 - Finite and Urysohn obstructions to Sabok's S-prime simplex questions