Main Page: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
← Older edit
No edit summary
No edit summary
 
(496 intermediate revisions by more than 100 users not shown)
Line 1: Line 1:
In [[mathematics]], more specifically in the area of [[modern algebra]] known as [[field theory (mathematics)|field theory]], the '''primitive element theorem''' or '''Artin's theorem on primitive elements''' is a result characterizing the finite degree [[field extension]]s that possess a '''primitive element'''. More specifically, the primitive element theorem characterizes those finite degree extensions <math>E\supseteq F</math> such that there exists <math>\alpha\in E</math> with <math>E=F[\alpha]=F(\alpha)</math>.
This is a preview for the new '''MathML rendering mode''' (with SVG fallback), which is availble in production for registered users.


== Terminology ==
If you would like use the '''MathML''' rendering mode, you need a wikipedia user account that can be registered here [[https://en.wikipedia.org/wiki/Special:UserLogin/signup]]
Let <math>E\supseteq F</math> be an arbitrary field extension. An element <math>\alpha\in E</math> is said to be a ''primitive element'' for <math>E\supseteq F</math> when
* Only registered users will be able to execute this rendering mode.
* Note: you need not enter a email address (nor any other private information). Please do not use a password that you use elsewhere.


:<math>E=F[\alpha].</math>
Registered users will be able to choose between the following three rendering modes:  


In this situation, the extension <math>E\supseteq F</math> is referred to as a ''[[simple extension]]''. Then every element ''x'' of ''E'' can be written in the form
'''MathML'''
:<math forcemathmode="mathml">E=mc^2</math>


:<math>x=f_{n-1}{\alpha}^{n-1}+\cdots+f_1{\alpha}+f_0</math> where <math>f_i\in F</math>  
<!--'''PNG'''  (currently default in production)
:<math forcemathmode="png">E=mc^2</math>


for all ''i'', and <math>\alpha\in E</math> is fixed. That is, if <math>E\supseteq F</math> is separable of degree ''n'', there exists <math>\alpha\in E</math> such that the set
'''source'''
:<math forcemathmode="source">E=mc^2</math> -->


:<math>\{1,\alpha,\cdots,{\alpha}^{n-1}\}</math>  
<span style="color: red">Follow this [https://en.wikipedia.org/wiki/Special:Preferences#mw-prefsection-rendering link] to change your Math rendering settings.</span> You can also add a [https://en.wikipedia.org/wiki/Special:Preferences#mw-prefsection-rendering-skin Custom CSS] to force the MathML/SVG rendering or select different font families. See [https://www.mediawiki.org/wiki/Extension:Math#CSS_for_the_MathML_with_SVG_fallback_mode these examples].


is a basis for ''E'' as a [[vector space]] over ''F''.
==Demos==


For instance, the extensions <math>\mathbb{Q}(\sqrt{2})\supseteq \mathbb{Q}</math> and <math>\mathbb{Q}(x)\supseteq \mathbb{Q}</math> are simple extensions with primitive elements <math>\sqrt{2}</math> and ''x'', respectively (<math>\mathbb{Q}(x)</math> denotes the field of rational functions in the indeterminate ''x'' over <math>\mathbb{Q}</math>).
Here are some [https://commons.wikimedia.org/w/index.php?title=Special:ListFiles/Frederic.wang demos]:


== Existence statement ==


The interpretation of the theorem changed with the formulation of the theory of [[Emil Artin]], around 1930. From the time of Galois, the role of primitive elements had been to represent a [[splitting field]] as generated by a single element. This (arbitrary) choice of such an element was bypassed in Artin's treatment.<ref>Israel Kleiner, ''A History of Abstract Algebra'' (2007), p. 64.</ref> At the same time, considerations of construction of such an element receded: the theorem becomes an [[existence theorem]].
* accessibility:
** Safari + VoiceOver: [https://commons.wikimedia.org/wiki/File:VoiceOver-Mac-Safari.ogv video only], [[File:Voiceover-mathml-example-1.wav|thumb|Voiceover-mathml-example-1]], [[File:Voiceover-mathml-example-2.wav|thumb|Voiceover-mathml-example-2]], [[File:Voiceover-mathml-example-3.wav|thumb|Voiceover-mathml-example-3]], [[File:Voiceover-mathml-example-4.wav|thumb|Voiceover-mathml-example-4]], [[File:Voiceover-mathml-example-5.wav|thumb|Voiceover-mathml-example-5]], [[File:Voiceover-mathml-example-6.wav|thumb|Voiceover-mathml-example-6]], [[File:Voiceover-mathml-example-7.wav|thumb|Voiceover-mathml-example-7]]
** [https://commons.wikimedia.org/wiki/File:MathPlayer-Audio-Windows7-InternetExplorer.ogg Internet Explorer + MathPlayer (audio)]
** [https://commons.wikimedia.org/wiki/File:MathPlayer-SynchronizedHighlighting-WIndows7-InternetExplorer.png Internet Explorer + MathPlayer (synchronized highlighting)]
** [https://commons.wikimedia.org/wiki/File:MathPlayer-Braille-Windows7-InternetExplorer.png Internet Explorer + MathPlayer (braille)]
** NVDA+MathPlayer: [[File:Nvda-mathml-example-1.wav|thumb|Nvda-mathml-example-1]], [[File:Nvda-mathml-example-2.wav|thumb|Nvda-mathml-example-2]], [[File:Nvda-mathml-example-3.wav|thumb|Nvda-mathml-example-3]], [[File:Nvda-mathml-example-4.wav|thumb|Nvda-mathml-example-4]], [[File:Nvda-mathml-example-5.wav|thumb|Nvda-mathml-example-5]], [[File:Nvda-mathml-example-6.wav|thumb|Nvda-mathml-example-6]], [[File:Nvda-mathml-example-7.wav|thumb|Nvda-mathml-example-7]].
** Orca: There is ongoing work, but no support at all at the moment [[File:Orca-mathml-example-1.wav|thumb|Orca-mathml-example-1]], [[File:Orca-mathml-example-2.wav|thumb|Orca-mathml-example-2]], [[File:Orca-mathml-example-3.wav|thumb|Orca-mathml-example-3]], [[File:Orca-mathml-example-4.wav|thumb|Orca-mathml-example-4]], [[File:Orca-mathml-example-5.wav|thumb|Orca-mathml-example-5]], [[File:Orca-mathml-example-6.wav|thumb|Orca-mathml-example-6]], [[File:Orca-mathml-example-7.wav|thumb|Orca-mathml-example-7]].
** From our testing, ChromeVox and JAWS are not able to read the formulas generated by the MathML mode.


The following theorem of Artin then takes the place of the classical ''primitive element theorem''.
==Test pages ==


;Theorem
To test the '''MathML''', '''PNG''', and '''source''' rendering modes, please go to one of the following test pages:
*[[Displaystyle]]
*[[MathAxisAlignment]]
*[[Styling]]
*[[Linebreaking]]
*[[Unique Ids]]
*[[Help:Formula]]


Let <math>E\supseteq F</math> be a finite degree field extension. Then <math>E=F[\alpha]</math> for some element <math>\alpha\in E</math> if and only if there exist only finitely many intermediate fields ''K'' with <math>E\supseteq K\supseteq F</math>.
*[[Inputtypes|Inputtypes (private Wikis only)]]
 
*[[Url2Image|Url2Image (private Wikis only)]]
A corollary to the theorem is then the primitive element theorem in the more traditional sense (where separability was usually tacitly assumed):
==Bug reporting==
 
If you find any bugs, please report them at [https://bugzilla.wikimedia.org/enter_bug.cgi?product=MediaWiki%20extensions&component=Math&version=master&short_desc=Math-preview%20rendering%20problem Bugzilla], or write an email to math_bugs (at) ckurs (dot) de .
;Corollary
 
Let <math>E\supseteq F</math> be a finite degree [[separable extension]]. Then <math>E=F[\alpha]</math> for some <math>\alpha\in E</math>.
 
The corollary applies to [[algebraic number field]]s, i.e. finite extensions of the rational numbers '''Q''', since '''Q''' has [[characteristic (algebra)|characteristic]] 0 and therefore every extension over '''Q''' is separable.
 
==Counterexamples==
 
For non-separable extensions, necessarily in [[characteristic p]] with ''p'' a prime number, then at least when the degree [''L''&nbsp;:&nbsp;''K''] is ''p'', ''L''&nbsp;/&nbsp;''K'' has a primitive element, because there are no intermediate subfields. When [''L''&nbsp;:&nbsp;''K''] = ''p''<sup>2</sup>, there may not be a primitive element (and therefore there are infinitely many intermediate fields). This happens, for example if ''K'' is
 
:''F<sub>p</sub>''(''T'',&nbsp;''U''),
 
the field of rational functions in two indeterminates ''T'' and ''U'' over the [[finite field]] with ''p'' elements, and ''L'' is obtained from ''K'' by adjoining a ''p''-th root of ''T'', and of ''U''. In fact one can see that for any &alpha; in ''L'', the element ''&alpha;''<sup>''p''</sup> lies in ''K'', but a primitive element must have degree ''p''<sup>2</sup> over ''K''.
 
==Constructive results==
 
Generally, the set of all primitive elements for a finite separable extension ''L''&nbsp;/&nbsp;''K'' is the complement of a finite collection of proper ''K''-subspaces of&nbsp;''L'', namely the intermediate fields. This statement says nothing for the case of [[finite field]]s, for which there is a computational theory dedicated to finding a generator of the [[multiplicative group]] of the field (a [[cyclic group]]), which is ''a fortiori'' a primitive element. Where ''K'' is infinite, a [[pigeonhole principle]] proof technique considers the linear subspace generated by two elements and proves that there are only finitely many linear combinations
 
:<math>\gamma = \alpha + c \beta\ </math>
 
with ''c'' in ''K'' in it, that fail to generate the subfield containing both elements. This is almost immediate as a way of showing how Artin's result implies the classical result, and a bound for the number of exceptional ''c'' in terms of the number of intermediate fields results (this number being something that can be bounded itself by Galois theory and ''a priori''). Therefore in this case trial-and-error is a possible practical method to find primitive elements. See the Example.
 
== Example ==
It is not, for example, immediately obvious that if one adjoins to the field '''Q''' of [[rational number]]s roots of both [[polynomial]]s
 
:<math>x^2 - 2\ </math>
 
and
 
:<math>x^2 - 3,\ </math>
 
say &alpha; and &beta; respectively, to get a field ''K''&nbsp;=&nbsp;'''Q'''(&alpha;,&nbsp;&beta;) of [[Degree of a field extension|degree]] 4 over '''Q''', that the extension is simple and there exists a primitive element &gamma; in ''K'' so that ''K''&nbsp;=&nbsp;'''Q'''(&gamma;). One can in fact check that with
 
:<math>\gamma = \alpha + \beta\ </math>
 
the powers &gamma;<sup>&nbsp;''i''</sup> for 0&nbsp;&le;&nbsp;''i''&nbsp;&le;&nbsp;3 can be written out as [[linear combination]]s of&nbsp;1,&nbsp;&alpha;,&nbsp;&beta; and ''&alpha;&beta;'' with integer coefficients. Taking these as a [[system of linear equations]], or by factoring, one can solve for &alpha; and &beta; over&nbsp;'''Q'''(''&gamma;'') (one gets, for instance, &alpha;=<math>\scriptstyle\frac{\gamma^3-9\gamma}2</math>), which implies that this choice of &gamma; is indeed a primitive element in this example. A simpler argument, assuming the knowledge of all the subfields as given by Galois theory, is to note the independence of 1,&nbsp;&alpha;,&nbsp;&beta; and &alpha;&beta; over the rationals; this shows that the subfield generated by &gamma; cannot be that generated &alpha; or &beta;, nor in fact that generated by &alpha;&beta;, exhausting all the subfields of degree 2. Therefore it must be the whole field.
 
== See also ==
* [[Primitive element (finite field)]]
 
==References==
 
* [http://www.mathreference.com/fld-sep,pet.html The primitive element theorem at mathreference.com]
* [http://planetmath.org/encyclopedia/ProofOfPrimitiveElementTheorem2.html The primitive element theorem at planetmath.org]
* [http://www.math.cornell.edu/~kbrown/6310/primitive.pdf The primitive element theorem on the site of Cornell's university (pdf file)]
 
==Notes==
{{Reflist}}
 
[[Category:Field theory]]
[[Category:Theorems in abstract algebra]]
 
[[de:Satz vom primitiven Element]]
[[fr:Théorème de l'élément primitif]]
[[it:Teorema dell'elemento primitivo]]
[[pt:Teorema do elemento primitivo]]
[[uk:Теорема про первісний елемент]]
[[zh:本原元定理]]

Latest revision as of 23:52, 15 September 2019

This is a preview for the new MathML rendering mode (with SVG fallback), which is availble in production for registered users.

If you would like use the MathML rendering mode, you need a wikipedia user account that can be registered here [[1]]

  • Only registered users will be able to execute this rendering mode.
  • Note: you need not enter a email address (nor any other private information). Please do not use a password that you use elsewhere.

Registered users will be able to choose between the following three rendering modes:

MathML


Follow this link to change your Math rendering settings. You can also add a Custom CSS to force the MathML/SVG rendering or select different font families. See these examples.

Demos

Here are some demos:


Test pages

To test the MathML, PNG, and source rendering modes, please go to one of the following test pages:

Bug reporting

If you find any bugs, please report them at Bugzilla, or write an email to math_bugs (at) ckurs (dot) de .

Retrieved from "https://en.formulasearchengine.com/index.php?title=Main_Page&oldid=329754"