Chen, Tserunyan & Tucker-Drob solve the Jackson–Kechris–Louveau ‘finite index over treeable’ problem (2002); ChatGPT 6 Astra Ultra supplied a ‘crucial observation’
Event confirmedAwaiting review
Importance: major (4 of 5)The takeaway
A countable Borel equivalence relation that contains a treeable subrelation of finite index is itself treeable. This answers Open Problem 6.4(B) of Jackson–Kechris–Louveau (2002), open even in the index-2 measure-preserving case. The authors had the strategy; GPT supplied the observation that made the stages fit together.
Status
- Claim
Event confirmedAwaiting review
- Our reporting
- High confidence
- Verification
- Preprint only
- Importance
- Major (4 of 5)
- Last verified
- 9 October 2026
Your AI and this story
- GPT-6 Astra159 days after its cutoff
- Claude Opus 5.598 days after its cutoff
- Gemini 3.8 Flash189 days after its cutoff
- Grok 4.7128 days after its cutoff
None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 98 days before it.
Key facts
- Theorem 1.2: if F ⊆ E are countable Borel equivalence relations, F has finite index in E and F is Borel treeable, then E is Borel treeable. Previously open even for index 2 in the probability-measure-preserving setting (treeing only on a conull set)
- Method: a median-subalgebra filtration on products of trees, extending the median-graph treeing algorithm of Chen–Poulin–Tao–Tserunyan (2025) to well-behaved increasing unions; answers Question 1.1, how to ‘canonically combine’ finitely many trees on the same vertex set into one tree-like structure
- Corollary 1.3: a locally compact second countable group with a strongly treeable finite-index open subgroup is strongly treeable (also for measure and Borel strong treeability); for unimodular groups this implies fixed price
- AI disclosure: ‘We conceived of the approach to proving Theorem 1.2 described above prior to consulting GPT.’ GPT ‘supplied the following observation that we missed: for a given Q_{n+1}-class D, the partial equivalence relation Q_n|D is invariantly separable by half-spaces in M_D’, which in the final proof ‘remains implicit but becomes essentially definitional’ (Theorem 4.1(c))
- Writing: ‘The article was entirely written by the three named authors’; ChatGPT gave editorial suggestions after the first draft
- No expert reactions found on X, HN or blogs as of 9 Oct; not in OpenAI’s 6 Oct catalogue
What happened
Treeable equivalence relations play the role that free groups play among groups. Jackson, Kechris and Louveau asked in 2002 whether treeability survives finite-index extensions. They had shown that free actions of virtually free groups give treeable relations, and the general question became a driver of geometric methods in the field.
Chen, Tserunyan and Tucker-Drob build the final tree in stages from a filtration of median algebras on a product of trees. Their AI declaration is unusually precise: they had the staged approach and its index-2 setting, and ChatGPT 6 Astra Ultra pointed out that each stage’s relation is invariantly separable by half-spaces in the next stage’s median graph. This was the coherence property they needed, and after reformulation it became a definition.
Why it matters
It settles a named problem from a standard reference on countable Borel equivalence relations, with direct consequences in measured group theory (fixed price, strong treeability). The disclosure is a clear example of the “AI supplies the missing lemma” pattern in research-level mathematics.
What is disputed or not yet verified
| Verification | Unrefereed preprint by leading experts in the field |
|---|
Sources
1 source from 1 site. Numbers match the chips in the text.
1 source: 1 primary
Primary
Changes
- Filed from the arXiv PDF