Source and verification
This article explains family 299 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: characters and central sequences
A character of a complex -algebra is a nonzero -homomorphism to . On a unital algebra it preserves the unit. Characters are precisely one-dimensional representations, so the absence of characters says that the algebra has no scalar representation.
For a nonzero unital algebra and a free ultrafilter on , its norm ultrapower is
Elements are bounded sequences, with sequences identified when their difference tends to zero in operator norm along . The norm central-sequence algebra is
where is embedded by constant sequences. Thus a representative is central when for every fixed . These are norm conditions; a tracial ultrapower using the trace -norm would be a different object.
The Jiang–Su algebra is a standard unital infinite-dimensional -algebra used in regularity and classification. An algebra is -stable if
This tensor product uses representations on separate Hilbert-space factors. The maximal tensor product, used in the finite construction below, instead has the universal property for pairs of commuting representations on the same Hilbert space. For general algebras these tensor products can differ.
🏷️ The character criterion
Kirchberg–Rørdam criterion
For every nonzero unital separable complex -algebra and every free ultrafilter , the manuscript states
No nuclearity, simplicity, trace, dimension or comparison hypothesis is imposed. (OpenAI, 2026)
The criterion turns a representation-theoretic obstruction in the central-sequence algebra into an absorption property of . The finite ingredient is a separate theorem:
A finite tensor construction
If is any nonzero unital characterless complex -algebra, some finite maximal tensor power admits a unital -homomorphism
Separability is not required, and may depend on . The map need not be injective.
Here the dimension-drop algebra consists of continuous functions satisfying
Its irreducible representations have dimensions two, three or six, so it has no characters and is subhomogeneous: irreducible dimensions have a common finite bound. Any nonzero unital image retains these two properties.
The finite theorem does not assert that a finite tensor power is -stable. For separable , the manuscript additionally deduces that the infinite minimal tensor power is -stable and contains a unital copy of .
🏷️ Positive comparison and the missing defect
A positive element is full if the closed two-sided ideal it generates is the entire algebra. Equivalently, it has nonzero image in every irreducible representation.
For positive elements in matrix algebras over , Cuntz subequivalence means that, after adding zero matrix corners when needed, there are matrices with in norm. Write for this comparison. Addition of classes is induced by direct sum; orthogonal positive elements satisfy .
The relevant dimension-drop criterion requires more than two full orthogonal elements. It asks for positive contractions with exact equivalence
and, for some , a comparison of the unused part of the unit:
Here is obtained by applying to a positive operator. The Rørdam–Winter implication used in the manuscript then gives a unital map from . It requires no stable-rank-one assumption. Mere equality of Cuntz classes is not a substitute for the displayed exact equivalence.
The proof therefore has two analytic tasks: construct a full matrix cone in a finite tensor power, then arrange that its unit defect fits into a positive cutoff of one corner.
🏷️ Finite tests that survive every representation
Absence of characters is witnessed by finitely many commutators. The closed ideal generated by commutators of selfadjoint elements is the whole algebra; otherwise its quotient would be nonzero, unital and commutative, and hence would have a character.
Choose a finite expression in those commutators within distance less than one of the unit. The real span of their selfadjoint entries is finite-dimensional, and its image contains a noncommuting pair under every unital representation of .
The manuscript then constructs tensor labels that remain independent in all relevant representations. If and labels are needed, choose with
There are tensors whose images remain linearly independent after any tensor product of linear maps of rank at least two on the individual legs.
The dimension count is useful to understand. It suffices to consider surjections from onto . Their -tuples have parameter dimension ; a normalized potential dependence adds parameters. Vanishing of that dependence imposes independent equations on the label choices. The incidence set therefore projects to a measure-zero subset of all labels, by Sard’s theorem. One choice outside it works simultaneously for every tuple of surjections.
Applying this to represented copies of requires care for maximal tensor products: an irreducible representation need not be a spatial tensor product. The weak closures of its commuting tensor legs are factors, and multiplication is injective on their algebraic tensor product. Real independence of selfadjoint labels also implies complex independence. Together these facts let the labels survive arbitrary irreducible representations, including after an additional tensor factor is attached.
🏷️ A full square-zero element and the matrix cone
Choose a real basis of and suitable independent labels . In a finite tensor power define
If their images commuted in an irreducible representation, independence of both label families would force every represented to vanish, contradicting the finite commutator witness.
Set , which is selfadjoint. Both its positive and negative parts are full. For example, if its image were positive, then for every vector the function
in that representation would be bounded and concave on all of , since its second derivative is the negative of the conjugated double commutator. It must be constant, forcing . Negativity gives the same contradiction using convexity.
Fullness of and supplies finitely many elements whose generated ideal is the whole algebra. Orthogonality gives . Attach another independent label family and set
Then , while independence prevents its image from vanishing in any irreducible representation. Normalize it to a full square-zero contraction of norm one.
Take its polar decomposition in the bidual. Its initial and final support projections are orthogonal, and the polar partial isometry supplies matrix units on their sum. The positive element
commutes with these matrix units. Thus defines a homomorphism from .
Although the matrix units may only belong to the bidual, the image belongs to the original algebra: each is one of , and approximation by polynomials vanishing at zero handles every . Unitization gives
where consists of the continuous -valued functions on whose value at zero is scalar, and is a finite maximal tensor power of . The element is full. No polar partial isometry or support projection is asserted to lie in .
🏷️ A cube construction for the unit defect
Write . Fullness gives , a cutoff , and a finite positive integer with
This can be obtained from an exact matrix witness after approximating the unit by a finite sum through . The other cone corner gives an orthogonal, exactly equivalent element with .
Choose an integer with , and put
The tensor products choosing or in each leg are orthogonal and equivalent. Tensoring the fullness comparison gives the two-sided bounds
The integers and have different roles and need not agree.
The nuclear cone algebra has tensor powers represented as continuous matrix functions on a cube, with the matrix action in a coordinate becoming scalar when that coordinate is zero. A continuous family of embeddings of indexed by the simplex interpolates among the available tensor legs. At a simplex vertex it uses exactly that coordinate; on a face it uses only the positive-weight coordinates. The family is built using a continuous path from the identity to the matrix flip.
In the -cube define
For , put and choose weights
Using the simplex embeddings , set
They extend continuously by zero at the origin. They are orthogonal and exactly equivalent through , and their sum is . Their defect is the scalar function .
Let and place it in one tensor coordinate at a time:
These elements are pairwise orthogonal because . Wherever is nonzero, the th coordinate exceeds and all others are below . Thus is exactly the th vertex and . It follows that
After applying , retain the same symbols and put . The comparison , tensorized in each coordinate, gives
The auxiliary algebra removes these unequal multiplicities without cancellation in Cuntz order:
Set . Since , functional calculus gives an exact comparison witness:
Consequently . The pair remains exactly equivalent and orthogonal. This is the required defect comparison.
🏷️ Converting the comparison to dimension drop
The manuscript includes the stable-rank-free Rørdam–Winter argument. First, a cutoff of a Cuntz comparison is realized by an element with an exact initial square and a final square in the hereditary subalgebra generated by the target. A hereditary subalgebra generated by is .
This moves the defect into one corner. Two orthogonal copies of the defect are then combined with the original matrix-cone structure. A weighted matrix flip arranges commuting completely positive contractive order-zero maps from and , whose units sum to one. Order zero means preservation of orthogonality of positive elements.
Such maps give the usual presentation of : at a scalar parameter they rescale to commuting copies of and , while at the endpoints only the appropriate one remains. Polynomial evaluation at these fibers proves the resulting map is bounded and extends to a unital homomorphism.
The source checks membership in the original algebra whenever bidual support projections or polar decompositions are used. It also retains the scalar fiber at zero in the section algebra, and weights the flip on the region where the two pieces overlap. These checks prevent an unjustified use of a bidual element as an element of the original algebra. The construction also covers zero defect.
🏷️ Applying the finite result to central sequences
If has no characters, its finite commutator witness lies in a separable subalgebra containing the same unit and still having no characters.
For each finite , reindexing central sequences produces commuting unital images of this inside . At each output index, choose an old coordinate satisfying finitely many algebraic-relation tests and commutator bounds. The latter are legitimate because, at that fixed output index, the other lifted coordinates are fixed elements of . A diagonal choice makes all errors tend to zero in the ordinary limit, and hence along any free ultrafilter.
Injectivity of the reindexed maps is unnecessary. The universal property of the maximal tensor product gives the composite
Its image is a separable subhomogeneous characterless algebra with the ambient unit. The imported Kirchberg–Rørdam absorption theorem for such a central subalgebra gives . Conversely, absorption supplies a central subalgebra of this kind; a character of would restrict to a character of it, a contradiction.
For the infinite-tensor consequence, compose the finite map with the canonical unital quotient from maximal to minimal tensor powers and then include that finite stage in . Its image remains characterless and subhomogeneous even if the map has a kernel. The imported Dadarlat–Toms theorem gives absorption of this infinite tensor power. Transporting through the absorption isomorphism yields a unital copy of . (OpenAI, 2026)
🏷️ Key steps and proof outlines
Fullness supplies a finite, exact comparison witness
The cone-to-dimension-drop argument starts with a full positive corner . “Full” means the closed two-sided ideal it generates is the entire algebra. Consequently there are finitely many such that is close to the unit. Choose a small cutoff so that replacing by leaves
invertible. The cutoff is essential: later geometric supports need a genuine gap. The source’s “From a cone map with a full corner” section turns this approximation into an exact comparison. Set
Since , one has . Invertibility of forces to be invertible. The column therefore satisfies
This is the concrete witness behind in Cuntz comparison; no cancellation property is being assumed. (OpenAI, 2026)
Continuously move a matrix corner without violating boundary conditions
On the cube model of the tensor cone, a coordinate equal to zero requires its matrix factor to be scalar. A matrix embedding chosen arbitrarily at each point need not respect this condition. The simplex family solves that compatibility problem explicitly.
For two factors, let be the flip unitary and use
Its endpoints are the identity and the flip. For several factors, recursively combine the embedding on the first factors with the last one, using and normalized earlier weights . Although those normalized weights may oscillate when , the estimate
is uniform in the earlier embedding and tends to zero. Thus the construction is continuous at the problematic vertex. When a weight is zero, its factor stays scalar by induction. This is why the geometric construction defines an element of the original tensor cone, rather than merely a pointwise matrix formula.
The same membership issue can be checked coefficientwise. Expand a matrix-valued cube section in a basis containing the identity. A coefficient involving nonidentity factors in coordinates must vanish whenever some for . With , the functions converge uniformly to that coefficient. Each approximant belongs to the required tensor algebra. This proves the cube model has exactly the stated boundary conditions.
Absorb multiplicities by amplification, rather than cancellation
The two equivalent orthogonal corners provide orthogonal copies of . Taking and yields
Meanwhile the cube construction produces a defect and a positive element with . Tensoring combines the inequalities in the useful direction:
Geometric support separation gives , so sits entirely where the first corner has value one. Multiplication by then realizes its comparison to exactly. The resulting defect comparison, together with exact equivalence of the two corners, is the input to the manuscript’s dimension-drop criterion. The later central-sequence and absorption steps use this finite construction as an interface; no finite tensor power is claimed to absorb the Jiang–Su algebra merely from this comparison.
🏷️ Connections
Jiang–Su stability and comparison explains other regularity mechanisms involving comparison and central splitting. Here the initial hypothesis is solely absence of characters in the norm central-sequence algebra. The finite tensor construction supplies the additional dimension-drop structure rather than assuming it.
🏷️ Manuscripts and verification scope
- The Kirchberg–Rørdam character criterion — pinned manuscript and companion source.
The family scope page describes selected formalization coverage. The documented selection is the equivalence between absence of nonzero characters on the norm central-sequence algebra and Jiang–Su absorption for every nonzero unital separable complex C*-algebra and every free ultrafilter. No nuclearity, simplicity, trace or comparison assumption is imposed. The finite maximal-tensor dimension-drop construction and infinite minimal-tensor absorption are additional manuscript results; a finite power is not asserted to absorb the Jiang–Su algebra. 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.