Open Algebraic Surfaces Book Review by Peter Russell, McGill University Open Algebraic Surfaces
Bibliographic record
Abstract
To put the subject matter of “Open Algebraic Surfaces ” in perspective, let me begin with a very classical question: If k ⊂ L are fields and L ⊂ k(x1, · · · , xn) = k (n) (field of rational functions), is L purely transcendental over k? (Then L = k (d) , d = transcendence degree of L over k. This is the “right ” measure for the dimension of the problem, one can easily reduce it to the case n = d.) The answer is yes if d = 1 by Lüroth’s Theorem. For d = 2 already we have to be more circumspect. The answer is yes for k algebraically closed of characteristic 0 by Castelnuovo’s Theorem. (If char k> 0, separability of k (n) /L is required.) The answer is no for d ≥ 3. This is a celebrated result of the 1970’s [CG]. Lüroth’s theorem can be settled by an elementary algebraic argument. For d ≥ 2, though, our question appears to require a determined plunge into algebraic geometry. It is tempting, but was done in a systematic way only fairly recently, to pose an affine version of our question: If A is a k-algebra and A ⊂ k[x1, · · · , xn] = k [n] (polynomial ring), is A a polynomial ring over k? Then A ≃ k [d] , where d
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.086 | 0.046 |
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".