The Dixmier-Moeglin equivalence for extensions of scalars and Ore extensions
Bibliographic record
Abstract
An algebra $A$ satisfies the Dixmier-Moeglin equivalence if we have the equivalences: $$P~{\rm primitive}\iff P~{\rm rational}\iff P ~{\rm locally~closed~}\qquad~{\rm for}~P\in {\rm Spec}(A).$$ We study the robustness of the Dixmier-Moeglin equivalence under extension of scalars and under the formation of Ore extensions. In particular, we show that the Dixmier-Moeglin equivalence is preserved under base change for finitely generated complex noetherian algebras. We also study Ore extensions of finitely generated complex noetherian algebras $A$. If $T:A\to A$ is either a $\mathbb{C}$-algebra automorphism or a $\mathbb{C}$-linear derivation of $A$, we say that $T$ is \emph{frame-preserving} if there exists a finite-dimensional subspace $V\subseteq A$ that generates $A$ as an algebra such that $T(V)\subseteq V$. We show that if $A$ is of finite Gelfand-Kirillov dimension and has the property that all prime ideals of $A$ are completely prime and $A$ satisfies the Dixmier-Moeglin equivalence then the Ore extension $A[x;T]$ satisfies the Dixmier-Moeglin equivalence whenever $T$ is a frame-preserving derivation or automorphism.
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.
How this classification was reachedexpand
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".