Belyi定理：覆盖、dessins与定义域

中文摘要 AI 辅助

Belyi定理断言，定义在$\mathbb{C}$上的光滑射影曲线定义在数域上，当且仅当它承认一个至多三个点分歧的非平凡态射到$\mathbb{P}^1$。本文给出了该定理的完整、自足的阐述——包括两个方向，所有下降机制均被证明而非引用——并研究了证明所产生的对象。除阐述外，本文还包含原创结果，并给出完整证明。主要结果是关于Belyi多项式$P_{m,n}(z)=\frac{(m+n)^{m+n}}{m^{m}n^{n}}z^{m}(1-z)^{n}$的结构定理：它们的dessins是双星，满足精确恒等式$P_{m,n}=\pi_{k}\circ P_{m/k,n/k}$，其中$k=\gcd(m,n)$，$\pi_{k}(w)=w^{k}$，且其单演是圈积$\mathfrak{S}_{(m+n)/k}\wr\mathbb{Z}/k$，当且仅当$\gcd(m,n)=1$时恰为全对称群。围绕尖锐下界$d\geq 2g+1$（所有Belyi映射）和$d\geq 4g$（清洁映射），我们研究了达到$d=2g+1$的极值映射：其单演位于交错群中，不必是循环的——最小的非循环例子次数为$5$，亏格为$2$，单演为$A_{5}$，定义在$\mathbb{Q}$上——并且它们满足精确的质量公式$\sum 1/|\mathrm{Aut}|=2(d-1)!/d(d+1)$，该公式由Boccara的循环因子分解计数得到——通过自足的Frobenius计算重新证明——并通过$d\leq7$的完全枚举验证。我们还以$N!$为界，其中$N$为无理分支值的个数，界定了Belyi算法有理化步骤的次数。该理论通过完全计算的例子以及三个平面树的显式$G_{\mathbb{Q}}$-轨道加以说明，其模域是非伽罗瓦三次域$\mathbb{Q}(\sqrt[3]{2})$的三个共轭嵌入。

英文摘要

Belyi's theorem asserts that a smooth projective curve over $\mathbb{C}$ is defined over a number field if and only if it admits a non-constant morphism to $\mathbb{P}^1$ ramified over at most three points. This article gives a complete, self-contained account of the theorem -- both implications, with all descent machinery proved rather than quoted -- together with a study of the objects the proof produces. Beyond the exposition it contains original results, proved in full. The principal one is a structure theorem for the Belyi polynomials $P_{m,n}(z)=\frac{(m+n)^{m+n}}{m^{m}n^{n}}z^{m}(1-z)^{n}$: their dessins are double stars, they satisfy the exact identity $P_{m,n}=π_{k}\circ P_{m/k,n/k}$ with $k=\gcd(m,n)$ and $π_{k}(w)=w^{k}$, and their monodromy is the wreath product $\mathfrak{S}_{(m+n)/k}\wr\mathbb{Z}/k$, the full symmetric group precisely when $\gcd(m,n)=1$. Around the sharp lower bounds $d\geq 2g+1$ (all Belyi maps) and $d\geq 4g$ (clean maps) we study the extremal maps attaining $d=2g+1$: their monodromy lies in the alternating group, they need not be cyclic -- the smallest non-cyclic one has degree $5$, genus $2$, monodromy $A_{5}$, and is defined over $\mathbb{Q}$ -- and they satisfy the exact mass formula $\sum 1/|\mathrm{Aut}|=2(d-1)!/d(d+1)$, obtained from Boccara's cycle-factorization count -- reproved by a self-contained Frobenius computation -- and verified by complete enumeration for $d\leq7$. We also bound the degree of the rationalization step of Belyi's algorithm by $N!$ in the number $N$ of irrational branch values. The theory is illustrated by fully computed examples, and by an explicit $G_{\mathbb{Q}}$-orbit of three plane trees whose fields of moduli are the three conjugate embeddings of the non-Galois cubic field $\mathbb{Q}(\sqrt[3]{2})$.

发表机构

• Department of Mathematics, University of Manitoba（曼尼托巴大学数学系）

机构由 AI 辅助整理，请以论文原文为准。