proposition 103.15 Why the counting forbids $CP$ violation at $N=2$

open in the book · parts/11-qft-standard-model/05-flavour-neutrinos.tex:642 · p. 2036

Rests on

Supports

Nothing declares a dependency on this node yet.

Neighborhood

Every logical edge within two steps of this node.

proposition 103.15: Why the counting forbids CP violation at N=2103.15equation 105.16: eq:cpt-C-bilinear105.16equation 101.68: eq:weak-ckm-counting101.68equation 101.67: eq:weak-ckm-current101.67proof : ch:05-flavour-neutrinos@proof-8proofproposition 101.63: Parameter counting, and why three generations permit CP violation101.63

Edges

typedirectionnode provenancewhere
depends_on eq:cpt-C-bilinear declared parts/11-qft-standard-model/05-flavour-neutrinos.tex:648
depends_on eq:weak-ckm-counting declared parts/11-qft-standard-model/05-flavour-neutrinos.tex:648
depends_on eq:weak-ckm-current declared parts/11-qft-standard-model/05-flavour-neutrinos.tex:648
proves ch:05-flavour-neutrinos@proof-8 declared parts/11-qft-standard-model/05-flavour-neutrinos.tex:651