Suppose is an irreducible character of a group of odd order and . Write . Every nonidentity element pairs with its distinct inverse, since there is no element of order . Also . If were nontrivial, character orthogonality with the trivial character of a representation would give
where is the sum of one character of a representation value from each inverse pair. This is an algebraic integer, so is an integer. Hence is even.
But an irreducible character degree divides the group order, so must be odd. One quick justification of that divisibility is that the central class sum of a conjugacy class acts by the algebraic integer . Its integrality follows from its integer matrix on the regular group representation. Character orthogonality then gives
a rational algebraic integer, hence an integer. The parity contradiction proves : the trivial character is the only self-conjugate irreducible character of an odd-order group.
Conjugation by partitions into orbits. Each non-singleton orbit has size divisible by , by the orbit-stabilizer theorem. The singleton orbits are exactly . Since is divisible by , . This set contains , so .
For the deduction we also give the representation-theoretic ingredient behind Burnside's theorem: a nonabelian finite simple group has no nontrivial conjugacy class of prime power size. Here is a proof, so no stronger theorem is being assumed without justification. Suppose has class size . For an irreducible character of degree coprime to , the class sum acts as the scalar , which is an algebraic integer: the class sum has an integer-entry matrix in the regular representation, which contains every irreducible representation, so this scalar is an eigenvalue of an integer-entry matrix. Also is an algebraic integer. Bezout's identity then makes an algebraic integer. All its algebraic conjugates have modulus at most , because character values of a representation are sums of roots of unity. An algebraic integer with this property is zero or a root of unity: the monic polynomials of all its powers have uniformly bounded integer coefficients, so two powers must coincide unless it is zero.
Every nontrivial irreducible representation of a simple group is faithful. If were a root of unity, equality in the triangle inequality would force its representing matrix to be scalar, hence central, impossible. Thus whenever , except for the trivial character of a representation. Orthogonality of the identity column and the column in the character table now gives
This would make an algebraic integer, contradicting the fact that rational algebraic integers are integers. The same proof covers class size directly through triviality of the center.
If an abelian subgroup had index , every would have , making its class size a divisor of , a contradiction. Such a exists: if , then is a nontrivial p-group, whose center is nontrivial by the first argument with . Therefore a nonabelian simple group has no abelian subgroup of prime power index.
For a square-free integer or , the ring of integers of the quadratic field is . Square-freeness is the usual convention underlying the first request: congruence alone would not suffice, for example gives the same field as .
Now take the stipulated square-free and put , . For any integral , relative traces to the three quadratic subfields show . Those subfields all have integral bases and their square root, including . Write with integer coefficients.
Its relative field norm to is
Thus is even, and the constant numerator is divisible by four. Since , these conditions force both even: one odd makes the numerator odd, and both odd contradicts even. They then force to have the same integer parity. Every algebraic integer consequently belongs to the lattice generated by
Conversely the last generator satisfies and the monic integer equation
All four generators are integral and linearly independent over , so this lattice is exactly , proving this integral basis of an odd biquadratic field containing square root of two without an unproved index assumption.
The row orthogonality relations for a character table state that for irreducible characters ,
Equivalently, if runs through representatives of the conjugacy classes ,
Fix an irreducible . The sum of the elements in a conjugacy class is central in , so Schur lemma says that it acts in the representation affording by the scalar
This central character value of a conjugacy-class sum is an algebraic integer: the class sum acts by a matrix with integer entries on the regular representation, and is one of its eigenvalues. Also is an algebraic integer because character values are sums of roots of unity.
Row orthogonality with now gives
The right-hand side is an algebraic integer. The left-hand side is rational, and every rational algebraic integer is an integer. Therefore
Put . It is an algebraic integer because it satisfies the monic polynomial . Choose a prime number dividing the square-free integer , and choose a prime ideal of above . From
and prime ideal factorization, the -adic exponents satisfy
because occurs to exponent one in . Hence divides the ramification index of a prime ideal . If , then , while the equation gives . Therefore
so
Write and . The field embeddings of into send to , so the field trace is
For the trace pairing , the basis therefore has dual basis
Every element of is an algebraic integer. If and , then is an algebraic integer and its trace is an integer. Thus belongs to the trace-dual lattice of , which is generated over by the displayed dual basis. Since , every such linear combination lies in . Hence
Now let be prime and put and . The Eisenstein criterion applied at gives , while the discriminant of elements of a number field of its power basis is
where . By the discriminant-index formula for an integral lattice, every prime dividing must therefore be .
Suppose . The finite abelian group is then a nontrivial finite p-group, so it contains an element of order . Consequently there is an such that
with some not divisible by .
The polynomial is Eisenstein, so total ramification from an Eisenstein polynomial gives a unique prime ideal above with normalized discrete valuation
Let be the least index for which . The term has valuation ; every earlier term has valuation at least , and every later term with coefficient prime to has a distinct, larger valuation. The non-Archimedean valuation therefore gives
This contradicts , since an algebraic integer has nonnegative valuation at every prime ideal. Thus , and
Gauss lemma for polynomials states that the product of two primitive polynomials over a unique factorization domain is primitive. In particular, a primitive polynomial in is reducible over exactly when it is reducible over .
Eisenstein criterion says that a primitive polynomial
is irreducible over if there is a prime such that , for every , and . To prove it, suppose with both factors of positive degree. After removing contents, Gauss's lemma lets us take primitive. Reduction modulo gives
so both reduced factors are monomials of positive degree. Their constant terms are therefore divisible by , making divide , a contradiction.
An algebraic integer is a complex number satisfying a monic polynomial in . Let be one and let be its monic minimal polynomial. The usual proof using polynomial content shows that . The set
is the kernel of the polynomial-evaluation ring homomorphism, hence an ideal. Every is divisible by in . Because is monic, polynomial division of by takes place in , and the remainder must vanish by minimality. Therefore
where is monic and irreducible.
For
translation gives
This is Eisenstein at , so and therefore are irreducible over . Hence
Irreducibility and Gauss's lemma also show that is a prime ideal of , so
It is not a field. The class of is nonzero but not a unit: reducing further modulo gives a nonzero quotient
in which the image of is zero, whereas a unit must remain a unit under every unital quotient map. Thus
Suppose that divided the finite index . Then the quotient would contain nonzero -torsion, so there would be with
where not all are divisible by . Let be the least index for which . Since and , the term is the unique term on the right of least -valuation. Thus
But is an algebraic integer, so and
a contradiction. Therefore
Put
Using , multiplication by on the ordered basis is determined by
Its matrix, with these coordinate vectors as columns, is
The characteristic polynomial is
By the Cayley-Hamilton theorem, this monic integer polynomial annihilates , so is an algebraic integer.
Let
The element is also integral because it satisfies the monic polynomial . Hence . Since
the lattice has index two in . The given power-basis discriminant is
so the discriminant-index formula for an integral lattice gives
If , then
Because is prime, the square can divide only when . Thus
so is an integral basis of the cubic field of discriminant minus 307.
Finally, the relation gives
Consequently , which will allow direct use of Dedekind's theorem.
Let be an integral basis of . Since each is an algebraic integer, there is an integer matrix such that
The form a -basis, so .
Products of algebraic integers are algebraic integers, and their traces are rational algebraic integers, hence ordinary integers. Therefore every entry
is integral. Part (i) makes the trace Gram matrix nonsingular, so is a nonzero integer.
Let and be the two trace Gram matrices. A change of basis gives
Taking determinants yields the discriminant-index formula for an integral lattice
where is the field discriminant. Since is a nonzero integer,
Equality holds exactly when , which is equivalent to being unimodular and to being a -basis of . Thus the minimum is the positive integer
Minkowski's lemma states that if is a full lattice in and is measurable, convex, and centrally symmetric, then
implies that contains a nonzero point of .
Let be the two real embeddings. The Minkowski embedding of a real quadratic field identifies with a lattice
of covolume . Choose a constant satisfying
For , consider the closed diamond
It is convex and centrally symmetric, and its area is
Minkowski's lemma supplies a nonzero whose two embeddings lie in .
For , the arithmetic-geometric mean inequality gives
Since the coordinate product is the field norm,
Finally, as . No fixed nonzero algebraic integer can occur for arbitrarily large , because its second embedding is nonzero. Consequently the elements obtained along an unbounded sequence of contain infinitely many distinct values. Here denotes the absolute norm, as usual in this inequality.
The product formula says that every satisfies
First suppose that is an algebraic integer. Its principal ideal has the prime ideal factorization
Taking the ideal norm gives
On the other hand, the field norm is the product over embeddings, so
Equating these expressions proves the formula for algebraic integers. Every nonzero element of is a quotient of two algebraic integers, and multiplicativity completes the proof.
Let be the monic cubic minimal polynomial of the algebraic integer , let be its conjugates, and let be the two conjugates of a nonrational . Because the degrees three and two are coprime, the fields are linearly disjoint, and
is a nonzero integer.
Assume
For large this makes bounded. Since is a quadratic algebraic integer, the height-Mahler measure formula gives
and therefore . The two remaining factors with are bounded, while the three factors with are . Consequently
We now use the standard effective norm form consequence of Part (b). For
where is an integral basis of , the effective norm-form height estimate supplies effective constants , depending only on and , such that
for every nonzero . Its proof factors , balances a generator using the Dirichlet unit theorem, and applies the Baker lower bound for a homogeneous linear form in logarithms to the linear relations defining ; the coprime degrees and exclude a unit-family degeneracy.
Apply this estimate to . Since , the height inequalities imply . Hence
Choose the effective value . The last inequality bounds effectively. The rational integers are already covered by the stronger degree-three Liouville approximation theorem, and the Northcott theorem leaves only finitely many remaining quadratic integers of bounded height. Taking the minimum of
over this effective finite set gives an effective and proves
for every .