• Aucun résultat trouvé

ERRATA AND ADDENDA: ON COMPUTING BELYI MAPS

N/A
N/A
Protected

Academic year: 2022

Partager "ERRATA AND ADDENDA: ON COMPUTING BELYI MAPS"

Copied!
2
0
0

Texte intégral

(1)

ERRATA AND ADDENDA:

ON COMPUTING BELYI MAPS

JEROEN SIJSLING AND JOHN VOIGHT

This note gives some errata for the articleOn explicit descent of marked curves and maps [1].

Errata

(1) In Remark 4.1.4, “marked maps curves” should be “marked maps”.

Addenda

The method of branches also gives a compact proof of the fact that a Galois Belyi map descends to its field of moduli, as a corollary of Theorem 3.2.4. (This descends the curves and the map, but not necessarily the action of the group.) More generally, we have the following.

Corollary. Let (Y, f: Y → X;R) be a map of marked curves over Fsep that is generically Galois. Suppose that Ris nonempty, containing either a smooth point Q∈Y(Fsep) or a smooth point P ∈X(Fsep). Then (Y, f;R)descends to its field of moduli.

Proof. Sincef: Y →X is Galois, there exists a finite subgroup H ≤Aut(Y, f;R)(Fsep)

and an isomorphism of marked maps from (Y, f;R) to (Y, π;R) where π:Y →H\Y

is the canonical quotient map. We apply Theorem 3.2.4, with H in place of G, and from R we take either takeS =P ∈ X(Fsep) or S =π(Q) if Q ∈Y(Fsep).

Repeating the proof of (a), the setB(π, S) of branches is aH-torsor. Repeating the proof of (b), we obtain a Weil cocycle, so descent follows from Theorem 2.1.1.

In a bit more detail, let b ∈B(π, S) be a branch of π whose underlying point Q ∈ Y(Fsep) is in the fiber above S. Given σ, there exists an automorphism φσ:σ(Y) →Y. Since the Galois group acts freely and transitively on the set of branches, we can ensure that φσ sends σ(b) to b: since σ(Q) ∈ σ(π)−1(P), it is mapped toQbyφσ by its defining property of transforming (σ(X), σ(π)) to (Y, π):

π(φσ(σ(Q))) =σ(π)(σ(Q)) =σ(π(Q)) =σ(∞) =∞.

(This property of staying in the fiber is crucial, and not formal!) The Galois property of the map π can be used to rewrite the cocycle in a unique fashion, ensuring the compatibility

φστσσ(φτ)

Date: September 21, 2020.

1

(2)

2 JEROEN SIJSLING AND JOHN VOIGHT

as in the proof of (b), essentially because of the free transitive action again. To be completely explicit, the map on the left sendsσ(τ(b)) tob, whereas the map on the right sendsσ(τ(b)) to

σσ(φτ))(σ(τ(b))) =φσ(σ(φτ)(σ(τ(b))))

σ(σ(φτ(τ(b)))) =φσ(σ(b)) =b

as claimed.

Corollary. A Galois Belyi map(X, f:X →P1;−; 0,1,∞)overQdescends to its field of moduli.

Proof. This is a special case of the preceding corollary.

References

[1] Jeroen Sijsling and John Voight,On explicit descent of marked curves and maps, Res. Num- ber Theory2:27 (2016), 35 pages.

Références

Documents relatifs

Geometric Invariant Theory (GIT) to construct a quotient of either the Chow variety or the Hilbert Scheme which parameterizes n-canonically embedded.. curves in

PROPOSITION 3. Let A be a Gorenstein noetherian local ring con- taining and let I be an unmixed ideal of finite projective dimen-.. Consequently the ring A/I is

The theoretical setting for this paper is a systematic method of constructing Belyi maps of arbitrarily large degree defined over Q and ramified within P.. In brief, the method has

In all cases but one, there is just one Belyi map defined over Q with the given partition triple, the Hurwitz–Belyi map.. All the other Belyi maps are conjugate, the relevant

computed a field of definition for many Bely˘ı maps of small degree and genus 0 using Gröbner methods, with an eye toward understanding the field of definition of regular

Using, on the one side, a general result in linear algebra due to Klingenberg (see [Kli54]) and on the other side, a theorem on the holonomy of pseudo-Riemannian ma- nifolds

[7] Chunhui Lai, A lower bound for the number of edges in a graph containing no two cycles of the same length, The Electronic J. Yuster, Covering non-uniform hypergraphs

Wang, Error analysis of the semi-discrete local discontinuous Galerkin method for compressible miscible displacement problem in porous media, Applied Mathematics and Computation,