{"schema":"postcutoff/event@1","as_of":"2026-10-30T13:42:00+01:00","url":"https://postcutoff.com/e/2026-10-06-openai-kadison-similarity-problem-lean/","md":"https://postcutoff.com/e/2026-10-06-openai-kadison-similarity-problem-lean/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-06-openai-kadison-similarity-problem-lean","date":"2026-10-06","date_precision":"day","short_title":"OpenAI claims Kadison's similarity problem (Lean)","deck":null,"takeaway":"Family 288 of OpenAI's 6 Oct 2026 release (paper dated 23 Sept) claims a positive answer to Kadison's similarity problem of 1955. The claim: every bounded unital homomorphism from a unital C*-algebra into the operators on a Hilbert space becomes a *-homomorphism after a bounded change of coordinates. The paper also claims one hyperreflexivity constant valid for every von Neumann algebra. Before, only special cases were known: nuclear algebras, cyclic representations, algebras without tracial states, and II₁ factors with property Γ. Lean statements of the similarity theorem, the hyperreflexivity bound and the underlying commutator estimate were accepted in two independent comparator runs. As of 29 Oct we found no assessment by an operator algebraist.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"OpenAI: Kadison's similarity theorem through uniform derivation estimates (23 Sept 2026, PDF)","url":"https://github.com/openai/math/blob/main/preprints/Kadisons-similarity-theorem-through-uniform-derivation-estimates-September-23-2026/paper.pdf","type":"paper","group":"primary","domain":"github.com"},{"n":2,"title":"Lean scope note for family 288","url":"https://github.com/openai/math/blob/main/lean/docs/288.md","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"Lean comparator challenge: KadisonSimilarity.lean","url":"https://github.com/openai/math/blob/main/lean/ComparatorChallenges/KadisonSimilarity.lean","type":"code","group":"primary","domain":"github.com"},{"n":4,"title":"Lean comparator challenge: UniformCommutator.lean","url":"https://github.com/openai/math/blob/main/lean/ComparatorChallenges/UniformCommutator.lean","type":"code","group":"primary","domain":"github.com"},{"n":5,"title":"oai-math-revised: comparator run on all challenges (LEAN_CHECKS.md)","url":"https://github.com/mathcommunity/oai-math-revised/blob/main/docs/LEAN_CHECKS.md","type":"code","group":"primary","domain":"github.com"},{"n":6,"title":"oai-math-revised: comparator results per challenge (25–26 Oct)","url":"https://github.com/mathcommunity/oai-math-revised/blob/main/checks/comparator-2026-10-26/results.tsv","type":"code","group":"primary","domain":"github.com"},{"n":7,"title":"Gilles Pisier: Similarity problems and length (background, 2000)","url":"https://arxiv.org/abs/math/0005077","type":"paper","group":"primary","domain":"arxiv.org"},{"n":8,"title":"oai-math-revised: community notes on the Kadison similarity manuscript","url":"https://github.com/mathcommunity/oai-math-revised/blob/main/preprints/Kadisons-similarity-theorem-through-uniform-derivation-estimates-September-23-2026/AGENT_NOTES.md","type":"discussion","group":"reactions","domain":"github.com"},{"n":9,"title":"MathVet: fidelity table for openai/math (pre-referee)","url":"https://math.vet/openai-math/","type":"discussion","group":"reactions","domain":"math.vet"},{"n":10,"title":"AIM problem 037: Kadison's similarity problem (status review)","url":"https://github.com/MColbrook/AIM/blob/main/problems/037-kadison-similarity.md","type":"discussion","group":"reactions","domain":"github.com"},{"n":11,"title":"Jesse Peterson: Open problems in operator algebras (Problem O.5)","url":"https://www.math.uwaterloo.ca/~j37peter/problems.html","type":"discussion","group":"reactions","domain":"math.uwaterloo.ca"}],"official":7,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI"],"title":"OpenAI's release claims a positive answer to Kadison's 1955 similarity problem, with one hyperreflexivity constant for all von Neumann algebras and a Lean proof of the full statement","summary":"\"Kadison's similarity theorem through uniform derivation estimates\" (OpenAI, 23 Sept 2026, 31 pages, family 288 of the 6 Oct release) claims that every bounded complex-linear unital algebra homomorphism from a unital C*-algebra into B(H), for any Hilbert space H, is similar to a *-homomorphism. That answers Kadison's 1955 question positively, without separability, nuclearity or cyclicity assumptions. The key step is an amplified commutator estimate whose constant does not depend on the von Neumann algebra, the Hilbert space or the matrix size. The same estimate gives one hyperreflexivity constant for all von Neumann algebras. Lean statements of the similarity theorem, the hyperreflexivity bound and the commutator estimate passed the oai-math-revised maintainers' comparator run (25–26 Oct) and MathVet's run. The paper is unrefereed, and no expert check has been published.","key_facts":["Claim (abstract, verbatim): 'We prove that every bounded complex-linear unital algebra homomorphism from a unital complex C∗-algebra into the bounded operators on an arbitrary Hilbert space is similar to a ∗-homomorphism. This resolves Kadison’s similarity conjecture positively. We also obtain one universal hyperreflexivity constant for all unital von Neumann algebras on arbitrary complex Hilbert spaces.'","Scope (paper, after Theorem 1.1): 'The theorem imposes no separability, nuclearity, finite generation, faithfulness, or normality condition.' The similarity may depend on the homomorphism; the paper does not claim an a priori bound on its condition number","Earlier results, as the paper recounts them: the nuclear case (Bunce, Christensen); cyclic representations, and C*-algebras without tracial states (Haagerup, 1983); type II₁ factors with property Γ (Christensen); Kirchberg's equivalence of the similarity property with innerness of derivations; Pisier's similarity degree; Eleftherakis and Paulsen's equivalence with the statement that every von Neumann algebra is hyperreflexive","Route (paper §1.2): Theorem 1.2 gives an absolute constant C with ‖[Y⁽ʰ⁾, X]‖ ≤ C·g_P(Y)·‖X‖ for every von Neumann algebra P, every operator Y, every matrix size h and every X ∈ M_h(P). The hard case is finite factors, 'where the estimate must be uniform in the factor and its representation multiplicity'. It is handled through a tracial free product, Schur–Weyl duality and Popa's relative independence theorem in ultrapowers; Paulsen's theorem and Kirchberg's equivalence then give similarity","Lean scope note (lean/docs/288.md): 'The formalization proves this for arbitrary Hilbert spaces. It also gives one universal hyperreflexivity constant for all unital von Neumann algebras.' In the comparator file KadisonSimilarity.lean, a bounded unital homomorphism is a continuous ℂ-algebra map from a Mathlib C*-algebra into B(H), and similarity means an invertible S with Sπ(a*)S⁻¹ = (Sπ(a)S⁻¹)*. Our reading: this is Kadison's problem as usually stated. The constant is explicit: the hyperreflexivity bound is 2·universalConstant, about 2.4 million by our arithmetic from the file's definitions","Machine checks: KadisonSimilarity and UniformCommutator were accepted in the oai-math-revised comparator run of 25–26 Oct ('Lean default kernel accepts the solution', standard axioms only, no definition-body caveat for these configurations). MathVet rates the formal statement 'full' with a sandboxed comparator pass, a verdict it calls 'pre-referee: one model-assisted reading per family, validated mechanically, not yet re-read by a named human referee'","Trackers: Matthew Colbrook's AIM list marks problem 037 'Kadison's similarity problem' SOLVED (13 Oct), on what it calls 'an AI statement-level review of a published manuscript, not a fresh independent audit of its complete proof or a Lean kernel replay'. Jesse Peterson's list of open problems in operator algebras, last updated on 15 May 2026, before the release, lists it as Problem O.5","Reactions: none from operator algebraists found as of 29 Oct. We searched the web, arXiv, Hacker News and Proofs and Prompts' collection of 100+ reactions; the oai-math-revised notes report 'Follow-up works: None found'. The same release also claims other problems on Peterson's list: the generator problem (family 296), the free group factor problem (287), strong Kadison–Kastler (289) and the Kadison–Ringrose vanishing-cohomology conjecture (295)"],"key_numbers":[],"tags":["math","operator-algebras","c-star-algebras","von-neumann-algebras","kadison-similarity-problem","hyperreflexivity","derivations","lean","openai","openai-math-release"],"science":{"field":"mathematics","subfield":"operator algebras (C*-algebras, von Neumann algebras)","problem":"Kadison's similarity problem (1955): is every bounded representation of a C*-algebra on a Hilbert space similar to a *-representation?","result":"Claimed: yes, for every unital C*-algebra and every Hilbert space, together with a uniform amplified commutator estimate and one hyperreflexivity constant for all von Neumann algebras","open_since":"1955","ai_system":["OpenAI internal model (openai/math release)"],"human_role":"Autonomous AI output released by OpenAI under its fixed procedure (README)","verification":{"key":"peer-review","label":"Peer-reviewed","text":"Lean formalization of the full statement (comparator accepted in two independent runs); no published expert verification yet"},"status":"pending","shock":"A central problem of operator algebra theory, open for 70 years and known in many equivalent forms, was claimed together with a machine-checked proof of its exact statement."},"body_md":"## What happened\n\nIn 1955 Richard Kadison asked whether every bounded representation of a C*-algebra on a Hilbert space is similar to one that\nrespects the adjoint, that is, a *-representation. The problem became one of the central questions of operator algebra theory. It\nhas many equivalent forms: complete boundedness of the representation (Haagerup), innerness of derivations (Kirchberg), a finite\nsimilarity degree (Pisier), and hyperreflexivity of every von Neumann algebra (Eleftherakis–Paulsen). Known positive cases\nincluded nuclear algebras, cyclic representations, algebras without tracial states, and II₁ factors with property Γ.\n\nOpenAI's release contains a 31-page manuscript dated 23 Sept that claims the full answer. Its main estimate bounds every matrix\namplification of an inner derivation by the derivation's scalar norm, with one absolute constant. The difficult case is finite\nfactors, which the paper handles through a free-product model, Schur–Weyl duality and Popa's relative independence theorem. The\npaper also gives one hyperreflexivity constant for all von Neumann algebras. OpenAI's Lean statements of the similarity theorem,\nthe hyperreflexivity bound and the commutator estimate are written with Mathlib's C*-algebras and Hilbert spaces. They were\naccepted in the oai-math-revised maintainers' comparator run and in MathVet's separate run.\n\n## Why it matters\n\nIf correct, the result settles a 70-year-old problem and, through the known equivalences, several others at once. The Lean\nstatement appears to be the problem itself rather than a special case, so the main remaining questions are whether that reading is\nright and whether specialists understand the argument. As of 29 Oct no operator algebraist had published either. The problem\ntrackers that mark it solved say they compared statements with AI help and did not audit the proof.","disputed":[{"label":"Verification","text":"Lean formalization of the full statement (comparator accepted in two independent runs); no published expert verification yet","sources":[]}],"related":[{"id":"2026-10-24-oai-math-revised-community-hub","url":"https://postcutoff.com/e/2026-10-24-oai-math-revised-community-hub/","date":"2026-10-24","date_precision":"day","short_title":"oai-math-revised: mathematicians launch a community hub to revise OpenAI's AI-written math manuscripts (guest post on Tao's blog)","deck":null,"takeaway":"This is the first organized attempt by research mathematicians to digest and credit the OpenAI catalogue.","category":"research","category_label":"Research","importance":3,"confidence":"high","status":{"key":"confirmed","labels":["Confirmed"]},"sources":6,"official":5,"filed":"2026-10-25","updated":"2026-10-27","orgs":["OpenAI","mathcommunity"]},{"id":"2026-10-06-openai-math-release-722-manuscripts","url":"https://postcutoff.com/e/2026-10-06-openai-math-release-722-manuscripts/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI releases 722 AI-written math manuscripts claiming hundreds of open problems","deck":"Including quasi-Riemann, Unique Games, Hodge for CM abelian varieties and free group factors","takeaway":"If even a fraction of these results hold up, this is the largest single jump in mathematical knowledge on record, produced by an AI system in about six weeks.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":79,"official":13,"filed":"2026-10-07","updated":"2026-10-29","orgs":["OpenAI"]},{"id":"2026-10-06-openai-baum-connes-kadison-kaplansky-counterexamples","url":"https://postcutoff.com/e/2026-10-06-openai-baum-connes-kadison-kaplansky-counterexamples/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI claims Baum–Connes and Kadison–Kaplansky counterexamples","deck":null,"takeaway":"Three manuscripts in OpenAI's 6 Oct 2026 math release (family 285, dated 23 Sept) claim the first counterexamples to the Baum–Connes conjecture without coefficients, one of them for a torsion-free group, and a torsion-free group whose reduced C*-algebra has a nontrivial projection, which would refute the Kadison–Kaplansky conjecture. Until now, counterexamples were known only for the version with coefficients. On 26 Oct Guoliang Yu, a leading specialist, posted his own construction of projections of every trace in (0,1), saying it develops arguments from OpenAI's irrational-trace paper. None of the three papers has a Lean proof.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":7,"official":5,"filed":"2026-10-29","updated":"2026-10-29","orgs":["OpenAI"]},{"id":"2026-10-06-free-group-factors-isomorphism-openai","url":"https://postcutoff.com/e/2026-10-06-free-group-factors-isomorphism-openai/","date":"2026-10-06","date_precision":"day","short_title":"OpenAI model claims the free group factor problem","deck":"L(F₂) ≅ L(F₃), so all free group factors are isomorphic (Lean-formalized)","takeaway":"The problem has been one of the best-known open questions in operator algebras for decades.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":4,"official":4,"filed":"2026-10-07","updated":"2026-10-19","orgs":["OpenAI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-29","type":"filed","text":"Created (manuscript abstract, introduction and proof outline, comparator challenge files and configurations, oai-math-revised AGENT_NOTES, results.tsv and logs, MathVet data, AIM problem page and cross-check review, Peterson's problem list; searches of the web, arXiv, Hacker News and Proofs and Prompts found no expert reaction)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-29","run":null,"sources_read":null,"updated":"2026-10-29","human_review":null,"version":{"date":"2026-10-29"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":159,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":98,"in_training_data":false},{"model_id":"gemini-4-argon","name":"Gemini 4 Argon","cutoff":"2026-03","days_after":189,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":128,"in_training_data":false}],"short_url":"https://postcutoff.com/s/openai-kadison-similarity"}