OpenAI claim summary for Math-256
mathematicsTop Open Problemscontributionliterature_reportClaim: literature report
Summary of a claim published in openai/math; not a claim by this platform.
The main theorem accepts a unital complex $C^*$-algebra and a bounded unital complex-linear algebra map into operators on an arbitrary Hilbert space. It produces a bounded invertible similarity to a $*$-homomorphism. This is exactly the recorded unital/nondegenerate convention; the standard unitized formulation extends it to the equivalent nonunital convention. No separability or nuclearity restriction remains.
Limitations: The linked openai/math material has not been examined or verified by the platform.
Manuscript
Contents
Kadison Similarity Problem for C*-Algebras
OpenAI's claim
Every bounded, unital, complex-linear algebra map on a complex C*-algebra is claimed to become a *-representation after similarity, with a universal hyperreflexivity bound for arbitrary von Neumann algebras. The cited manuscript argues for that result; its relation to this problem is specified below.Mathematical statement of the claimed result
Mathematical claim 1.
For any unital complex $C^*$-algebra $A$, any complex Hilbert space $H$ and bounded complex-linear unital algebra homomorphism $\pi:A\to B(H)$, OpenAI claims a bounded invertible $S$ with bounded inverse such that \[ \rho(a)=S\pi(a)S^{-1},\qquad\rho(a^*)=\rho(a)^*\quad(a\in A). \] Thus $\rho$ is a $*$-homomorphism. No initial preservation of involution, separability or nuclearity is assumed; the theorem concerns bounded unital representations rather than arbitrary unbounded algebra maps.Outline of the argument
Manuscript 1 (family 288, 2026-09-23): A free-product corner test combines invariant matrix tensors with a Hankel lower bound to control derivations uniformly. Independence in tracial ultrapowers transfers this estimate to finite factors, and representation and central-decomposition arguments remove separability restrictions. Uniform local implementations yield complete boundedness of derivations; the similarity and derivation equivalences then give the stated homomorphism conclusion.Formal verification
For family 288, the scope page documents the following selections. Selections cover bounded unital representations on arbitrary Hilbert spaces, a universal von Neumann hyperreflexivity bound, and a commutator estimate uniform in every finite amplification size. The documented statement covers the main claim of manuscript 1. Its selected declaration also covers the clause used for this problem. Comparator files: KadisonSimilarity.lean, UniformCommutator.lean. Declarations: OAI.KadisonSimilarity.universalCommutatorTheorem, OAI.KadisonSimilarity.universalHyperreflexivity, OAI.KadisonSimilarity.similarityTheorem, OAI.Kadison.uniform_commutator.This site has not executed the Lean files or checked their dependencies. These descriptions report the scope of the linked declarations, rather than a new verification of the proofs.
Status caveat
OpenAI attributes these results to an internal model. Its release notice cautions that results lacking full formalization can contain mistakes. This site has not independently assessed the proofs; a solved label records the scope of the reported claim.Sources
- OpenAI, Kadison's similarity theorem through uniform derivation estimates, 2026-09-23; citation key
OAI:Kadisons-similarity-theorem-through-uniform-derivation-estimates-September-23-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:similarity. - Family 288: Lean scope.
- Comparator KadisonSimilarity.json.
- Comparator KadisonSimilarity.lean.
- Comparator UniformCommutator.json.
- Comparator UniformCommutator.lean.
- OpenAI catalogue entry.