The classification problem for operator algebraic varieties and their multiplier algebras
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.
Bibliographic record
Abstract
We study from the perspective of Borel complexity theory the classification problem for multiplier algebras associated with operator algebraic varieties. These algebras are precisely the multiplier algebras of irreducible complete Nevanlinna-Pick spaces. We prove that these algebras are not classifiable up to algebraic isomorphism using countable structures as invariants. In order to prove such a result, we develop the theory of turbulence for Polish groupoids, which generalizes Hjorth’s turbulence theory for Polish group actions. We also prove that the classification problem for multiplier algebras associated with varieties in a finite-dimensional ball up to isometric isomorphism has maximum complexity among the essentially countable classification problems. In particular, this shows that Blaschke sequences are not smoothly classifiable up to conformal equivalence via automorphisms of the disc.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it