What was already known
Geuvers formulated a system-wide weak-to-strong normalization conjecture for β and βη reduction. Earlier translation arguments handled restricted systems, while arbitrary nonfunctional pure type systems remained open.
AI involvement
OpenAI credits itself as manuscript author and states that its internal frontier model produced the results in this release. Individual human input is not detailed enough to establish task-only autonomy.
OpenAI is named as author on the manuscript, and its release attributes the results to an internal frontier model. The individual human input is not detailed enough to establish autonomy.
Importance
Resolves the β instance of the Barendregt–Geuvers–Klop normalization conjecture for arbitrary pure type systems.
Limitations
The hypothesis concerns every legal expression in every valid context; the result does not say an individual weakly normalizing term is strongly normalizing. It does not cover βη reduction.
Technical verification
OpenAI reports a Lean proof matching the selected claim.
Formal checking
The pinned Lean note proves the system-wide β implication with arbitrary sorts and nonfunctional axioms or rules, allowing reduction in annotations.
- Checker
- OpenAI-reported Lean 4 / Comparator
- Scope
- For any pure type system, if every legal expression in every valid context has a terminating β-reduction sequence, then every β-reduction sequence from every such expression terminates, including reductions inside type annotations.
- Basis
- Reported by the linked checker
Checking a formal statement does not establish that it matches the original problem.
Human understanding
Few is the default when evidence for a higher level is insufficient. No named person is documented as explaining the central argument for this assessed contribution.
Correction and publication history
Primary manuscript, attribution, prior-work, and scoped checking review for non-notifying local inclusion.
Read this published revision