ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a totally real number field, and let ell0ell_0 and ell∞ell_\infty be prime numbers. Let

ρi:Gal⁡(F‾/F)→GL⁡2(F‾ℓi),i=0,∞,\rho_i:\operatorname{Gal}(\overline{F}/F)\to \operatorname{GL}_2(\overline{\mathbb F}_{\ell_i}),\qquad i=0,\infty,

be two absolutely irreducible odd Galois representations attached to Hilbert modular newforms f0f_0 and f∞f_\infty, respectively. A strictly compatible system is a family of two-dimensional Galois representations satisfying the usual compatibility conditions. The modular Rayuela conjecture. There exists a family of odd, absolutely irreducible, two-dimensional strictly compatible systems of Galois representations {ρi,λ}i=1n\{\rho_{i,\lambda}\}_{i=1}^n satisfying ρ0≡ρ1,λ0(modλ0)\rho_0\equiv\rho_{1,\lambda_0}\pmod{\lambda_0} for some λ0∣ℓ0\lambda_0\mid\ell_0, ρ∞≡ρn,λ∞(modλ∞)\rho_\infty\equiv\rho_{n,\lambda_\infty}\pmod{\lambda_\infty} for some λ∞∣ℓ∞\lambda_\infty\mid\ell_\infty, intermediate congruences ρi,λi≡ρi+1,λi(modλi)\rho_{i,\lambda_i}\equiv\rho_{i+1,\lambda_i}\pmod{\lambda_i} for i=1,…,n−1i=1,\dots,n-1, and the requirement that all these congruences are modularity-lifting-theorem congruences. This modular variant is presented as a version that may eventually follow from advances in modularity-lifting theorems; the source says that proving it would provide evidence for, and in fact establish the equivalence of, the Rayuela conjecture with the generalized Serre conjecture over FF.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.