The Strong Atiyah Conjecture over a subfield of the complex numbers
The Strong Atiyah Conjecture over a subfield of the complex numbers
Let be a subfield of , let be a countable group with a bound on the orders of its finite subgroups, and let denote the least common multiple of the orders of the finite subgroups of . For a finite matrix over , let be its von Neumann rank. The Strong Atiyah Conjecture over . For every finite matrix over , one has
This conjecture is known over for many classes of groups, including locally indicable groups, braid groups, elementary amenable groups, virtually compact special groups, and -manifold groups, and it is stable under free products of groups satisfying it. It has applications such as implying Kaplansky's zero-divisor conjecture for torsion-free groups, but it remains open in general.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
The Strong Atiyah Conjecture over a subfield of the complex numbers
Let be a torsion-free countable group, let be a subfield of , and let be the Linnell ring, defined as the division closure of in the ring of unbounded operators affiliated to . The Strong Atiyah Conjecture over . The Linnell ring is a division ring. The conjecture is open in general, although it has been established for many large classes of groups, including torsion-free -manifold groups.
source: Pablo Sánchez-Peralta, “Simon's knot genus problem and Lewin 3-manifold groups”, arXiv:2603.26580 (2026).
Sources & referencesView supporting material
Primary source
Sam P. Fisher and Andrew Ng, “Outer automorphism groups and the Atiyah Conjecture”, arXiv:2606.19606 (2026).
Additional references
8 papers in this index state this conjecture (2003–2026). The statement above is taken from the most recent of them; the others are arXiv:2505.08701, arXiv:2412.16090, arXiv:2005.12814, arXiv:1602.04515, arXiv:1305.1071, arXiv:0810.1365, arXiv:math/0303097.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.