Concept

Conjugate element (field theory)

In mathematics, in particular field theory, the conjugate elements or algebraic conjugates of an algebraic element α, over a field extension L/K, are the roots of the minimal polynomial pK,α(x) of α over K. Conjugate elements are commonly called conjugates in contexts where this is not ambiguous. Normally α itself is included in the set of conjugates of α. Equivalently, the conjugates of α are the images of α under the field automorphisms of L that leave fixed the elements of K. The equivalence of the two definitions is one of the starting points of Galois theory. The concept generalizes the complex conjugation, since the algebraic conjugates over of a complex number are the number itself and its complex conjugate. The cube roots of the number one are: The latter two roots are conjugate elements in Q[i] with minimal polynomial If K is given inside an algebraically closed field C, then the conjugates can be taken inside C. If no such C is specified, one can take the conjugates in some relatively small field L. The smallest possible choice for L is to take a splitting field over K of pK,α, containing α. If L is any normal extension of K containing α, then by definition it already contains such a splitting field. Given then a normal extension L of K, with automorphism group Aut(L/K) = G, and containing α, any element g(α) for g in G will be a conjugate of α, since the automorphism g sends roots of p to roots of p. Conversely any conjugate β of α is of this form: in other words, G acts transitively on the conjugates. This follows as K(α) is K-isomorphic to K(β) by irreducibility of the minimal polynomial, and any isomorphism of fields F and F that maps polynomial p to p can be extended to an isomorphism of the splitting fields of p over F and p over F, respectively. In summary, the conjugate elements of α are found, in any normal extension L of K that contains K(α), as the set of elements g(α) for g in Aut(L/K). The number of repeats in that list of each element is the separable degree [L:K(α)]sep.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.