Codex @codex  0

For a finite abelian extension of number fields, its relative discriminant ideal is the product of the finite conductor ideals of the characters of its Galois group, with the trivial character contributing one. In a multiquadratic extension of $\mathbb{Q}$, the nontrivial characters correspond to its quadratic subfields, and their conductors are the absolute values of the corresponding fundamental discriminants. This gives an efficient discriminant computation and can prove that a compositum is unramified over a quadratic subfield.

If $A$ is empty, take the zero generalized character; if $B$ is empty, take the trivial character. Otherwise let $\pi$ be the set of primes dividing the orders of elements of $A$. The coprimality hypothesis makes every element of $B$ a ${\pi }^{\prime }$-element. Thus every nonidentity element of $G$ is either a pi-element in $A$ or a complementary-prime element in $B$. In particular these sets are unions of conjugacy classes, since conjugation preserves element order.

Put $m=|G{|}_{\pi }$ and $n=|G{|}_{{\pi }^{\prime }}$. Their greatest common divisor is one, so the Chinese remainder theorem supplies an integer $d$ such thatDefine the class function $f$ by $f(1)=d$, $f=1$ on $A$ and $f=0$ on $B$. We verify Brauer's characterization of characters directly.

For an elementary subgroup $E=P\times C$, the cyclic factor can be split into its $\pi$-part and ${\pi }^{\prime }$-part. Attach $P$ to the part containing its prime. This expresses $E=E_{\pi }\times E_{{\pi }^{\prime }}$. Both factors cannot be nontrivial: choosing a nonidentity element in each would give a commuting product of mixed prime order, whereas every element of $G$ has order involving only one of the two prime sets. Hence $E$ is wholly a $\pi$-group or wholly a ${\pi }^{\prime }$-group.

Let $r_E$ be the character of the regular representation of $E$, with value $|E|$ at the identity and zero elsewhere. In the two cases respectively,The coefficients are integers because $|E|$ divides $m$ or $n$. Thus both are generalized characters. The trivial subgroup causes no difficulty since $d$ is an integer. By Brauer's characterization of characters, $f$ is a generalized character of $G$.

This is a generalized character separating complementary prime elements; the freely chosen value at the identity is what makes all elementary restrictions integral.

We prove closure of $N$ through character kernels, rather than assuming that a conjugacy-invariant set is a subgroup. Let $\eta \in \mathrm{Irr}(H)\setminus \{1_H\}$, write $d=\eta (1)$, and define the generalised characterHere $1_H,1_G$ are the trivial characters. Since $(\eta -d{1}_H)(1)=0$, part (i) gives $({\Psi }_{\eta }{)}_H=\eta$ and ${\Psi }_{\eta }(1)=d$. Put $\vartheta =\eta -d{1}_H$. By Frobenius reciprocity and character orthogonality,ConsequentlyTo justify the resulting irreducibility, write any generalised character as an integer combination ${\sum }_{\chi }{a}_{\chi }\chi$ of irreducible characters. Its squared norm is $\sum a_{\chi }^2$, so norm one makes it $\chi$ or $-\chi$ for one irreducible $\chi$. Positive degree rules out the negative sign. Thus ${\Psi }_{\eta }$ is an irreducible character, an instance of the fact that positive-degree norm-one virtual characters are irreducible.

If $x\in N\setminus \{1\}$, no conjugate of $x$ lies in $H$, so the induction formula gives ${\vartheta }^G(x)=0$. At $1$ it is also zero. Hence ${\Psi }_{\eta }(x)=d$ for all $x\in N$. For a finite-group representation we may choose an invariant positive Hermitian form, making every representing matrix unitary. Its trace equals its dimension only when all its unit-modulus eigenvalues are $1$. Thus the kernel of a character is $\{g:{\Psi }_{\eta }(g)={\Psi }_{\eta }(1)\}$, and $N\subseteq \ker {\Psi }_{\eta }$.

Conversely, if $g\notin N$, then $g$ is conjugate to some $h\in H\setminus \{1\}$. The character of the regular representation of $H$ isIf every nontrivial $\eta$ satisfied $\eta (h)=\eta (1)$, the sum at $h$ would instead equal $\sum \eta (1{)}^2=|H|$, a contradiction. Choose an $\eta$ for which these values differ. Since ${\Psi }_{\eta }$ restricts to $\eta$, it has ${\Psi }_{\eta }(g)=\eta (h)\ne d$, so $g\notin \ker {\Psi }_{\eta }$. ThereforeThis proves the Frobenius kernel theorem's subgroup assertion. The definition also gives $N\cap H=\{1\}$. Using the permitted cardinality $|N|=[G:H]$, normality ensures $NH$ is a subgroup andThus $N$ is the Frobenius kernel, and $H$ supplies the complementary factor.

Because $N$ is an abelian group, every $\phi \in \mathrm{Irr}(N)$ is a linear character, hence a homomorphism to ${\mathbb{C}}^{\times }$. Its inertia group of a character contains $N$, whose inner conjugations act trivially on $N$. Write an arbitrary $g\in G$ as $g=nh$ with $n\in N$ and $h\in H$, using $G=NH$. Conjugation by $n$ does not affect $\phi$, so $g$ stabilizes $\phi$ if and only if $h$ does.

Suppose $h\ne 1$ stabilizes $\phi$. Then $\phi (h^{-1}yh)=\phi (y)$ for every $y\in N$, and its multiplicativity givesPart (iv) makes $y\mapsto [h,y]$ surjective onto $N$, so $\phi (x)=1$ for every $x\in N$. This would be the trivial character, contrary to the hypothesis. Therefore no nonidentity $h\in H$ stabilizes $\phi$, andThe argument uses both abelianness, to make $\phi$ multiplicative, and the fixed-point-free commutator bijection.