<p>Let <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(K = {{\textbf{Q}}}(\theta )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>K</mi> <mo>=</mo> <mi mathvariant="bold">Q</mi> <mo stretchy="false">(</mo> <mi>θ</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> be an algebraic number field, where <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\theta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>θ</mi> </math></EquationSource> </InlineEquation> is a root of the irreducible polynomial <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(x^n - a \in {{\textbf{Q}}}[x]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>x</mi> <mi>n</mi> </msup> <mo>-</mo> <mi>a</mi> <mo>∈</mo> <mi mathvariant="bold">Q</mi> <mrow> <mo stretchy="false">[</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> of degree <i>n</i>, and let <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\({\textbf {Z}}_K\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="bold">Z</mi> <mi>K</mi> </msub> </math></EquationSource> </InlineEquation> denote the ring of integers of <i>K</i>. In general, for arbitrary integers <i>n</i> and <i>a</i>, the explicit computation of the discriminant and an integral basis of <i>K</i> remains unresolved, except in special cases such as <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(n = 4\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <mn>4</mn> </mrow> </math></EquationSource> </InlineEquation>, 8, 9, a prime <i>p</i>, or a product <i>pq</i> of distinct primes <i>p</i> and <i>q</i>. Most existing results assume either that <i>a</i> is square-free or that <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\gcd (a, n) = 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo movablelimits="true">gcd</mo> <mo stretchy="false">(</mo> <mi>a</mi> <mo>,</mo> <mi>n</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mn>1</mn> </mrow> </math></EquationSource> </InlineEquation>. In this article, we address the case <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(n = p^2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>n</mi> <mo>=</mo> <msup> <mi>p</mi> <mn>2</mn> </msup> </mrow> </math></EquationSource> </InlineEquation> for an odd prime <i>p</i>, without imposing any condition on <i>a</i>. Using the theory of Newton polygons of first and second order, we determine the exact power of each prime <i>q</i> dividing the index <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\([{\textbf {Z}}_K : {\textbf {Z}}[\theta ]]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">[</mo> <msub> <mi mathvariant="bold">Z</mi> <mi>K</mi> </msub> <mo>:</mo> <mi mathvariant="bold">Z</mi> <mrow> <mo stretchy="false">[</mo> <mi>θ</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>. This allows us to construct explicitly a <i>q</i>-integral basis of <i>K</i> for each prime <i>q</i>, which in turn yields a complete integral basis of <i>K</i>. Several illustrative examples are provided. As an application, we show that if <i>a</i> is square-free and satisfies <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(a^{p-1} \not \equiv 1 \pmod {p^2}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msup> <mi>a</mi> <mrow> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </msup> <mo>≢</mo> <mn>1</mn> <mspace width="4.44443pt" /> <mrow> <mo stretchy="false">(</mo> <mo>mod</mo> <mspace width="0.277778em" /> <msup> <mi>p</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, then <i>K</i> admits a power basis; that is, <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\({\textbf {Z}}_K = {\textbf {Z}}[\theta ]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi mathvariant="bold">Z</mi> <mi>K</mi> </msub> <mo>=</mo> <mi mathvariant="bold">Z</mi> <mrow> <mo stretchy="false">[</mo> <mi>θ</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Explicit discriminant and integral basis of \({{\textbf{Q}}}(\root p^2 \of {a})\)

  • Anuj Jakhar

摘要

Let \(K = {{\textbf{Q}}}(\theta )\) K = Q ( θ ) be an algebraic number field, where \(\theta \) θ is a root of the irreducible polynomial \(x^n - a \in {{\textbf{Q}}}[x]\) x n - a Q [ x ] of degree n, and let \({\textbf {Z}}_K\) Z K denote the ring of integers of K. In general, for arbitrary integers n and a, the explicit computation of the discriminant and an integral basis of K remains unresolved, except in special cases such as \(n = 4\) n = 4 , 8, 9, a prime p, or a product pq of distinct primes p and q. Most existing results assume either that a is square-free or that \(\gcd (a, n) = 1\) gcd ( a , n ) = 1 . In this article, we address the case \(n = p^2\) n = p 2 for an odd prime p, without imposing any condition on a. Using the theory of Newton polygons of first and second order, we determine the exact power of each prime q dividing the index \([{\textbf {Z}}_K : {\textbf {Z}}[\theta ]]\) [ Z K : Z [ θ ] ] . This allows us to construct explicitly a q-integral basis of K for each prime q, which in turn yields a complete integral basis of K. Several illustrative examples are provided. As an application, we show that if a is square-free and satisfies \(a^{p-1} \not \equiv 1 \pmod {p^2}\) a p - 1 1 ( mod p 2 ) , then K admits a power basis; that is, \({\textbf {Z}}_K = {\textbf {Z}}[\theta ]\) Z K = Z [ θ ] .