Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH

Abstract: The Schubert vanishing problem is a central decision problem in algebraic combinatorics and Schubert calculus, with applications to representation theory and enumerative algebraic geometry. The problem has been studied for over 50 years in different settings, with much progress given in the last two decades. We prove that the Schubert vanishing problem is in ${\sf AM}$ assuming the Generalized Riemann Hypothesis (GRH). This complements our earlier result in arXiv:2412.02064, that the problem is in ${\sf coAM}$ assuming the GRH. In particular, this implies that the Schubert vanishing problem is unlikely to be ${\sf coNP}$-hard, as we previously conjectured in arXiv:2412.02064. The proof is of independent interest as we formalize and expand the notion of a lifted formulation partly inspired by algebraic computations of Schubert problems, and extended formulations of linear programs. We use a result by Mahajan--Vinay to show that the determinant has a lifted formulation of polynomial size. We combine this with Purbhoo's algebraic criterion to derive the result.