Source and verification
This article explains family 286 of the October 6, 2026 OpenAI collection. Research conclusions are attributed to its manuscripts. The review covers statements, introductions, and selected proof mechanisms; it is not an independent verification of the complete proofs.
Overview
A group von Neumann algebra remembers multiplication through operators, but an isomorphism need not preserve the original group basis. This family claims strong recovery for a specified class of lattices, including arbitrary scalar twists. The first manuscript classifies finite correspondences up to finite sums and summands; the companion identifies the summands and their maps. The resulting integer dimension formulas force stable isomorphisms to preserve scale and recover the given map.
🏷️ Twisted factors and module dimension
For a countable discrete group , the group von Neumann algebra is the weak operator closure of its left regular representation on . It carries the trace . The vectors form an orthonormal basis of its trace Hilbert space .
A normalized scalar 2-cocycle , where , changes the multiplication to . Associativity is exactly the identity
The resulting algebra is . A group is ICC if each nonidentity conjugacy class is infinite. For an ICC group, is a factor: its center consists of scalars. To see the mechanism, conjugation preserves the absolute values of Fourier coefficients of a central vector; square summability forces those coefficients to vanish on every infinite nonidentity class.
A bifinite correspondence from a finite factor to a finite factor is a Hilbert space with commuting normal unital left and right actions, finite in module dimension on both sides. Normality means the actions preserve increasing bounded suprema of positive operators. The actions need not be mutual commutants.
Module dimension differs from ordinary Hilbert-space dimension. A finite right -module has the form , with a projection, and
The matrix trace is unnormalized. This dimension is a positive real number for a nonzero module and equals one for itself. Left module dimension is defined analogously. The companion’s assertion that both dimensions are integers for these particular correspondences is therefore substantial.
An amplification is a corner with unnormalized trace of equal to , equipped with its normalized corner trace. Stable isomorphism permits comparison of such corners, not only of the original factors.
🏷️ The lattice class and the recovery statements
A lattice is a discrete subgroup of a locally compact group with finite Haar covolume. Groups are abstractly commensurable if they have isomorphic finite-index subgroups. Kazhdan’s property says that a unitary representation with almost invariant unit vectors has a nonzero invariant vector.
The manuscripts use the class of countably infinite ICC groups abstractly commensurable with lattices in finite nonempty products of noncompact property- groups . Here is , , or a finite extension of ; is connected, adjoint, and absolutely simple; and denotes the subgroup generated by the unipotent radicals of proper parabolic subgroups. The real factors include higher-rank groups and the quaternionic and Cayley property- rank-one groups. The finite-place factors have relative rank at least two.
For a concrete example, and its finite-index subgroups belong to this class. The general theorem allows mixed local fields, reducible and nonuniform lattices, and torsion. Property alone is not the asserted hypothesis. (OpenAI, 2026) (OpenAI, 2026b)
Stable canonical recovery claimed by the companion
Let , let be any countably infinite ICC group, and let be arbitrary normalized scalar cocycles. Then
holds precisely when and an isomorphism carries the cocycles to one another up to a normalized scalar cochain . At unit scale, every specified isomorphism has the form
for a unitary in the target. All isomorphisms are normal, unital, complex-linear, and preserve the adjoint. (OpenAI, 2026b)
The cochain condition is the exact multiplication constraint
If both cocycles are trivial, is a character. Taking the same factor at both endpoints gives trivial fundamental group: forces .
The family also classifies arbitrary finite-index factor neighbors. A separable factor admits a nonzero bifinite correspondence with precisely when is an amplification of a twisted factor with matched finite-index subgroup data described next. No group presentation for is assumed in advance. (OpenAI, 2026b)
🏷️ Explicit models and the cocycle ratio
Put and . Choose finite-index subgroups , , and an actual isomorphism . A finite-dimensional projective unitary representation supplies the remaining data:
The ratio is forced by the subgroup action on : define . Multiplying two such operators yields the required source multiplier precisely when the displayed equation holds.
Induce this action to using the relative tensor product
Relative tensoring identifies with . Its Hilbert norm uses the operator-valued inner product of bounded module vectors, rather than the ordinary tensor-product norm.
There is a concrete counting-space model. Let and let be the graph subgroup. Place one copy of at every left coset in . The joint action moves these fibers and has multiplier . The right adjoint accounts for the conjugate.
Both coordinate groups act freely on this coset space. Their orbit counts are and , respectively. Each orbit is a twisted regular module with multiplicity . Thus
The first manuscript’s arithmetic exhaustion theorem asserts that every bifinite correspondence is a closed bimodule summand of a finite sum of these models. Only the matched cocycle ratio must have a finite-dimensional projective representation. Neither individual cocycle must satisfy that condition, and the representation need not have finite image. (OpenAI, 2026a)
🏷️ Boundary measurements and finite-dimensional fibers
The main analytic work of the first manuscript starts with an arbitrary correspondence, without a known basis on the comparison side. After finite-index restrictions and removal of compact projective sectors, it works in a weakly mixing setting: the relevant conjugation representation on the mean-zero part of the finite commutant has no finite-dimensional invariant subspace.
The geometric input constructs observations on the flag boundary of the known source lattice. Both boundary copies come from the source; no ambient geometry for is assumed. Initially the observations are positive operator-valued measures: countably additive laws assigning positive operators to measurable sets, with total mass the identity. A projection-valued measure takes orthogonal projection values, so disjoint sets have orthogonal ranges. The proof must show that the observations are projection-valued and that distinct observations commute.
The required output is a simultaneous projection-valued law of nonsingular, essentially invertible boundary maps on . On three copies, the laws comparing slots and must commute even though they share slot zero. This shared-slot statement is stronger than constructing two separate boundary maps.
Here is its role in recovery. Take normal slices in the branch slots. Shared-slot commutation makes the resulting algebra on abelian, allowing disintegration into ordinary projection-valued laws on the fixed space . A measurable transversal for the source-group action gives an orthogonal decomposition into translates of one projection. Finite module dimension makes that projection finite rank, so its spectral measure has finitely many atoms.
The remaining disintegration parameter could still change the atom partition. The source records each partition by a finite set of finite-rank projection orbits, using Hilbert–Schmidt distance. Group representations extending normally to the twisted group factor have matrix coefficients vanishing at infinity: approximate their coefficient densities by finite Fourier polynomials. This ensures the orbit distance separates distinct projection orbits.
Weak mixing makes the diagonal action on two copies of the partition distribution ergodic. Consequently the distance between two independent samples is almost surely constant. Separability forces that constant to be zero: some ball of every positive radius has positive probability, so two samples have positive probability of being arbitrarily close. The partition is therefore fixed almost everywhere. The boundary-map labels themselves need not be deterministic.
Both endpoint groups permute the resulting finite-dimensional atoms. The source action is free with finitely many orbits. Normal coefficient decay makes a comparison-group atom stabilizer finite; ICC and finite source-orbit count make it trivial. Finite right module dimension then gives finitely many comparison-group orbits. The joint stabilizer of an atom is the graph of a finite-index subgroup isomorphism, and its projective action has exactly the cocycle ratio above.
Restoring compact sectors restores the original scalar multiplier. Two-sided finite-index induction gives the original correspondence as a closed summand of a finite sum. The full geometric construction preceding this recovery—ordered boundary transfer, local scale estimates, domain control, locality, and gluing—is a substantive manuscript input, not independently verified in this exposition. (OpenAI, 2026a)
🏷️ Why summands require a separate argument
Integer dimensions of the containing models do not prove integer dimensions of their summands. The companion resolves this using germs of subgroup isomorphisms: two isomorphisms represent the same germ when they agree on a common finite-index subgroup.
For a germ , the action of is . Its full stabilizer contains any chosen presenting graph at finite index. ICC makes itself a graph: an element centralizing a finite-index subgroup has a finite conjugacy class and must be the identity.
Several cosets of can describe the same germ. Their fibers must be grouped into one finite-dimensional representation of before classifying projections onto summands.
A projection that mixes presenting fibers
Present the identity germ using a subgroup of index . The model has dimensions . Its grouped fiber is the permutation representation on ; the constant vectors form an invariant line selecting the standard correspondence of dimensions . The selecting matrix has every entry . Its individual diagonal entries are not projections. Inspecting the original one-dimensional fibers separately would miss the actual summand. (OpenAI, 2026b)
The crucial finite-orbit test says that the only finite -orbit on the germ space is . If a finite-index part of fixes another germ, the two subgroup maps induce equal conjugations on a common finite-index domain. Triviality of finite-index centralizers then makes the germs equal.
Now let intertwine two grouped-fiber models, with blocks . A finite-dimensional source fiber gives
Equivariance makes each block’s Hilbert–Schmidt norm constant along the stabilizer orbit of its target label. A nonzero block must therefore lie in a finite orbit, forcing . Every bounded bimodule map is fiberwise after grouping, and every summand is obtained from invariant subspaces of the finite-dimensional fiber representations.
Thus the actual correspondence, including any selected summand, has dimensions
where the nonzero fiber ranks and subgroup indices are positive integers. This classification also describes adjoints and composition of maps. The companion computes conjugation and relative tensor composition of correspondences through projective induction and finite double-coset formulas, retaining all cocycle phases. (OpenAI, 2026b)
🏷️ Recovering stable scales and the specified map
An isomorphism determines an equivalence correspondence between and . The corner column has dimensions with normalized corner trace. Relative tensor products multiply left dimensions and right dimensions. Combining the two corner columns with therefore gives dimensions
Both are positive integers by the actual-summand classification, and their product is one. Hence . Both dimension sums then equal one, forcing a single orbit, a one-dimensional fiber, and subgroup indices one on both sides. The recovered subgroup isomorphism is consequently an isomorphism of the whole groups; its one-dimensional projective representation is the cochain .
This identifies the correspondence of . Recovering the specified map requires one more step. For actual corner projections and , put . Equal unnormalized traces give a rectangular partial isometry with
The resulting corner map has the same correspondence as . A right-linear unitary on the standard trace module is multiplication by a target unitary. Absorbing that unitary into yields the exact formula . Thus the argument controls the given map in its given corners. (OpenAI, 2026b)
🏷️ Recovering an unknown factor from multiplication
For a bifinite – correspondence with no presentation of , the commutant of the right action is an amplification , containing as a finite-index subfactor. Arithmetic exhaustion grades by finite-dimensional spaces indexed by virtual automorphism germs of .
These spaces initially contain vectors, which need not be bounded operators. For , orthogonality of distinct right translates implies . Apply the finite-index expectation inequality to bounded spectral truncations of to obtain
Products are now legitimate. On a common finite-index subgroup domain, the finite-dimensional orbit criterion gives and .
The identity space is a finite-dimensional algebra. Compress by a minimal projection . If , both and are positive scalar multiples of , with equal scalars by traciality. Normalizing makes it a corner unitary; any other vector of that degree is its scalar multiple.
The nonzero degrees form a countable group, since products of these unitaries cannot vanish. Their multiplication defines a scalar cocycle, and their trace-orthonormal basis identifies with a twisted group factor. The source further proves ICC, commensurability with , and the exact cocycle-ratio condition by examining the identity matrix block. For an untwisted source, that ratio condition becomes finite type of the target cocycle. For arbitrary source twist, only the ratio is required. (OpenAI, 2026b)
🏷️ Verification scope
The review covers the elementary models, selected boundary-to-partition recovery, full-stabilizer and intertwiner arguments, integer-dimension deduction, specified corner maps, and bounded-product reconstruction. It does not independently verify the first manuscript’s complete boundary geometry, local-field estimates, or unbounded-operator gluing. The complete fusion formulas and external rigidity theorems are also outside the selected proof audit.
🏷️ Key steps and proof outlines
Convert a random partition into a deterministic one
The first manuscript’s geometric argument produces a simultaneous boundary law, and disintegration produces a distribution of finite-rank projection partitions. The final determinism argument uses a general probability principle that is useful beyond this setting.
Let be a random element of a separable metric space recording these partitions. Shared-slot commutation and weak mixing imply that the diagonal action on two independent samples is ergodic. Their bounded distance is invariant, hence is almost surely a constant .
For every , separability gives a countable cover by balls of radius . At least one ball has positive probability. Two independent samples both belong to that ball with positive probability, so their distance is at most with positive probability. Constancy forces for every , and hence . Fubini then says almost every sample equals one fixed partition. (OpenAI, 2026a)
More precisely, the random variable records a finite set of projection-orbit classes. Decay of matrix coefficients makes the orbit metric separating, and its Hausdorff metric separates finite sets. A constant such set recovers an actual fixed partition by taking the union of all the represented projection orbits. The boundary labels and the chosen representatives of individual orbits are not required to become constant.
Square summability forbids off-label intertwiners
Once fibers are grouped by the full stabilizer of an isomorphism germ, let be a bounded intertwiner and fix a finite-dimensional source fiber . For an orthonormal basis of that fiber,
Equivariance keeps each block norm constant along the source stabilizer’s orbit of . An infinite orbit cannot carry a nonzero constant in this summable family. The finite-orbit lemma then leaves only . Thus an orthogonal projection onto a correspondence summand is fiberwise in the grouped model. Its fiber ranks are integers, which explains why the dimension formulas survive passage to arbitrary closed summands. (OpenAI, 2026b)
This is stronger than knowing that the containing module has integer dimension. A subprojection in an arbitrary finite factor can have noninteger trace; here the orbit argument reduces every relevant subprojection to an ordinary finite-dimensional invariant subspace.
Establish boundedness before multiplying recovered vectors
For an unknown finite-index extension , the recovered spaces initially lie only in . To multiply them, first take and set . Distinct right translates of have distinct orthogonal degrees, so all nonidentity Fourier coefficients of vanish. Its identity coefficient is , hence
Write and use bounded spectral truncations . Positivity of expectation gives . The finite-index inequality therefore gives uniformly in . Letting proves and .
Now orbit spans of products lie in the finite-dimensional span of products of basis elements. The intrinsic orbit criterion proves and . This ordering avoids manipulating products of arbitrary unbounded vectors.
A minimal identity corner turns degrees into unitary lines
Choose a minimal projection of the finite-dimensional identity algebra . For nonzero , the product rules give and . Faithful traciality forces , so is unitary in the corner. If has the same degree, is scalar, making a scalar multiple of .
Products of these unitaries cannot vanish, so the surviving degrees form a group. Choosing one unitary in each line gives with ; associativity is exactly the cocycle identity. Their orthonormal trace basis identifies the actual corner multiplication with a twisted regular representation. The later subgroup and cocycle-ratio analysis supplies the arithmetic restrictions. These analytic bridges occur in the recovery section of the first manuscript and the arbitrary-endpoint section of the companion.
See Also
- Reduced assembly, projections, and traces introduces group operator algebras and unnormalized trace conventions; this family works with von Neumann factors and finite module dimensions.
- Fixed points in reflexive spaces offers a different use of group actions and invariant structures; the present rigidity statement needs the specified lattice class and finite correspondences.
🏷️ Manuscripts and verification scope
- Arithmeticity of twisted finite correspondences for lattices over local fields — pinned manuscript and companion source.
- The arithmetic category and stable recovery of lattice factors — pinned manuscript and companion source.
No family scope page was present at lean/docs/286.md in the pinned snapshot. This does not establish that all related formalization code is absent. No Lean build, axiom audit, or manuscript-to-formal-statement equivalence check was performed for these notes.
OpenAI collection provides prerequisites and the reading sequence; coverage register records completed and pending families.