A dynamical Shafarevich theorem for endomorphisms of ℙ^{ℕ}
Bibliographic record
Abstract
We prove a dynamical analogue of the Shafarevich conjecture for morphisms <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f colon double-struck upper P Subscript upper K Superscript upper N Baseline right-arrow double-struck upper P Subscript upper K Superscript upper N"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo>:</mml:mo> <mml:msubsup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">P</mml:mi> </mml:mrow> <mml:mi>K</mml:mi> <mml:mi>N</mml:mi> </mml:msubsup> <mml:mo stretchy="false"> → </mml:mo> <mml:msubsup> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">P</mml:mi> </mml:mrow> <mml:mi>K</mml:mi> <mml:mi>N</mml:mi> </mml:msubsup> </mml:mrow> <mml:annotation encoding="application/x-tex">f:\mathbb {P}_K^N\to \mathbb {P}_K^N</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of degree <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="d greater-than-or-equal-to 2"> <mml:semantics> <mml:mrow> <mml:mi>d</mml:mi> <mml:mo> ≥ </mml:mo> <mml:mn>2</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">d\ge 2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , defined over a number field <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper K"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding="application/x-tex">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . This extends previous work of Silverman [Pacific J. Math. 295 (2018), pp. 145–190] and others in the case <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper N equals 1"> <mml:semantics> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">N=1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> .
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| 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".