Rigidity and arithmetic of lattice von Neumann algebras

What OpenAI claims

Classifies finite-index bimodules between scalar-twisted group factors of ICC groups commensurable with property-(T) lattices over characteristic-zero local fields and arbitrary ICC group factors. Every such bimodule is a summand of finite sums of models arising from finite-index subgroup isomorphisms and finite-dimensional projective representations. The classification also recovers the group, scalar cocycle and amplification scale up to the stated stable equivalence.

Papers (2)

1. Arithmeticity of twisted finite correspondences for lattices over local fields

   23 September 2026 · Preprint, not peer reviewed · PDF

   We prove arithmetic exhaustion for bifinite correspondences between arbitrarily scalar-twisted group factors of ICC groups commensurable with property-(T) lattices over characteristic-zero local fields and twisted group factors of arbitrary countable ICC groups. Every such correspondence is a closed summand of a finite direct sum of models obtained from actual finite-index subgroup isomorphisms and finite-dimensional projective representations of the matched cocycle ratio. The proof includes reducible products, mixed real and finite places, and quaternionic and Cayley rank-one factors.

2. The arithmetic category and stable recovery of lattice factors

   23 September 2026 · Preprint, not peer reviewed · PDF

   We prove stable canonical recovery for scalar-twisted group factors of ICC groups commensurable with property-(T) lattices over characteristic-zero local fields. Every specified stable isomorphism to a scalar-twisted factor of any countably infinite ICC group recovers the group, the cocycle up to a normalized cochain, and equal amplification scales, with an implementing partial isometry in the given matrix corners. We compute the arithmetic correspondence subcategory for arbitrary countable ICC groups, including all bounded maps, summands, conjugates, and Connes fusion, and combine it with the companion's arithmetic exhaustion theorem. Multiplication also recovers arbitrary finite-index factor neighbors, with the exact projective condition on the matched cocycle ratio.

Status

Preprint. The papers have not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.