The Formal Shift Operator on the Yangian Double
Bibliographic record
Abstract
Abstract Let ${\mathfrak{g}}$ be a symmetrizable Kac–Moody algebra with associated Yangian $Y_\hbar{\mathfrak{g}}$ and Yangian double $\textrm{D}Y_\hbar{\mathfrak{g}}$. An elementary result of fundamental importance to the theory of Yangians is that, for each $c\in{\mathbb{C}}$, there is an automorphism $\tau _c$ of $Y_\hbar{\mathfrak{g}}$ corresponding to the translation $t\mapsto t+c$ of the complex plane. Replacing $c$ by a formal parameter $z$ yields the so-called formal shift homomorphism $\tau _z$ from $Y_\hbar{\mathfrak{g}}$ to the polynomial algebra $Y_\hbar{\mathfrak{g}}[z]$. We prove that $\tau _z$ uniquely extends to an algebra homomorphism $\Phi _z$ from the Yangian double $\textrm{D}Y_\hbar{\mathfrak{g}}$ into the $\hbar $-adic closure of the algebra of Laurent series in $z^{-1}$ with coefficients in the Yangian $Y_\hbar{\mathfrak{g}}$. This induces, via evaluation at any point $c\in{\mathbb{C}}^\times $, a homomorphism from $\textrm{D}Y_\hbar{\mathfrak{g}}$ into the completion of the Yangian with respect to its grading. We show that each such homomorphism gives rise to an isomorphism between completions of $\textrm{D}Y_\hbar{\mathfrak{g}}$ and $Y_\hbar{\mathfrak{g}}$ and, as a corollary, we find that the Yangian $Y_\hbar{\mathfrak{g}}$ can be realized as a degeneration of the Yangian double $\textrm{D}Y_\hbar{\mathfrak{g}}$. Using these results, we obtain a Poincaré–Birkhoff–Witt theorem for $\textrm{D}Y_\hbar{\mathfrak{g}}$ applicable when ${\mathfrak{g}}$ is of finite type or of simply laced affine type.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
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 source (direct Gemma or distilled Codex), 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".