Les Zéros de la Fonction Zeta de Riemann

48 downloads 0 Views 103KB Size Report
The Zeta was first introduced by Euler, but Riemann proved it utility by ... Riemann conjectured that all non-trivial zeros of the zeta functions are on the critical line ...
THE RIEMANN HYPOTHESIS: IS TRUE!! Ayman MACHHIDAN Morocco [email protected] Abstract : The Riemann’s zeta function is defined by 1

=

for complex value s, this formula have sense only for > 1. This function is analytically extended to hole complex plan (with a simple singularity on s=1). The Zeta was first introduced by Euler, but Riemann proved it utility by establishing the relationship between the distribution of prime number and the localization of zeta’s zeros. Riemann conjectured that all non-trivial zeros of the zeta functions are on the critical line

=

In this paper we will try to give a positive answer. INTRODUCTION In 1859 Bernhard Riemann wrote a short paper titled “Uber die Anzahl der Primzahlen unter einer gegebenen Grosse”, which can be translated as “On the Number of Prime Numbers less than a Given Quantity”. As the title suggests, it deals with prime numbers and, in particular, with the prime counting function =

1=#

/ ≤

It was the only paper written by Riemann on number theory but it is considered, together with the Dirichlet’s theorem on the primes in arithmetic progression, the starting point of modern analytic number theory. Riemann’s aim was to provide an explicit formula for ; before him, Gauss already tried to find such a formula but he was only able to prove that the function π(x) is well approximated by the logarithmic integral =! 1

"# log #

Gauss’s estimate was motivated by the observation made by Euler about the divergence of the series 1

'=

=

1 1 1 + + +⋯ 2 3 5

In Euler’s terminology, ' = log log ∞ , which was a consequence of the Euler’s product formula for the harmonic series, 1

=.

1 1−

0

So that log 1

1

2=−

345 1 −

0

1 1 1 6 + + 7 +⋯8 2 3

=

And the right hand side is the sum of S plus convergent series. Riemann was intentioned to find an explicit formula for the prime counting function, not only an estimate like Gauss did. In order to do that, he certainly based his work on the excellent approximation (3) but, at the same time, he made use of a generalization of the Euler’s product formula, introducing the most important function in analytic number theory, the Riemann zetafunction , defined as 1

= For = 9 + # ∈ ℂ. The zeta-function converges absolutely for product formula to =.



> 1, in which case we can generalize the Euler’s 1 1−

0

, σ>1

The function plays a fundamental role inside Riemann’s paper: “some” of its zeros appear in the explicit formula that connects to , they are the basic ingredient of the error term in Gauss’s approximation (3). The zeros we are talking about are the so-called non-trivial zeros of , in contrast with the trivial zeros of ζ(s) which happens for = −2, −4, −6, …: the non-trivial zeros, usually indicated with B = C + D, are infinite in number and they have B = C ∈ 0,1 , the region 0 < < 1 is called critical strip and the most important open problem in number theory, the Riemann Hypothesis (RH), states that each non-trivial zero has β = 1 2 , that is they are 2

all located along the critical line,

= . RH was first conjectured by Riemann in his paper,

where he wrote that “it is probable” that all non-trivial zeros have real part equal to

.

This paper presents an affirmation of Riemann Hypothesis.

PRELIMINARY : In this section we will present definitions and necessary theorem (lemma) for establishing the Riemann Hypothesis. 1. THE NOTION OF GH-INJECTIVE COMPLEX FUNCTION The notion of injective complex function is well known; in this section we introduce a new vision for function of complex variable. Definition: a function I: K ⊂ ℂ ⟶ ℂ is called assertion: For all N, ∈ K, For all N, ∈ K,

I

-injective if and only if verify one of the equivalent

=I N ⟹ ≠

N ⟹I

=

N

≠I N

Remark: from the definition every injective function is -injective. The inverse is false, in fact: the exponential function is non-injective (indeed if = Q then = N + 2 R ), but it is well injective. 2. SEQUENCES OF ST-INJECTIVE FUNCTIONS. The Huwirtz’s (Titchmarsh, 1985) theorem proves that the limit of injective sequence of complex function is also injective. In this section we will prove that the limit of -injective sequence of complex function is also -injective. LEMME : Let Ω an open connected subset of ℂ. Suppose that IV ⟶ I in W Ω . And suppose that IV is not identically zero on Ω for big. Then I is identically zero on Ω. Proof. see (Titchmarsh, 1985)

3

The main Theorem: Let Ω = I × ℝ [ an open interval of ℝ open connected subsets of ℂ. Suppose that IV ⟶ I in W Ω . And suppose that IV are Then I is

-injective on Ω for

big enough.

-injective on Ω, or constant.

Proof. Suppose that there is \ > 0, such that for is not constant on Ω. Let N, N^ ∈ Ω such that

≥ \ that IV is -injective sur Ω . Suppose that I N^ ≠ N and let :

_V N = IV N − IV N^

_ N = I N − I N^

et

By construction _V ⟶ _ in W Ω\ N^ .

Since IV are -injective on Ω, then _V is not zero on Ω\ N^ and Ω\ N^ is an open connected subset, by the precedent lemma _ is not zero on Ω\ N^ , hence I is -injective on Ω.

L’HYPOTHESE DE RIEMANN Riemann Theorem: The Riemann zetas Function verify the following property: = 0, = 9 + #, 0 < 9 < 1 ⟹ 9 = Proof: Denote by Ω =]0,1[× ℝ ⊂ ℂ open connected subset of ℂ. The proof is divided in three parts: i.

The sequence of function I

=

1 1−2

0



Converge to the Riemann zeta function. ii.

We prove that the following sequence is

For that let , N ∈ Ω, such that

ce

−1 cd R

-injective :

1 1−2

I

=

>

N , on obtient

4

0



ce

−1 R

cd

1 2

|


1 1 + 2 0gh

|I

Q

i

−1 R

Q

i

−1 cd i RQ

ce

cd

i

and

ce

It is clear that i

ce

−1 R

cd

i