Write . The discriminant is , and the bound of part (a) is
Every ideal class therefore has an integral representative of norm at most . The Kummer-Dedekind theorem gives
Modulo , is irreducible, so there is no ideal of norm . Modulo it has roots , giving , where . The ideal of has norm , and reduction in the three residue fields shows that it lies in . Equality of norms therefore gives
It follows that , because . The other prime over has the inverse class, which is the same class here.
By unique factorization of nonzero ideals, all norms at most now give only the classes : norm gives , norm gives , and norm was handled above. None of is principal, since their norms are and
Also , since equality would make principal. Thus there are exactly four classes, all of exponent two:
Choose a nonzero integral ideal whose class is ; one obtains such an ideal by multiplying the fractional ideal by a suitable nonzero integer. The assumed Minkowski bound for ideal classes gives with
Because and nonzero ideals of the ring of integers are invertible,
It is an integral ideal in class . By multiplicativity of the ideal norm,
The same argument applies if the starting is a fractional ideal, since its class is unchanged by clearing denominators.
Put and . The polynomial reduces to modulo , so the Kummer-Dedekind theorem gives
If , its norm would imply , impossible for integers . Thus represents the nontrivial ideal class. Since the class number is , every nonprincipal integral ideal has , and . Write with ; integrality follows from . Multiplying by gives
Norms give , hence . If , writing yields
contradicting the list of squares modulo . Therefore no nonprincipal ideal has norm .
As and , quadratic reciprocity gives . Thus has two distinct roots modulo and
The norm obstruction shows that must be principal, say . Taking its norm proves
Let , whose minimal polynomial is . For , the cyclic group has a nontrivial cube root of unity . Then and are distinct roots of . By the Kummer-Dedekind theorem,
Since the given ring of integers is a principal ideal domain, write . Its norm is
Multiplication by completes the square:
Thus and supply the required integers.
The Kummer-Dedekind theorem states the following. If with integral and , factor the minimal polynomial modulo as into distinct monic irreducible factors. Then
The index restriction is essential.
For the proposed ideal relation, reflexivity uses and symmetry interchanges . If and , multiplication gives . All multipliers remain nonzero. Thus it is an equivalence relation, namely equality of ideal classes.
Put . The minimal polynomial is and the given full power basis makes every prime eligible for the theorem. Modulo its roots are ; modulo and it is irreducible; modulo its roots are . Consequently
The two inert ideals have norms and ; each split factor has norm equal to its rational prime.
For , quadratic reciprocity and its supplementary laws give . Thus has two distinct roots modulo , giving distinct prime ideals with
The given principal ideal domain property makes for some integers . Taking norms, which are positive here, gives .
Let . The power-basis discriminant is
If were a proper sublattice of , part (a) would produce a prime whose square divides and a new integral element with denominator . The only possible prime is . But is Eisenstein at , and part (b) says that every integral element of already belongs to . This is a contradiction. Hence
The polynomial is irreducible by Eisenstein's criterion at , so . Its constant coefficient gives the field norm
The defining equation gives
If and , then
has -adic valuation . It is not an integer. The norm of an algebraic integer is an integer, so is not integral.
Suppose now that is integral. Multiply it by . All terms except are integral, since their powers of are at least . Thus this remaining term is integral, and the norm obstruction forces . Subtract the integer from . Multiply the remainder by ; the only term of exponent below is , so . Continuing in this way proves for every . Therefore
For the same conclusion follows directly from the norm obstruction with .
An integral basis is a -basis of the ring of integers ; it consists of algebraic integers and is also a -basis of .
The lattice has finite index . Choose a prime . The finite abelian group has an element of order , represented by . Thus
If all were divisible by , cancellation in the characteristic-zero field would put in , a contradiction. The discriminant-index formula for an integral lattice gives
where is an integer. Hence , and the required integral element is .
A finite solvable group is a group admitting a finite chain of normal subgroups with abelian successive quotients; equivalently its derived series eventually becomes trivial. The chain
has quotients , all abelian. Thus is solvable. Every subgroup of a solvable group is solvable, because intersecting the chain with the subgroup gives factors isomorphic to subgroups of the original abelian factors. A Galois group of a polynomial of degree at most embeds in by its action on the roots, so it is solvable even if the polynomial is reducible or has repeated roots.
For the substitution, the characteristic-zero solvability by radicals theorem says that a polynomial has solvable Galois group if and only if its splitting field is contained in a finite tower formed by adjoining successive roots of elements of the preceding field. First place all roots of in such a tower. Adjoin a primitive th root of unity and, for every nonzero , an th root . These are radical adjunctions, and all roots of are . Zero roots require no adjunction. The resulting radical tower therefore contains the splitting field of . The theorem implies
The Fundamental theorem of symmetric polynomials states that every symmetric polynomial in variables over a field is a polynomial in the elementary symmetric polynomials, uniquely so. For the three roots, Vieta's formulas give , , .
The squared product of root differences is symmetric. Expansion in elementary symmetric polynomials gives
One can verify the displayed identity simply by substituting the definitions of and expanding; it is the cubic polynomial discriminant.
If the cubic is irreducible, its roots are distinct in characteristic zero, so . Its Galois group is a transitive subgroup of , hence either or . A permutation of the roots multiplies by its sign. The fixed-field assertion of the Fundamental theorem of Galois theory therefore gives exactly when all group elements are even. Thus
For example, has no rational root: neither nor is a root, and these are the only possibilities by the rational root theorem. Its discriminant is , so and its group is .
The Fundamental theorem of Galois theory says that for a finite Galois extension with group , the maps and are mutually inverse inclusion-reversing correspondences between subgroups and intermediate fields. They satisfy and . An intermediate extension is Galois exactly when its subgroup is normal, in which case its group is the quotient by that subgroup.
Let , , . The real field has degree : if with , squaring forces and either or , both impossible. Adjoining the nonreal doubles the degree. All three square-root signs can be changed independently, giving
Write for the automorphism sending to , where . Every nonzero vector generates an order-two subgroup, so there are such subgroups. Their fixed fields are:
GeneratorFixed field
Each listed field has degree and is fixed by the indicated sign change, which proves equality with the fixed field.
There are also order-four subgroups: they are the kernels of the seven nonzero linear functionals on . For , define . Then
Thus the seven quadratic fields have radicands . Their square classes are distinct, so all are different. Finally the trivial subgroup fixes , and all of fixes . This accounts for every subgroup and intermediate field.
The fixed field is
It is a subfield because every field automorphism preserves sums, products and inverses.
Set . If is infinite the desired finite lower bound is immediate. Otherwise let be an -basis of . If , the homogeneous system over
has a nonzero solution. For , with , every fixes , so the same coefficients give . This contradicts linear independence of distinct field embeddings. Consequently
A splitting field of a nonconstant polynomial over a field is an field extension in which factors into linear factors and which is generated over by those roots. We prove existence and the divisibility simultaneously by induction on ; constant nonzero polynomials have splitting field .
If is reducible, write with positive degrees . By induction first split , obtaining of degree dividing , then split over , obtaining of degree dividing . The tower law for field extensions gives . All adjoined elements are roots of , so has the required minimality.
If is irreducible, take and let be the image of . Then and in . Apply induction to , of degree , to obtain . Therefore
This proof also covers inseparable polynomials; it does not incorrectly identify extension degree with automorphism count in that case.
Identify with the Euclidean plane and start with the points . A complex number is a constructible number if a finite sequence of drawing lines through known points and circles with known centres and known distances as radii, and selecting their intersections, produces that point.
Line-line intersections solve linear equations in the current coordinate field. Line-circle and circle-circle intersections require at most one quadratic equation after eliminating a coordinate. Hence all coordinates obtained lie in a finite tower of real quadratic extensions of . If is constructible, choose a common such real field containing . Adjoining if needed still gives an extension of power-of-two degree. By the tower law for field extensions,
A regular heptagon centred at with one vertex would have as another constructible vertex. But its cyclotomic degree is , which is not a power of two. Thus the regular heptagon is not constructible.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact