Information About

Adjunction (field Theory)





DEFINITION


Let ''E'' be a field extension of a Field ''F''. Given a set of elements ''A'' in the larger field ''E'' we denote by ''F''(''A'') the smallest subextension which contains the elements of ''A''. We say ''F''(''A'') is constructed by adjunction of the elements ''A'' to ''F'' or '''generated''' by ''A''.

If ''A'' is finite we say ''F''(''A'') is finitely generated and if ''A'' consists of a single element we say ''F''(''A'') is a ''' Simple Extension '''. For finite extensions
:A=\{a_0,\ldots,a_n\}
we often write
:F(a_0,\ldots,a_n)
instead of
:F(\{a_0,\ldots,a_n\}).


NOTES


  • , / applied to elements from ''F'' and ''A''. For this reason ''F''(''A'') is sometimes called field of rational expressions in ''F'' and ''A''.



EXAMPLES


  • Given a field extension ''E''/''F'' then ''F''(Ø) = ''F'' and ''F''(''E'') = ''E''.

  • The Complex Number s are constructed by adjunction of the Imaginary Unit to the Real Number s, that is C='''R'''(i).



PROPERTIES


Given a field extension ''E''/''F'' and a subset ''A'' of ''E''. Let \mathcal{T} be the family of all finite subsets of ''A'' then
:F(A) = \bigcup_{T \in \mathcal{T}} F(T).
In other words the adjunction of any set can be reduced to a union of adjunctions of finite sets.

Given a field extension ''E''/''F'' and two subset ''N'',''M'' of ''E'' then ''K''(''M'' ∪ ''N'') = ''K''(''M'')(''N'') = ''K''(''N'')(''M''). This shows that any adjunction of a finite set can be reduced to a sucessive adjunction of single elements.