1 · The essentials
These manuscripts study whether a mathematical object built from a group still remembers the group it came from. They also ask which tightly constrained connections can exist between two such objects. For the particular groups covered by their assumptions, the main manuscript claims that every connection of this kind comes from a specified recipe involving smaller parts of the groups and finite-dimensional data. This remains the claim when the construction is modified by scalar twists. The companion manuscript claims that a specified comparison between two objects can recover the groups, the twists, and the scale of the comparison in the stated sense. Together, the manuscripts describe both the allowed connections and the information those connections preserve. The main result is not formalized in Lean and has not been formally verified.
A picture to help (an imperfect image, not to be taken literally)
As an imperfect image, imagine two assembled cabinets and a tightly constrained connector between them. The classification says that every allowed connector is a component of a finite assembly made from specified matching parts, while the recovery result says that a specified comparison reveals the underlying construction data. This image does not capture the exact mathematical restrictions on the groups or their twists.
Why it matters
The claimed classification turns a question about all finite-index connections between these operator algebras into a description using finite-index subgroup isomorphisms and finite-dimensional projective representations. The companion adds recovery of the group, scalar cocycle, and amplification scale under the stated stable comparison. Its treatment of maps and composition also describes how the classified connections fit together, rather than listing them in isolation.
2 · Going further
The precise setting involves scalar-twisted group factors of ICC groups commensurable with property- lattices over characteristic-zero local fields. The other side may be a scalar-twisted group factor of any countable ICC group. The main question is to classify bifinite correspondences, also described in the repository summary as finite-index bimodules, between these factors. The scalar twists are arbitrary within this setting.
The main manuscript claims arithmetic exhaustion: every such correspondence is a closed summand of a finite direct sum of models obtained from actual isomorphisms between finite-index subgroups and finite-dimensional projective representations of the matched cocycle ratio. Thus the description allows both finite assembly and passage to a summand; it does not say that every correspondence is itself a single model. The abstract explicitly includes reducible products, mixed real and finite places, and quaternionic and Cayley rank-one factors. It states this structural reduction but does not supply the intermediate argument in the provided text.
The companion manuscript claims stable canonical recovery. 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. It also computes the arithmetic correspondence subcategory for arbitrary countable ICC groups, including bounded maps, summands, conjugates, and Connes fusion, and combines this computation with the main manuscript's exhaustion claim. Finally, it claims recovery of arbitrary finite-index factor neighbors through multiplication, subject to the exact projective condition on the matched cocycle ratio.
Useful notions
- Groups and finite-index subgroups
- Group von Neumann algebras and factors
- Scalar cocycles and projective representations
- Bimodules and finite-index correspondences
- Stable isomorphisms and amplification
What was known before / what is new
Before
The supplied text frames the problem using twisted group factors, finite-index correspondences, and stable isomorphisms. It gives no account of earlier classification results or historical milestones, so it does not establish which parts were previously known.
New
The main manuscript's stated contribution is exhaustion of all bifinite correspondences in its setting by the specified subgroup-and-representation models, allowing finite sums and closed summands. The companion claims stable canonical recovery and a computation of the arithmetic correspondence subcategory, including its maps and composition. It combines that computation with exhaustion and extends the recovery description to finite-index factor neighbors under the stated projective condition.
Limits and assumptions
The exhaustion and stable-recovery claims require the lattice-side group to be ICC and commensurable with a property- lattice over a characteristic-zero local field. The broad freedom on the other side—an arbitrary countable ICC group—does not remove those lattice-side hypotheses. Recovery is in the stated stable sense: the cocycle is recovered up to a normalized cochain, with equal amplification scales, rather than without any equivalence qualification. The abstracts do not give the full argument or an explicit formula for the exact projective condition. The main result is not formalized in Lean and has not been formally verified. The supplied text identifies no specific remaining open problem.
Mini glossary
- ICC group —
- A group in which every nonidentity element has an infinite conjugacy class.
- Commensurable groups —
- Groups that have isomorphic finite-index subgroups.
- Scalar-twisted group factor —
- A group von Neumann algebra whose multiplication incorporates a scalar cocycle and whose center consists only of scalars.
- Bifinite correspondence —
- A bimodule connecting two factors with a finiteness condition on both sides.
- Projective representation —
- A representation in which multiplication is respected up to scalar factors encoded by a cocycle.
- Closed summand —
- A closed component that can be split off as part of a direct-sum decomposition.
Keywords : Twisted group factors · Finite-index correspondences · Stable recovery
AI-generated explanation based on the manuscript. Unofficial. Refer to the manuscript for the authoritative version.
3 · Technical details and sources
Claim made in the manuscript (source text)
Classifies finite-index bimodules between scalar-twisted group factors of ICC groups commensurable with property- 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.
To be verified: the proof is written in the manuscript, but no software has checked it and no validation by independent mathematicians is established. It may contain errors.
Manuscripts in this family
Arithmeticity of twisted finite correspondences for lattices over local fields
23/09/2026We prove arithmetic exhaustion for bifinite correspondences between arbitrarily scalar-twisted group factors of ICC groups commensurable with property- 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.
The arithmetic category and stable recovery of lattice factors
23/09/2026We prove stable canonical recovery for scalar-twisted group factors of ICC groups commensurable with property- 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.