Let . Its ring of integers of a quadratic field is , and its fundamental field discriminant is .
First compute the class number. The ideal-form correspondence for imaginary quadratic fields identifies the ideal classes with proper equivalence classes of primitive positive definite binary quadratic forms of discriminant . Each has a unique reduced positive definite binary quadratic form representative under the convention , with when or . From we get . Checking these three possible leading coefficients gives exactly
For , neither odd residue choice makes integral. The listed forms are primitive and satisfy the reduction convention, so
This computes the ideal class group of Q of square root minus thirty-one.
Now take a root of , and let be its splitting field over . There is no rational root: the only candidates are , and neither vanishes. Thus the cubic is irreducible. Its polynomial discriminant is
Since this is nonsquare, the Galois group of an irreducible cubic is . Its quadratic subfield is : the product of pairwise root differences squares to and changes sign under odd permutations. Thus is cyclic of degree three, and . Indeed the cubic field and have coprime degrees, so their compositum already has the full splitting-field degree six. The squarefree polynomial discriminant also shows, by the discriminant-index formula for an integral lattice, that is the full integer ring of the cubic field.
It remains to prove that is unramified everywhere. At any rational prime , the reduction of is separable. Over a finite residue extension in which it splits, all residue roots are simple and lift by Hensel lemma to the corresponding unramified extension of . Therefore the local splitting field is unramified over , and its extension over a completion of is unramified as well.
At the only possible ramified prime, direct reduction gives
The simple root lifts to . Write , with monic quadratic over . The discriminant product formula gives
Here is a unit, so the quadratic discriminant has square class . Hence the entire local splitting field is
It is quadratic over , but its extension over the completion of is trivial. Thus the prime over splits completely in ; in particular it is not ramified there. This is the local splitting-field argument behind an unramified cyclic cubic extension from a prime-discriminant cubic. There are no real places of the imaginary quadratic field , so no infinite-place ramification remains to check.
The Hilbert class field theorem identifies the maximal everywhere unramified abelian extension with an extension of degree . Our cyclic unramified extension already has that degree, so it must be the whole Hilbert class field. Therefore
Equivalently, it is the splitting field of , of degree six over and degree three over . Replacing by gives the alternative defining cubic . This is the Hilbert class field of Q of square root minus thirty-one.
Use the simple-root form of Hensel lemma: if and satisfy and , there is a unique with and . More generally the same assertion holds over a complete discrete valuation ring, with its maximal ideal in place of .
Every nonzero 3-adic number has a unique expression
Indeed its normalized p-adic valuation fixes , and its unit residue modulo three fixes . Cubing is an automorphism on , so it remains to compute the cube map on the principal units.
For ,
Thus . Conversely, given , apply Hensel lemma to
Modulo three it is , and is always a unit. The residue root therefore lifts, giving with . Hence
This is the cube map on 3-adic principal units. Introducing is essential: applying simple-root lifting directly to would fail because its derivative is divisible by three at every unit.
The map induces an isomorphism , since multiplication adds the first principal-unit digits modulo three. The valuation factor contributes independently, so the cube-class group of the 3-adic numbers is
Explicit generators are the classes of and . Representatives are with . The class of is detected by valuation modulo three, and that of by its nonzero first principal-unit digit, so the two generators are independent.

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