Source and verification
This article explains family 295 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.
π·οΈ Preliminaries: bounded cocycles
A von Neumann algebra is a unital algebra of bounded operators on a Hilbert space, closed under adjoints and weak operator limits. Its multiplication is associative, but generally not commutative. This article concerns bounded multilinear identities involving that multiplication; no previous course in homological algebra is required.
Let be the space of bounded complex -linear maps from to , with norm
For a tuple , let denote the shorter tuple obtained by replacing adjacent entries with . The Hochschild differential forms a -linear map by multiplying successive inputs and adding two outside multiplication terms:
Associativity makes the terms in cancel in pairs, so . A map satisfying is a cocycle. A map of the form is a coboundary, and is its primitive. The quotient of cocycles by coboundaries is .
The degree-two equation
A bounded bilinear map is a cocycle when
Vanishing of its class means that a bounded linear map satisfies
Thus the question asks whether every compatible bilinear error can be removed by a bounded linear correction.
Here βboundedβ refers to this ordinary operator norm. Complete boundedness, which would require uniform bounds after all matrix amplifications, is a stronger condition and is not an assumption. The quotient uses the actual image of , without taking its closure: a sequence of approximate corrections would not suffice.
π·οΈ The manuscriptβs vanishing theorem
Higher bounded cohomology
The family manuscript states that for every complex von Neumann algebra and every integer ,
Equivalently, every bounded -cocycle has an -valued bounded primitive of degree . There is no separability or type restriction. (OpenAI, 2026)
The coefficient space is part of the assertion. If acts on a Hilbert space , finding a primitive with values in the larger algebra would not establish this theorem.
For comparison, in degree one the cocycle equation says that a map is a derivation, . The classical inner-derivation theorem handles that degree. The new scope described here starts at degree two.
Two analytic notions will organize the proof. A normal linear map is ultraweakly continuous; a multilinear map is separately normal when this holds in each variable with the others fixed. A faithful normal tracial state on a finite algebra supplies the Hilbert norm
A map is continuous in -norm on bounded balls if and imply . For linear maps this gives a uniform continuity modulus on each fixed operator norm ball.
The central new argument treats a type algebra with separable predual and faithful normal tracial state. In this usage the algebra has no type-I central summand, but may have a nontrivial center. Separable predual means that its space of normal functionals is separable. For a separately normal cocycle in this setting the construction gives the useful bound . The later reductions establish the unrestricted theorem; they do not assert this same bound for every original cocycle.
π·οΈ Harmonic averaging and the primitive
The manuscript constructs a symmetric countably supported probability measure on the unitary group . Symmetry means that and have the same law. Its positive-mass atoms include a -norm dense set of unitaries.
The crucial analytic statement is a Liouville theorem: if a bounded linear map is continuous in -norm on bounded balls and satisfies
then . Positivity and complete boundedness of are not required. The measure is chosen for , independently of .
First see how this theorem produces a primitive. Write and average in the last input:
Unitary multiplication preserves norms, so is contractive and . Pointwise ultraweak compactness supplies a convergent subnet with limit . Since
the limit satisfies . Passing through the limit is justified by first truncating its countable probability sum and then uniformly bounding the remaining tail.
For fixed , separate normality of supplies a -norm continuity modulus for . Right multiplication by each walk product preserves both relevant norms, so all the averages share that modulus. Ultraweak lower semicontinuity of transfers it to . The limit need not itself be normal; the retained modulus is sufficient.
Liouville therefore gives
To identify , evaluate the original equation at , multiply the output by , and average over the same CesΓ ro mixture of walk laws. Put . Writing and using the adjacent-product notation above, the resulting identity is
Taking the limit gives . Thus is the required primitive, with . This argument does not assume that commutes with the Hochschild differential.
Why normality supplies the continuity modulus
Let be bounded and normal. Suppose a uniformly bounded sequence tends to zero in -norm while its images stay a fixed distance from zero. Spectral truncation replaces each input by an operator supported on a projection of arbitrarily small trace, retaining a definite part of the output norm.
Choose a subsequence whose support traces are summable. The joins of the tail supports decrease to zero. Normality and lower semicontinuity then produce operators on mutually orthogonal two-sided support projections, with and . Every signed sum of these inputs has norm at most , whereas independent random signs give
Boundedness also bounds the left side by , a contradiction for large . This establishes the needed continuity for normal slices of the cocycle.
π·οΈ A random walk with free moments
A unitary is Haar when for every nonzero integer . A family is free Haar when every nonidentity reduced word in the unitaries and their inverses has trace zero. βReducedβ means that neighboring inverse pairs have been canceled.
The walk is designed so that finitely many independent long products approach the joint moments of free Haar unitaries along selected times. An imported theorem of Popa supplies finite unitary configurations approximating any prescribed finite collection of free-moment tests. The manuscript also treats nonfactor algebras by measurable selection in their factor decomposition.
The probabilistic construction uses rare levels. With
level has probability and contains unsigned unitary labels, each sampled with an independent uniform sign. A positive remaining weight is assigned to a symmetric measure on a dense sequence of base unitaries. At stage , choose a finite set capturing base mass greater than .
Among independent paths of length , the desired event says that each path contains a level- label, none of those labels repeats anywhere regardless of sign, no later level appears, and all base increments lie in . Its failure probability is at most
which tends to zero. The four terms control later levels, omitted base atoms, label collisions, and paths missing the current level. For example, makes the first term , while controls the last.
Each path now has a label unique to it and to the entire path list. Treating all other labels as coefficients, these distinguished letters force every nontrivial reduced word in the path products to have small trace. All requirements at each stage are finite and are imposed simultaneously before constructing the next level.
The conclusion is convergence of scalar joint moments in probability. Operator norms of polynomials in the sampled products are not asserted to converge.
π·οΈ From harmonic maps to a rigidity problem
For a harmonic , let be the walk and set
Harmonicity makes an -valued martingale, bounded by . Orthogonality of its increments gives a limit and errors
If the limit is deterministic, conditional expectation forces on every positive-mass atom. Density, the continuity modulus, and linear combinations of unitaries then prove Liouville.
Suppose instead that the limit law has distinct support points . For a long product , its forward first half and reversed inverse last half use disjoint increments. Symmetry makes their laws agree, and independence gives a positive probability that is near while is near . The martingale error bounds justify replacing these halves by the full endpoints. The variables and themselves are not independent.
Concatenating independent signed blocks with pairwise distinct unsigned indices gives another walk. Thus the value of on their product is close to its value on the first block. Reusing a block, even with the opposite sign, would invalidate this argument.
Fix a finite number of blocks and an error tolerance first. The endpoint event has a positive probability, possibly very small. Choose the walk time only afterwards, so the combined failure probability of the free-moment and concatenation tests is smaller. A deterministic successful tuple then exists.
A tracial ultrapower identifies bounded sequences whose -norm difference tends to zero along a free ultrafilter. This turns those increasingly accurate finite tuples into exact free Haar unitaries in . Bounded-ball continuity makes the coordinatewise map well defined. For every nonempty signed word with distinct unsigned indices,
The remaining rigidity theorem says that a bounded map with this continuity and these identities in a finite tracial algebra must have . Freeness from or is not needed.
π·οΈ The rigidity mechanism
The first-letter identities cannot immediately be applied to powers of one generator, because such powers repeat its index. The manuscript instead averages the exact free family:
The norm bound follows from the free-word length estimate
It is applied only after exact freeness has been obtained. A second ultrapower supplies and the induced map .
Expand ordered products of blocks . Their reduced words begin and end positively and have no scalar term. Among words of a fixed reduced length , those with a repeated surviving index number , while each coefficient is . Their total -norm is therefore ; the length estimate upgrades this to operator norm for each fixed polynomial. Discarding them leaves words covered by the first-letter identity.
Consequently acts by on these ordered block products in , and by on their adjoints. A moment calculation identifies the distribution of :
The moments count noncrossing cancellation pairings. The displayed probability measure has those moments and no atom at zero, so faithfulness implies that has zero kernel. Its polar part is unitary because the algebra is finite.
Polynomial approximation first transfers the block identities to . These are contractions converging to in -norm; bounded-ball continuity then gives
To force , use the analytic polynomials
Their imaginary parts are uniformly bounded on the circle, whereas their real parts are at least within angular distance of . Boundedness of and the two power identities therefore bound uniformly for every rotation .
On each short spectral arc, rotate it near and invert the real part within that spectral corner. For its projection , this yields , with independent of the arc and . Partitioning the circle into such arcs gives
The trace weights sum to one, so the number of arcs introduces no loss. This proves rigidity, rules out a nonconstant martingale limit, and establishes Liouville. The finite trace is essential to this final step.
π·οΈ Removing separability and type restrictions
For a possibly nonseparable type algebra with faithful normal tracial state, work first with a finite set of inputs. Place , all values , and unital matrix systems of every finite size inside a countably generated von Neumann subalgebra . The matrix systems rule out finite type-I central components of .
The trace-preserving conditional expectation is normal and respects multiplication on either side by elements of . Hence is a separately normal cocycle, and the separable argument gives a primitive of norm at most . Precomposing that primitive with in each input yields a global cochain whose differential agrees with exactly on .
These cochains have a common norm bound. Direct the finite sets by inclusion and take a pointwise ultraweak subnet: every fixed input tuple eventually lies in , so the limit is a primitive everywhere. The subalgebras and expectations need not be nested.
For general , an imported normal-reduction theorem first writes an arbitrary cocycle as a separately normal one plus a coboundary. Classical results handle the central summand with no type- part. The remaining center splits into orthogonal summands, each admitting a faithful normal tracial state.
There is one further compatibility issue: solving a cocycle on a central corner does not automatically solve it on inputs mixing that corner and its complement. For a central projection , define
where has values in . The manuscript constructs an insertion homotopy satisfying
Operationally, inserts just before the first complementary input in the expansion into and components. Adjacent differential terms cancel; merging the inserted projection with that input recovers the omitted term.
Adding to the pulled-back corner primitive corrects the mixed inputs. On each tracial type- piece its norm is at most . On the complementary piece, with classical primitive , the bound is . The maximum of these two bounds permits assembly across all central pieces, including an uncountable family, using the bounded central product and the net of finite partial sums. Finally add back the primitive from normal reduction. This completes the manuscriptβs route to an actual bounded primitive for every original cocycle. (OpenAI, 2026)
π·οΈ Key steps and proof outlines
A normal map cannot retain large outputs on infinitely many tiny supports
The Liouville input requires -norm continuity on bounded balls. For a bounded normal map , suppose , , but . Choose a fixed spectral cutoff with . The part of above that cutoff retains output norm at least and has a two-sided support projection satisfying
Pass to a subsequence with summable support traces and put . Then . Normality lets one compress into sufficiently long disjoint bands while retaining output norm at least . This gives elements with orthogonal two-sided supports and . (OpenAI, 2026)
Every signed sum still has operator norm at most , while independent signs give
Boundedness gives the incompatible upper bound . The common continuity modulus this proves survives every unitary average, and then survives the ultraweak limit by lower semicontinuity. Normality of the limit itself is not needed.
Check the primitive formula in the first nontrivial degree
For a two-cocycle , the original equation is
Multiply by on the right and average over the walkβs CesΓ ro law. With denoting the average of , this becomes
The harmonic limit has by Liouville, so : precisely . In degree , the same calculation contributes the sign . This small example explains why the proof averages the original cocycle equation instead of claiming that averaging commutes with its differential.
Obtain exact equations on finite tests before taking a global limit
To remove separability in the tracial type-II case, fix a finite set . Choose a countably generated subalgebra containing both and the finite set . Also include unital matrix systems of every size, ensuring has no finite type-I central part. Its trace representation has separable predual.
Let be the trace-preserving expectation and define . Bimodularity makes . The separable theorem supplies with and . Extend it to all of by applying in every input slot.
For a tuple from , its adjacent products lie in , and its cocycle value was explicitly included there. Hence this extension satisfies the original equation exactly on . Pointwise ultraweak compactness gives a global limit with the same norm bound. Directed finite subsets eventually contain every fixed tuple, so its equation passes through finitely many terms to the limit. The algebras need not form an increasing chain or have mutually compatible expectations.
Correct mixed central inputs before assembling summands
A primitive inside a central corner accounts only for cocycle evaluations whose inputs have all been cut by . Put . The manuscriptβs homotopy inserts immediately before the first input from , with the corresponding alternating sign.
Expanding each input into its and parts makes the homotopy identity transparent. Merging the inserted with the next input reproduces that input with positive total sign. Every other adjacent merger cancels with its counterpart in the differential; a merger crossing and vanishes. Thus , with norm bound in degree .
This bounded correction supplies the mixed-input terms that a cornerwise argument would otherwise omit. Uniform primitive bounds then permit central assembly. The cohomology section proves these analytic reductions; the free-walk Liouville and harmonic rigidity theorems remain the principal prior inputs.
π·οΈ Connections
Central sequences and regularity also uses tracial approximation, but its comparison and stability conclusions concern different properties. Here the decisive approximation produces harmonic rigidity and a cochain primitive. The two ultrapowers in this proof have distinct roles: the first makes moment identities exact; the second averages that exact free family with a uniform operator norm bound.
π·οΈ Manuscripts and verification scope
- Vanishing of higher bounded Hochschild cohomology β pinned manuscript and companion source.
The family scope page describes selected formalization coverage. The documented selection covers ordinary bounded Hochschild cocycles with values in the complex von Neumann algebra itself, in every degree at least two, without separability or type restrictions. It requires an actual bounded primitive. The degree-one inner-derivation theorem is outside that selection. 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.