A simplified proof of the reduction point crossing sign formula for Verma modules
Bibliographic record
Abstract
The Unitary Dual Problem is one of the most important open problems in mathematics: classify the irreducible unitary representations of a group. That is, classify all irreducible representations admitting a definite invariant Hermitian form. Signatures of invariant Hermitian forms on Verma modules are important to finding the unitary dual of a real reductive Lie group. By a philosophy of Vogan introduced in [Vog84], signatures of invariant Hermitian forms on irreducible Verma modules may be computed by varying the highest weight and tracking how signatures change at reducibility points (see [Yee05]). At each reducibility point there is a sign \(\varepsilon\) governing how the signature changes. A formula for \(\varepsilon\) was first determined in [Yee05] and simplified in [Yee19]. The proof of the simplification was complicated. We simplify the proof in this note.
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.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.003 | 0.008 |
| Open science | 0.002 | 0.005 |
| Research integrity | 0.002 | 0.008 |
| Insufficient payload (model declined to judge) | 0.032 | 0.009 |
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".