Endomorphism Algebras of Kronecker Modules Regulated by Quadratic Function Fields
Bibliographic record
Abstract
Abstract Purely simple Kronecker modules ℳ, built from an algebraically closed field K, arise from a triplet (m, h, α) where m is a positive integer, h: K ∪ ﹛∞﹜ → ﹛∞, 0, 1, 2, 3, … ﹜ is a height function, and α is a K-linear functional on the space K(X) of rational functions in one variable X. Every pair (h, α) comes with a polynomial f in K(X)[Y] called the regulator. When the module ℳ admits nontrivial endomorphisms, f must be linear or quadratic in Y. In that case ℳ is purely simple if and only if f is an irreducible quadratic. Then the K-algebra End ℳ embeds in the quadratic function field K(X)[Y]/(f). For some height functions h of infinite support I, the search for a functional α for which (h, α) has regulator 0 comes down to having functions η : I → K such that no planar curve intersects the graph of η on a cofinite subset. If K has characterictic not 2, and the triplet (m, h, α) gives a purely-simple Kronecker module ℳ having non-trivial endomorphisms, then h attains the value ∞ at least once on K ∪ ﹛∞﹜ and h is finite-valued at least twice on K ∪ ﹛∞﹜. Conversely all these h form part of such triplets. The proof of this result hinges on the fact that a rational function r is a perfect square in K(X) if and only if r is a perfect square in the completions of K(X) with respect to all of its valuations.
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.001 | 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.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".