the entanglement of structures in complex proofsjeanpetitot.com/articlespdf/petitot_rh.pdf · the...

247
The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot CAMS (EHESS), Paris Tuesday, June 21st J. Petitot Complex entanglement of structures

Upload: others

Post on 05-Oct-2020

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The entanglement of structuresin complex proofs

PhilMath Intersem 7. 2016

Jean PetitotCAMS (EHESS), Paris

Tuesday, June 21st

J. Petitot Complex entanglement of structures

Page 2: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Introduction

The unity of mathematics

In mathematics, the context of justification is proof. It has beendeeply investigated philosophically. But the context of discoveryremains mysterious and is very poorly understood.

Structural concepts in Bourbaki’s sense play a crucial role in it.

I am interested in the role of such structural concepts in complexproofs and the only way to understand something is to look atrelevant examples.

J. Petitot Complex entanglement of structures

Page 3: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Some monthes ago (November 2015), in the 7eme RencontresFrancaises de Philosophie des Mathematiques, I gave the exampleof the Wiles-Taylor proof of the Shimura-Taniyama-Weilconjecture.

Today, I will try to explain what I understand of Connes’ newconceptual strategy for proving Riemann hypothesis.

It is Connes himself who constantly stresses the fact that we needa conceptual understanding of the formulas involved in theproblem to discover good strategies of proof.

J. Petitot Complex entanglement of structures

Page 4: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

RH is a very long story entangling some of the deepest methodsand results of arithmetics, analysis, and geometry.

Its conceptual content is deeply correlated to this entanglementand in particular to the analogies from which it is derived.

J. Petitot Complex entanglement of structures

Page 5: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

A conceptually complex proof is a very uneven, rough, ruggedmulti-theoretical route in a sort of “Himalayan chain” whose peaksseem inaccessible.

It cannot be understood without the key thesis of the unity ofmathematics since its deductive parts are widely scattered in theglobal unity of the mathematical universe.

It is holistic and it is this holistic nature I am interested in.

J. Petitot Complex entanglement of structures

Page 6: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As was emphasized by Israel Kleiner for the STW conjecture:

“What area does the proof come from? It is unlikely onecould give a satisfactory answer, for the proof bringstogether many important areas – a characteristic ofrecent mathematics.”

J. Petitot Complex entanglement of structures

Page 7: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As was also emphasized by Barry Mazur:

“The conjecture of Shimura-Taniyama-Weil is aprofoundly unifying conjecture — its very statement hintsthat we may have to look to diverse mathematical fieldsfor insights or tools that might leads to its resolution.”.

J. Petitot Complex entanglement of structures

Page 8: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In the same paper, Mazur adds:

“One of the mysteries of the Shimura-Taniyama-Weilconjecture, and its constellation of equivalentparaphrases, is that although it is indeniably a conjecture“about arithmetic”, it can be phrased variously, so that:in one of its guises, one thinks of it as being also deeply“about” integral transforms in the theory of one complexvariable; in another as being also “about” geometry.”

J. Petitot Complex entanglement of structures

Page 9: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

All these quotations point out that the proof unfolds in thelabyrinth of many different theories.

It is exactly the same thing for Connes’ strategy concerning theRH. As he explains in “An essay on Riemann Hypothesis” (p. 2) hetries

“to navigate between the many forms of the explicitformulas [see below] and possible strategies to attack theproblem, stressing the value of the elaboration of newconcepts rather than “problem solving”.”

J. Petitot Complex entanglement of structures

Page 10: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

We will meet an incredible amount of deep and heterogeneousmathematics in Connes’ “navigation”.

1 Riemann’s use of complex analysis in arithmetics: ζ-function,the duality between the distribution of primes and thelocalization of the non trivial zeroes of ζ (s), RH.

2 The “algebraization” of Riemann’s theory of complexalgebraic (projective) curves (compact Riemann surfaces) byDedekind and Weber.

3 The transfer of this algebraic framework to the arithmetics ofalgebraic number fields and the interpretation of integers n as“functions” on primes p. It is the archeology of the concept ofspectrum (the scheme Spec(Z)).

J. Petitot Complex entanglement of structures

Page 11: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

4 The move of Andre Weil introducing an intermediary thirdworld (his “Rosetta stone”) between arithmetics and thealgebraic theory of compact Riemman surfaces: the world ofprojective curves over finite fields (characteristic p ≥ 2). Thetranslation of RH in this context and its far reaching proofusing tools of algebraic geometry (divisors, Riemann-Rochtheorem, intersection theory, Severi-Castelnuovo inequality)coupled with the action of Frobenius maps in characteristicp ≥ 2.

5 The generalization of RH to higher dimensions incharacteristic p ≥ 2. The Weil’s conjectures and the formalreconstruction of algebraic geometry achieved byGrothendieck: schemes, sites, topoı, etale cohomology, etc.Deligne’s proof of Weil’s conjectures. Alain Connesemphasized the fact that, through Weil’s vision,Grothendieck’s culminating discoveries proceeds from RH:

J. Petitot Complex entanglement of structures

Page 12: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

“It is a quite remarkable testimony to the unity ofmathematics that the origin of this discovery [topostheory] lies in the greatest problem of analysis andarithmetic.” (p. 3)

6 Connes’ return to pure arithmetics and the original RH bytranslating algebraic geometry a la Grothendieck (topoı, etc.)and Weil’s proof in characteristic p ≥ 2 to the world ofcharacteristic 1, that is the world of tropical geometry andidempotent analysis.

J. Petitot Complex entanglement of structures

Page 13: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Analogies, conceptual structures, axiomatics

In his celebrated letter written in prison to his sister Simone(March 26, 1940, Collected Papers, vol.1, 244-255, translated byMartin Krieger, Notices of the AMS, 52/3 (2005) 334-341), AndreWeil described his move towards RH in natural language using alot of military metaphors to emphasize the fact that finding a proofis a strategy:

“find an opening for an attack (please excuse themetaphor)”, “open a breach which would permit one toenter this fort (please excuse the straining of themetaphor)”,“it is necessary to inspect the availableartillery and the means of tunneling under the fort(please excuse, etc.)”.

J. Petitot Complex entanglement of structures

Page 14: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

He wrote:

“It is hard for you to appreciate that modernmathematics has become so extensive and so complexthat it is essential, if mathematics is to stay as a wholeand not become a pile of little bits of research, to providea unification, which absorbs in some simple and generaltheories all the common substrata of the diverse branchesof the science, suppressing what is not so useful andnecessary, and leaving intact what is truly the specificdetail of each big problem. This is the good one canachieve with axiomatics (and this is no smallachievement). This is what Bourbaki is up to. It will nothave escaped you (to take up the military metaphoragain) that there is within all of this great problems ofstrategy.” (p. 341)

J. Petitot Complex entanglement of structures

Page 15: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

My purpose is not here to discuss philosophically Bourbaki’sconcept of structure as mere “simple and general” abstraction.

It has been done by many authors. See e.g. Leo Corry’s “NicolasBourbaki: Theory of Structures” (Chapter 7 of Modern Algebraand the Rise of Mathematical Structures, 1996).

And many authors have criticized the very limited Bourbaki’sconception of logic.

J. Petitot Complex entanglement of structures

Page 16: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

My purpose is rather to focus on the fact that, for these creativemathematicians, the concept of “structure” is a functional concept,which has always a “strategic” creative function, namely “leavingintact what is truly the specific detail of each big problem”.

As Dieudonne always emphasized it, the “bourbakist choice ”cannot be understood without references to “big problems”.

J. Petitot Complex entanglement of structures

Page 17: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

There is a fundamental relation between the holistic and “organic”conception of the unity of mathematics and the thesis that someanalogies can be creative and lead to essential discoveries.

It is a leitmotive since the 1948 Bourbaki (alias Dieudonne)Manifesto: “L’architecture des mathematiques” (Les grandscourant de la pensee mathematique, F. Le Lionnais ed., Cahiers duSud).

J. Petitot Complex entanglement of structures

Page 18: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The constant insistance on the “immensity” of mathematics andon its “organic” unity, the claim that “to integrate the whole ofmathematics into a coherent whole” (p. 222) is not a philosophicalquestion as for Plato, Descartes, Leibniz or “logistics”, theconstant critique against the reduction of mathematics to a towerof Babel juxtaposing separed “corners”, are not vanities of elitistmathematicians.

They have a very precise, strictly technical function: constructcomplex proofs in navigating into this holistic conceptuallycoherent world.

“The “structures” are tools for the mathematician.”(p. 227)

J. Petitot Complex entanglement of structures

Page 19: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

“Each structure carries with it its own language” and to discover astructure in a concrete problem

“illuminates with a new light the mathematicallandscape” (p. 227)

Leo Corry has well formulated the key point:

“In the “Architecture” manifesto, Dieudonne also echoedHilbert’s belief in the unity of mathematics, based bothon its unified methodology and in the discovery ofstriking analogies between apparently far-removedmathematical disciplines.” (p.304)

J. Petitot Complex entanglement of structures

Page 20: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

And indeed, Dieudonne claimed that

“Where the superficial observer sees only two, or several,quite distinct theories, lending one another “unexpectedsupport” through the intervention of mathematicalgenius, the axiomatic method teaches us to look for thedeep-lying reasons for such a discovery”.

J. Petitot Complex entanglement of structures

Page 21: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It is important to understand that structures are guides forintuition and to overcome

“the natural difficulty of the mind to admit, in dealingwith a concrete problem, that a form of intuition, whichis not suggested directly by the given elements, [...] canturn out to be equally fruitful.” (p. 230)

So

“more than ever does intuition dominate in the genesis ofdiscovery” (p. 228)

and intuition is guided by structures.

J. Petitot Complex entanglement of structures

Page 22: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Riemann’s ζ-function

The distribution of primes

The story of RH begins with the enigma of the distribution ofprimes. The multiplicative structure of integers is awfull.

For x ≥ 2, let π(x) be the number of primes p ≤ x .

