Information AboutAdjunction (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 : we often write : instead of :. NOTES
EXAMPLES
PROPERTIES Given a field extension ''E''/''F'' and a subset ''A'' of ''E''. Let be the family of all finite subsets of ''A'' then :. 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. |
|
|