The Riemann proof structure

The Riemann proof structure

The original five public results share a theorem giving nonvanishing of Dirichlet L-functions to the right of the critical line. The zeta result specializes it to level one. The two Dirichlet zero results follow different formal reductions in the archive.

This source map follows selected direct references in the original Lean proof bodies, including projections from conjunctions. Each dependency records a line where the consumer names the prerequisite. The graph stops at selected arithmetic and analytic inputs. The source excerpts show additional prerequisites at those boundaries. Blueprint tracks these as informal nodes linked to the archive. Checking this document verifies the map and its markup, independently of a full build or axiom audit of the original project.

Table of Contents

  1. Dependency Graph
  2. 1. Public conclusions
  3. 2. Export wrappers
  4. 3. Nonvanishing
  5. 4. Arithmetic inputs
  6. 5. Analytic reductions

Dependency Graph🔗

1. Public conclusions🔗

Theorem1.1
uses 0used by 0XL∃∀N

riemannHypothesis

The public Riemann hypothesis theorem in Mathlib’s formulation.

Original declaration, line 4

Proof for Theorem 1.1

Line 4 uses rhOfAll.

Theorem1.2
uses 0used by 0XL∃∀N

riemannZeta_eq_zero_re

The explicitly quantified claim about the real parts of nontrivial zeta zeros uses the same proof as RH.

Original declaration, line 6

Proof for Theorem 1.2

Line 6 uses rhOfAll.

Theorem1.3
uses 0used by 0XL∃∀N

LFunction_ne_zero_of_half_lt_re

The public nonvanishing theorem for Dirichlet L-functions to the right of the critical line, with the stated exception at one.

Original declaration, line 8

Proof for Theorem 1.3

Line 8 uses allChi.

Theorem1.4
uses 0used by 0XL∃∀N

LFunction_eq_zero_re

The public strip result for all characters projects the middle field of the conjunction.

Original declaration, line 10

Proof for Theorem 1.4

Line 10 uses claimAll.

Theorem1.5
uses 0used by 0XL∃∀N

LFunction_eq_zero_re_of_isPrimitive

The public strip result for primitive characters uses the dedicated primitive wrapper.

Original declaration, line 12

Proof for Theorem 1.5

Line 12 uses critAll.

2. Export wrappers🔗

Theorem2.1
uses 0
Used by 4
Reverse dependency previews
Preview
Theorem 1.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

allChi

Binds the all-character theorem used by the public-facing wrappers.

Original declaration, line 7

Proof for Theorem 2.1

Line 7 uses everyCharacter.

Theorem2.2
uses 0
Used by 2
Reverse dependency previews
Preview
Theorem 1.1
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

rhOfAll

Supplies the half-plane input to the level-one zeta reduction.

Original declaration, line 9

Proof for Theorem 2.2
Proof uses 2
Proof dependency previews
Preview
Theorem 2.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 9 uses rh_of_every, allChi.

Theorem2.3
uses 0used by 1XL∃∀N

claimAll

Stores half-plane nonvanishing, the strip result, and the zeta result in one conjunction. The all-character strip export selects its middle field.

Original declaration, line 15

Proof for Theorem 2.3
Proof uses 3
Proof dependency previews
Preview
Theorem 2.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 16 uses allChi, strip, zeta.

Theorem2.4
uses 0used by 1XL∃∀N

critAll

Supplies the half-plane input to the primitive critical-line reduction.

Original declaration, line 11

Proof for Theorem 2.4
Proof uses 2
Proof dependency previews
Preview
Theorem 2.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 13 uses critLine, allChi.

3. Nonvanishing🔗

Theorem3.1
uses 0used by 1XL∃∀N

UpperTheory.Top.zeroFreeAll_of_topG

Derives primitive-character zero-freeness from connected families and a host for each character.

Original declaration, line 26

Theorem3.2
uses 0used by 1XL∃∀N

UpperTheory.Top.zero_free_all_of_green_v_win

