On the addition of an $SU(2)$ quadruplet of scalars to the Standard Model
Darius Jurčiukonis, Luís Lavoura
TL;DR
This work analyzes the bounded-from-below (BFB) conditions for the Standard Model extended by a single SU(2) quadruplet of scalars, considered with hypercharges $Y=3/2$ or $Y=1/2$ (the latter with a reflection symmetry). It derives exact analytical expressions for the boundaries of the phase space of the scalar potential’s quartic sector, introducing gauge-invariant combinations $F_1$, $F_2$, $F_4$, and $F_5$ and the dimensionless parameters $r$, $\boldsymbol{\delta}$, and $\boldsymbol{\gamma}_5$ (and analogously $\boldsymbol{\texteta}$ for the $Y=1/2$ case). The authors show that, in practice, testing BFB reduces to scanning along a few special lines on the boundary (rather than across surfaces), and they provide explicit line choices and the associated analytic conditions; this yields a dramatic speed-up (up to ~1700x) compared with brute-force minimization. They also discuss the convexity/concavity of boundary sheets, justify the line-based approach, and confirm the results numerically across large random parameter samples. The findings enable efficient and exact characterization of the viable parameter space for these extended scalar sectors, with potential implications for neutrino mass mechanisms and Higgs-gauge couplings.
Abstract
We consider the extension of the Standard Model through an $SU(2)$ quadruplet of scalars with hypercharge either $3/2$ or $1/2$ (with an additional reflection symmetry in the latter case). We establish, through exact analytical equations, the boundaries of the phase spaces of the gauge-invariant terms that appear in the (renormalizable) scalar potentials. We devise procedures for the determination of necessary and sufficient bounded-from-below conditions on those potentials; we emphasize that one mostly needs to scan the scalar potential over a few \emph{lines}, instead of \emph{surfaces}, in order to establish the boundedness-from-below; this fact allows one to reduce by three orders of magnitude the computational time devoted to that establishment.
