Conjecture 3. We can compute this.
Statement
Conjecture 3. We can compute this. • The trace of Frobenius on unstable homology gives rise to the error term. We can control this if we know a bound on unstable Betti numbers (this turns out to be easy) and a good enough range of stability. The sheaf Lk decomposes into summands V\lambda , indexed by irreducible representa- tions of the symplectic group. The multiplicity of V\lambda in Lk depends on k and n, but the family of summands {V\lambda } are the same regardless.2 It is thus natural to study each summand H∗ (\betan ; V\lambda ) individually. What is done in [2]. A very general stability theorem of Randal-Williams–Wahl [4] implies that the sequence H∗ (\betan ; V\lambda ) satisfies homological stability: (1) Hk (\betan ; V\lambda ) \to Hk (\betan+1 ; V\lambda ) is an isomorphism for k < 21 (n − |\lambda|). It is thus meaningful to ask what the stable homology of H∗ (\betan ; V\lambda ) is. We com- pute the stable homology, together with its action of Gal(Q/Q). We show that the answer is compatible with Conjecture 3, but that the range of stability (1) is not good enough to imply Conjecture 3. We show that Conjecture 3 would follow from our topological calculations if we knew a stable range of the form (2) Hk (\betan ; V\lambda ) \to Hk (\betan+1 ; V\lambda ) is an isomorphism for k < An − B; what we call a “uniform stability bound”.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.