Bruinier–Yang conjecture on arithmetic intersections of Hirzebruch–Zagier divisors

At least 15 years old · documented by

Let K=F(Δ)K=F(\sqrt{\Delta}) be a quartic non-biquadratic CM number field with real quadratic subfield FF, let Tm\mathcal T_m be the integral Hirzebruch–Zagier divisor, and let CM(K)\mathcal{CM}(K) be the corresponding CM cycle on the Hilbert modular surface. For a CM type of KK, let K~\widetilde K be the reflex field, with real quadratic subfield F~\widetilde F and discriminant D~=dF~\widetilde D=d_{\widetilde F}. Define

bm=∑pbm(p)log⁡p,b_m=\sum_p b_m(p)\log p,

where

bm(p)log⁡p=∑p∣p∑t=n+mD~2D∈dK~/F~−1∣n∣<mD~Bt(p),b_m(p)\log p=\sum_{\mathfrak p\mid p}\sum_{\substack{t=\frac{n+m\sqrt{\widetilde D}}{2D}\in d_{\widetilde K/\widetilde F}^{-1}\\ |n|<m\sqrt{\widetilde D}}}B_t(\mathfrak p),

and

Bt(p)={0if p is split in K~,(ord⁡pt+1)ρ(tdK~/F~p−1)log⁡∣p∣if p is not split in K~,B_t(\mathfrak p)=\begin{cases}0&\text{if }\mathfrak p\text{ is split in }\widetilde K,\\(\operatorname{ord}_{\mathfrak p}t+1)\rho(t d_{\widetilde K/\widetilde F}\mathfrak p^{-1})\log|\mathfrak p|&\text{if }\mathfrak p\text{ is not split in }\widetilde K,\end{cases}

with ∣p∣|\mathfrak p| the norm of p\mathfrak p and

ρ(a)=#{A⊂OK~:NK~/F~A=a}.\rho(\mathfrak a)=\#\{\mathfrak A\subset\mathcal O_{\widetilde K}:N_{\widetilde K/\widetilde F}\mathfrak A=\mathfrak a\}.

Bruinier–Yang conjecture. The arithmetic intersection satisfies

Tm⋅CM(K)=12bm,\mathcal T_m\cdot\mathcal{CM}(K)=\frac12 b_m,

or equivalently, for every prime pp,

(Tm⋅CM(K))p=12bm(p).(\mathcal T_m\cdot\mathcal{CM}(K))_p=\frac12 b_m(p).

This conjecture gives an explicit formula for arithmetic intersections between Hirzebruch–Zagier divisors and CM cycles in terms of ideal-counting data in the reflex field. Its status is not resolved by the supplied source context.

References

Primary source

Tonghai Yang, “Arithmetic Intersection on a Hilbert Modular Surface and the Faltings Height”, arXiv:1008.1854 (2010).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.