Mazur–Rubin–Sano conjecture for Rubin–Stark elements

Let n\mathfrak{n} be a product of primes in the indexing set, let Hn=Gal(F(n)/F)\mathcal{H}_\mathfrak{n}=\operatorname{Gal}(F(\mathfrak{n})/F), let InI_\mathfrak{n} be the augmentation ideal of Z[Hn]\mathbb{Z}[\mathcal{H}_\mathfrak{n}], and let cnc_\mathfrak{n} and ϵn\epsilon_\mathfrak{n} be the (p,χ)(p,\chi)-components of the Rubin–Stark elements defined for LF(n)/KLF(\mathfrak{n})/K and LF/KLF/K, respectively. Let

ιn:O[Γ]rUF,SnZInν(n)/Inν(n)+1O[Gn]rUF(n),SnZZ[Hn]/Inν(n)+1\iota_\mathfrak{n}:{\bigcap}_{\mathcal{O}[\Gamma]}^rU_{F,S_\mathfrak{n}}\otimes_\mathbb{Z}I_\mathfrak{n}^{\nu(\mathfrak{n})}/I_\mathfrak{n}^{\nu(\mathfrak{n})+1}\hookrightarrow {\bigcap}_{\mathcal{O}[\mathcal{G}_\mathfrak{n}]}^rU_{F(\mathfrak{n}),S_\mathfrak{n}}\otimes_\mathbb{Z}\mathbb{Z}[\mathcal{H}_\mathfrak{n}]/I_\mathfrak{n}^{\nu(\mathfrak{n})+1}

and let Recn{\rm Rec}_\mathfrak{n} be the reciprocity homomorphism.

Mazur–Rubin–Sano conjecture. In the module

O[Gn]rUF(n),SnZZ[Hn]/Inν(n)+1{\bigcap}_{\mathcal{O}[\mathcal{G}_\mathfrak{n}]}^rU_{F(\mathfrak{n}),S_\mathfrak{n}}\otimes_\mathbb{Z}\mathbb{Z}[\mathcal{H}_\mathfrak{n}]/I_\mathfrak{n}^{\nu(\mathfrak{n})+1}

one has

σHnσcnσ1=ιn(Recn(ϵn)).\sum_{\sigma\in\mathcal{H}_\mathfrak{n}}\sigma c_\mathfrak{n}\otimes\sigma^{-1}=\iota_\mathfrak{n}\left({\rm Rec}_\mathfrak{n}(\epsilon_\mathfrak{n})\right).

This predicts a refined congruence between Rubin–Stark elements in ray-class towers, relating augmentation-ideal leading terms to local reciprocity. The supplied text does not state a proof or disproof.

Sources & referencesView supporting material

Primary source

David Burns, Ryotaro Sakamoto and Takamichi Sano, “On the theory of higher rank Euler, Kolyvagin and Stark systems, IV: the multiplicative group”, arXiv:1903.09509 (2019).

Additional references

3 papers in this index state this conjecture (2015–2019). The statement above is taken from the most recent of them; the others are arXiv:1710.04568, arXiv:1506.07935.

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.