Fine-tuning and the doublet-triplet splitting problem in the minimal $SU(5)$ GUT
Dani\"el Boer, Ruud Peeters

TL;DR
This paper examines the doublet-triplet splitting problem in minimal non-supersymmetric SU(5) GUTs, highlighting the need for fine-tuning and proposing a hierarchy-imposing approach to avoid it.
Contribution
It demonstrates that imposing a hierarchy in vevs at the outset can eliminate fine-tuning issues in minimal SU(5) GUT models.
Findings
Large fine-tuning is required in standard models due to the hierarchy problem.
Imposing the hierarchy as a theoretical condition removes the need for fine-tuning.
A natural, perturbative model with the desired hierarchy can be constructed without fine-tuning.
Abstract
In this paper we analyse the doublet-triplet splitting problem in the minimal non-super-symmetric GUT. We take into account the full symmetry breaking pattern with both high scale breaking and electroweak symmetry breaking. Our analysis shows that the only phenomenologically acceptable model has three vevs, with a strong hierarchy determined by the minimization conditions. The amount of fine-tuning in the model is then numerically evaluated by looking at the effect of variation of input parameters on both the minimization conditions and the bosonic masses. Regarding the vevs as output parameters, a large amount of fine-tuning is required in this scenario, which is an expression of the doublet-triplet splitting problem. We show that this problem is more general, since a model with coupled scalar sectors will in general never realise a hierarchy in vevs. To avoid these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParticle physics theoretical and experimental studies · Quantum Chromodynamics and Particle Interactions · Neutrino Physics Research
