The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system

Theorem 1.1: for every pure type system $(\mathcal S,\mathcal A,\mathcal R)$ , with no functionality assumption on $\mathcal A$ or $\mathcal R$ , if every legal expression in every valid context is weakly $\beta$ -normalizing then every such expression is strongly $\beta$ -normalizing; reduction acts inside annotations and contexts may be open. Both properties are system-wide: the theorem does not say that an individual term with a normal form is strongly normalizing. It makes no claim about $\beta\eta$ -reduction, the other half of Geuvers's formulation. The proof uses Tait-Girard style candidates indexed by sort profiles and a realization of Hurkens's paradox to exclude a graph configuration.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 25, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system · Barendregt-Geuvers-Klop conjecture (beta)

Confidence: Not scored

Registry verification: lean checked · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Evidence vector

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Named evidence

VibeMathed record: The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system

specialist registry · passed

No independent mathematician has checked this yet. Checked here: the abstract, introduction and Theorem 1.1 were read against Geuvers's conjecture. lean/docs/245.md points to ComparatorChallenges/TypeSystemNormalization.json (theorem OAI.PureTypeSystem.weak_implies_strong, solution module OAI.Computability.TypeSystem.Normalization); the solution file exists at the pinned commit, and the challenge is not in the formalization catalogue formalization.yaml. The statement was read here: for an arbitrary specification (any sort type, nonfunctional axiom and rule relations), with de Bruijn syntax, annotated lambda and pi, the seven PTS typing rules and full beta reduction including annotations, system-wide weak normalization of legal terms in valid contexts implies system-wide strong normalization. That is the headline claim. Not rebuilt here. The result covers beta only: the beta-eta half of Geuvers's conjecture is not addressed.

Source ↗

The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system

witness · pending

Primary source named by the VibeMathed record. Presence in this import is not an independent mathematical verification.

Source ↗

Lean proof (OAI.PureTypeSystem.weak_implies_strong)

lean artifact · pending

lean-proof link supplied by the VibeMathed registry.

Source ↗

Geuvers, Logics and Type Systems (thesis, 1993), Conjecture 8.1.2

specialist registry · pending

problem-record link supplied by the VibeMathed registry.

Source ↗

Artifacts and verifiers

Lean proof (OAI.PureTypeSystem.weak_implies_strong)

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

This event attributed to Unreleased internal OpenAI model

VibeMathed record: The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system evidence for this event

The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system parent of this event

Lean proof (OAI.PureTypeSystem.weak_implies_strong) evidence for this event

The Barendregt-Geuvers-Klop conjecture for beta reduction: weak normalization implies strong normalization in every pure type system evidence for this event

Geuvers, Logics and Type Systems (thesis, 1993), Conjecture 8.1.2 evidence for this event

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem Explore evidence graph