ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture 3. There is a canonical Perf(ParG )-linear equivalence of categories (2) Shv(BunG , Λ) = Shv(IsocG , Λ). While the full equivalence is conjectural, it is a theorem of [17] that the mor- phism (1) constructed out of the spectral action of Fargues–Scholze agrees with the one of Genestier–Lafforgue. Higher nearby cycles. It follows from the spectral decomposition theorems [6, 1], that the data of the spectral action is equivalent to the data of the Hecke functors. That is, functorially in finite sets I, we have a ⊗-functor TI : RepΛ (L G)⊗I \to End(Shv(IsocG )) ⊗ Lisse(D\times )⊗I , where Lisse(D\times ) denotes the category of Weil local systems on D\times = Spec(F((t))). To construct our spectral action, we define these functors using a nearby cycles procedure. When I = {∗} is a point, we introduce a deformation f : IsocG,A1 \to A1 of IsocG whose fiber over 0 is IsocG and whose fiber over A1 − 0 is IsocG \times Hkloc , where the second factor is the local Hecke stack. The functor TI is then defined to be, for V \in RepΛ (L G) and A \in Shv(IsocG ), TI (V )(A) = Ψf (A ⊗ SatV ) where Ψf denotes the nearby cycle functor (defined with respect to f ) and SatV \in Shv(Hkloc ) is the Satake sheaf. To define the functors TI when |I| > 1, we use the theory of nearby cycles over general bases due to Deligne, Laumon [16], Gabber, Orgogozo [18], Illusie [12] and its reinterpretation by Hansen–Scholze [10]. When dealing with nearby cycles over general bases, one usually gets control theorems for the nearby cycles only after modifying the base. In our situation, to get a canonical construction, we prove that the ‘naı̈ve’ nearby cycles (i.e. without introducing a modification) are well behaved. The key part for this control involves showing that the space that controls the difference between naı̈ve and non-naı̈ve nearby cycles is contractible (in a suitable sense). There is a second difficulty stemming from the fact that nearby cycles, a priori, are only equipped with an action of the inertia IF \subset WF . The difference between the actions of these two groups is encoded by the action of the partial Frobeniuses. The problem here is essentially combinatorial as it requires organizing the partial Frobenius correspondences in a coherent way with respect to the nearby cycles. The report passage is retained verbatim as the relevant context for this extracted problem.

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.