Not evaluated
Polynomial removal fails for ordered binary matrices (family 190)
The gist
In its release of October 6, 2026, OpenAI claims, in a manuscript, that polynomial removal fails for ordered binary matrices.
DiscoverIA status on October 12, 2026: not evaluated, meaning no third-party evaluation found.
AI draft, not reviewedWhat has not been reviewed?
Text written by an AI (DiscoverIA pipeline), on . The status and its sources come from the registry; only the explanatory text has not been reviewed. A reported error is corrected, then the text is reviewed.
Cite this entry
A single status snapshot since Oct 12, 2026: a citation always points to a dated snapshot.
Cite snapshot 1, Oct 12, 2026
APA citation with the dated link
BibTeX @misc, key discoveria-oai-fam-190-polynomial-removal-fails-ordered-binary-r1
@misc{discoveria-oai-fam-190-polynomial-removal-fails-ordered-binary-r1,
author = {{DiscoverIA}},
title = {Polynomial removal fails for ordered binary matrices (family 190)},
howpublished = {DiscoverIA registry, entry oai-fam-190-polynomial-removal-fails-ordered-binary},
note = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
year = {2026},
url = {https://discoveria.ai/entry/oai-fam-190-polynomial-removal-fails-ordered-binary#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
To understand ≈ 30 s reading time, estimated
What it changes
A removal lemma says that a matrix containing few copies of a pattern can be cleared of it by changing few entries; “polynomial” qualifies the link between those two “few”. If the manuscript were correct, this polynomial link would fail for ordered binary matrices, in which the order of rows and columns matters.
What remains unclear
The Lean (a language in which a computer checks every step of a proof) is supplied by OpenAI itself: its review field reads “unchecked”, and no third-party verification is recorded. The sources read do not say for which patterns polynomial removal would fail.
For experts
Sources, method, key facts, status history, report an error
Status
Not evaluated
Recorded on · github.com · 190.md
Step 1 of 4 on the scale: not evaluated. Next step: under review.
- Announced
- Recordednot evaluated
- nextTo follow
What this status means
Source reading : Source read word for word (level 3 of 3)
The result is declared neither right nor wrong.
To move to “Under review”: a public review under way. To “Peer reviewed”: a journal publication or a review by named experts.
Sources
- Main sourcegithub.com · CONTENTS.mdlink only, reading not recorded
- Repositorygithub.com · Polynomial-removal-fails…link only, reading not recorded
- Lean proofgithub.com · 190.mdpage read word for word
- Lean proofgithub.com · MatrixRemoval.leanlink only, reading not recorded
Method
The manuscript “Polynomial removal fails for ordered binary matrices”, dated September 25, 2026, is attributed to an unreleased internal OpenAI model. The file lean/docs/190.md describes the scope of the Lean formalisation, which has 1 Comparator statement (lean/ComparatorChallenges/MatrixRemoval.lean); the family is among the sources listed in formalization.yaml, and history.md reports no revision of the manuscript. DiscoverIA status: not evaluated, meaning that no third-party evaluation has been found in the sources read. Set on October 12, 2026 from github.com (page read, quotation checked word for word: “describes the scope of the Lean formalization”).
Limits
No named third party: the recorded checks come from the claimant or from a platform tool. The claimant supplies a Lean proof; as of this date, DiscoverIA has found no independent verification of this proof or of the result.
Key facts
- Claimed by
- OpenAI (unreleased internal model)
announced on Oct 6, 2026 - Nature
- new result
- Field
- Mathematics (Combinatorics)
- In openai/math
- family 190, section “Combinatorics”, 1 manuscript dated Sep 25, 2026
- Lean proof
- supplied by the claimant, marked “unchecked” (not reviewed) in its repository
- Revisions
- none reported by the claimant
- Checked by
- claimant (Lean supplied, not checked by a third party)
- Sources
- 4 : 1 read word for word, 3 links only
- This entry
- AI draft, not reviewed
Status history
Only one observation so far.
- 01
First observation:Not evaluatedCurrent status
Family with a Lean proof supplied by the claimant. No third-party check read; the source marks this proof as not reviewed (“unchecked”).
Source: github.comread word for word
An observation is added; none is ever erased.
In the same set
openai/math: 719 manuscripts in 372 families from an unreleased internal model · entry 184 of 372, by family number
- Not evaluated : Snaky in 21 Maker moves (family 187)
- Not evaluated : The sharp constant in random triangle removal (family 188)
- Not evaluated : Exact cycle–clique Ramsey numbers (family 189)
- Not evaluated : Polynomial removal fails for ordered binary matrices (family 190)
- Not evaluated : A power improvement in the Heilbronn triangle problem (family 191)
- Not evaluated : A counterexample to the Gopalan–Servedio conjecture (family 192)
- Not evaluated : Serre's intersection-multiplicity conjecture (family 193)
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to contact@discoveria.ai.
Is your result listed?What each status requires, correcting this entry, replying to it.