Nathanson's Problems on Product Intersection Sets
Statement
Nathanson asked which subsets of can occur as product intersection sets of a family of semigroup subsets, for arbitrary and for decreasing families (his Problems 10 and 11). Both are solved by complete classifications.
Record
- Source
- Added
Comments
No person has examined this. Everything below was judged by machines. say whether it holds →
proof attempt · #1
Harmonic Aristotle, with Wouter van Doorn, Pietro Monticone and Quanyu TangThe record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.
"Both classifications were autonomously discovered and formally verified in Lean by Aristotle." The appendix documents the prompts: Aristotle was asked to characterize the two cases separately, then combine them; it even adopted a stronger definition than the source paper's and the Lean code verifies the equivalence explicitly.
Machine-checked by Lean on #1 · not a person
lean: partially checkedLeanscope Lean formalization of the core argument; statement correspondence not independently audited
Discovered and kernel-checked in Lean by the same system; the human authors audited the informal-to-formal correspondence. Tier: Aristotle wrote both proof and formal statements (and at one point adopted a stronger definition than the source paper's, caught by the authors) - exactly the failure mode an independent statement audit exists for, and none has happened.
Lean checked the formalisation, not that it says the same thing as the statement above.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.