---
id: "2026-10-10-vaught-conjecture-infinitary-counterexample-lean"
url: "https://postcutoff.com/e/2026-10-10-vaught-conjecture-infinitary-counterexample-lean/"
as_of: "2026-10-14T07:26:00+02:00"
date: "2026-10-10"
date_precision: day
category: science
importance: 4
confidence: high
status: [Event confirmed, Awaiting review]
verification: Lean-verified
sources: 5
editor: human editor
human_review: null
version: null
---

As of: 2026-10-14 07:26 CEST.
Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/
Canonical page: https://postcutoff.com/e/2026-10-10-vaught-conjecture-infinitary-counterexample-lean/

# Vaught's conjecture fails for infinitary logic

Full title: Vaught's conjecture fails for infinitary logic: Ackerman, Freer and Knight post a Lean-verified counterexample, built over 8 months with Claude Code and Codex

arXiv 2610.15217 (submitted 10 Oct 2026) by Nathanael Ackerman (Harvard), Cameron Freer (MIT) and Robin Knight (Oxford) constructs a sentence of L_ω1,ω with exactly ℵ1 countable models up to isomorphism but no perfect set of non-isomorphic models, which disproves Vaught's conjecture for infinitary logic. The construction follows Knight's framework (his 2002 counterexample claim never won general acceptance). The paper says the full argument is "certified in Lean", checked by Comparator and registered on the Palomar Registry. Freer spent 8 months formalizing it with coding agents (Claude Code and Codex, Opus 4.5–5.5, Fable 5/5.1, GPT 5.2–6). The Lean certificate is the main check so far; the preprint is unrefereed.

## Key facts
- Paper: 'A counterexample to Vaught's Conjecture for L_ω1,ω', Nathanael L. Ackerman, Cameron E. Freer, Robin W. Knight, arXiv 2610.15217 [math.LO], 26 pages, submitted 10 Oct 2026
- Result: a sentence of L_ω1,ω with exactly ℵ1 countable models up to isomorphism and no perfect set of non-isomorphic models, so the number of countable models is neither countable nor 2^ℵ0 in the strong (perfect-set) sense
- Scope: the paper disproves Vaught's conjecture 'for infinitary logic'; it does not claim the original first-order case (Knight's 2002 manuscript claimed a first-order counterexample)
- History (paper, §1.2): Knight announced a first-order counterexample in 2002; despite a Notre Dame conference devoted to it, the argument 'did not achieve general acceptance as a correct proof, although no definitive flaw in the construction had been identified'
- AI use: in Feb 2026 Ackerman and Freer proposed 'to use AI coding agents to help formalize his proof in Lean'. 'Over the following 8 months, Freer worked extensively with coding agents (Claude Code and Codex with models ranging from Opus 4.5 through 5.5, Fable 5 and 5.1, and GPT 5.2 through 6) and occasional help from GPT Pro (5.2 through 6)'
- Not a routine formalization: Knight's object needed 'substantial revisions' to satisfy his conditions; 'Closing this gap involved a great deal of human mathematical direction and AI-assisted exploration'. Finding the template system 'required a great deal of work using coding agents to interact with LLMs, Lean, and SMT and Horn clause solvers'
- Verification: 'a formally verified counterexample … with the entire argument certified in Lean'; one version checked by Comparator and registered as PALOMAR-2026-10-07-000001; a cleaner version on GitHub (cameronfreer/vaught-conjecture-counterexample, created 30 Sep 2026); the paper notes that 'not every line of this exposition has been formally verified'
- Tools: Freer's lean4-skills pack for AI coding agents (Oct 2025), the Lean LSP MCP server, and Freer's infinitary-logic Lean library

## What happened

On 10 Oct 2026 Nathanael Ackerman, Cameron Freer and Robin Knight submitted [arXiv 2610.15217](https://arxiv.org/abs/2610.15217) (listed 13 Oct). It gives a sentence of the infinitary logic L_ω1,ω with exactly ℵ1 countable models up to isomorphism and no perfect set of non-isomorphic models. Vaught's conjecture (1961) says this cannot happen, so the paper disproves its infinitary version. The original first-order conjecture is not claimed.

The paper's history section explains how it came about. In 2002 Knight announced a first-order counterexample. The community tried hard to check it, including a conference at Notre Dame, but the proof "did not achieve general acceptance", although nobody found a definitive flaw. In February 2026 Ackerman and Freer suggested formalizing Knight's newer, clearer infinitary draft in Lean with AI coding agents. Freer then worked for 8 months with Claude Code and Codex (Opus 4.5 to 5.5, Fable 5 and 5.1, GPT 5.2 to 6, plus occasional GPT Pro). The draft's combinatorial object turned out to need "substantial revisions"; closing the gap took "a great deal of human mathematical direction and AI-assisted exploration", and SMT and Horn-clause solvers were used near the end. The template system in the paper is a simplified version of the first one found.

The formal proof is on the [Palomar Registry](https://palomar-registry.org/entry?id=PALOMAR-2026-10-07-000001&version=1) (Comparator-checked) and in a [GitHub repository](https://github.com/cameronfreer/vaught-conjecture-counterexample) with a cleaner API. The authors note that the written exposition and the Lean development are organized differently in places.

No expert reactions or press coverage were found on 14 Oct (web search; X not searched directly).

## Why it matters

Vaught's conjecture is one of the best-known open problems in model theory. Here the human idea is two decades old; what changed is that coding agents made a full machine check practical, and the check forced repairs that the informal argument had missed. It is a clear case of AI-assisted formalization settling a disputed human proof rather than finding a new one. Whether the method extends to the first-order case is open.

## What is disputed or not yet verified

- Verification: Formal proof in Lean (Comparator-checked, Palomar Registry); unrefereed preprint

## Your AI and this story

- GPT-6 Astra (training cutoff April 2026): 163 days after its cutoff
- Claude Opus 5.5 (training cutoff June 2026): 102 days after its cutoff
- Gemini 4 Argon (training cutoff March 2026): 193 days after its cutoff
- Grok 4.7 (training cutoff May 2026): 132 days after its cutoff

## Sources

1. [arXiv 2610.15217: A counterexample to Vaught's Conjecture for L_ω1,ω](https://arxiv.org/abs/2610.15217) (arxiv.org, paper)
2. [Palomar Registry entry PALOMAR-2026-10-07-000001](https://palomar-registry.org/entry?id=PALOMAR-2026-10-07-000001&version=1) (palomar-registry.org, code)
3. [GitHub: cameronfreer/vaught-conjecture-counterexample (Lean 4)](https://github.com/cameronfreer/vaught-conjecture-counterexample) (github.com, code)
4. [GitHub: cameronfreer/lean4-skills](https://github.com/cameronfreer/lean4-skills) (github.com, code)
5. [Wikipedia: Vaught conjecture (background, Knight's claim)](https://en.wikipedia.org/wiki/Vaught_conjecture) (en.wikipedia.org, press)

## Changes

- 2026-10-14 (filed): Created from the arXiv paper

## Related

- 2026-10-13: [October 2026: the arXiv stream of conjectures settled with disclosed AI help continues](https://postcutoff.com/e/2026-10-13-ai-assisted-results-october-2026/index.md)
- 2026-08-18: [Palomar launches: a registry of Lean-verified mathematics to curb misrepresented AI proof claims](https://postcutoff.com/e/2026-08-18-palomar-lean-registry/index.md)