Source and verification
This article explains family 289 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
How much of an operator algebra is determined by its position inside the bounded operators on a Hilbert space? This family separates three questions. Its first manuscript claims universal stability for two-sided perturbations of von Neumann algebras. The companions show why one-sided approximation and norm-closed algebras require different conclusions. The mechanisms are a correction of approximately multiplicative maps, an almost-commuting-matrix obstruction, and a sequence algebra that remembers how an inclusion sits inside its ambient algebra.
🏷️ Three perturbation questions
Throughout, algebras are complex, unital, and share the identity of their represented Hilbert space. A concrete -algebra is an adjoint-closed subalgebra of closed in operator norm. A von Neumann algebra is also closed in the weak operator topology, meaning convergence of all coefficients . For a unital adjoint-closed algebra , its weak closure is its double commutant , where consists of the operators commuting with every element of .
Write for the closed unit ball. Define the directed unit-ball distance and the symmetric Kadison–Kastler distance by
The one-sided near-inclusion gap instead is
Here the approximant in need not be a contraction. Rescaling it gives ; there is no bound on the reverse gap from this alone.
A spatial conjugacy is an equality for a unitary on the given . A spatial embedding replaces equality by inclusion. Both retain information about the representation beyond abstract algebraic isomorphism. Moreover,
Thus a small implementing unitary supplies small distances. The question is whether distances force such a unitary.
| Setting | Smallness hypothesis | Manuscript conclusion |
|---|---|---|
| Von Neumann algebras | Two-sided | Uniform near-identity conjugacy |
| Von Neumann algebras | One-sided | Embeddings can exist with every implementer bounded away from |
| Norm-separable -algebras | Two-sided | Arbitrarily close examples with no spatial conjugacy |
The positive statement has the quantifiers
The tolerance depends only on , before the algebras, their types, representations, or Hilbert-space cardinalities are chosen. The first manuscript claims this statement without separability assumptions. (OpenAI, 2026)
🏷️ Matrix control and correction of a positive map
For a linear map , its amplification acts entrywise on operator matrices. The completely bounded norm is . A unital completely positive map, abbreviated UCP, preserves the identity and positivity at every matrix size. Such maps are complete contractions, but need not preserve products.
For von Neumann algebras , the positive proof repeatedly constructs a UCP map close to a faithful normal representation . Here normal means ultraweakly continuous. Its correction criterion assumes
Why is the reverse gap present? Complete isometry of gives , so is injective with closed range . Every contraction of has distance at most from . A proper closed linear subspace would have a quotient map of norm one. Therefore .
Now transport multiplication through the linear bijection:
This is an associative product. At all rectangular matrix sizes, inserting the product-preserving map gives
For a bilinear map, the displayed norm controls sums of products obtained by multiplying arbitrary rectangular operator matrices; it is the Haagerup product norm used by the manuscript. An imported multiplication-perturbation theorem corrects by a linear change of coordinates preserving adjoints. Composing with produces a normal -isomorphism satisfying .
To implement it on the original Hilbert space, place and diagonally on . The switch has commutator controlled by . A commutant-distance estimate provides an off-diagonal intertwiner close to the identity. Its unitary polar part gives
The original UCP map need not be normal. This matters when it is obtained by taking weak limits. (OpenAI, 2026)
🏷️ The positive stability architecture
A factor is a von Neumann algebra whose center consists of scalar operators. A factor has a faithful normal tracial state and no minimal nonzero projections. Its standard trace representation is on , with left multiplication and cyclic vector ; right multiplication supplies the commuting action.
For finite factors, the source combines two separate inputs. An absolute commutator-amplification estimate converts ordinary norm control into matrix control. A boundary argument constructs the approximately identity isomorphism to which that estimate can be applied. A derivation estimate alone does not choose a multiplicative matching between nearby unit balls.
The factors are first moved into common tracial position, sharing and the left and right actions of an irreducible hyperfinite subfactor . Hyperfinite here means generated in the weak topology by increasing finite matrix algebras; irreducible means .
Choose a countable strongly dense subgroup and nearby unitaries . Their multiplication defects are small. The source corrects them over an amenable nonsingular action on a probability space , obtaining measurable fields with
This is a cocycle over the action. It does not assert that the possibly nonamenable group admits the same averaging on a point.
Two boundary comparisons are used. One intertwines the separate left and right actions on ; another produces actual unitary trace vectors inside . Double ergodicity forces their combined equivariant Hilbert-space vector field to be constant. At a suitable boundary pair, the resulting Hilbert-space unitary sends each to , with uniformly close to .
Linearity and the separating property of extend this assignment to a unital linear map . Applying it to for self-adjoint , then comparing the first two Taylor coefficients of the unitary identity, shows preservation of adjoints and squares. Thus it is a Jordan map. The reverse gap proves surjectivity. The factor target forces either multiplication preservation or multiplication reversal. The latter would make all commutators small, contradicting two anticommuting symmetries in a copy of .
Transporting this isomorphism back gives ordinary norm closeness on the original . Applying commutator amplification to its paired representation upgrades that bound to complete boundedness; the switch-and-polar argument gives the desired small unitary.
For infinite factors, the manuscript uses modular theory. A cyclic separating vector defines the closed antilinear operator ; its polar decomposition yields a positive modular operator and automorphisms implemented by . After an auxiliary tensor preparation, a small change of position makes both algebras invariant under one modular action.
Their crossed products, generated by the algebras and translations implementing that action, can then be compared. One is a semifinite factor with finite corners. The finite-factor result conjugates corresponding corners and hence the crossed products. Averaging gives a UCP map back to the base algebras; slicing the auxiliary tensor factor gives another such descent. The correction criterion supplies the spatial conjugacies.
Finally, center decomposition assembles the factor results. For nonseparable , finite collections of operators and vectors are placed in suitable separable reducing subspaces. Local small unitaries are extended by the identity. The proof takes a pointwise weak limit of their conjugation maps, which remains UCP and close at all matrix levels. Finite coefficient tests put its range in . It does not take a weak limit of unitaries and declare that limit unitary. The UCP criterion finishes the argument with tolerances chosen before all finite tests. (OpenAI, 2026)
🏷️ One-sided gaps and almost commuting matrices
The first companion constructs separable examples with , but an absolute such that every unitary implementing has for all sufficiently large . An embedding does exist in every example. (OpenAI, 2026a)
The finite-dimensional obstruction begins with clock and shift matrices for :
Their commutator norm tends to zero. Yet they cannot approach commuting unitary pairs. For a pair whose multiplicative commutator avoids , define
The trace is unnormalized and the logarithm principal. The determinant of a multiplicative commutator is one, so is an integer and remains constant along paths avoiding the cut. For the clock–shift pair it equals one; for a commuting pair it equals zero. Hypothetical close commuting approximants can be joined by short unitary logarithm paths whose commutators stay near the identity, giving the contradiction.
To turn this into an algebra perturbation, the source constructs circle-indexed representations of the countably generated free group on :
Along distinct generators, converges weakly to , where projects onto the identity basis vector. Substituting and into the circle variable gives representations whose weak limits retain those matrices.
For , define and the diagonal unitary . Let be the commuting left and right regular representations of . Set
The map need not be a representation, but is still unitary, and .
The essential estimate holds on the whole source unit ball. Reordering four Fourier expansions yields a bounded operator in . Telescoping powers gives , while summability of the coefficient first moments gives
with independent of matrix dimension. Bounds merely on generators would not establish this near inclusion.
A hypothetical sequence of embeddings tending to the identity would produce a representation of by multiplying the conjugated left action with the right action. Its two factor algebras commute. Their weak limits recover operators close to supported copies of .
Compression to an arbitrary finite subspace could destroy commutation. The proof first replaces the intended support projections by nearby spectral projections in the two commuting algebras. Their product is a common finite-dimensional projection. A small polar unitary identifies its range with the original matrix space; the compressed operators commute across adjoints, so their polar parts are commuting unitaries close to . This contradicts . The construction supplies no reverse near-inclusion bound. (OpenAI, 2026a)
🏷️ Close norm-closed algebras with no spatial conjugacy
The second companion strengthens the negative conclusion while changing the class of algebras: for every it constructs norm-separable unital -algebras on a common separable with and , but no unitary conjugating onto . It does not assert abstract nonisomorphism. (OpenAI, 2026a)
Let , where is norm-separable and has scalar center. On , form
This is plus the constant -valued sequences. Keeping a finite prefix and replacing its tail by an approximating constant proves one direction of
Testing constant sequences proves the reverse direction. Both sequence algebras have commutant the bounded diagonal -valued sequences, so their weak closures agree.
Their centers are the convergent scalar sequences. Thus any spatial conjugacy must permute the intrinsic minimal central coordinate projections. On each coordinate it is a unitary normalizing . Pulling back a constant forces one sequence of these normalizers to satisfy
The same works for every , hence for each finite list simultaneously.
Now test the relative tensor identity
Both sides are concrete operator norms, on and . The identity survives normalizers of and simultaneous norm limits: both error sums are bounded by . If it holds for and fails for , the sequence algebras cannot be spatially conjugate.
The source realizes this with a tree deformation of the regular representation of , satisfying
The construction uses unit vectors and , where deletes the last letter. Their Gram matrix is , so left translation defines a unitary representation. The norm comparison reduces to the finite path from to , with a geometric-series bound independent of path length. A globally bounded change of basis is not needed.
Put and use . The common algebra is generated by , both second-factor representations, and all second-factor matrix units. Its commutant is , and its center is scalar. Absorption gives a unitary within of conjugating to .
For , a tensor-coordinate change puts it on the second factor and on the first, proving the tensor identity. For , choose and . The identity vector gives
The second estimate uses absorption and the creation/cancellation split of free shifts: orthogonal output ranges control the creation part by , and orthogonal input domains control the cancellation part by another . Taking violates the identity.
Consequently and have distance at most but no spatial conjugacy. The small unitary conjugating the limit subalgebras does not normalize ; the sequence construction is what makes their relative position an obstruction to every implementing unitary. (OpenAI, 2026a)
🏷️ Review scope
All three READMEs and main files were read, together with the complete principal sections of the near-inclusion paper and the sequence-algebra construction. The positive stability review covered its statements, foundations, selected finite-factor proof, modular and crossed-product interfaces, final finite-test argument, and comparison of uniformities. Its full free-word amplification, boundary, modular alignment, and measurable-selection proofs, and the external perturbation theorems, were not independently verified.
🏷️ Key steps and proof outlines
The reverse gap is used to prove surjectivity
Suppose the positive argument has constructed with , where is a faithful representation. Then , so the range is closed. If were larger than , its quotient map would have norm one: this is the definition of the quotient norm, or follows by scaling elements nearly attaining it. But the reverse gap says every element of is within of , making the quotient map’s norm strictly less than one. Thus is onto. (OpenAI, 2026c)
This is the exact logical point where a two-sided hypothesis is needed. Once exists, associativity of the transported product is automatic, and the multiplication-perturbation input can correct it. A one-sided inclusion estimate does not provide this quotient contradiction.
Recover commuting matrices in a genuinely common corner
The near-inclusion companion obtains operators in two commuting von Neumann algebras, close to supported unitaries , where commute and has the desired finite-dimensional range. Put . Then
If is small, the spectrum of lies near zero or one. Its spectral projection belongs to the corresponding algebra and satisfies . Because the two algebras commute, is a projection close to . (OpenAI, 2026b)
The operator
is close to one and intertwines with . Its unitary polar part satisfies and remains close to one. This identifies the perturbed finite-dimensional corner with the original one without changing its dimension.
Why do the compressions commute if need not commute with ? Write and . The two compressed operators are and ; both orders of their product equal , and the same calculation works across adjoints. After transporting by , their polar parts therefore remain in commuting -algebras. They are commuting unitaries close to the original clock and shift matrices, contradicting the integer winding invariant. Arbitrary compression to the original range of would not have preserved this property.
Sequence algebras retain distance but expose spatial rigidity
For the norm-closed companion, let consist of -valued sequences converging in norm to an element of . Its directed distance to equals that of to : for the upper bound retain a finite prefix and replace only the tail by an approximating -element; for the lower bound test constant -sequences and take the limit of any proposed approximant. (OpenAI, 2026a)
If , the center of this sequence algebra consists exactly of convergent scalar sequences, because commuting with every finitely supported -sequence forces each coordinate to be scalar. Its minimal central projections are precisely the coordinate projections. A spatial conjugacy must therefore permute coordinates and supply coordinate unitaries normalizing .
Pulling back a constant sequence , with , forces to converge in norm to some . This is a much stronger restriction than the original metric proximity. The source uses the tensor-norm identity
as an obstruction: normalizers preserve it, and pointwise norm limits preserve it for every finite family. The constructed has this identity and does not. The sequence construction thus turns that asymmetric invariant into failure of every spatial conjugacy, while preserving arbitrarily small two-sided distance and the same weak closure. These arguments complement the positive correction mechanism rather than contradicting its von Neumann hypotheses.
See Also
- Kadison similarity and uniform commutators explains why scalar-to-matrix commutator bounds matter, while the present positive proof also needs a multiplicative matching of the two algebras.
- Reduced projections and traces develops the distinction between norm-closed group algebras, weak closures, and spectral functional calculus.
🏷️ Manuscripts and verification scope
- Universal strong Kadison–Kastler stability — pinned manuscript and companion source.
- Near Inclusions of von Neumann Algebras Without Small Spatial Embeddings — pinned manuscript and companion source.
- Close Separable C*-Algebras Without Spatial Conjugacy — pinned manuscript and companion source.
The family scope page describes selected formalization coverage. The documented selection covers universal near-identity unitary conjugacy for close unital von Neumann algebras, with a tolerance uniform over algebras, representations and Hilbert spaces. The two counterexample manuscripts are not listed in that scope page. 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.