西格尔零点
西格尔零点、西格尔零(Template:Lang-en)、兰道-西格尔零点(Template:Lang-en)、異常零点(Template:Lang-en[1]),是以德国数学家愛德蒙·蘭道和卡爾·西格爾命名的一種对廣義黎曼假設潛在反例的解析數論猜想,是關於與二次域相關的狄利克雷L函數的零點。粗略說,這些可能的零點在可量化的意義上可以非常接近Template:Math。
動機和定義
狄利克雷L函數有與黎曼ζ函數相似的無零點區域。
Template:TransH The way in which Siegel zeros appear in the theory of Dirichlet L-functions is as potential exceptions to the Template:Tsl, which can only occur when the L-function is associated to a real Dirichlet character.
Real primitive Dirichlet characters
For an integer Template:Math, a Dirichlet character modulo Template:Math is an Template:Tsl satisfying the following properties:
- (Template:Tsl) for every Template:Math, Template:Math;
- (Periodic) for every Template:Math;
- (Support) if .
That is, Template:Math is the lifting of a Template:Tsl .
The trivial character is the character modulo 1, and the principal character modulo Template:Math, denoted , is the lifting of the trivial homomorphism .
A character is called imprimitive if there exists some integer with such that the induced homomorphism factors as
for some character ; otherwise, is called primitive.
A character is real (or quadratic) if it equals its Template:Tsl (defined as ), or equivalently if . The real primitive Dirichlet characters are in one-to-one correspondence with the 克罗内克符号s for a Template:Tsl (i.e., the discriminant of a Template:Tsl).[2] One way to define is as the completely multiplicative arithmetic function determined by (for Template:Math prime):
It is thus common to write , which are real primitive characters modulo .
Classical zero-free regions
The Dirichlet L-function associated to a character is defined as the Template:Tsl of the 狄利克雷级数 defined for , where s is a Template:Tsl. For non-principal, this continuation is Template:Tsl; otherwise it has a Template:Tsl of Template:Tsl at Template:Math as its only singularity. For , Dirichlet L-functions can be expanded into an 欧拉乘积 , from where it follows that has no zeros in this region. The Template:Tsl is equivalent (in a certain sense) to (). Moreover, via the Template:Tsl, we can reflect these regions through to conclude that, with the exception of negative integers of same parity as Template:Math,[3] all the other zeros of must lie inside . This region is called the critical strip, and zeros in this region are called non-trivial zeros.
The classical theorem on zero-free regions (Grönwall,[4] Landau,[5] Titchmarsh[6]) states that there exists a(n) (effectively computable) real number such that, writing for the complex variable, the function has no zeros in the region
if is non-real. If is real, then there is at most one zero in this region, which must necessarily be real and simple. This possible zero is the so-called Siegel zero.
The Template:Tsl (GRH) claims that for every , all the non-trivial zeros of lie on the line .
定義「西格爾零點」
The definition of Siegel zeros as presented ties it to the constant Template:Math in the zero-free region. This often makes it tricky to deal with these objects, since in many situations the particular value of the constant Template:Math is of little concern.[1] Hence, it is usual to work with more definite statements, either asserting or denying, the existence of an infinite family of such zeros, such as in:
- Conjecture ("no Siegel zeros"): If denotes the largest real zero of , then
The possibility of existence or non-existence of Siegel zeros has a large impact in closely related subjects of number theory, with the "no Siegel zeros" conjecture serving as a weaker (although powerful, and sometimes fully sufficient) substitute for GRH (see below for an example involving Siegel–Tatuzawa's Theorem and the Template:Tsl problem). An equivalent formulation of "no Siegel zeros" that does not reference zeros explicitly is the statement:
The equivalence can be deduced for example by using the zero-free regions and classical estimates for the number of non-trivial zeros of up to a certain height.[7]
Landau–Siegel estimates
The first breakthrough in dealing with these zeros came from Landau, who showed that there exists an effectively computable constant Template:Math such that, for any and real primitive characters to distinct moduli, if are real zeros of respectively, then
This is saying that, if Siegel zeros exist, then they cannot be too numerous. The way this is proved is via a 'twisting' argument, which lifts the problem to the Template:Tsl of the Template:Tsl . This technique is still largely applied in modern works.
This 'repelling effect' (see Template:Tsl), after more careful analysis, led Landau to his 1936 theorem,[8] which states that for every , there is such that, if is a real zero of , then . However, in the same year, in the same issue of the same journal, Siegel[9] directly improved this estimate to
Both Landau's and Siegel's proofs provide no explicit way to calculate , thus being instances of an Template:Tsl.
Siegel–Tatuzawa 定理
In 1951, Template:Tsl proved an 'almost' effective version of Siegel's theorem,[10] showing that for any fixed , if then
with the possible exception of at most one fundamental discriminant. Using the 'almost effectivity' of this result, Template:Tsl (1973)[11] showed that Euler's list of 65 Template:Tsl is complete except for at most one element.
Relation to quadratic fields
Siegel zeros often appear as more than an artificial issue in the argument for deducing zero-free regions, since zero-free region estimates enjoy deep connections to the arithmetic of quadratic fields. For instance, the identity can be interpreted as an analytic formulation of Template:Tsl (see Template:Tsl). The precise relation between the distribution of zeros near Template:Math and arithmetic comes from Template:Tsl:
where:
- is the Template:Tsl of ;
- is the number of Template:Tsl in (Template:Math);
- is the Template:Tsl of (Template:Math).
This way, estimates for the largest real zero of can be translated into estimates for (via, for example, the fact that for ),[12] which in turn become estimates for . Classical works in the subject treat these three quantities essentially interchangeably, although the case Template:Math brings additional complications related to the fundamental unit.
Siegel zeros as 'quadratic phenomena'
There is a sense in which the difficulty associated to the phenomenon of Siegel zeros in general is entirely restricted to quadratic extensions. It is a consequence of the Template:Tsl, for example, that the Template:Tsl of an Template:Tsl can be written as a product of Dirichlet L-functions.[13] Thus, if has a Siegel zero, there must be some subfield with such that has a Siegel zero.
While for the non-abelian case can only be factored into more complicated Template:Tsls, the same is true:
- Theorem (Template:Tsl, 1974).[14] Let be a number field of degree Template:Math. There is a constant ( if is normal, otherwise) such that, if there is a real in the range
- with , then there is a quadratic subfield such that . Here, is the Template:Tsl of the extension .
"No Siegel zeros" for D < 0
When dealing with quadratic fields, the case tends to be elusive due to the behaviour of the fundamental unit. Thus, it is common to treat the cases and separately. Much more is known for the negative discriminant case:
Lower bounds for h(D)
In 1918, Template:Tsl showed that "no Siegel zeros" for implies that [5] (see Template:Tsl for comparison). This can be extended to an equivalence, as it is a consequence of Theorem 3 in Template:Tsl–Template:Tsl (2000):[15]
where the summation runs over the Template:Tsl Template:Tsl of discriminant . Using this, Granville and Stark showed that a certain uniform formulation of the Template:Tsl for number fields implies "no Siegel zeros" for negative discriminants.
In 1976, Template:Tsl[16] proved the following unconditional, effective lower bound for :
Complex multiplication
Another equivalence for "no Siegel zeros" for can be given in terms of Template:Tsl for Template:Tsl of Template:Tsl:
where:
- is the absolute Template:Tsl for number fields;
- is the Template:Tsl;
- .
The number generates the Template:Tsl of , which is its maximal unramified abelian extension.[17] This equivalence is a direct consequence of the results in Granville–Stark (2000),[15] and can be seen in C. Táfula (2019).[18]
A precise relation between heights and values of L-functions was obtained by Template:Tsl (1993,[19] 1998[20]), who showed that, for an elliptic curve with Template:Tsl by , we have
where denotes the Template:Tsl.[21] Using the identities [22] and ,[23] Colmez' theorem also provides a proof for the equivalence above. Template:TransF
西格爾零點存在所造成的結果
盡管一般預期廣義黎曼猜想是對的,但由於「西格爾零點不存在」的猜想依舊開放之故,因此研究「假如廣義黎曼猜想如此的反例存在的話,會有什麼結果」,也是一個令人感興趣的題目。
另一個研究如此可能性的理由,是迄今為止,部分的無條件證明要分成兩部分:第一部分是假定西格爾零點不存在,第二部分是假定西格爾零點存在,並證明說想要的定理在這兩種狀況下都成立。一個如此為之的經典案例是關於算數數列中最小的質數的林尼克定理。
以下是在西格爾零點存在的狀況下,所會造成的結果。
存在無限多個孿生質數
羅傑·希斯-布朗在1983年做出的一個令人驚訝的結果[24],用陶哲軒的話,[25]可如下陳述:
- 定理(Heath-Brown, 1983):以下兩个命题至少有一為真:(1)不存在西格爾零點;(2)存在有無限多的孿生質數。
換句話說,如果(1)不成立,也就是西格爾零點存在的話,那(2)就必須成立;反之若(1)成立,也就是西格爾零點不存在的話,那(2)是否成立依舊是未知數。
篩法的奇偶性問題
篩法的奇偶性問題指的是篩法無法顯示出篩選出的整數有奇數個或偶數個質因數這樣的問題。
這使得很多運用篩法的估計,像是使用線性篩(linear sieve)做出的估計,[26]會以一個2的因子,與預期值產生誤差。
在2020年,Template:Link-en[27]證明說假若西格爾零點存在,那麼篩法篩選區間的一般上界就是最佳的,換句話說,在這種狀況下,奇偶性多出來的這個2的因子,就不會是篩法的人為限制。
另見
參考
- ↑ 1.0 1.1 See Iwaniec (2006).
- ↑ See Satz 4, §5 of Zagier (1981).
- ↑ Template:Math is even if Template:Math, and odd if Template:Math.
- ↑ Template:Cite journal
- ↑ 5.0 5.1 Template:Cite journal
- ↑ Template:Cite journal
- ↑ See Chapter 16 of Davenport (1980).
- ↑ Template:Cite journal
- ↑ Template:Cite journal
- ↑ Template:Cite journal
- ↑ Template:Cite journal
- ↑ See (11) in Chapter 14 of Davenport (1980).
- ↑ Theorem 10.5.25 in Template:Cite book.
- ↑ Lemma 8 in Template:Cite journal
- ↑ 15.0 15.1 Template:Cite journal
- ↑ Template:Cite journal
- ↑ Theorem II.4.1 in Template:Citation.
- ↑ Template:Cite journal
- ↑ Template:Cite journal
- ↑ Template:Cite journal
- ↑ See the diagram in subsection 0.6 of Colmez (1993). There is small typo in the upper right corner of this diagram, that should instead read "".
- ↑ Proposition 2.1, Chapter X of Template:Cite book
- ↑ Consequence of the Template:Tsl, where Template:Math is the Template:Tsl.
- ↑ Template:Cite journal
- ↑ Template:Cite web
- ↑ See Chapter 9 of Template:Cite book
- ↑ Template:Cite arXiv