Minimally allows a set of terms #
i. Overview #
In this module we consider those charge spectra which minimally allow a finite set of potential terms. That is, they those charge spectra which allow each term in the set, but no proper subset of the charge spectra allows each term in that set.
We have special focus on those charge spectra which minimally allow a top and bottom Yukawa term.
ii. Key results #
MinimallyAllowsFinsetTerms: the proposition that a charge spectrum minimally allows a given finite set of potential terms.minTopBottom: a finite set of charge spectra which contains every charge spectrum which minimally allows a top and bottom Yukawa term, given finite sets of possible5-bar and10charges.
iii. Table of contents #
- A. Charge spectra which minimally allow a finite set of potential terms
- A.1.
MinimallyAllowsFinsetTerms: Prop of minimally allowing a finset of potential terms - A.2. The prop
MinimallyAllowsFinsetTermsis decidable - A.3. Every element of
MinimallyAllowsFinsetTermsallows each term in the finset - A.4.
MinimallyAllowsFinsetTermsfor the singleton set is equivalent toMinimallyAllowsTerm
- A.1.
- B. Minimally allowing the top and bottom Yukawa
- B.1. Finset of charge spectra containing those which minimally allow top and bottom Yukawa
- B.2. Every element of
minTopBottomallows a top Yukawa - B.3. Every element of
minTopBottomallows a bottom Yukawa - B.4. Every charge spectrum minimally allowing a top and bottom Yukawa in
minTopBottom
iv. References #
There are no references for this module.
A. Charge spectra which minimally allow a finite set of potential terms #
We start by defining the proposition that a charge spectrum minimally allows a finite set of potential terms, and prove some basic properties there of.
A.1. MinimallyAllowsFinsetTerms: Prop of minimally allowing a finset of potential terms #
A collection of charge spectra is said to minimally allow
a finite set of potential terms Ts if it allows
all terms in Ts and no strict subset of it allows all terms in Ts.
Equations
- x.MinimallyAllowsFinsetTerms Ts = ∀ y ∈ x.powerset, y = x ↔ ∀ T ∈ Ts, y.AllowsTerm T
Instances For
A.2. The prop MinimallyAllowsFinsetTerms is decidable #
Equations
- x.instDecidableMinimallyAllowsFinsetTerms Ts = inferInstanceAs (Decidable (∀ y ∈ x.powerset, y = x ↔ ∀ T ∈ Ts, y.AllowsTerm T))
A.3. Every element of MinimallyAllowsFinsetTerms allows each term in the finset #
A.4. MinimallyAllowsFinsetTerms for the singleton set is equivalent to MinimallyAllowsTerm #
B. Minimally allowing the top and bottom Yukawa #
We now consider the special case of those charge spectra which minimally allow a top and bottom Yukawa term.
We construct a finite set of such charge spectra given finite sets of
possible 5-bar and 10 charges which contains every charge
spectrum which minimally allows a top and bottom Yukawa term.
B.1. Finset of charge spectra containing those which minimally allow top and bottom Yukawa #
Here we define minTopBottom in a way which is computationally efficient.
The set of charges of the form (qHd, qHu, {q5}, {-qHd-q5, q10, qHu - q10})
This includes every charge which minimally allows for the top and bottom Yukawas.
Equations
- One or more equations did not get rendered due to their size.