MétaCan
Menu
Back to cohort
Record W2949216979 · doi:10.48550/arxiv.1306.1049

Completeness of the isomorphism problem for separable C*-algebras

2013· preprint· en· W2949216979 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenuearXiv (Cornell University) · 2013
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Operator Algebra Research
Canadian institutionsMcGill University
Fundersnot available
KeywordsSeparable spaceIsomorphism (crystallography)MathematicsMetrization theoremEquivalence relationIsomorphism extension theoremEquivalence (formal languages)Simple (philosophy)Group isomorphismCompleteness (order theory)Pure mathematicsAutomorphism groupOuter automorphism groupAutomorphismMathematical analysisChemistry

Abstract

fetched live from OpenAlex

We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation. This means that any isomorphism problem arsing from a continuous action of a separable completely metrizable group can be reduced to the isomorphism of simple, separable AI C*-algebras. As a consequence, we get that the isomorphism problems for separable nuclear C*-algebras and for separable C*-algebras have the same complexity. This answers questions posed by Elliott, Farah, Paulsen, Rosendal, Toms and Törnquist.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.097
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.184
GPT teacher head0.261
Teacher spread0.077 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it