Supplies the family and host inputs using the Green condition, the window and the definite-side hypotheses.

Original declaration, line 12

Proof for Theorem 3.2

Line 14 uses zeroFreeAll_of_topG.

Theorem3.3
uses 0used by 1XL∃∀N

UpperTheory.Top.imprimitive

Extends primitive-character nonvanishing to arbitrary level by the change-of-level formula and nonzero Euler factors.

Original declaration, line 5

Theorem3.4
uses 0used by 1XL∃∀N

UpperTheory.Top.every_character_of_green_v_win

Combines primitive nonvanishing with change of level to cover every Dirichlet character.

Original declaration, line 16

Proof for Theorem 3.4
Proof uses 2
Proof dependency previews
Preview
Theorem 3.2
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 18 uses zero_free_all_of_green_v_win, imprimitive.

Theorem3.5
uses 0used by 1XL∃∀N

UpperTheory.Lit.every_character_of_theta_integrals_local_matching

Uses regular characters for the Green condition and theta matching for the definite-side hypotheses, then applies the all-level theorem.

Original declaration, line 69

Proof for Theorem 3.5
Proof uses 2
Proof dependency previews
Preview
Theorem 3.4
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 72 uses every_character_of_green_v_win. Line 73 uses nonempty_hyps_definite_side_of_closed_bound.

Theorem3.6
uses 0used by 1XL∃∀N

UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin

Feeds the assembled third-place and theta inputs, both matching facts, a covolume bound, local reciprocity and the window into the theta argument.

Original declaration, line 810

Proof for Theorem 3.6
Proof uses 6
Proof dependency previews
Preview
Theorem 3.5
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 811 uses published_results_eigen, published_results_first, theta_integrals_agree_and_local_matching_of_literature, every_character_of_theta_integrals_local_matching. Line 812 uses topCovolSlim2_use_alt_alt. Line 813 uses local_langlands_gl_recT_exists_of_literature.

Theorem3.7
uses 0used by 1XL∃∀N

UpperTheory.FinalTheorems.everyCharacter_of_row

Supplies the row twice in the literature record, supplies local reciprocity, and builds the required window from that row.

Original declaration, line 7

Proof for Theorem 3.7
Proof uses 3
Proof dependency previews
Preview
Theorem 3.6
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 8 uses recTExists, vwin_of_row, every_character_of_literature_of_vWin.

Theorem3.8
uses 0used by 1XL∃∀N

UpperTheory.FinalTheorems.everyCharacter

Applies the row-to-nonvanishing implication to the constructed Galois row.

Original declaration, line 10

Proof for Theorem 3.8
Proof uses 2
Proof dependency previews
Preview
Theorem 3.7
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 11 uses galoisLocalGlobalStrong_recParameter, everyCharacter_of_row.

4. Arithmetic inputs🔗

Theorem4.1
uses 0used by 1XL∃∀N

UpperTheory.LiteratureTheorems.local_langlands_gl_recT_exists_of_literature

Extracts existence of local reciprocity from the supplied literature record.

Original declaration, line 313

Theorem4.2
uses 0used by 1XL∃∀N

SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt

Derives the required covolume bound from arithmetic geometry inputs including Hilbert–Samuel, positivity, toroidal compactifications and deformation theory.

Original declaration, line 16

Theorem4.3
uses 0used by 1XL∃∀N

UpperTheory.Gal.Int.galoisRepresentations_of_thetaLift

Converts the theta lift and the geometric input into the local–global reciprocity row.

Original declaration, line 6

Theorem4.4
uses 0used by 1XL∃∀N

UpperTheory.TP.K.tLiftK

Supplies the theta lift fed into the Galois representation construction.

Original declaration, line 4

Theorem4.5
uses 0used by 1XL∃∀N

UpperTheory.Gal.Int.galoisLocalGlobalStrong_recParameter

The local–global Galois row for the reciprocity parameter comes from the theta-lift construction.

Original declaration, line 6

