A Subconvex Metaplectic Prime Geodesic Theorem and the Shimura Correspondence

We investigate the prime geodesic theorem with an error term dependent on the varying weight and its higher metaplectic coverings in the arithmetic setting, each admitting subconvex refinements despite the softness of our input. The former breaks the $\frac{3}{4}$-barrier due to Hejhal (1983) when the multiplier system is nontrivial, while the latter represents the first theoretical evidence supporting the prevailing consensus on the optimal exponent $1+\varepsilon$ when the multiplier system specialises to the Kubota character. Our argument relies on the elegant phenomenon that the main term in the prime geodesic theorem is governed by the size of the largest residual Laplace eigenvalue, thereby yielding a simultaneous polynomial power-saving in the error term relative to its Shimura correspondent where the multiplier system is trivial.