Petrykowski's conjecture (Newelski 2012) asserted that a definable group
is definably amenable whenever it admits
a global type
with bounded orbit under left translation. Here
bounded means that the orbit's cardinal number
is smaller than the saturation cardinal of the monster model
.
The conjecture holds for groups in theories without the independence property (Chernikov
and Simon 2018), but fails in general. Chernikov (2026) constructed a complete simple theory, a definable
group ,
and a global type
such that
, while
has no left-invariant Keisler
measure. The counterexample is a simple expansion
of the theory of nonabelian free
groups.
Chernikov (2026) reports that ChatGPT 5.6 established parts of the general construction and found the bounded-orbit type construction. The author subsequently simplified and reorganized the arguments. Independent external review had not been reported as of Sep. 23, 2026.