Comum · Saberes
Dirichlet's unit theorem
Theorem
In mathematics, Dirichlet's unit theorem is a basic result in algebraic number theory due to Peter Gustav Lejeune Dirichlet. It determines the rank of the group of units in the ring OK of algebraic integers of a number field K. The regulator is a positive real number that determines how "dense" the units are.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
In mathematics, Dirichlet's unit theorem is a basic result in algebraic number theory due to Peter Gustav Lejeune Dirichlet. It determines the rank of the group of units in the ring OK of algebraic integers of a number field K. The regulator is a positive real number that determines how "dense" the units are. The statement is that the group of units is finitely generated and has rank (maximal number of multiplicatively independent elements) equal to where r1 is the number of real embeddings and r2 the number of conjugate pairs of complex embeddings of K. This characterisation of r1 and r2 is based on the idea that there will be as many ways to embed K in the complex number field as the degree n = [ K : Q ] {\displaystyle n=[K:\mathbb {Q} ]} ; these will either be into the real numbers, or pairs of embeddings related by complex conjugation, so that Note that if K is Galois over Q {\displaystyle \mathbb {Q} } then either r1 = 0 or r2 = 0. Other ways of determining r1 and r2 are use the primitive element theorem to write K = Q ( α ) {\displaystyle K=\mathbb {Q} (\alpha )} , and then r1 is the number of conjugates of α that are real, 2r2 the number that are complex; in other words, if f is the minimal polynomial of α over Q {\displaystyle \mathbb {Q} } , then r1 is the number of real roots and 2r2 is the number of non-real complex roots of f (which come in complex conjugate pairs); write the tensor product of fields K ⊗ Q R {\displaystyle K\otimes _{\mathbb {Q} }\mathbb {R} } as a product of fields, there being r1 copies of R {\displaystyle \mathbb {R} } and r2 copies...
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·