Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
General number field sieve
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Number fields == {{main|Number field}} Suppose {{mvar|f}} is a {{mvar|k}}-degree polynomial over <math display=inline>\mathbb Q</math> (the rational numbers), and {{mvar|r}} is a complex root of {{mvar|f}}. Then, {{math|''f''(''r'') {{=}} 0}}, which can be rearranged to express {{math|''r''<sup>''k''</sup>}} as a linear combination of powers of {{mvar|r}} less than {{mvar|k}}. This equation can be used to reduce away any powers of {{math|''r''}} with exponent {{math| ''e'' β₯ ''k''}}. For example, if {{math|''f''(''x'') {{=}} ''x''<sup>2</sup> + 1}} and {{mvar|r}} is the imaginary unit {{mvar|i}}, then {{math|''i''<sup>2</sup> + 1 {{=}} 0}}, or {{math|''i''<sup>2</sup> {{=}} β1}}. This allows us to define the complex product: :<math> \begin{align} (a+bi)(c+di) & = ac + (ad+bc)i + (bd)i^2 \\[4pt] & = (ac - bd) + (ad+bc)i. \end{align} </math> In general, this leads directly to the [[algebraic number field]] <math display=inline>\mathbb Q[r]</math>, which can be defined as the set of [[complex number]]s given by: :<math>a_{k-1}r^{k-1} + \cdots + a_1 r^1 + a_0 r^0, \text{ where } a_0,\ldots,a_{k-1} \in \mathbb Q.</math> The product of any two such values can be computed by taking the product as polynomials, then reducing any powers of {{math|''r''}} with exponent {{math| ''e'' β₯ ''k''}} as described above, yielding a value in the same form. To ensure that this field is actually {{mvar|k}}-dimensional and does not collapse to an even smaller field, it is sufficient that {{mvar|f}} is an [[irreducible polynomial]] over the rationals. Similarly, one may define the [[ring of integers]] <math display=inline> \mathbb O_{\mathbb Q[r]} </math> as the subset of <math display=inline>\mathbb Q[r]</math> which are roots of [[monic polynomial|monic polynomials]] with integer coefficients. In some cases, this ring of integers is equivalent to the ring <math display=inline> \mathbb Z[r] </math>. However, there are many exceptions.<ref name="AlgNumbersRibenboim">{{cite book | title=Algebraic Numbers | publisher=Wiley-Interscience | author=Ribenboim, Paulo | year=1972 | isbn=978-0-471-71804-8}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)