Ideal class group

related topics
{math, number, function}
{group, member, jewish}

In mathematics, the extent to which unique factorization fails in the ring of integers of an algebraic number field (or more generally any Dedekind domain) can be described by a certain group known as an ideal class group (or class group). If this group is finite (as it is in the case of the ring of integers of a number field), then the order of the group is called the class number. The multiplicative theory of a Dedekind domain is intimately tied to the structure of its class group. For example, the class group of a Dedekind domain is trivial if and only if the ring is a unique factorization domain.

Contents

History and origin of the ideal class group

Ideal class groups (or, rather, what were effectively ideal class groups) were studied some time before the idea of an ideal was formulated. These groups appeared in the theory of quadratic forms: in the case of binary integral quadratic forms, as put into something like a final form by Gauss, a composition law was defined on certain equivalence classes of forms. This gave a finite abelian group, as was recognised at the time.

Later Kummer was working towards a theory of cyclotomic fields. It had been realised (probably by several people) that failure to complete proofs in the general case of Fermat's last theorem by factorisation using the roots of unity was for a very good reason: a failure of the fundamental theorem of arithmetic to hold in the rings generated by those roots of unity was a major obstacle. Out of Kummer's work for the first time came a study of the obstruction to the factorisation. We now recognise this as part of the ideal class group: in fact Kummer had isolated the p-torsion in that group for the field of p-roots of unity, for any prime number p, as the reason for the failure of the standard method of attack on the Fermat problem (see regular prime).

Full article ▸

related documents
Sequence
Elliptic curve
Gaussian quadrature
Natural transformation
Linear combination
IEEE 754-1985
Algebraic structure
Absolute convergence
E (mathematical constant)
Partition (number theory)
Galois theory
Ultrafilter
Abstract interpretation
Random variable
Complex analysis
Binary relation
Exclusive or
Countable set
Database normalization
Fuzzy logic
Pushdown automaton
Filter (mathematics)
Modular arithmetic
Presentation of a group
Axiom schema of replacement
Heine–Borel theorem
Euclidean algorithm
Glossary of topology
Semigroup
XPath 1.0