What was already known
Earlier three-dimensional monotiles allowed screw symmetry or periodic stacking. Here strong aperiodicity excludes infinite-order symmetries; it does not require every stabilizer to be trivial.
What changed and why it matters
A reported solution to the strong three-dimensional monotile problem, with later human expositions of the underlying matching rules.
The AI contribution
Tsiokos directed the investigation. The sources attribute the tile search and proof development to ChatGPT Astra; the news interview also identifies Claude’s writing role. Later human proofs and explanations are not attributed to that model.
Limitations
The original proof is a submission. Its reported Lean gates use named native_decide compiler hooks; AIProofWatch did not reproduce them or audit the geometric interface. Goodman-Strauss criticizes the original presentation and supplies a clearer proof; Flicker gives a human-readable matching-rule argument. Their work is credited separately.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
Original scoped monotile theorem and verification qualifications.
Accessible artifact / proof
Written construction and declared compiler-dependent checking are accessible; not reproduced here.
Correction and publication history
Historical backfill prompted by new 12 October coverage. Primary theorem, symmetry convention, AI roles and human follow-ups reviewed. The news date is not the result date; no subscriber notification.
Read this published revision