Proof for Theorem 4.5
Proof uses 2
Proof dependency previews
Preview
Theorem 4.3
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 6 uses tLiftK, galoisRepresentations_of_thetaLift.

Theorem4.6
uses 0used by 1XL∃∀N

UpperTheory.Zero.LLC.recTExists

Constructs the local reciprocity datum and proves its required compatibility properties.

Original declaration, line 20

Theorem4.7
uses 0used by 1XL∃∀N

UpperTheory.One.vwin_of_row

Turns the local–global row and base-change input into the automorphic window.

Original declaration, line 4

Theorem4.8
uses 0used by 1XL∃∀N

UpperTheory.LiteratureTheorems.published_results_eigen

Assembles the unitary-group third-place hypotheses from the literature package.

Original declaration, line 666

Theorem4.9
uses 0used by 1XL∃∀N

UpperTheory.LiteratureTheorems.published_results_first

Builds the local theta input record used in the matching argument.

Original declaration, line 727

Theorem4.10
uses 0used by 1XL∃∀N

UpperTheory.LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature

Produces both agreement of theta integrals and local matching.

Original declaration, line 565

Theorem4.11
uses 0used by 1XL∃∀N

UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound

Uses the theta, covolume and reciprocity data to construct the definite-side hypotheses.

Original declaration, line 44

5. Analytic reductions🔗

Theorem5.1
uses 0used by 1XL∃∀N

Claim.factor_ne_zero

A removed prime Euler factor cannot vanish when the real part is positive.

Original declaration, line 7

Theorem5.2
uses 0used by 1XL∃∀N

Claim.prim_zero

A zero in the open strip descends to the primitive character after removing the nonvanishing Euler factors.

Original declaration, line 23

Proof for Theorem 5.2

Line 33 uses factor_ne_zero.

Theorem5.3
uses 0used by 1XL∃∀N

Claim.gamma_ne_zero

The character gamma factor is nonzero in the open right half-plane.

Original declaration, line 35

Theorem5.4
uses 0used by 1XL∃∀N

Claim.prim_reflect

Reflects a primitive zero to the inverse character at one minus the original point by the completed functional equation.

Original declaration, line 42

Proof for Theorem 5.4

Line 51 uses gamma_ne_zero.

Theorem5.5
uses 0
Used by 2
Reverse dependency previews
Preview
Theorem 2.3
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
XL∃∀N

Claim.strip

For a zero left of the critical line, descend to the primitive character and reflect it into the zero-free half-plane. Right-side zeros are excluded directly.

Original declaration, line 59

Proof for Theorem 5.5
Proof uses 2
Proof dependency previews
Preview
Theorem 5.2
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Line 67 uses prim_zero. Line 68 uses prim_reflect.

Theorem5.6
uses 0used by 1XL∃∀N

Claim.zeta

Uses the level-one instance of the strip result and the zeta functional equation outside the strip. This is a component of the conjunction used by an export.

Original declaration, line 75

Proof for Theorem 5.6

Line 82 uses strip.

Theorem5.7
uses 0used by 1XL∃∀N

Formalism.VW.gammaFactor_ne_zero

Proves gamma-factor nonvanishing in the separate primitive-character reduction.

Original declaration, line 6

Theorem5.8
uses 0used by 1XL∃∀N

Formalism.VW.critLine

Reflects a primitive Dirichlet zero and applies the half-plane hypothesis. This is the reduction used by the original primitive export.

Original declaration, line 11

Proof for Theorem 5.8

Line 21 uses gammaFactor_ne_zero.

Theorem5.9
uses 0used by 1XL∃∀N

Formalism.VW.rh_of_right

Reflects a nontrivial zeta zero to show that right-half-plane nonvanishing forces real part one half.

Original declaration, line 5

Theorem5.10
uses 0used by 1XL∃∀N

Formalism.VW.rh_of_every

Specializes all-character nonvanishing to the trivial character at level one, identifies its L-function with zeta, and applies reflection.

Original declaration, line 29

Proof for Theorem 5.10

Line 30 uses rh_of_right.