What was already known
OpenAI proved the implication for typing with β-conversion. In the variant, an η-step can erase a λ-domain annotation and introduces different proof obligations.
AI involvement
The project credits Claude Opus 5.5 with adapting OpenAI’s argument to η-conversion, including domain erasure and η-canonical observations, and writing the new Lean proof under the authors’ direction.
- PTS formalizationPTS formalization
Importance
The proof extends the weak-to-strong normalization implication to every specification of the variant.
Technical verification
The project reports Lean checking and Comparator replay of both implications with the three standard axioms. The authors also compared the challenge statement with Geuvers’s definitions.
Formal checking
The cited project reports the check for these statements.
- Checker
- Pradhan, Vick, Fang and Kwan, reporting Lean checks
- Scope
- PureTypeSystem.weak_implies_strong_betaEta and PureTypeSystem.weak_beta_implies_strong_betaEta for any PTS specification; the formalization uses the three standard Lean axioms.
- Basis
- Reported by the linked checker
- PTS authorship and statement alignmentPTS authorship and statement alignment
Human understanding
The authors checked the statement against Geuvers’s definition. A human account of the central proof adaptation is undocumented.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision