<p>Schinzel and Wójcik have shown that for every <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="124" /> </InlineMediaObject> <EquationSource Format="TEX">\(\alpha ,\beta \in \mathbb {Q}^{\times }\hspace{0.55542pt}{\setminus }\hspace{1.111pt}\{\pm 1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo>∈</mo> <msup> <mrow> <mi mathvariant="double-struck">Q</mi> </mrow> <mo>×</mo> </msup> <mspace width="0.55542pt" /> <mo lspace="0.15em" rspace="0.15em" stretchy="false">\</mo> <mspace width="1.111pt" /> <mrow> <mo stretchy="false">{</mo> <mo>±</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>, there are infinitely many primes <i>p</i> where <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq2.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="128" /> </InlineMediaObject> <EquationSource Format="TEX">\(v_p(\alpha )=v_p(\beta )=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>v</mi> <mi>p</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msub> <mi>v</mi> <mi>p</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> and where <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq3.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="14" /> </InlineMediaObject> <EquationSource Format="TEX">\(\alpha \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>α</mi> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\beta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>β</mi> </math></EquationSource> </InlineEquation> generate the same multiplicative group mod <i>p</i>. We prove a weaker result in the same direction for algebraic numbers <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq5.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="33" /> </InlineMediaObject> <EquationSource Format="TEX">\(\alpha , \beta \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>,</mo> <mi>β</mi> </mrow> </math></EquationSource> </InlineEquation>. Let <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq6.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="73" /> </InlineMediaObject> <EquationSource Format="TEX">\(\alpha , \beta \in \overline{\mathbb {Q}} ^{\times }\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo>∈</mo> <msup> <mover> <mi mathvariant="double-struck">Q</mi> <mo>¯</mo> </mover> <mo>×</mo> </msup> </mrow> </math></EquationSource> </InlineEquation>, and suppose <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq7.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="128" /> </InlineMediaObject> <EquationSource Format="TEX">\(|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\alpha )|\ne 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="double-struck">Q</mi> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mi mathvariant="double-struck">Q</mi> </mrow> </msub> <mrow> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">|</mo> <mo>≠</mo> <mn>1</mn> </mrow> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq8.gif" Format="GIF" Height="21" Rendition="HTML" Resolution="72" Type="Linedraw" Width="127" /> </InlineMediaObject> <EquationSource Format="TEX">\(|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\beta )|\ne 1\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>N</mi> <mrow> <mi mathvariant="double-struck">Q</mi> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> <mo stretchy="false">/</mo> <mi mathvariant="double-struck">Q</mi> </mrow> </msub> <mrow> <mrow> <mo stretchy="false">(</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">|</mo> <mo>≠</mo> <mn>1</mn> </mrow> </mrow> </math></EquationSource> </InlineEquation>. Then for some positive integer <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq9.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="91" /> </InlineMediaObject> <EquationSource Format="TEX">\(C = C(\alpha ,\beta )\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>C</mi> <mo>=</mo> <mi>C</mi> <mo stretchy="false">(</mo> <mi>α</mi> <mo>,</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>, there are infinitely many prime ideals <i>P</i> of <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="MediaObjects/40879_2025_819_IEq10_HTML.gif" Format="GIF" Height="22" Rendition="HTML" Resolution="120" Type="Linedraw" Width="52" /> </InlineMediaObject> </InlineEquation> where <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq11.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="135" /> </InlineMediaObject> <EquationSource Format="TEX">\(v_P(\alpha )=v_P(\beta )=0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>v</mi> <mi>P</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>α</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <msub> <mi>v</mi> <mi>P</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>β</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mn>0</mn> </mrow> </math></EquationSource> </InlineEquation> and where the group <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq12.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="83" /> </InlineMediaObject> <EquationSource Format="TEX">\(\langle \beta \bmod {P}\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">⟨</mo> <mi>β</mi> <mspace width="0.277778em" /> <mo>mod</mo> <mspace width="0.277778em" /> <mi>P</mi> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation> is a subgroup of <InlineEquation ID="IEq13"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq13.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="83" /> </InlineMediaObject> <EquationSource Format="TEX">\(\langle \alpha \bmod {P}\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">⟨</mo> <mi>α</mi> <mspace width="0.277778em" /> <mo>mod</mo> <mspace width="0.277778em" /> <mi>P</mi> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq14"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="40879_2025_819_Article_IEq14.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="175" /> </InlineMediaObject> <EquationSource Format="TEX">\([\langle \alpha \bmod {P}\rangle \,{:}\, \langle \beta \bmod {P}\rangle ]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">[</mo> <mo stretchy="false">⟨</mo> <mi>α</mi> <mspace width="0.277778em" /> <mo>mod</mo> <mspace width="0.277778em" /> <mi>P</mi> <mo stretchy="false">⟩</mo> <mspace width="0.166667em" /> <mo>:</mo> <mspace width="0.166667em" /> <mo stretchy="false">⟨</mo> <mi>β</mi> <mspace width="0.277778em" /> <mo>mod</mo> <mspace width="0.277778em" /> <mi>P</mi> <mo stretchy="false">⟩</mo> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> dividing <i>C</i>. A key component of the proof is a theorem of Corvaja and Zannier bounding the greatest common divisor of shifted <i>S</i>-units.</p>

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

Towards a Schinzel–Wójcik theorem for number fields

  • Paul Pollack

摘要

Schinzel and Wójcik have shown that for every \(\alpha ,\beta \in \mathbb {Q}^{\times }\hspace{0.55542pt}{\setminus }\hspace{1.111pt}\{\pm 1\}\) α , β Q × \ { ± 1 } , there are infinitely many primes p where \(v_p(\alpha )=v_p(\beta )=0\) v p ( α ) = v p ( β ) = 0 and where \(\alpha \) α and \(\beta \) β generate the same multiplicative group mod p. We prove a weaker result in the same direction for algebraic numbers \(\alpha , \beta \) α , β . Let \(\alpha , \beta \in \overline{\mathbb {Q}} ^{\times }\) α , β Q ¯ × , and suppose \(|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\alpha )|\ne 1\) | N Q ( α , β ) / Q ( α ) | 1 and \(|N_{\mathbb {Q}(\alpha ,\beta )/\mathbb {Q}}(\beta )|\ne 1\) | N Q ( α , β ) / Q ( β ) | 1 . Then for some positive integer \(C = C(\alpha ,\beta )\) C = C ( α , β ) , there are infinitely many prime ideals P of where \(v_P(\alpha )=v_P(\beta )=0\) v P ( α ) = v P ( β ) = 0 and where the group \(\langle \beta \bmod {P}\rangle \) β mod P is a subgroup of \(\langle \alpha \bmod {P}\rangle \) α mod P with \([\langle \alpha \bmod {P}\rangle \,{:}\, \langle \beta \bmod {P}\rangle ]\) [ α mod P : β mod P ] dividing C. A key component of the proof is a theorem of Corvaja and Zannier bounding the greatest common divisor of shifted S-units.