It is a step function increasing of 1 at every prime p (one takesπ(p) = 1

2 (π(p−) + π(p+)).

From Legendre (1788) and the young Gauss (1792) to Hadamard(1896) and de la Vallee Poussin (1896) it has been proved theasymptotic formula called the prime number theorem:

π(x) ∼ x

log(x)

J. Petitot Complex entanglement of structures

Page 23: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Definitions of ζ(s)

The zeta function ζ(s) encodes arithmetic properties of π(x) inanalytic structures. Its initial definition is extremely simple and ledto a lot of computations at Euler time:

ζ(s) =∑n≥1

1

ns

which is a series – now called a Dirichlet series – absolutelyconvergent for integral exponents s > 1.

Euler already proved ζ(2) = π2/6 and ζ(4) = π4/90.

J. Petitot Complex entanglement of structures

Page 24: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

A trivial expansion and the existence of a unique decomposition ofany integer in a product of primes show that, in the convergencedomain, the sum is equal to an infinite Euler product (Euler 1748)containing a factor for each prime p (we note P the set of primes):

ζ(s) =∏p∈P

(1 +

1

ps+ . . .

1

pms+ . . .

)=∏p∈P

1

1− 1ps

The local ζ-functions ζp(s) =∑

k≥01

pks = 11− 1

psare the

ζ-functions of the local rings Zp of p-adic integers.

(See below)

J. Petitot Complex entanglement of structures

Page 25: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The ζ-function is a symbolic expression associated to thedistribution of primes, which is well known to have a verymysterious structure.

Its fantastic strength as a tool comes from the fact that it can beextended by analytic continuation to the complex plane.

It has a simple pole at s = 1 with residue 1.

J. Petitot Complex entanglement of structures

Page 26: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Mellin transform, theta function and functional equation

It was discovered by Riemann in his celebrated 1859 paper “Uberdie Anzahl der Primzahlen unter einer gegeben Grosse” (“On thenumber of prime numbers less than a given quantity”), that ζ(s)has also beautiful properties of symmetry.

This can be made explicit noting that ζ(s) is related by a Mellintransform (a sort of Fourier transform), to the theta functionwhich possesses beautiful properties of automorphy.

J. Petitot Complex entanglement of structures

Page 27: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

“Automorphy” means invariance of a function f (τ) defined on thePoincare hyperbolic half complex plane H (complex numbers τ ofpositive imaginary part =(τ) > 0) w.r.t. to a countable subgroupof the group acting on H by homographies (Mobiustransformations) γ(τ) = aτ+b

cτ+d .

The theta function Θ(τ) is defined on the half plane H as theseries

Θ(τ) =∑n∈Z

e in2πτ = 1 + 2∑n≥1

e in2πτ

=(τ) > 0 is necessary to warrant the convergence of e−n2π=(τ).Θ(τ) is what is called a modular form of level 2 and weight 1

2 .

J. Petitot Complex entanglement of structures

Page 28: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Its automorphic symmetries are

1 Symmetry under translation: Θ(τ + 2) = Θ(τ) (level 2, trivialsince e2iπ = 1 implies e in2π(τ+2) = e in2πτ ).

2 Symmetry under inversion: Θ(−1τ ) =

(τi

) 12 Θ(τ) (weight 1

2 ,proof from Poisson formula).

J. Petitot Complex entanglement of structures

Page 29: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If f : R+ → C is a complex valued function defined on the positivereals, its Mellin transform g(s) is defined by the formula:

g(s) =

∫R+

f (t)ts dt

t

Let us compute the Mellin transform:

ζ∗(s) =1

2g( s

2

)=

1

2

∫ ∞0

(Θ(it)− 1) ts2

dt

t=∑n≥1

∫ ∞0

e−n2πtts2

dt

t

J. Petitot Complex entanglement of structures

Page 30: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In each integral we make the change of variable x = n2πt. Theintegral becomes:∫ ∞

0e−xx

s2−1(n2π)− s

2+1 (

n2π)−1

dx = n−sπ−s2

∫ ∞0

e−xxs2−1dx

But∫∞

0 e−xxs2−1dx = Γ

(s2

)where Γ (s) =

∫∞0 e−xx s−1dx is the

gamma function, which has an analytic meromorphic continuationto the entire complex plane C and satisfies the functional equation:

Γ (s + 1) = sΓ (s)

J. Petitot Complex entanglement of structures

Page 31: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So, computations give

ζ∗(s) = π−s2 Γ( s

2

)∑n≥1

1

ns

= ζ(s)Γ( s

2

)π−

s2

ζ∗(s) is the total ζ-function. Due to the automorphic symmetriesof the theta function it satisfies a functional equation (symmetryw.r.t. the critical line < (s) = 1

2 )

ζ∗(s) = ζ∗(1− s)

J. Petitot Complex entanglement of structures

Page 32: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As an Euler product

ζ∗(s) = π−s2 Γ( s

2

) ∏p∈P

1

1− 1ps

The factor π−s2 Γ(

s2

)corresponds to the place at infinity ∞ of Q

(see below) and ζ∗(s) is a product of factors associated to allthe places of Q:

ζ∗(s) =∏

p∈P∪∞

ζ∗p(s)

with ζp(s) = 11− 1

psfor p ∈ P and ζ∞(s) = π−

s2 Γ(

s2

)J. Petitot Complex entanglement of structures

Page 33: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Zeroes of ζ(s)

As ζ(s) is well defined for <(s) > 1, it is also well defined, via thefunctional equation of ζ∗, for <(s) < 0, and the difference betweenthe two domains comes from the difference of behavior of thegamma function Γ.

Γ has poles at s ∈ −N. The figure 1 shows it on the real axis.

J. Petitot Complex entanglement of structures

Page 34: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

-4 -2 2 4

-6

-4

-2

2

4

6

Figure: The Γ function on the real axis.

J. Petitot Complex entanglement of structures

Page 35: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As ζ∗ is without poles on ]1,∞[ (since ζ and Γ are without poles),ζ∗ is also, by symmetry, without poles on ]−∞, 0[. So, as thes = −2k are poles of Γ

(s2

), they must be zeroes of ζ.

See figure 2

J. Petitot Complex entanglement of structures

Page 36: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

-10 -5 5 10

-1

1

2

-10 -8 -6 -4 -2

-0.03

-0.02

-0.01

0.01

Figure: The graph of the zeta function along the real axis showing thepole at 1 (left). A zoom shows the trivial zeroes at even negative integers(right).

J. Petitot Complex entanglement of structures

Page 37: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

But ζ(s) has non trivial zeroes outside the domain < (s) > 1 whereit is explicitely defined by the Euler product.

Their distribution reflects the distribution of primes and thelocalization of these zeroes is one of the main tools forunderstanding the mysterious distribution of primes.

A pedagogical way for seeing the (non trivial) zeroes (J.Arias-de-Reyna) is to plot in the s plane the curves < (ζ(s)) = 0and = (ζ(s)) = 0 and to look at their crossings (see figure 3).

J. Petitot Complex entanglement of structures

Page 38: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

-4 -3 -2 -1 0 1 2 3

0

10

20

30

40

Figure: The null-lines of the real part (red) and the imaginary part (blue)of the zeta function.

J. Petitot Complex entanglement of structures

Page 39: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It can be proved easily that all the non trivial zeroes of ζ(s) mustlie inside the critical strip 0 < <(s) < 1 (due to the functionalequation it is sufficient to prove ζ(s) 6= 0 for <(s) ≥ 1 , due to theEuler product expression ζ(s) 6= 0 for <(s) > 1, due to the primenumber theorem ζ(s) 6= 0 for <(s) = 1).

Due to the functional equation they are symmetric w.r.t. thecritical line < (s) = 1

2 .

J. Petitot Complex entanglement of structures

Page 40: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It is traditional to write the non trivial zeroes ρ = 12 + it. As they

code for the irregularity of the distribution of primes, they must beirregularly distributed. But the irregularity can concern < (t)and/or = (t). When = (t) 6= 0 we get pairs of symmetric zeroeswhose horizontal distance can fluctuate.

Riemann showed that the number N(T ) of zeroes s.t.0 < =(s) ≤ T is of order T

2π log(

T2π

)− T

2π and it is known thatthere exist an infinity of zeroes on the critical line and that thezeroes “concentrate” in a precise sense on the critical line.

J. Petitot Complex entanglement of structures

Page 41: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

An enormous amount of computations from Riemann time toactual supercomputers (ZetaGrid: more than 1012 zeroes in 2005)via Gram, Backlund, Titchmarsh, Turing, Lehmer, Lehman, Brent,van de Lune, Wedeniwski, Odlyzko, Gourdon, and others, showsthat all computed zeroes lie on the critical line <(s) = 1

2 .

J. Petitot Complex entanglement of structures

Page 42: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Riemann hypothesis

The Riemann hypothesis (part of 8th Hilbert problem) conjecturesthat all the non trivial zeroes of ζ(s) are exactly on the criticalline, that is are of the form ρ = 1

2 + it with t ∈ R (i.e. = (t) = 0).

It is an incredibly strong still open conjecture and an enormouspart of modern mathematics has been created to solve it.

J. Petitot Complex entanglement of structures

Page 43: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

We meet a lot of strange configurations.

For instance in figure 4 we show a configuration where a zero atthe crossing of two folded lines (one red and the other blue) isnested inside a large folded blue line yielding another zero whencrossing the upper folded red line.

J. Petitot Complex entanglement of structures

Page 44: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

-4 -3 -2 -1 0 1 2 3

500

505

510

515

520

0.5 1 1.5 2 2.5

503

504

505

506

507

Figure: Configuration where a zero (crossing of folded red and blue lines)is nested.

J. Petitot Complex entanglement of structures

Page 45: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Speiser proved that RH is equivalent to the fact that all foldedblue lines cross the critical line (there is always a single non trivialzero on such a folded blue line).

When it is the case, one point is a zero and the other is called aGram point that is a point where a blue line (ζ(s) real) crosses thecritical line with ζ(s) 6= 0.

Gram points seem to separate the non trivial zeroes (Gram’s law),but it is not exactly the case.

There are situations where a zero and a Gram point are extremelyclose and in the reverse order and these “bad” situations increasecontinuously (Lehmer).

J. Petitot Complex entanglement of structures

Page 46: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The figure 5 shows Lehmer’s example with two extremely closezeroes between two Gram points (we note that we are at theheight of the 26 830th line).

J. Petitot Complex entanglement of structures

Page 47: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

-4 -3 -2 -1 0 1 2 3

7002

7003

7004

7005

7006

7007

7008

0.2 0.4 0.6 0.8 1

7004.5

7004.75

7005

7005.25

7005.5

7005.75

7006

Figure: Lehmer’s example of two extremely close zeroes of the zetafunction.

J. Petitot Complex entanglement of structures

Page 48: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It seems that there exists always a zero between two Gram points(Rosser’s law). But it is not the case.

Figure 6 shows the first counterexample (we note that we are atthe height of the 55 998 101th line).

J. Petitot Complex entanglement of structures

Page 49: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

-4 -3 -2 -1 0 1 2 36.82005·10

6

6.82005·106

6.82005·106

6.82005·106

6.82005·106

6.82005·106

6.82005·106

0.4 0.6 0.8 1

6.82005·106

6.82005·106

6.82005·106

6.82005·106

6.82005·106

Figure: The first counterexample to Rosser’s law.

J. Petitot Complex entanglement of structures

Page 50: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So RH is really not evident.

As noted Pierre Cartier, the risk would be to see a pair of veryclose “good” zeroes bifurcate into a pair of very close symmetric“bad” zeroes.

J. Petitot Complex entanglement of structures

Page 51: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The problem of localizing zeroes

The problem is, given the explicit definition of ζ (s), to find someinformations on the localization of its zeroes.

As was emphasized by Alain Connes, it is a great generalization ofthe problem solved by Galois for polynomials (of one variable).

If we consider a polynomial P (x) = anxn + . . .+ a1x + a0, thecoefficients aj give the symmetric functions of the roots and theproblem of solving the equation P (x) = 0 is to go far beyond thisraw information and find the localization of the zeroes.

J. Petitot Complex entanglement of structures

Page 52: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Explicit formulas

Riemann’s explicit formula

One of the most “magical” results of Riemann is the explicit andexact formula linking explicitely and exactly the distribution ofprimes and the (non trivial) zeroes of ζ (s).

We have seen that, for x ≥ 2, π(x), the number of primes p ≤ xsatisfies the asymptotic formula (prime number theorem)π(x) ∼ x

log(x) .

A better approximation, due to Gauss (1849), is π(x) ∼ Li(x)where the logarithmic integral is Li(x) =

∫ x2

dxlog(x) (for small n,

π(x) < Li(x), but Littelwood proved in 1914 that the inequalityreverses an infinite number of times).

J. Petitot Complex entanglement of structures

Page 53: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

A still better approximation is given by the Riemann formula R(x),where µ(n) is the Mobius function µ(n) = (−1)r if n is a productof r distinct primes and 0 otherwise:

π(x) ∼ R(x) =

∑n≥1

µ(n)

nLi(

x1n

)+1

πarctan

log (x)

)

Figure 7 shows the step function π(x) and its two approximationsx

log(x) (in gray) and R(x) (in blue).

J. Petitot Complex entanglement of structures

Page 54: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

20 40 60 80 100

10

15

20

25

Figure: Two classical approximations of the distribution of primes.

J. Petitot Complex entanglement of structures

Page 55: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The prime number theorem is a consequence of the fact that ζ(s)has no zeroes on the line 1 + it (recall that 1 is the pole of ζ(s)).It as been improved with better approximations by many greatarithmeticians.

J. Petitot Complex entanglement of structures

Page 56: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let

f (x) =k=∞∑k=1

1

kπ(

x1k

)

(π(x) can be retrieved from f (x) by an inverse transformation):

π(x) =m=∞∑

m=1, m square free

(−1)µ1

mf(

x1m

)

J. Petitot Complex entanglement of structures

Page 57: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In his 1859 paper, Riemann proved the following (fantastic)explicit formula:

f (x) = Li(x)−∑ρ

Li (xρ) +

∫ ∞x

1

t2 − 1

dt

t log t− log 2

The approximation of π(x) using Riemann’s explicit formula up tothe twentieth zero of ζ(s) is shown in figure 8.

We see that the red curve departs from the approximation R(x)and that its oscillations draw near π(x).

J. Petitot Complex entanglement of structures

Page 58: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

20 40 60 80 100

10

15

20

25

Figure: The approximation (red curve) of π (x) by Riemann’s explicitformula up to the twentieth zero of ζ (s).

J. Petitot Complex entanglement of structures

Page 59: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

A simpler explicit formula can be found using instead of π(x) theTchebychev-Mangoldt function ψ(x) which counts not the numberof primes p ≤ x but the number of powers pk ≤ x of p eachcounted with the weight log (p):

ψ(x) =∑

p,k: pk≤x

log(p) (where ψ(x) is mean-valued at the steps).

Reformulated with respect to the ψ function, the prime numbertheorem says that ψ(x) ∼ x .

J. Petitot Complex entanglement of structures

Page 60: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In this context, Riemann explicit formula becomes

ψ(x) =∑

p,k: pk≤x

log(p) =1

2πi

∫ c+i∞

c−i∞

(−ζ′(s)

ζ(s)

)x s ds

s, c > 1

= x −∑ρ

ρ− log(2π)− 1

2log

(1− 1

x2

)

J. Petitot Complex entanglement of structures

Page 61: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The van Mangoldt formula concerns only ζ(s) and therefore onlythe p-adic places of Q (with completions Qp).

But we know that the structural formulas concern ζ∗(s) with itsΓ-factor and must take into account the Archimedean real place ∞(with completion R).

This step was accomplished by Weil.

J. Petitot Complex entanglement of structures

Page 62: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Weil’s explicit formula

Andre Weil interpreted and generalized Riemann’s explicit formulain an incredibly deep manner.

First he considered the formula in the context of distributiontheory, where discontinuous fonctions such asψ(x) =

∑p,k: pk≤x log(p) can be interpreted using sums of Dirac

distributions Dp =∑

pk log(p)δ(u − pk

).

Indeed, ψ(x) =⟨

D, χ[0,x] (u)⟩

where χ[0,x] is the characteristic

function of [0, x ]).

Dp is associated to the p-factor of ζ, that is to the p-adic place ofQ, and there must be also a D∞ corresponding to theArchimedean real place ∞.

J. Petitot Complex entanglement of structures

Page 63: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The formula becomes then a duality between D applied to“correct” functions g (u) on R+ and the sum of the values ofMellin transform g (s) =

∫∞0 g (u) us ds

s on the poles 0 and 1 andthe zeroes ρ of ζ∗ (s):

g (0) + g (1)−∑ρ

