An integral basis is a -basis of the ring of integers ; its elements also form a -basis of .
To prove existence, first multiply the elements of a rational basis by suitable nonzero integers to obtain an integral rational basis . Put . The trace pairing is nondegenerate in characteristic zero, and the matrix has integer entries and nonzero determinant . If is integral, all are integers, so . The adjugate formula gives . Consequently
A subgroup of a free abelian group is free, and these inclusions force rank . A -basis of is therefore an integral basis.
Now put and . The polynomial is irreducible by Eisenstein at any prime dividing the squarefree , except for , where is Eisenstein at . Thus and . Every has the unique form with . The nontrivial -automorphism sends to , so an integral has integral conjugate . Relative trace and norm of integral elements are integral in . Applying them to and taking the trace of gives
The power basis has discriminant
Indeed, the resultant of and is ; the discriminant sign factor is . By the discriminant-index formula for an integral lattice, a prime dividing must divide .
No odd prime can divide this index. The Eisenstein equation gives , while has nonintegral field norm for and : its -adic norm valuation is . If were integral, multiplication by first forces ; subtracting and multiplying by forces . Continuing forces all coefficients divisible by . This excludes an index element of order .
To exclude , any index element of order two would be represented by an integral
with integers not all even. Here and . The integrality of forces
Since , the first congruence implies have the same parity. If both were odd, the second would require , impossible. Hence are even. The second congruence then forces to have the same parity, while the first forces even. Thus are even too, a contradiction. Therefore the index is one and
For the last request, let and take . It satisfies , and hence
This monic integer polynomial proves integrality. Its coordinates in the rational power basis have halves, so . Also with a nonzero coefficient in ; if were in that quadratic field, then would be too, contradicting degree four. Thus it meets both exclusions.
An algebraically closed field is a field in which every nonconstant polynomial has a root, equivalently every such polynomial splits. An algebraic closure of is an algebraic extension of which is algebraically closed.
For the displayed subset , if are algebraic over , then is finite. Sums, differences, products and nonzero inverses of its elements are algebraic over , so is a subfield. If a nonconstant polynomial has coefficients in , those finitely many coefficients generate a finite extension . It has a root by algebraic closure of , and is algebraic over . Part (i) makes it algebraic over , so . Hence is algebraically closed and is an algebraic closure of .
Every lies in the finite subextension , and every element of a finite subextension is algebraic over . Therefore is exactly the union of all finite subextensions inside . The two examples follow.
For nonzero ideals, unique factorization of ideals in a number field converts to . Coprimality says at most one of the first two exponents is positive, so each is divisible by three. Dividing its exponents by three constructs ideals whose cubes are . If a zero ideal is allowed, coprimality forces the other ideal to be the whole ring and the conclusion is immediate with the zero ideal as its own cube.
To compute the Ideal class group of Q of square root minus thirty, put . The ring of integers is , with discriminant . The given Minkowski bound for ideal classes is . Hence the ideal class group is generated by prime ideals with ideal norm below seven. The rational primes two, three and five all ramify, giving unique prime ideals , , with and ideal norm . There is no additional prime ideal of ideal norm four because two ramifies with residue degree one; six is not a prime power. Thus these three classes generate and each has order at most two.
As , unique factorization of ideals in a number field gives , so their three classes multiply to one. None is principal: a generator of one would be an integral element of field norm equal to two, three or five, and none of those field norm equations has integer solutions. The three nontrivial classes are therefore distinct, with the third the product of the first two. Hence
To rule out integer solutions, suppose . Necessarily . If a prime divided , then reduction modulo would force . Because thirty is squarefree, the valuation of at that prime would be exactly one, while that of is a positive multiple of three, a contradiction. Thus .
If a prime ideal divided both and , it would divide their difference and their product . Its underlying rational prime would divide , hence divide thirty, and would also divide . This contradicts the gcd just proved, so the two ideals are coprime. Their product is , so the first part gives for an ideal .
In a ideal class group of exponent two, forces . Thus with . Equality of principal ideals gives for a unit . The only units are , since forces , ; both signs are cubes and can be absorbed into the generator. Comparing the coefficient of after cubing now gives
which is impossible modulo three. Therefore
ideals are coprime when , equivalently for some , . Always . If , then , giving in the coprime case. For nonzero integral ideals, the Chinese remainder theorem gives , and taking finite cardinalities yields .
For a nonzero prime ideal, the chain of finite-index inclusions gives
by the given hypothesis. Distinct nonzero prime ideals are maximal and coprime, as are their positive powers. Unique factorization of ideals in a number field therefore gives . Exponents add under ideal multiplication, proving multiplicativity for arbitrary nonzero integral ideals. This is the standard domain of the finite ideal norm used here.
For the Dedekind factorization theorem, choose an integral primitive element of with monic minimal polynomial of an algebraic element , and assume the rational prime does not divide the index . Factor
over , with distinct monic irreducible factors. For integer polynomial lifts , the distinct prime ideals above are , and
Thus the residue degree is , the ramification index is , and . The index restriction is essential to this direct factorization formula.
For , the ring of integers is , so the index is one and the theorem applies to every prime. Modulo two, , giving one prime ideal of ideal norm two. For an odd rational prime, a prime ideal has ideal norm if the polynomial splits, and ideal norm if it is irreducible. In the former case the supplied condition forces or ; in the latter case every odd square is one modulo eight. Consequently
The odd part of any ideal norm is thus one or three modulo eight, because . Multiplication by a power of two leaves possible residues for exponent zero, for exponent one, for exponent two, and for exponent at least three. Hence for every nonzero integral ideal.
The set consists of the elements of integral over , meaning roots of monic polynomials in .
First prove the finite-module criterion for integrality in a slightly stronger form, for any nonzero finitely generated -submodule stable under multiplication by . Choose generators and write with integer coefficients. Multiply the vector equation by its adjugate matrix. This gives for every generator. Some generator is nonzero and is a field, so . The polynomial is monic with integer coefficients, proving integrality of . This implication needs no prior closure theorem for .
Conversely, if satisfies a monic polynomial of degree , then is generated by and is stable under . Every also maps into itself because it is an integer polynomial in ; the finite-module criterion for integrality just proved makes every such integral. Thus this really lies in , proving the stated equivalence without circularity.
For two integral elements , the module spanned by for , contains one, is finitely generated, and is stable under both elements by their monic equations. It is therefore stable under and . The finite-module criterion for integrality proves that both are integral. Negatives follow by replacing a multiplication matrix by its negative, and are integral. Hence .
The integral basis of the cubic field of discriminant minus 140 can be obtained as follows. For the specified field, Eisenstein at two makes irreducible, and is integral because the polynomial is monic. The discriminant of a monic cubic is , so
Here is the printed notation for the signed discriminant, namely the square of a Vandermonde product of the conjugates; that product need not be real.
Suppose is integral with the prescribed binary coefficients. The root traces give , , . Thus must be an integer, forcing . If , nonzeroness of the coefficient triple forces , giving . If , multiply by and use :
Closure of the ring then again gives .
But , so the field norm of is . The field norm of an algebraic integer is an integer, proving . Dividing the defining cubic by gives . Thus cannot be integral either.
Finally the discriminant-index formula for an integral lattice says . The square of the integer index divides , so its only possibilities are one and four, giving index one or two. If the index were two, a nonzero coset would supply an integral element after reducing coefficients modulo two, with a nonzero binary triple. The preceding argument would force the impossible integrality of . Hence

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