← All problems

The rationality conjecture for Mumford–Tate-valued Weil–Deligne representations

Let XX be a proper, smooth algebraic variety over a number field E⊂C{\mathrm{E}}\subset\mathbb C, and let G{\mathbf{G}} be the Mumford–Tate group of the Hodge structure Hi(XC,Q){\mathrm{H}}^i(X_{\mathbb C},{\mathbb Q}). For each prime ℓ\ell, write

ρX,ℓG:ΓE→G(Qℓ)\rho_{X,\ell}^{{\mathbf{G}}}:\Gamma_{\mathrm{E}}\rightarrow {\mathbf{G}}({\mathbb Q}_\ell)

for the associated Galois representation. For a prime v∤ℓv\nmid\ell of E{\mathrm{E}}, let

ρX,ℓ,vWD,G:WDv→G(Qℓ)\rho_{X,\ell,v}^{{\mathrm{WD}},{\mathbf{G}}}:{\mathrm{WD}}_v\rightarrow {\mathbf{G}}({\mathbb Q}_\ell)

be the corresponding Weil–Deligne representation, viewed as G(C){\mathbf{G}}(\mathbb C)-valued after choosing an isomorphism Q‾ℓ≅C\overline{\mathbb Q}_\ell\cong\mathbb C. Two G{\mathbf{G}}-valued Weil–Deligne representations are equivalent, written ρ1∼Gρ2\rho_1\sim_{\mathbf{G}}\rho_2, if they are conjugate by an element of G(C){\mathbf{G}}(\mathbb C); such a representation is defined over Q\mathbb Q if it is equivalent to each of its images under Aut⁡(C/Q)\operatorname{Aut}(\mathbb C/\mathbb Q). The rationality conjecture. There exists a G{\mathbf{G}}-valued Weil–Deligne representation ρX,vWD,G\rho_{X,v}^{{\mathrm{WD}},{\mathbf{G}}} defined over Q\mathbb Q such that

ρX,vWD,G∼GρX,ℓ,vWD,Gfor all primes v∤ℓ.\rho_{X,v}^{{\mathrm{WD}},{\mathbf{G}}}\sim_{\mathbf{G}}\rho_{X,\ell,v}^{{\mathrm{WD}},{\mathbf{G}}}\quad\text{for all primes }v\nmid\ell.

This conjecture expresses the expected rationality, or independence of ℓ\ell, of the Weil–Deligne representations attached to the cohomology of algebraic varieties. The paper proves the relevant strongly compatible-system statement for semistable abelian varieties, while the general formulation above remains an expectation.

References
  1. Mark Kisin and Rong Zhou, “Strongly compatible systems associated to semistable abelian varieties”, arXiv:2505.02165 (2025).

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.