g (ρ) =∑ν

Wν (g)

where the Wν are distributions associated to the different placesp,∞ of Q. The Wp have their support on the pk and W∞ is asmooth function with a singularity at 1.

J. Petitot Complex entanglement of structures

Page 64: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The admissible functions g must satisfy some strong conditions tomake the formulas and integrals well defined.

If g is a “test” function (i.e. smooth with compact support) thereis no problem.

But one needs more general functions, which are smooth exceptedat “good” step discontinuities at isolated points u0, whereg (u0) = 1

2

(g(u−0)

+ g(u+

0

))and with growth conditions which

warrant that g (s) is analytic in an open strip < (s) ∈ ]−ε, 1 + ε[containing all the poles and zeroes of ζ∗.

J. Petitot Complex entanglement of structures

Page 65: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Then, a lot of elementary computations show that:

For finite places,

1

2πi

∫ c+i∞

c−i∞

(−ζ′(s)

ζ(s)

)g (s) ds =

∑p,k≥1

log(p)g(

pk), 1 < c < 1 + ε.

Using the fact that the Mellin transform of χ[0,x] is∫ x0 us−1ds = xs

s , this formula has for particular case the previousformula

ψ(x) =∑

p,k: pk≤x

log(p) =1

2πi

∫ c+i∞

c−i∞

(−ζ′(s)

ζ(s)

)x s ds

s, c > 1

J. Petitot Complex entanglement of structures

Page 66: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For the Archimedean place ∞ (that is the Γ-factor of ζ∗), one getsa component of the form

term∞ =1

2πi

∫ c+i∞

c−i∞

(−Γ′(s)

Γ(s)

)g (s) ds, 1 < c < 1 + ε

=1

2(log (π) + γ) g (1) +

∫ ∞1

g (u)du

u

+

∫ ∞1

(g (u)− g (1))

u2 − 1

du

u.

J. Petitot Complex entanglement of structures

Page 67: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let g∗ (u) = 1u g(

1u

)be the function whose Mellin transform is the

symmetric g∗ (s) = g (1− s) of g (s) w.r.t. the critical line:

g∗ (s) =

∫ ∞0

g∗ (u) us du

u=

∫ ∞0

1

ug

(1

u

)us du

u

= −∫ 0

∞vg (v) v 1−s dv

v 2, v =

1

u

=

∫ ∞0

g (v) v 1−s dv

v= g (1− s)

Then Weil’s explicit formula obtains with Wν (g) constructed fromcomponents as above for g and g∗.

J. Petitot Complex entanglement of structures

Page 68: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For g (s) = xs−1s and g (u) = χ[0,x] (u)− χ[0,1] (u) = χ[1,x] (u)

(with the rule χ[1,x] = −χ[x ,1] if x < 1), one retrieves theMangoldt formula.

Indeed g (0) = log(x), g (1) = x − 1, and g (ρ) = xρ−1ρ .

So the LHS is

g (0) + g (1)−∑ρ

g (ρ) = log (x) + x − 1−∑ρ

ρ+∑ρ

1

ρ

J. Petitot Complex entanglement of structures

Page 69: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

while the RHS is

Σ =∑pk≤x

log (p) +1

2(log (π) + γ) +

∫ ∞1

g (u)du

u

+

∫ ∞1

(g (u)− g (1))

u2 − 1

du

u

with

Σ =∑pk≤x

log (p) +1

2(log (π) + γ) +

∫ ∞1

g (u)du

u

+

∫ ∞1

(g (u)− g (1))

u2 − 1

du

u

=∑pk≤x

log (p) +1

2(log (π) + γ) +

∫ x

1

du

u+

∫ x

1

1

(u2 − 1)

du

u

=∑pk≤x

log (p) +1

2(log (π) + γ) + log (x) +

1

2log

(1− 1

x2

)

J. Petitot Complex entanglement of structures

Page 70: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

since

1

2

(log

(1− 1

u2

))′=

1

2

(log

(u2 − 1

u2

))′=

1

2(log (u + 1) + log (u − 1)− 2log (u))′

=1

2

(1

u + 1+

1

u − 1− 2

u

)=

1

u (u2 − 1)

J. Petitot Complex entanglement of structures

Page 71: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So LHS = RHS means∑pk≤x

log (p) +1

2(log (π) + γ) + log (x) +

1

2log

(1− 1

x2

)

= log (x) + x − 1−∑ρ

ρ+∑ρ

1

ρ

that is∑pk≤x

log (p)

= x − 1−∑ρ

ρ+∑ρ

1

ρ− 1

2(log (π) + γ)− 1

2log

(1− 1

x2

)

J. Petitot Complex entanglement of structures

Page 72: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Van Mangoldt formula∑p,k: pk≤x

log(p) = x −∑ρ

ρ− log(2π)− 1

2log

(1− 1

x2

)

is therefore equivalent to

−1 +∑ρ

1

ρ− 1

2(log (π) + γ) = − log(2π)

J. Petitot Complex entanglement of structures

Page 73: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

that is ∑ρ

1

ρ= 1 + log

(1

2√π

)+γ

2

which can be proved.

J. Petitot Complex entanglement of structures

Page 74: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Remark. As ρ and 1− ρ are zeroes,

2∑ρ

1

ρ=∑ρ

1

ρ+∑ρ

1

1− ρ=∑ρ

1

ρ (1− ρ)= 2 + log

(1

)+ γ

As RH ⇐⇒ 1− ρ = ρ, we see that

RH⇐⇒∑ρ

1

|ρ|2= 2 + log

(1

)+ γ

J. Petitot Complex entanglement of structures

Page 75: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

More generally, RH is equivalent to the positivity condition for“test” functions:∑

ρ

g (ρ) g(1− ρ

)≥ 0 ∀g smooth with compact support

Indeed, if RH is true, then 1− ρ = ρ and∑ρ g (ρ) g (ρ) =

∑ρ |g (ρ)|2 ≥ 0.

Conversely, if ρ0 6= 1− ρ0 is a “bad” zero, on can construct a gviolating the positivity condition.

J. Petitot Complex entanglement of structures

Page 76: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The adelic context

Local/global in arithmetics

One of the main idea, introduced by Dedekind and Weber in theircelebrated 1882 paper “Theorie der algebraischen Funktionen einerVerandlichen” (J. Reine Angew. Math, 92 (1882) 181-290), was toconsider integers n as kinds of “functions” over the sets P ofprimes p, “functions” having a value and an order at every “point”p ∈ P.

These values and orders being local concepts, Dedekind and Weberhad to define the concept of localization in a purely algebraicmanner.

J. Petitot Complex entanglement of structures

Page 77: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It is the origin of the modern concept of spectrum in algebraicgeometry.

Then Q becomes the “global” field of “rational functions” on this“space”.

J. Petitot Complex entanglement of structures

Page 78: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If p is prime, the ideal (p) = pZ of p in Z is a prime (and evenmaximal) ideal. To localize Z at p means to delete all the ideals a

that are not included into (p) and to reduce the arithmetic of Z tothe ideals a ⊆ (p).

For that, we note that if an ideal a contains an invertible elementthen it contains 1 and is therefore trivial (improper): a = Z.

So, if we add the inverses of the elements of the complementarymultiplicative subset S of (p), S = Z− (p), we “kill” all the idealsa such that a ∩ S 6= ∅, that is, precisely, the a * (p).

J. Petitot Complex entanglement of structures

Page 79: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

This partial quotient Z(p) is a local ring (that is with a uniquemaximal ideal) intermediary between Z and Q (Q is thelocalization of the prime ideal 0).

Z(p) is arithmetically much simpler than the global ring Z but morecomplex than the global fraction field Q since it preserves all thearithmetic inside (p).

The maximal ideal of Z(p) is m(p) = pZ(p) and the residue field isZ(p)/pZ(p) = Z/pZ = Fp.

J. Petitot Complex entanglement of structures

Page 80: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If n ∈ Z, to look at n “locally” at p is to look at n in Z(p).

The “value” of n at p is its class in Fp, i.e. n mod p and the localstructure of n at p can be read in Z(p).

J. Petitot Complex entanglement of structures

Page 81: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In the local ring Z(p) every ideal a is equal to some power (p)k of(p).

As (p)k ⊃ (p)k+1 we get a decreasing sequence – what is called afiltration – of ideals which exhausts the arithmetic of Z(p).

The successive quotients Z(p)/pk+1Z(p) correspond to theexpansion of natural integers n in base p. Indeed, to makepk+1 = 0 is to approximate n by a sum

∑i=ki=0 nip

i with all ni ∈ Fp.

J. Petitot Complex entanglement of structures

Page 82: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Weil’s description of Dedekind’s analogy

In his letter to Simone, Weil describes very well Dedekind’sanalogy:

“[Dedekind] discovered that an analogous principlepermitted one to establish, by purely algebraic means,the principal results, called “elementary”, of the theory ofalgebraic functions of one variable, which were obtainedby Riemann by transcendental [analytic] means.”

J. Petitot Complex entanglement of structures

Page 83: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Since Dedekind’s analogy is algebraic it can be applied to otherfields than C.

integers ←→ polynomialsdivisibility of integers ←→ divisibility of polynomials

rationals ←→ rational functionsalgebraic numbers ←→ algebraic functions

Dedekind’s “different” ideal ←→Hilbert

Riemann-Roch theorem

Abelian extensions ←→ Abelian functionsclasses of ideals ←→ divisors

J. Petitot Complex entanglement of structures

Page 84: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

And Weil adds

“At first glance, the analogy seems superficial. [... But]Hilbert went further in figuring out these matters.”

J. Petitot Complex entanglement of structures

Page 85: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Valuations and ultrametricity

Dedekind and Weber defined the order of n ∈ N at p using thedecomposition of n into primes.

Let n =∏i=r

i=1 pvii . vi is the valuation of n at pi : vpi (n). It is trivial

to generalize the definition to Z and Q. So the valuation vp(x) ofx ∈ Q is the power of p in the decomposition of x in prime factors.

J. Petitot Complex entanglement of structures

Page 86: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It satisfies:

vp(0) =∞ by conventionvp(n) = 0 if n is prime to pvp(mn) = vp(m) + vp(n)vp(m/n) = vp(m)− vp(n)vp(xy) = vp(x) + vp(y), x , y ∈ Qvp(x + y) ≥ Inf (vp(x), vp(y)) , x , y ∈ QZ = x ∈ Q : vp (x) ≥ 0(p) = pZ = x ∈ Q : vp (x) ≥ 1(p)k = x ∈ Q : vp (x) ≥ k

J. Petitot Complex entanglement of structures

Page 87: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The fundamental point is that |x |p = p−vp(x) is a norm on Q(|0|p = 0 because by definition vp(0) =∞) defining a metricdp (x , y) = |x − y |p and that, due to the last inequality, it satisfiesthe ultrametric property

|x + y |p ≤ Max(|x |p , |y |p

)which is non-Archimedean and much stronger than the triangularinequality of classical metrics.

J. Petitot Complex entanglement of structures

Page 88: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It must be emphasized that the ultrametricity property is nonintuitive since the size of pk become smaller and smaller as kincreases and vanishes for k =∞.

It must also be emphasized that the relative positions induced bythe p-adic metric between the rationals change radically with p. Asa set, Q remains the same, but as metric spaces the differentp-adic Q are incommensurable.

J. Petitot Complex entanglement of structures

Page 89: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

p-adic numbers

The idea of expanding natural integers along the base p with ametric such that

∣∣pk∣∣p−→ 0k→∞

leads naturally to add a “point at

infinity” to the localization Z(p).

This operation is a completion procedure for the metric |•|passociated to the valuation vp and is formalized by the concept ofp-adic number (Hensel).

J. Petitot Complex entanglement of structures

Page 90: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The successive rings ZpkZ with the canonical projections Z

pkZ →Z

p`Zfor ` > k constitute a projective system

· · · → Zpk+1Z

→ ZpkZ

→ · · · → ZpZ

= Fp

where the arrows are the natural projections.

J. Petitot Complex entanglement of structures

Page 91: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let Zp be the projective limit

Zp = lim←−Z

pkZ

The “profinite” object Zp is a local ring with maximal ideal pZp,

residue fieldZp

pZp= Z

pZ = Fp and fraction field

Qp = Q⊗Z Zp = Zp

(1p

).

Zp is compact (due to Tychonoff theorem, in fact the maximalcompact subring of Qp), totally discontinuous as limit of discretestructures, and is the completion of Z for the p-adic absolute value|x |p = p−vp(x).

J. Petitot Complex entanglement of structures

Page 92: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For a polynomial P(x) ∈ Z [x ], to have a root in Zp is to have aroot mod pn for every n ≥ 1.

Zp =

x ∈ Qp : |x |p ≤ 1

Mp = pZp =

x ∈ Qp : |x |p < 1

Zp/Mp = Fp

J. Petitot Complex entanglement of structures

Page 93: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The local p-adic field

The local field Qp is the completion of the global field Q for thevaluation vp(x).

Z is a subring of Zp and Q is a dense subfield of Qp.

A way of trying to understand the non-intuitive topology of Zp isto consider that the ideal pnZp is the closed ball of radius 1

pn .

The local p-adic field Qp is of characteristic 0 while the residue

field ZpZ =

Zp

pZp= Fp is of characteristic p. The lifting of arithmetic

properties from Fp to Qp is a crucial problem.

J. Petitot Complex entanglement of structures

Page 94: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

We must note also that the algebraic closure Qp of Qp is notcomplete. Its completion is C endowed with a non classical metric.

The ring of p-adic integers contains all the (p − 1) th roots ofunity but in a sophisticated way. For instance, in Z2 we have

−1 =k=∞∑k=0

2k

In general, the classical series 11−p = 1 + p + · · ·+ pn + · · · is

always convergent in Zp and we can write

−1 = p−11−p =

n=∞∑n=0

(p − 1) pn.

J. Petitot Complex entanglement of structures

Page 95: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Hensel’s geometric analogy

In Bourbaki’s Manifesto, Dieudonne emphasizes Hensel’s unifyinganalogy (with those of Hilbert spaces and Haar measure):

“where, in a still more astounding way, topology invadesa region which had been until then the domain parexcellence of the discrete, of the discontinuous, viz. theset of whole numbers.” (p. 228)

J. Petitot Complex entanglement of structures

Page 96: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As we have already noted, the geometrical lexicon of Hensel’sanalogy can be rigourously justified using the concept of scheme:

primes p are the points of the spectrum of Z,

the finite prime fields Fp are the fibers of the structural sheaf O ofZ,

integers n are global sections of O,

and Q is the field of global sections of the sheaf of fractions of O.

In this context, Zp and Qp correspond to the localization of globalsections, analog to what are called germs of sections in classicalgeometry.

J. Petitot Complex entanglement of structures

Page 97: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Places

On Q there exist not only the p-adic valuations of the “finite”primes p but also the real absolute value |x |, which can beinterpreted as an “infinite” prime and is conventionally written|x |∞.

To emphasize the geometrical intuition of a “point”, the “finite”and “infinite” primes are also called places.

To work in arithmetics with all places is a necessity if we want tocontinue the analogy with projective (birational) algebraicgeometry (Riemann surfaces) and transfer some of its results (asthose of the Italian school of Severi, Castelnuovo, etc.) toarithmetics.

J. Petitot Complex entanglement of structures

Page 98: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Indeed, in projective geometry the point ∞ is on a par with theother points.

Weil emphasized strongly this point from the start.

Already in his 1938 paper “Zur algebraischen Theorie desalgebraischen Funktionen” (Journal de Crelle, 179 (1938) 129-138)he explains that he wants to reformulate Dedekind-Weber in abirationally invariant way.

J. Petitot Complex entanglement of structures

Page 99: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In his letter to Simone, he says

“In order to reestablish the analogy [lost by the singularrole of ∞ in Dedekind-Weber], it is necessary tointroduce, into the theory of algebraic numbers,something that corresponds to the point at infinity in thetheory of functions.”

It is achieved by valuations, places and Hensel’s p-adic numbers(plus Hasse, Artin, etc.).

J. Petitot Complex entanglement of structures

Page 100: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So, Weil strongly stressed the use of analogies as a discoverymethod:

“If one follows it in all of its consequences, the theoryalone permits us to reestablish the analogy at manypoints where it once seemed defective: it even permits usto discover in the number field simple and elementaryfacts which however were not yet seen.”

J. Petitot Complex entanglement of structures

Page 101: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Local and global fields

All the knowledge gathered during the extraordinay period initiatedby Kummer in arithmetics and Riemann in geometry, led to therecognition of two great classes of fields, local fields and globalfields.

In characteristic 0, local fields are R, C and finite extensions of Qp.

In characteristic p, local fields are the fields of Laurent series overa finite field Fpn and their ring of integers are those of thecorresponding power series.

Local fields possess a discrete valuation v and are complete for theassociated metric. Their ring of integers is local. Finite extensionsof local fields are themselves local.

J. Petitot Complex entanglement of structures

Page 102: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In characteristic 0, global fields are finite extensions K of Q, i.e.algebraic number fields.

In characteristic p, global fields are the fields of rational functionsof algebraic curves over a finite field Fpn . The completions ofglobal fields at their different places are local fields. They satisfythe product formula, where V is the set of places ν:

∏ν∈V|x |ν = 1 for every element x .

J. Petitot Complex entanglement of structures

Page 103: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

To summarize, Andre Weil was the first to understand that thenatural context for the explicit formula and the RH was the adeliccontext, that is the embedding of the global field Q into therestricted product of its p-adic and real completions Qp and R.

These local fields are the completions of Q at its finite (nonArchimedean, ultrametric) and infinite (Archimedean) places.

J. Petitot Complex entanglement of structures

Page 104: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The adelic context

Definition of adeles

If K is a global field, that is an algebraic number field or the fieldof rational functions of an algebraic curve over a finite field Fpn , itis embedded as a discrete subfield in its ring of adeles AK, which isthe restricted product of its completions Kν for its different places.

Note that, even when K is a dense subfield of its completions Kν ,it is nevertheless a discrete subfield of its ring of adeles AKbecause the topologies of the different Kν are incompatible.

J. Petitot Complex entanglement of structures

Page 105: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

AK is topologically a locally compact ring (neither discrete norcompact, it is locally compact because it is a restricted product).It is also semi-simple (with trivial Jacobson radical) and K iscocompact in it.

According a theorem of Iwasawa, this situation characterizesconceptually global fields and means that the arithmetics of K iscorrelated to the analysis of AK.

As says Alain Connes (p.5),

“it is the opening door to a whole world which is that ofautomorphic forms and representations, starting in thecase of GL1 with Tate’s thesis (Fourier analysis innumber fields and Hecke’s zeta-function, 1950) andWeil’s book (Basic Number Theory).”

J. Petitot Complex entanglement of structures

Page 106: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The multiplicative group A×K of invertible elements of AK is thegroup (locally compact) of ideles of K, and its quotientCK = A×K/K

∗ by the multiplicative group K∗ of K acting bymultiplication is the group of classes of ideles of K.

J. Petitot Complex entanglement of structures

Page 107: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Adeles and subgroups of Q

For the following, it is essential to emphasize the fact that theadeles of Q parametrize the subgroups of (Q,+).

It is well known that every finitely generated subgroup of (Q,+) is

monogenic (reduce to the case of two generators H =⟨

m1n1, m2

n2

⟩,

reduce to the commun denominator n1n2, take the gcd d of thenumerators m1n2 and m2n1, and apply Bezout to find H = d

n1n2Z).

J. Petitot Complex entanglement of structures

Page 108: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

But there are other subgroups of (Q,+).

Theorem. Subgroups of (Q,+) are all of the form

H = Ha :=

q ∈ Q | aq ∈ Z

for a ∈ AfQ a finite adele (i.e. an

adele whose Archimedean component = 0).

Here, Z =∏

p Zp is the Pontryagin dual (the group of characters)of the additive group (Q/Z,+) (see below).

J. Petitot Complex entanglement of structures

Page 109: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

This means that we take a finite set of pj -adic numbers aj and wetake the rationals q ∈ Q s.t. ajq ∈ Zpj . But if a and a′ are

equivalent modulo Z× then Ha ' Ha′ .

Theorem. The subgroups of (Q,+) are in bijection with thequotient Af

Q/Z×.

J. Petitot Complex entanglement of structures

Page 110: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Adeles and the dual of Q : Q ' AQ/Q

Another important property of adeles is the following.

We have already noted that Z is the Pontryagin dual (the group ofcharacters) of the additive group (Q/Z,+). Indeed,Q/Z =lim−→

(1nZ)/Z while Z = lim←−Z/nZ.

Z =∏

p Zp since if n =∏

i pαii then Z/nZ'

∏i Z/pαi

i Z andlim←−∏

=∏

lim←−.

J. Petitot Complex entanglement of structures

Page 111: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Now, the point is that the adeles parametrize the characters of theadditive group (Q,+) and are needed to define its Pontryagin dualQ.

Indeed, it is well known that all the continuous characters of(R,+) are of the form

χy : x 7→ e−2πiyx

For (Q,+) we still have these characters χy : r 7→ e−2πiyr . Theycorrespond to the Archimedean place ∞ of Q (that is to the localfield R).

J. Petitot Complex entanglement of structures

Page 112: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

But there exist also other characters corresponding to the finiteplaces p of Q (that is to the local fields Qp). They are of the form

χap: r 7→ e2πiaprp

where ap ∈ Qp is a p-adic number and where aprp is the

fractional part of apr (the part with the negative powers 1pk of p).

One has aprp = 0 if apr ∈ Zp.

J. Petitot Complex entanglement of structures

Page 113: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Theorem. . All the characters of Q (that is the dual Q) are of theform

χa = e−2πia∞r∏p

e2πiaprp

with a∞ ∈ Q and ap ∈ Qp and ap ∈ Zp for almost every p.

This means that the characters are parametrized by the adelesa ∈ AQ.

J. Petitot Complex entanglement of structures

Page 114: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Now, Q → AQ, s 7−→ (s, . . . s) (rational adeles).

But if s is a rational adele, then χs = 1.

Indeed, χs = e2πi(−sr+P

psrp) and, as sr ∈ Q, −sr +∑

p srp isan integer.

Theorem. Q ' AQ/Q.

J. Petitot Complex entanglement of structures

Page 115: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Weil’s adelic explicit formula

Weil translated Riemann’s explicit formula in the adelic context ofthe global field Q.

He considered test functions h (u) : CQ → R+ where

h (u) = h (|u|) := |u|12 F (|u|) for F (t) defined on [1,∞) (i.e. F is

defined on R but F ≡ 0 on (−∞, 1[). We have h (u) = 0 for|u| < 1.

For technical reasons (convergence, etc.), one must assume that Fis smooth except for a finite number of “good” steps where it ismean-valued and decreases more rapidly than 1√

tat infinity.

Be careful that the u are classes of ideles and that their module |u|is complicated, while x is a mere positive real.

J. Petitot Complex entanglement of structures

Page 116: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let h (s) =∫

h (u) |u|s duu be the “symbolic” Mellin transform of h,

which corresponds to F(s − 1

2

)with F (s) =

∫∞1 F (t) ts dt

t theMellin transform of F .

Riemann-Weil formula is (with p-adic integrals and∫ ′

meaningnormalized principal value)

h (0) + h (1)−∑ρ

h (ρ) =∑ν

∫ ′Q∗ν

h(u−1

)|1− u|ν

du

u

J. Petitot Complex entanglement of structures

Page 117: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For the finite places p, one finds∫ ′Q∗ν

h(u−1

)|1− u|ν

du

u=

∑pk ,p given

log (p) p−k2 F(

pk)

Indeed, h (u) = h (|u|) depends only on the module |u| andpresupposes |u| > 1.

So, in the in the∫ ′

Q∗νintegral, we must have

∣∣u−1∣∣ > 1 and

therefore |u| < 1.

But in Q∗p, |u| < 1 implies |1− u| = 1 and the integral is∫ ′Q∗p

1

|u|12

F(|u|

12

)duu .

J. Petitot Complex entanglement of structures

Page 118: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For the Archimedean place ∞, one finds∫R∗

h(u−1

)|1− u|

du

u=

∫R∗

h (u)

|1− u−1|du

u

=1

2

∫ ∞1

(h (t)

|1− t−1|+

h (t)

|1 + t−1|

)dt

t

=

∫ ∞1

t32 F (t)

(t2 − 1)

dt

t

J. Petitot Complex entanglement of structures

Page 119: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If we convert the h formula into a F formula, we find:

F

(−1

2

)+ F

(1

2

)−∑ρ

F

(ρ− 1

2

)

=∑pk

log (p) p−k2 F(

pk)

+

∫ ∞1

t32 F (t)

(t2 − 1)

dt

t

+ F (1)

(1

2(log (π) + γ)−

∫ ∞1

1

(t2 − 1)

dt

t

)

J. Petitot Complex entanglement of structures

Page 120: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The RH for curves over Fq (Weil)

One of the greatest achievements of Weil has been the proof ofRH for the global fields K/Fq (T ) of rational functions on analgebraic curve defined over a finite field Fq of characteristic p(q = pn), that is finite algebraic extensions of Fq (T ).

J. Petitot Complex entanglement of structures

Page 121: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The “Rosetta stone”

The main difficulty was that in Dedekind-Weber’s analogy betweenarithmetics and the theory of Riemann surfaces, the latter is “toorich” and “too far from the theory of numbers”. So

“One would be totally obstructed if there were not abridge between the two.” (p. 340)

J. Petitot Complex entanglement of structures

Page 122: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Hence the celebrated metaphor of the “Rosetta stone”:

“my work consists in deciphering a trilingual text; of eachof the three columns I have only disparate fragments; Ihave some ideas about each of the three languages: but Iknow as well there are great differences in meaning fromone column to another, for which nothing has preparedme in advance. In the several years I have worked at it, Ihave found little pieces of the dictionary.” (p. 340)

J. Petitot Complex entanglement of structures

Page 123: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

From the algebraic number theory side, one can transfer theRiemann-Dirichlet-Dedekind ζ and L-functions (Artin, Schmidt,Hasse) to the algebraic curves over Fq.

In this third world they become polynomials, which simplifiestremendously the situation.

J. Petitot Complex entanglement of structures

Page 124: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The Hasse-Weil function

For the history of the ζ-function of curves over Fq, see Cartier’s1993 paper “Des nombres premiers a la geometrie algebrique (unebreve histoire de la fonction zeta)” (Cahiers du Seminaired’Histoire des mathematiques (2eme serie), tome 3 (1993) 51-77).

On the arithmetic side (spec(Z), Qp, AQ, etc.), we have RH.

On the geometric side, we have the theory of compact Riemannsurfaces (projective algebraic curves on C).

J. Petitot Complex entanglement of structures

Page 125: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

On the intermediary level, at the beginning of the XXth centuryEmil Artin (thesis, 1921 published in 1924) and Friedrich KarlSchmidt (1931) formulated the RH no longer for global numberfields K/Q but for global fields of functions K/Fq (T ). As Cartiersays,

“La theorie d’Artin-Schmidt se developpe donc enparallele avec celle de Dirichlet-Dedekind, et elle s’efforcede calquer les resultats acquis : definition par serie deDirichlet et produit eulerien, equation fonctionnelle,prolongement analytique.” (p. 61)

J. Petitot Complex entanglement of structures

Page 126: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The main challenge was to interpret geometrically thezeta-function ζC (s) for algebraic curves C defined over Fq.

It took a long time to understand that ζC was a counting function,counting the (finite) number N (qr ) of points of C rational overthe successive extensions Fqr of Fq :

C is defined over Fq, all its points are with coordinates in Fq, andwe can look at its points with coordinates in intermediateextensions Fq ⊂ Fqr ⊂ Fq.

J. Petitot Complex entanglement of structures

Page 127: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The generating function of the N (qr ) is by definition

ZC (T ) := exp

∑r≥1

N (qr )T r

r

Note that TZ ′C (T )ZC (T ) =

∑r≥1 N (qr ) T r . The Hasse-Weil function

ζC (s) of C is defined as

ζC (s) := ZC

(q−s)

J. Petitot Complex entanglement of structures

Page 128: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It corresponds to the two expressions of the classical Riemann’sζ-function (Dirichlet series and Euler product) if one introducesthe concept of a divisor D on C as a finite Z-linear combination ofpoints of C : D =

∑j ajx .

The degree of D is deg(D) =∑

j aj .

D is said to be positive (D ≥ 0) if all aj ≥ 0.

J. Petitot Complex entanglement of structures

Page 129: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Then

ζC (s) =∑D>0

1

N (D)−s =∏P>0

(1− N (D)−s)−1

where D are positive divisors on Fq-points, P prime positivedivisors (i.e. P is not the sum of two smaller positive divisors) andN (D) = qdeg(D).

J. Petitot Complex entanglement of structures

Page 130: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The key problem is, as before, the localization of the zeroes ofζC (s).

If ρ is a zero, q−ρ is a zero of ZC .

Conversely, if q−ρ is a zero and if ρ′ = ρ+ k 2πilog(q) , then

q−ρ′

= q−ρ is also a zero.

So the zeroes of the Hasse-Weil function ζC (s) come in arithmeticprogressions.

J. Petitot Complex entanglement of structures

Page 131: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Divisors and classical Riemann-Roch (curves)

On the other direction, one try to transfer to curves over Fq theresults of the theory of Riemann compact surfaces, and inparticular the Riemann-Roch theorem.

If C is a compact Riemann surface of genus g , to deal with thedistribution and the orders of zeroes and poles of meromorphicfunctions on C , one introduces the concept of a divisor D on C asa Z-linear combination of points of C :

D =∑

x∈C ordx(D)x with ordx(D) ∈ Z the order of D at x .

All the terms vanish except a finite number of them.

J. Petitot Complex entanglement of structures

Page 132: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The degree of D is then defined as deg(D) =∑

x∈C ordx(D). It isadditive.

D is said to be positive (D ≥ 0) if ordx(D) ≥ 0 at every point x .

If f is a meromorphic function on C , poles of order k can beconsidered as zeroes of order −k and the divisor(f ) =

∑x∈C ordx(f )x is called principal and its degree vanishes:

deg(f ) =∑

x∈C ordx(f ) = 0.

J. Petitot Complex entanglement of structures

Page 133: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

By construction, divisors form an additive group Div(C ) and, asthe meromorphic functions contitute a field K (C ) having theproperty that the order of a product is the sum of the orders,principal divisors constitute a subgroup Div0(C ).

The quotient group Pic(C ) = Div(C )/Div0(C ), that is the groupof classes of divisors modulo principal divisors, is called the Picardgroup of C .

J. Petitot Complex entanglement of structures

Page 134: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If ω and ω′ are two meromorphic differential 1-forms on C ,ω′ = f ω for some f ∈ K (C )∗ (the set of invertible elements ofK (C )), div(ω′) = div(ω) + (f ) and therefore the class of div(ω)mod (Div0(C )) is unique: it is called the canonical class of C andone can show that its degree is deg(ω) = 2g − 2.

J. Petitot Complex entanglement of structures

Page 135: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For instance, if g = 0, C is the Riemann sphere C and thestandard 1-form is ω = dz on the open subset C.

Since to have a local chart at infinity we must use the change ofcoordinate ξ = 1

z and since dξ = −dzz2 , we see that, on C, ω

possesses no zero and a single double pole at infinity.

Hence deg(ω) = −2 = 2g − 2.

For g = 1 (elliptic case) deg(ω) = 0 and there exists holomorphicnowhere vanishing 1-forms. As C ' C/Λ (Λ a lattice), one cantake ω = dz .

J. Petitot Complex entanglement of structures

Page 136: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

To any divisor D one can associate what is called a linear system,that is the set of meromorphic functions on S whose divisor (f ) isgreater than −D :

L(D) = f ∈ K (S)∗ : (f ) + D ≥ 0 ∪ 0

Since a holomorphic function on S is necessarilly constant(Liouville), we have L(0) = C. One of the most fundamentaltheorem of Riemann’s theory is the theorem due to himself and hisdisciple Gustav Roch:

J. Petitot Complex entanglement of structures

Page 137: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Riemann-Roch theorem.dim L(D) = deg(D) + dim L(ω − D)− g + 1.

If dim L(D) is noted `(D), we get

`(D)− `(ω − D) = deg(D)− g + 1

Corollary. `(ω) = 2g − 2 + 1− g + 1 = g (since `(0) = 1).

J. Petitot Complex entanglement of structures

Page 138: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

A very important conceptual improvement of RR is due to PierreCartier in the 1960s using the new tools of sheaf theory andcohomology.

Let O = OC be the structural sheaf of rings O (U) of holomorphicfunctions on the open subsets U of C , and K = KC the sheaf offields K (U) of meromorphic functions.

J. Petitot Complex entanglement of structures

Page 139: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let U = Ui be an open covering of C and D a divisor.

We take a family fi ∈ K (Ui ) whose zeroes and poles give exactlythe points of D with their orders and we glue them on theintersections Ui ∩ Uj using fij ∈ O (Ui ∩ Uj)

∗ (non vanishingholomorphic functions).

The fi , fij define a global section of the quotient sheaf K∗/O∗,and this section corresponds exactly to D.

J. Petitot Complex entanglement of structures

Page 140: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Now, the fij can be used to define a line bundle on C with a sheafof sections O (D) and Cartier has shown that the C-vector spaceof global sections of O (D) can be identified with L (D), i.e.L (D) = H0 (C ,O (D)).

This cohomological interpretation is fundamental and allows adeep “conceptual” cohomological interpretation of RR using thefact that dim L(D) = dim H0 (C ,O (D)).

J. Petitot Complex entanglement of structures

Page 141: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Divisors and classical Riemann-Roch (surfaces)

For surfaces S , RR is more involved. Divisors are now Z-linearcombinations no longer of points but of curves Ci .

One has to use what is called the intersection number of twocurves C1 • C2 (and of divisors D1 • D2).

For two curves in general position one defines C1 • C2 in anintuitive way as the sum of the points of intersection.

J. Petitot Complex entanglement of structures

Page 142: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

One shows that, as the base field is algebraically closed, thisnumber is invariant by linear equivalence.

One shows also that for any divisors D1 and D2, even whenD1 = D2, there exist D ′1 ∼ D1 and D ′2 ∼ D2 which are in generalposition.

One then defines D1 • D2 = D ′1 • D ′2.

J. Petitot Complex entanglement of structures

Page 143: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The RR theorem is then

j=2∑j=0

(−1)j dim H j(S ,O (D)) =1

2D • (D − KS) + χ (S)

with χ (S) = 1 + pa, pa being the “arithmetic genus”.

J. Petitot Complex entanglement of structures

Page 144: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

What is called Serre duality says that

dim H2(S ,O (D)) = dim H0(S ,O (KS − D))

Now, dim H0 and dim H2 are ≥ 0 while − dim H1 is ≤ 0, so onegets the RR inequality :

`(D) + `(KS − D) ≥ 1

2D • (D − KS) + χ (S)

J. Petitot Complex entanglement of structures

Page 145: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

RR for curves over Fq

From Artin to Weil, the theory of compact Riemann surfaces hasbeen transfered to the intermediate case of the curves C/Fq.Schmidt and Hasse transfered the RR theorem.

A fundamental consequence was that ZC (T ) not only satisfies afunctional equation but is a rational function of T .

J. Petitot Complex entanglement of structures

Page 146: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For instance, let us consider the simplest case K = Fq (T )(coresponding to the simplest number field Q).

Each unitary polynomial P (T ) = T m + a1T m−1 + . . .+ am ofdegree m gives a contribution (qm)−s to the additive (Dirichlet)formulation of ZK (T ) since the norm of its ideal is qm.

But there are qm such polynomials since the m coefficients aj

belong to Fq. SoζK (s) =

∑m=∞m=0 qm (qm)−s = 1

1−q1−s

ZC (T ) = 11−qT

J. Petitot Complex entanglement of structures

Page 147: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Hence, as ZC (T ) is a rational function of T , it has a finitenumber of zeroes t1, . . . , tM and therefore, the zeroes of ζC (s) areorganized in a finite number of arithmetic progressions ρj + k 2πi

log(q)

with q−ρj = tj .

This is a fundamental difference with the arithmetic case,which makes the proof of RH easier.

J. Petitot Complex entanglement of structures

Page 148: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The Frobenius

But in the Fq case, a completely original phenomenon appears.

A fundamental property of any finite field Fq is that xq = x forevery x . So, one can consider the automorphism ϕq of Fq,ϕq : x 7→ xq (it is an automorphism) and retrieve Fq as the field offixed points of ϕq.

ϕq is called the Frobenius morphism.

J. Petitot Complex entanglement of structures

Page 149: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

For a curve C/Fq, the Frobenius ϕq acts, for every r , on the set ofpoints C (Fqr ) with coordinates in Fqr , and the numberNr = N (qr ) of points of C rational over Fqr is the number of fixedpoints of the Frobenius ϕqr .

So the generating counting function ZC (T ) counts fixed pointsand has to do with the world of trace formulas counting fixedpoints of maps.

In particular, N1 = C (Fq) = #ϕFixq =

∣∣Ker(ϕq − Id

)∣∣. It is like a“norm”.

J. Petitot Complex entanglement of structures

Page 150: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

RH for elliptic curves (Schmidt and Hasse)

Schmidt was the first to add the point at infinity (projectivecurves) and to understand that, in the case of K/Fq (T ), thefunctional equation of ζC was correlated to the duality betweendivisors D and D − K in Riemann’s theory. As Cartier says

“on voit se manifester ici l’une des premieres apparitionsde la tendance a la geometrisation dans l’etude de lafonction ζ.” (p. 69)

J. Petitot Complex entanglement of structures

Page 151: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Schmidt proved that

ZC (T ) =L (T )

(1− T ) (1− qT )with L (T ) a polynomial of degree 2g

He showed also that L (T ) is in fact the characteristic polynomialof the Frobenius ϕq, i.e. the “norm” (the determinant) ofId − Tϕq.

J. Petitot Complex entanglement of structures

Page 152: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So

ZC (T ) =det(Id − Tϕq

)(1− T ) (1− qT )

and ZC (T ) satisfies the functional equation

ZC

(1

qT

)= q1−g T 2−2g ZC (T )

For ζC the symmetric functional equation is

q(g−1)sζC (s) = q(g−1)(1−s)ζC (1− s)

J. Petitot Complex entanglement of structures

Page 153: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Then, in three fundamental papers of 1936, Hasse proved RH forelliptic curves.

As g = 1, L (T ) is a polynomial of degree 2. And as C is elliptic, ithas a group structure (C is isomorphic to its Jacobian J (C )),which is used as a crucial feature in the proof.

Indeed, one can consider the group endomorphisms ψ : C → C andtheir graphs Ψ in C × C , what Hasse called correspondences.

J. Petitot Complex entanglement of structures

Page 154: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Hasse proved that, due to the functional equation, L (T ) is thepolynomial L (T ) = 1− c1T + qT 2 with

L (1) = 1− c1 + q = N1 = |C (Fq)|

So L (T ) = (1− ωT ) (1− ωT ) with ωω = q and ω + ω = c1 theinverses of the zeroes.

J. Petitot Complex entanglement of structures

Page 155: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As |ω| = |ω|, we have |ω| =√

q. But, since ζC (s) = ZC (q−s), the

zeroes of ζC (s) correspond to q−sj = (ωj)−1. So we must have

∣∣q−sj∣∣ =

∣∣q−sj∣∣ = |q|−<(s) = q−<(s) =

1

|ωj |=

1√

q= q−

12

and < (s) = 12 .

Hence, the RH.

J. Petitot Complex entanglement of structures

Page 156: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let us rewrite RH.

One has |C (Fq)| − q − 1 = −c1 with c1 = ω + ω = 2< (ω). Butω =√

qe iα and therefore < (ω) =√

q cos (α). Soc1 = 2

√q cos (α) and RH is equivalent to

||C (Fq)| − q − 1| ≤ 2q12

J. Petitot Complex entanglement of structures

Page 157: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Weil’s “conceptual” proof of RH

To tackle the case g > 1, Weil had to take into account that C isno longer isomorphic to its Jacobian.

He worked on Fq (to have a good intersection theory) and in thesquare S = C × C of the curve C extended to Fq.

For a description of Weil’s proof, see e.g. James Milne’s paper“The Riemann Hypothesis over finite fields from Weil to thepresent day” (2015).

J. Petitot Complex entanglement of structures

Page 158: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let Φq be the graph of the Frobenius ϕq on Fq. It is a divisor ofthe surface S .

As the Fq-points of C , i.e. C (Fq), are the fixed points of ϕq, theirnumber is the intersection number: Φq •∆ where ∆ is thediagonal of S = C × C .

But one can apply Hurwitz trace formula (1887), which says that,for a Riemann surface C and a divisor Φ in S = C × C associatedto a map ϕ : C → C , one has:

Φ •∆ = Tr(ϕ | H0

(C ,Q

))− Tr

(ϕ | H1

(C ,Q

))+ Tr

(ϕ | H2

(C ,Q

))

J. Petitot Complex entanglement of structures

Page 159: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Here the trace formula becomes

Φq •∆ = Φq • ξ1 − Tr(ϕq | H1

(C))

+ Φq • ξ2

= 1− Tr(ϕq | H1

(C))

+ q

with ξ1 = e1 × C and ξ2 = C × e2 (ej points of C )

J. Petitot Complex entanglement of structures

Page 160: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

One considers the symmetric quadratic intersection forms (D,D ′) = D • D ′. We note that ξ1 • ξ1 = ξ2 • ξ2 = 0 (the ξj areisotropic) and ξ1 • ξ2 = 1 (it is exactly the reverse oforthonormality).

The key point is that, in this geometric context, RH for curvesover Fq is equivalent to the negativity condition D • D ≤ 0 for allD of degree = 0.

This is equivalent to the Castelnuovo-Severi inequality for everydivisor D :

D • D ≤ 2 (D • ξ1) (D • ξ2)

J. Petitot Complex entanglement of structures

Page 161: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Indeed, let

def (D) = 2 (D • ξ1) (D • ξ2)− D • D = 2d1d2 − D • D ≥ 0

be what Severi called the “defect” of the divisor D.

Writing def (mD + nD ′) ≥ 0 for all m, n, we find∣∣D • D ′ − d1d ′2 − d ′1d2

∣∣ ≤ (def (D) def(D ′)) 1

2

J. Petitot Complex entanglement of structures

Page 162: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If we apply this to the Frobenius divisor Φq when C has genus g ,and use the fact that d1 = Φq • ξ1 = 1 and d2 = Φq • ξ2 = q, wecompute def (Φq) = 2gq and def (∆) = 2g . So we get

|Φq •∆− q − 1| ≤ 2gq12

But, as Φq •∆ =∣∣C (Fq)

∣∣, one has

∣∣∣∣C (Fq)∣∣− q − 1

∣∣ ≤ 2gq12

which is the generalization for genus g of RH (see above).

J. Petitot Complex entanglement of structures

Page 163: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It is to prove Castelnuovo-Severi inequality that RR enters thestage with the inequality

`(D)− `(KS − D) ≥ 1

2D • (D − KS) + χ (S)

Indeed, let us suppose D • D > 0.

J. Petitot Complex entanglement of structures

Page 164: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

1 One then uses RR to show that after some rescaling D nDwe must have `(nD) > 1. So one can suppose `(D) > 1.

2 Now it can be shown that if `(D) > 1, then D is linearlyequivalent to D ′ > 0. One can therefore suppose D > 0.

3 Then one shows that this implies the positivity(D • ξ1) + (D • ξ2) > 0. So D • ξ1 and D • ξ2 cannot vanishat the same time (D cannot be orthogonal to both the ξj).

4 One then applies Castelnuovo-Severi lemma saying that if, forevery D s.t. D • D > 0, D • ξ1 and D • ξ2 cannot vanish atthe same time then for any D

D • D ≤ 2 (D • ξ1) (D • ξ2)

J. Petitot Complex entanglement of structures

Page 165: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Remark. To the Hasse-Weil function ζC (s) is associated anexplicit formula as in the arithmetic case.

The RHS is an intersection number D •∆ between the diagonal ∆of C × C and a certain divisor D =

∑k akΦk which is an integral

linear combination of powers of Φ.

The terms h (0) + h (1) of the LHS h (0) + h (1)−∑

ρ h (ρ)

correspond to the D • ξj with ξ1 = e1 × C and ξ2 = C × e2 (ej

points of C ).

J. Petitot Complex entanglement of structures

Page 166: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Connes’ strategy : “a universal object for the localizationof L functions”

To summarize: Weil introduced an intermediate world, the world ofcurves over finite fields Fq. He reformulated the RH in this newframework and used tools inspired by algebraic geometry andcohomology over C to prove it.

It is well known that the generalization of this result to higherdimensions led to his celebrated conjectures and that the strategyfor proving them has been at the origin of the monumentalprogramme of Grothendieck (schemes, sites, topoı, etalecohomology).

J. Petitot Complex entanglement of structures

Page 167: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

But after Deligne’s proof of Weil’s conjectures in 1973 the originalRH remained unbroken.

Some years ago, Alain Connes proposed a new strategy consistingin constructing a new geometric framework for arithmetics whereWeil’s proof could be transfered by analogy.

The fundamental discovery is that for finding a strategy, one needsto work in the world of “tropical algebraic geometry incharacteristic 1”, and apply it to the noncommutative space of theclasses of adeles.

J. Petitot Complex entanglement of structures

Page 168: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In his 2014 Lectures at the College de France he said that he waslooking since 18 years for a geometric interpretation of adeles andideles in terms of algebraic geometry a la Grothendieck.

In his essay he explains:

“It is highly desirable to find a geometric framework forthe Riemann zeta function itself, in which the Hasse-Weilformula, the geometric interpretation of the explicitformulas, the Frobenius correspondences, the divisors,principal divisors, Riemann-Roch problem on the curveand the square of the curve all make sense. (p.8)”

I will try to summarize now Connes’ last two years Lectures.

J. Petitot Complex entanglement of structures

Page 169: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Ingredients : semi-fields and characteristic 1

There are some key ingredients needed for implementing thestrategy.

The main idea is to change the basic algebraic structures and shiftfrom rings and fields to semi-rings and semi-fields, that is toalgebraic structures

(A, +, ×

)where +, × are monoid laws (i.e.

associative, with neutral element, + commutative, × distributive).

J. Petitot Complex entanglement of structures

Page 170: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In particular, one can look at Z and Q using the sup ∨ as newaddition + and the + or the × as new multiplication ×.

We will need in the following:

Zmax = −∞ ∪ Z with + = ∨ (−∞ is the neutral element sincex ∨ −∞ = x) and × = + (with neutral element 0).

Zmax is a semi-field K whose K× is infinite cyclic (there exists nofield with this property). It is essential to note that there arenatural Frobenius maps on Zmax. Indeed, if n ∈ N×,ϕn : x 7→ xn = nx is an endomorphism of Zmax (of course,n (x ∨ y) = nx ∨ ny and n (x + y) = nx + ny).

J. Petitot Complex entanglement of structures

Page 171: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Idem for Rmax.

More generally, if H is any abelian ordered group,Hmax = −∞ ∪ H with + = ∨ (−∞ is the neutral element) and× = + is a semi-field.

R+max = R+ with + = ∨ (0 is the neutral element since all x are

> 0) and × = × (1 remains the neutral element). It is theexponential transform of Rmax.

J. Petitot Complex entanglement of structures

Page 172: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In these semi-algebras, addition is idempotent x+x = x ∨ x = xand one says they are of characteristic 1.

The basic structure in characteristic 1 is the Boolean semi-fieldB = 0, 1 with ∨ and ×, with 1 ∨ 1 = 1.

R+max is an extension of B (there don’t exist finite extensions of B).

Its Galois group is

Gal(R+

max

):= Aut

B

(R+

max

)= R∗+,

and the λ ∈ R∗+ act as Frobenius maps x 7→ xλ.

J. Petitot Complex entanglement of structures

Page 173: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

One has actually (x ∨ y)λ = xλ ∨ yλ since x , y ≥ 0 and λ > 0, andof course (xy)λ = xλyλ.

So one gets a Frobenius flow (a multiplicative 1-parameter group)on R+

max.

J. Petitot Complex entanglement of structures

Page 174: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Now, one can extend the classification of finite fields (the Fpn) tofinite semi-fields. The result is remarkable.

Theorem. If K is a finite semi-field, then either K is a field (a Fpn)or K = B.

Indeed, let x 6= 0 in K. As K× is finite, xn = 1 for an n. Letb = 1 + x + . . . xn−1 = 1 + a. We have xb = b. If b = 0, thenb = 0 = 1 + a, a = −1 and the semi-group + is a group and K is afield. If b 6= 0, then x = bb−1 = 1 and K = B.

J. Petitot Complex entanglement of structures

Page 175: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So one can use the Boolean semi-field B as the base for a newworld of algebraic structures, try to do algebraic geometry incharacteristic 1, that is over a putative “non-existent” field F1, andlook at the possibility of transfering Weil’s proof of RH to this newframework.

J. Petitot Complex entanglement of structures

Page 176: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Remark. The world of semi-rings and semi-fields in characteristic1 is intimately correlated to what is called tropical geometry,idempotent analysis, and what V.P. Maslov called“dequantization”.

The idea is to take + as the “multiplication” and conjugate it withscaling x 7→ xε where ε is a scale which → 0 as ~→ 0 in thesemiclassical approximations of quantum mechanics.

J. Petitot Complex entanglement of structures

Page 177: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Now, it is well known that

limε→0

(x

1ε + y

)ε= x ∨ y

A great advantage of this framework for optimization problems isthat Legendre transforms become simply Fourier transforms.

Its origin is to be found in the technique of Newton polygonsintroduced by Newton to localize the zeroes of polynomials.

J. Petitot Complex entanglement of structures

Page 178: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The Hasse-Weil function in characteristic 1 : Soule’s work

We have seen that for curves C over finite fields Fq, theHasse-Weil zeta function ζC (s) counts the (finite) number N (qr )of points of C rational over the successive extensions Fqr .

The generating function of the N (qr ) is

ZC (T ) := exp(∑

r≥1 N (qr ) T r

r

)and ζC (s) := ZC (q−s).

But such ZC are defined for every function N (qr ), even if N (qr )does not derive from a curve.

J. Petitot Complex entanglement of structures

Page 179: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

An interesting question is therefore to know if it is possible toretrieve Riemann’s original ζ (s) as a limit case of a Hasse-Weilfunction ZN (q−s) for a well defined N.

But what type of limit case?

For curves over Fq=pk , that is global fields K (C ) /Fq (t), the basefield Fp is a common underlying structure to all localizations.

For the global field Q, there is no evident equivalent.

J. Petitot Complex entanglement of structures

Page 180: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Christophe Soule had the fine idea to look at polynomials ZN (q−s)for q → 1.

More precisely, as ZN (T ) has a pole of order N (1) at q = 1, helooked at limits

ζN (s) = limq→1

ZN

(q−s)

(q − 1)N(1)

J. Petitot Complex entanglement of structures

Page 181: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The question is then to know if there exists a counting function Ngiving

ζN (s) = ζ∗ (s) = ζ(s)Γ( s

2

)π−

s2

Such a “function” N does exist.

If one takes the logarithms, one gets

log ζN (s) = log ζ∗ (s) = limq→1

∑r≥1

N (qr )q−sr

r+ N (1) log (q − 1)

J. Petitot Complex entanglement of structures

Page 182: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Connes and Consani have shown that the logarithmic derivative isgiven by the formula

ζ ′N (s)

ζN (s)=ζ∗′ (s)

ζ∗ (s)= −

∫ ∞1

N (u) u−s du

u

where N is the well-defined distribution

N (u) = u + 1− d

du

(∑ρ

uρ+1

ρ+ 1

)

J. Petitot Complex entanglement of structures

Page 183: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

N (u) is the derivative in the distribution sense of the increasingstep function J (u) on [1,∞) diverging to −∞ at 1 (see figure).

J (u) =u2

2+ u −

(∑ρ

uρ+1

ρ+ 1

)

See figure 9

J. Petitot Complex entanglement of structures

Page 184: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Figure: The integral of Soule’s distributrion

J. Petitot Complex entanglement of structures

Page 185: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The arithmetic topos A

A =(N×,Zmax

)

Connes’ challenge was to find

“the bridge between noncommutative geometry andtopos points of view.” (p.21)

J. Petitot Complex entanglement of structures

Page 186: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

His construction is quite astonishing. He succeeded in identifying

1 the natural action of the multiplicative group R×+ of classes of

ideles on the noncommutative space Q×\AQ/Z×,

2 the natural action of the Frobenius maps ϕλ, λ ∈ R×+ on thepoints of the “arithmetic topos” A over Rmax

+

J. Petitot Complex entanglement of structures

Page 187: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The starting point is incredibly simple, “d’une simplicite biblique”.

Connes and Consani identify N× to the small category with asingle object ∗ and morphisms n ∈ N× with composition n mgiven by the multiplication nm.

Then they look at the category N× of presheaves on N×, that isthe category of contravariant functors (N×)

op → Set, that is thecategory of sets endowed with a N×-action.

J. Petitot Complex entanglement of structures

Page 188: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As the category is trivial, N× is a topos on the site N× endowedwith the trivial Grothendieck topology. Now, Zmax is a semi-ring inthis topos since N× acts on Zmax through the Frobenius maps ϕn.

Connes takes it as the structural sheaf of the topos N× and calls

A =(N×,Zmax

)the arithmetic site (or topos). It is a geometric

object “defined over” B.

J. Petitot Complex entanglement of structures

Page 189: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The key idea is then to develop the analogy:

arithmetic site A =(N×,Zmax

)over the finite semi-field B of characteristic 1

malgebraic curve C

over the finite field Fq of characteristic p

J. Petitot Complex entanglement of structures

Page 190: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The points of the topos A

The first remarkable fact is that the points of the topos A

correspond, up to isomorphism, to the additive subgroups H of Q.

Recall that a point of a topos T is a geometric morphismp : Set→ T , that is a pair of adjoint functors p∗ a p∗ with p∗

preserving finite limits (as p∗ is a left adjoint, it is left exact andpreserves general colimits) :

Tp∗→←p∗

Set

J. Petitot Complex entanglement of structures

Page 191: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

This means that HomSet (p∗ (F ) ,S) ' HomT (F , p∗ (S)), forF ∈ T and S ∈ Set.

p∗ (F ) is the stalk of the topos T at the point p.

(See e.g. Mac Lane and Moerdijk and the Web site nLab.)

J. Petitot Complex entanglement of structures

Page 192: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In our case, an element F of N× is simply a set X = F (∗)endowed with an action θn of N× and a point

(p∗, p∗) : N× → Set associates functorially to each (X , θ) a setp∗ ((X , θ)) s.t. HomSet (p∗ ((X , θ)) ,S) ' Hom cN× ((X , θ) , p∗ (S)).

J. Petitot Complex entanglement of structures

Page 193: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let Y : N× → N× be the Yoneda functor ∗ 7→ Y∗ : (N×)op → Set

defined by Y∗ (∗) = N× and Y∗ (n) = multiplication by n in N×.

To p∗ : N× → Set one associates the covariant functorp : N× → Set

p = p∗ Y : N× Y→ N× p∗→ Set

and shows that, since p∗ is a geometric morphism, p is flat.

J. Petitot Complex entanglement of structures

Page 194: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

This means :

1 X = p (∗) 6= ∅,

2 Every pair of elements x , x ′ ∈ X are the images of someelement z ∈ X through two morphisms p (k) and p (k ′),k, k ′ ∈ N× (i.e. x , x ′ are always in some orbit of theN×-action),

3 If p (k) (x) = p (k) (x ′), then k = k ′ (i.e. the N×-action isfree).

J. Petitot Complex entanglement of structures

Page 195: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

This means that beyond the given action of the multiplicativemonoid (N×,×) on X , there is in fact an action of the ring(N×,×,+).

So, if one defines H+ as X endowed with the (well defined)commutative and associative addition x + x ′ := p (k + k ′) (z) for az s.t. p (k) (z) = x and p (k ′) (z) = x ′, one can transfer to X theconstruction of the ring Z from the multiplicative monoid N×.

J. Petitot Complex entanglement of structures

Page 196: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Moreover, one can show that the N×-action is simplifiable, whichmeans that for every pair x , x ′ ∈ X there exists a z ∈ X s.t. eitherx + z = x ′ or x ′ + z = x and so either x − x ′ or x ′ − x can be welldefined.

This implies that H+ is the positive part of an abelian additivetotally ordered group (H,H+), the N×-action being

p (k) (x) = x + . . .+ x︸ ︷︷ ︸k times

= kx

J. Petitot Complex entanglement of structures

Page 197: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

(H,H+) is an increasing union of subgroups isomorphic to (Z,Z+)and is isomorphic to an additive subgroup of (Q,Q+).

Indeed if x ∈ X , there exists an injection jx : H → Q given byjx (x) = 1 and jx (x ′) := k ′

k deduced from every z ∈ X s.t.

p (k) (z) = x and p (k ′) (z) = x ′ (k ′

k is well defined).

Theorem. The category of points of the arithmetic topos N× iscanonically equivalent to the category whose objects are the totallyordered groups (H,H+) isomorphic to non trivial subgroups of(Q,Q+) and morphisms are order preserving injections.

J. Petitot Complex entanglement of structures

Page 198: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

In particular, the subgroups of Q: Hp =

npk | n ∈ Z, k ∈ N

for p

prime, are special points of N×.

As the primes p are the points of the scheme Spec (Z), one gets acanonical interpretation of Spec (Z) into the arithmetic topos A.

J. Petitot Complex entanglement of structures

Page 199: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

But we have already seen that the non trivial subgroups of (Q,Q+)are classified by the quotient of finite adeles Af

Q/Z×. In fact:

Theorem. The isomorphism classes of points of the arithmetictopos A are canonically isomorphic to the noncommutative spaceQ×+\Af

Q/Z× where Q×+ acts by multiplication.

J. Petitot Complex entanglement of structures

Page 200: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let pH be the point of N× represented by the subgroup H and letHmax be (see above) the semi-field Hmax = −∞ ∪H with + = ∨(−∞ is the neutral element) and × = +.

Theorem. Hmax is the stalk of the structural sheaf Zmax at thepoint pH .

J. Petitot Complex entanglement of structures

Page 201: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Extension of scalars

In Connes’ analogy, the arithmetic topos corresponds to a curve Cover a finite field Fq. We have seen that Weil’s proof of RH usesintersection theory and RR in the square C × C .

So, to keep on with the analogy, one has to define the squareA× A and use the Frobenius maps to “count the points”.

J. Petitot Complex entanglement of structures

Page 202: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The starting idea is rather subtle. Connes adds a scaling flow tothe arithmetic topos.

The underlying site of the scaled topos A is constructed using thesemi-direct product [0,∞) o N×.

The category C is the category with objects the open intervals Ω of[0,∞) (the [0, a) and ∅ are included, ∅ is an initial object) andwith morphisms n : Ω→ Ω′ the n ∈ N× s.t. nΩ ⊂ Ω′ (i.e. n actsas a scaling).

So we have a topological space [0,∞) with a N×-scaling.

J. Petitot Complex entanglement of structures

Page 203: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The category C has fiber products.

One considers then the Grothendieck topology J on C defined bythe covering of open intervals Ω by families of open intervals Ωjand the sheaves over the site (C, J), that is sheaves over [0,∞)which are N×-equivariant.

Let A = Sh (C, J).

J. Petitot Complex entanglement of structures

Page 204: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The structural sheaf

Connes insists on the “enormous gain” due to the fact that thescaled arithmetic topos A has a structural sheaf O which is asemi-ring object.

The key definition is the following. It opens the world of tropicalgeometry in this new context.

J. Petitot Complex entanglement of structures

Page 205: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

If Ω ⊂ [0,∞) is an open interval, O (Ω) is the semi-ring offunctions f : Ω→ Rmax

1 with values f (λ) in Rmax = −∞ ∪ (R,+),

2 continuous,

3 piecewise affine,

4 with integral slopes f ′ ∈ Z except at points where f ′ presentsa discontinuity (angular point),

5 convex.

J. Petitot Complex entanglement of structures

Page 206: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As for the morphisms (scaling) n : Ω→ Ω′, one defines

O(

Ωn→ Ω′

)by f (λ) 7→ f (nλ).

It is a coherent definition since f ′ (nλ) = nf ′ (λ) and if f ′ ∈ Z thennf ′ ∈ Z.

O is a semi-ring in A and a semi-algebra over Rmax .

The deep analogy with algebraic curves in the classical Riemann’stheory is the following:

J. Petitot Complex entanglement of structures

Page 207: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

A C

f piecewise affine f analytic

−f 1f

f convex f holomorphic

linear point λ : f ′ (λ−) = f ′ (λ+) f holomorphic invertible at z

angular point λ with f ′ (λ−) < f ′ (λ+) zero of f

angular point λ with f ′ (λ−) > f ′ (λ+) pole of f

J. Petitot Complex entanglement of structures

Page 208: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Points of A and A over Rmax+

When one extends the scalars to Rmax+ , one adds a lot of new

points, namely all the subgroups of rank 1 of R.

They are the subgroups of the form λHa with a λ ∈ R scaling anadditive subgroup Ha of Q.

Remember (see above) that the Ha are parametrized by the finiteadeles a.

J. Petitot Complex entanglement of structures

Page 209: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

It can be shown that – as one has C(Fq

)= C

(Fq

)in the case of

curves over Fq – one has here A(Rmax

+

)= A

(Rmax

+

).

The action of the Frobenius maps ϕλ, λ ∈ R×+ on these points

correspond to the action of the classes of ideles modulo Z× i.e.R×+.

Theorem. The isomorphism classes of points of the scaledarithmetic topos A

(Rmax

+

)= A

(Rmax

+

)are canonically isomorphic

to the noncommutative space Q×\AQ/Z×, where Q× acts bymultiplication.

J. Petitot Complex entanglement of structures

Page 210: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So it becomes possible to do algebraic geometry on theadeles’ classes.

It is important to note that the points of the initial arithmetictopos A correspond to abstract groups isomorphic to the Ha

defined by finite adeles a.

Now, we add to a an Archimedean component λ ∈ R (a scaling)and look at λHa no longer as an abstract subgroup but as a welldefined subgroup of R. All the points λHa of A lie over the pointHa of A.

J. Petitot Complex entanglement of structures

Page 211: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Theorem. If pH is the point of A defined by the rank 1 subgroupH of R, the stalk of the structural sheaf O at pH is the semi-ringRH of germs at λ = 1 (the identity scaling) of functions f (1)continuous, (2) Rmax -valued, (3) piecewise affine, (4) convex, (5)with slopes in H.

Let x = f (1) ∈ Rmax and h = f ′ (1−) ∈ H andh+ = f ′ (1+) ∈ H. As f is convex, h ≤ h+. If h = h+, f is regular(linear) at 1 and if h < h+, f is singular at 1 (angular point).

J. Petitot Complex entanglement of structures

Page 212: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

RH is the semi-ring of triplets (x , h , h+) with

(x , h , h+) ∨(x ′, h′ , h′+

)=

(x , h , h+) if x > x ′(x ′, h′ , h′+

)if x < x ′(

x , h ∧ h′ , h+ ∨ h′+)

if x = x ′

(x , h , h+) +(x ′, h′ , h′+

)=

(x + x ′, h + h′ , h+ + h′+

)

J. Petitot Complex entanglement of structures

Page 213: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Then one defines the order of f as ord (f ) = h+ − h. As f isconvex, ord (f ) ≥ 0. If ord (f ) = 0 then f is linear.

For a rescaling µ, the action of Frobenius ϕµ on O is given by

ϕµ : RH → RµH , (x , h , h+) 7→ (x , µh , µh+)

J. Petitot Complex entanglement of structures

Page 214: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The RR strategy

In the framework of the scaled arithmetic topos, one can transferto the square A× A Weil’s RR strategy for trying to prove RH.

The “graphs” of the Frobenius scaling flow ϕλ define a flow ofFrobenius scaling “correspondences” Φλ on A× A (λ ∈ R×+) andone has Φλ Φλ′ = Φλλ′ up to some technicalities when λλ′ ∈ Qwhile λ, λ′ /∈ Q.

J. Petitot Complex entanglement of structures

Page 215: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The “elliptic” case of periodic points

An analogy with Fp elliptic curves

In A, all the points λHp with Hp =

npk | n ∈ Z, k ∈ N

lie over

the point Hp of A.

They are parametrized by R∗+/pZ and constitute in some sense a“circle” Cp over p which is a periodic orbit of the Frobenius scalingflow ϕλ.

J. Petitot Complex entanglement of structures

Page 216: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Remark. When one makes the link of this toposic approach ofarithmetics with the explicit formulas, one finds that the “length”of Cp must be log p.

It has been a long while since Selberg noted the deep analogy ofRiemann’s explicit formula with his own “trace formula”concerning the eigenvalues of the Laplacian of hyperbolic compactsurfaces (Riemann surfaces of genus ≥ 2).

It is the log of the length of the closed geodesics (i.e. the periodicorbits of the geodesic flow) which is involved.

J. Petitot Complex entanglement of structures

Page 217: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Connes and Consani have recently proved RR in that simple case,which as they say, is “encouraging”.

More precisely they have shown that the algebraic geometry ofelliptic curves over Fp can be completely transfered to the Cp.

The analogy is with the 1959 theory of John Tate (see A review ofnon-Archimedean elliptic functions and the correspondence withSerre).

J. Petitot Complex entanglement of structures

Page 218: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The classical theory of elliptic curves Eτ as quotients C/Λ of C bya lattice Λ = 〈1, τ〉 with = (τ) > 0 (i.e. τ ∈ H, the hyperbolicPoincare half-plane) cannot be extended to the p-adic context.

To overcome this difficulty, Tate remarked that, since functions fover Eτ are doubly periodic functions f (z) over C with periods 1and τ (elliptic functions), one can “absorb” the period 1 in thechange of variables z 7→ u = e2πiz .

J. Petitot Complex entanglement of structures

Page 219: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

This is a Fourier transform transforming the cylinder(C/Z,+, 0,×, 1) into (C∗,×, 1, exp, 1).

Then f (z) becomes a function f (u) on C∗ with period τ .

Applying again a Fourier transform, namely q = e2πiτ (|q| < 1since = (τ) > 0), f (z) becomes q-periodic and hence a functionon C∗/qZ. Indeed,

if z 7→ z + τ , then e2πiz 7→ e2πi(z+τ) = e2πize2πiτ = qe2πiz

J. Petitot Complex entanglement of structures

Page 220: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

So Eτ can be identified with C∗/qZ, q = e2πiτ , and Tatereformulated the whole theory of elliptic curves in that new contextand showed how it can be transfered to the p-adic case. Thereason of the transfer is that (p. 2)

“these Fourier expansions, suitably normalized, yield“universal” identities among power series with rationalintegral coefficients.”

J. Petitot Complex entanglement of structures

Page 221: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The periodic orbit Cp ' R∗+/pZ of the Frobenius scaling flow

The analogy is then between Tate’s C∗/qZ and Connes’ R×+/pZ.

The Rmax-valued functions f are now multiplicatively p-periodicfunctions f (λ) defined on the scales λ ∈ R×+, i.e. on R×+/pZ.

So, the f are periodically scale invariant and can be considered asdefined on [1, p]. Remember that the algebraic operations are+ = ∨ and × = +.

J. Petitot Complex entanglement of structures

Page 222: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

O (Cp) = Op is the sheaf ot germs of p-periodic functions f (λ)(1) continuous, (2) piecewise affine (f (λ) = hλ+ a), (3) convex,(4) with slopes f ′ (λ) = h in Hp at all points λ. (As f ′ (λ) ∈ Hp isthe same as λf ′ (λ) ∈ λHp the condition (4) is invariant.)

They are the equivalent of holomorphic functions in Tate’s case.

J. Petitot Complex entanglement of structures

Page 223: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

O (Cp)× = O×p is the sheaf of invertible elements of Op that is off whose germs are linear at every point, i.e. C 1.

It is evident that there cannot exist non constant global sections ofO×p since we would have f p-periodic, C 1, and everywhere convex,which is impossible.

J. Petitot Complex entanglement of structures

Page 224: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

K (Cp) = Kp is the sheaf of germs of functions f (λ) (1)continuous, (2) piecewise affine, (3) non necessarilly convex, (4)with slopes f ′ (λ) in Hp at all points λ.

Kp has a lot of global sections (the equivalent of elliptic functionsin Tate’s case).

J. Petitot Complex entanglement of structures

Page 225: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Divisors

As in the classical case, Cartier divisors are global sections of thequotient sheaf Kp/O×p .

As in the classical case, they are finite formal sums D of points pλ,that is of rank 1 subgroups λHp of R.

The fundamental difference is that the order D (pλ) of D at pλbelongs now to λHp ⊂ R and no longer to Z.

So, if D =∑j=n

j=1 D (pλi) pλi

, deg (D) =∑j=n

j=1 D (pλi) ∈ R is a real

number.

J. Petitot Complex entanglement of structures

Page 226: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Now let f be continuous, piecewise affine, with multiplicativeperiod p, and with slopes in Hp.

If one decomposes f in its affine parts on a fondamental domainλ0 < λ1 < · · · < λn = pλ0 and remember that ord (f ) at pλ isλ(h(λ+)− h

(λ−))

, one sees that, as in the classical case, thedegree of the principal divisor (f ) vanishes: deg ((f )) = 0.

J. Petitot Complex entanglement of structures

Page 227: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

There is another number that can be associated to a divisor.

If p > 2, Hp/ (p − 1) Hp ' Z/ (p − 1) Z.

Then, for H = λHp, consider the map

χ : H → Z/ (p − 1) Z, µ 7→ µ

λ∈ Hp

µλ being seen as an element of Hp/ (p − 1) Hp ↔ Z/ (p − 1) Z.

J. Petitot Complex entanglement of structures

Page 228: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

χ can be extended to divisors by linearity and one shows thatχ ((f )) = 0 for principal divisors.

So, one can consider the map (deg, χ) from divisors toR× Z/ (p − 1) Z.

The principal divisors constitute the kernel of (deg, χ).

J. Petitot Complex entanglement of structures

Page 229: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The Frobenius scaling flow in the “elliptic” case

Remember that for a rescaling µ, the action of the Frobenius ϕµon the structural sheaf O is given by

ϕµ : RH → RµH , (x , h , h+) 7→ (x , µh , µh+)

On the functions f (λ), the natural action is

ϕµ (f ) (λ) := µf(µ−1λ

)

J. Petitot Complex entanglement of structures

Page 230: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Indeed, in the multiplicative semi-field Rmax+ , ϕµ acts as

ϕµ : x → xµ.

In the additive semi-field Rmax (which is the log of Rmax+ ), ϕµ acts

therefore as ϕµ : x → µx .

Now, f is valued in Rmax and piecewise affine: f (λ) = hλ+ a, andthe ϕµ act on the a. So we must have

ϕµ (f ) (λ) = hλ+ µa = µ(hµ−1λ+ a

)= µf

(µ−1λ

)

J. Petitot Complex entanglement of structures

Page 231: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The ϕµ act also on divisors.

1 If D =∑

j (Hj , hj ∈ Hj), then ϕµ (D) =∑

j (µHj , µhj ∈ µHj),

2 deg(ϕµ (D)

)= µ deg (D),

3 χ(ϕµ (D)

)= µχ (D).

J. Petitot Complex entanglement of structures

Page 232: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

“Elliptic” functions and “theta” functions

In the classical case, it is well known that elliptic functions on theelliptic curve Eτ = C/Λ can be expressed using theta functions.

Due to Liouville theorem, an entire elliptic function on Eτ isnecessarilly constant.

So if we want to get non constant functions we have twopossibilities:

J. Petitot Complex entanglement of structures

Page 233: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

1 to keep the periodicity, weaken the property of being entire,and accept meromorphic functions;

2 to weaken the periodicity and keep the property of beingentire.

The first possibility leads to elliptic functions and the second totheta functions.

J. Petitot Complex entanglement of structures

Page 234: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Tate reformulated the Θ-functions when the elliptic curve Eτ iswritten as C∗/qZ with q = e2πiτ . Tate’s formula is

Θ (w) =∑

Z(−1)n q

n(n−1)2 wn

= (1− w)m=∞∏m=1

(1− qm) (1− qmw)(1− qmw−1

)

and Θ (w) satisfies the functional equation

−wΘ (qw) = Θ (w)

J. Petitot Complex entanglement of structures

Page 235: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As in Tate’s case, Connes defined a theta function Θ (λ) on thewhole R×+,

1 which is no longer p-periodic (i.e. “elliptic”),

2 but which is globally (1) continuous, (2) piecewise affine, (3)convex (i.e. globally “holomorphic”),

3 and which satisfies a functional equation.

J. Petitot Complex entanglement of structures

Page 236: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Tate’s term (1− w)∏m=∞

m=1 (1− qmw) =∏m=∞

m=0 (1− qmw) istranslated into Θ+ (λ) λ ∈ (0,∞)

Θ+ (λ) :=m=∞∑m=0

(0 ∨ (1− pmλ))

and Tate’s term∏m=∞

m=1

(1− qmw−1

)is translated into

Θ− (λ) :=m=∞∑m=1

(0 ∨

(p−mλ− 1

))

The term∏m=∞

m=1 (1− qm) can be skipped.

J. Petitot Complex entanglement of structures

Page 237: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Then, one shows the functional equationΘ+ (pλ) = Θ+ (λ)− (0 ∨ (1− λ)) ,Θ− (pλ) = Θ+ (λ) + (0 ∨ (λ− 1)) , and thereforeΘ (pλ) = Θ (λ) + λ− 1 since (0 ∨ x)− (0 ∨ (−x)) = x

J. Petitot Complex entanglement of structures

Page 238: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Connes and Consani then proved the equivalent of the classicalreconstruction of all elliptic functions from theta functions.

From the basic theta function Θ (λ), they define a whole family oftheta functions Θh,µ parametrized by (h, µ) ∈ H+

p × R×+, that is bya positive slope and a rescaling.

These functions Θh,µ are associated with the Frobenius scaling flow

Θh,µ (λ) := µΘ(µ−1hλ

)(the role of µ and µ−1 is to warrant that the slopes remain in Hp).

J. Petitot Complex entanglement of structures

Page 239: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Their divisors are

δ (h, µ) :=(point µh−1Hp, order µ

)(one checks that µ ∈ µh−1Hp since µ = µh−1h and h ∈ Hp).

J. Petitot Complex entanglement of structures

Page 240: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

Let D = D+ − D− be a divisor with D+ =∑

i δ (hi , µi ) and

D− =∑

j δ(

h′j , µ′j

)and suppose that deg (D) = 0.

Theorem. If χ (D) = 0 (that is if h ∈ Hp satisfies(p − 1) h =

∑i hi −

∑j h′j), then the function

f (λ) :=∑

i

Θhi ,µi(λ)−

∑j

Θh′j ,µ′j(λ)− hλ

is a global section of Kp with divisor (f ) = D. Moreover all“elliptic” functions can be recovered through such a canonicaldecomposition.

J. Petitot Complex entanglement of structures

Page 241: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

p-adic norm, filtration and dimension

As the slopes of the f are in Hp =

npk | n ∈ Z, k ∈ N

we can

look at them “p-adically” that is by filtering them through the pk .

Let h (λ) ∈ Hp be the slope of f at λ. Connes defines theappropriate p-adic norm ‖f ‖p of f as

‖f ‖p := maxλ∈R×+

|h (λ)|pλ

with |•|p the p-adic norm normalized by |p|p = 1p .

J. Petitot Complex entanglement of structures

Page 242: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

As h (pλ) = 1p h (λ), this definition is appropriate since,

|h(λ)|pλ is

invariant by the scaling periodicity λ 7→ pλ :

|h (pλ)|ppλ

=p |h (λ)|p

pλ=|h (λ)|pλ

The ultrametricity of this p-adic norm is compatible with thealgebraic operations + = ∨ and × = + on functions.

One has also ‖paf ‖p = p−a ‖f ‖p and ‖f ‖p ≤ 1 iff the restrictionf |[1,p] has integral slopes.

J. Petitot Complex entanglement of structures

Page 243: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The H0 (D) and their dimension

As in the classical case, if D is a divisor one can consider the spaceH0 (D) (or L (D)) of the f s.t. D + (f ) ≥ 0.

H0 (D) := f ∈ Kp | D + (f ) ≥ 0

which is a Rmax-module (i.e. stable by ∨).

The challenge becomes to prove the Riemann-Roch theorem. Butfor that, one must at first define the dimensions of the spacesH0 (D) (they are the ` (D) = dimC (L (D)) in the classical case).

This is not trivial at all since they are Rmax-modules.

J. Petitot Complex entanglement of structures

Page 244: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

To define dim(H0 (D)

), Connes filters the H0 (D) using the p-adic

norm, that is the filtration of H0 (D) by the

H0 (D)pn

=

f ∈ H0 (D) s.t. ‖f ‖p ≤ pn

and proposes the formula

dim(H0 (D)

):= lim

n→∞p−n dimtop

(H0 (D)pn

)

where, for a topological space X , dimtop (X ) is the smallest k s.t.for every sufficiently fine open covering U = Uiof X , every pointx of X belongs to at most k + 1 open sets Ui .

J. Petitot Complex entanglement of structures

Page 245: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

RR theorem

RR theorem. If D ∈ Div (Cp) is a positive divisor, thendim

(H0 (D)

)= deg (D). If D is any divisor, then

dim(H0 (D)

)− dim

(H0 (−D)

)= deg (D)

(remember that these numbers are real numbers and not integers).

H0 (−D) corresponds to Serre’s duality between H0 (D) andH0 (K − D) in the classical case.

J. Petitot Complex entanglement of structures

Page 246: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The rest of the story

Connes’ programme is now to develop the intersection theory inthe square A× A of the scaled arithmetic topos, to prove RR forthis “surface” and show that for divisors D on A× A one has theinequality

dim(H0 (D)

)+ dim

(H0 (−D)

)≥ 1

2D • D

which would be the analog of the classical formula over S = C × Cfor curves:

`(D) + `(KS − D) ≥ 1

2D • (D − KS) + χ (S)

J. Petitot Complex entanglement of structures

Page 247: The entanglement of structures in complex proofsjeanpetitot.com/ArticlesPDF/Petitot_RH.pdf · The entanglement of structures in complex proofs PhilMath Intersem 7. 2016 Jean Petitot

The analogy is

C/Fq A/Bstructural sheaf OC structural sheaf O = Zmax

extension C/Fq extension A/Rmax+ = ([0,∞) o N×,O)

O =

continuous,

piecewise affine,convex

with integral slopes

functions

K = non necessarilly convex functions

C(Fq

)= C

(Fq

)A(Rmax

+

)= A

(Rmax

+

)

J. Petitot Complex entanglement of structures