Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Table 2 data: rational measures and V lower-bound templates

Definition
Zeta5_SourceTable2Data

by tomasz · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisformalizationirrationalitynumber-theoryzeta5-mo271

The data module of Table 2: the 48 rational rewrite lemmas for the measures aρ j, bρ j, cρ j (j ≤ 16) of Table 1, and the two generic templates Vfield_ge_of_bounds_pos / Vfield_ge_of_bounds_neg turning rational enclosures of √p, log(1+p), log(p+α²), arctan(1/ξ), arctan(α/ξ) and a sign decision for π + A1 - 6 A2 into a rational lower bound for Vfield p.

Definition code
import Mathlib
import Definitions.Def_Zeta5_SourcePotentialIneq

/-!
# Table 2 data: rational measures and `V` lower-bound templates

Ported from mo271/Zeta5 @ 7fe736760f4b96bfdb4334b68e3b3124ecbe10b0, `Apery/Table2/Data.lean`.
Adaptations: imports re-pointed at the platform definition modules; definitions already
published on the platform are not redeclared; `Real.arctan_le_self` (absent from the pinned
Mathlib) is replaced by the local `arctan_le_self'` from `Apery/Potential.lean`.
-/

open Finset Filter Topology Set MeasureTheory

namespace Apery

lemma aρ_1 : aρ 1 = (1953374043 / 500000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_1 : bρ 1 = (8992695531 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_1 : cρ 1 = (525779809 / 50000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_2 : aρ 2 = (289031033 / 125000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_2 : bρ 2 = (3068199571 / 200000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_2 : cρ 2 = (29471737793 / 1000000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_3 : aρ 3 = (280457333 / 200000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_3 : bρ 3 = (6432545181 / 250000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_3 : cρ 3 = (42934365099 / 1000000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_4 : aρ 4 = (220431339 / 250000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_4 : bρ 4 = (20954789123 / 500000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_4 : cρ 4 = (29102115983 / 500000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_5 : aρ 5 = (289098953 / 500000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_5 : bρ 5 = (65851089563 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_5 : cρ 5 = (6903762131 / 100000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_6 : aρ 6 = (396324613 / 1000000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_6 : bρ 6 = (24870259471 / 250000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_6 : cρ 6 = (78873099189 / 1000000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_7 : aρ 7 = (283911191 / 1000000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_7 : bρ 7 = (72162863729 / 500000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_7 : cρ 7 = (84856120711 / 1000000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_8 : aρ 8 = (53051547 / 250000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_8 : bρ 8 = (201105762729 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_8 : cρ 8 = (88396082127 / 1000000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_9 : aρ 9 = (82548843 / 500000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_9 : bρ 9 = (269345996903 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_9 : cρ 9 = (706427057 / 8000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_10 : aρ 10 = (33336783 / 250000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_10 : bρ 10 = (86772388539 / 250000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_10 : cρ 10 = (17094464251 / 200000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_11 : aρ 11 = (55761057 / 500000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_11 : bρ 11 = (86161340883 / 200000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_11 : cρ 11 = (39449592119 / 500000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_12 : aρ 12 = (19269871 / 200000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_12 : bρ 12 = (515561896511 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_12 : cρ 12 = (35176735959 / 500000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_13 : aρ 13 = (85815639 / 1000000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_13 : bρ 13 = (297724389273 / 500000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_13 : cρ 13 = (11767795323 / 200000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_14 : aρ 14 = (78667711 / 1000000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_14 : bρ 14 = (664241383483 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_14 : cρ 14 = (22210660553 / 500000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_15 : aρ 15 = (14825913 / 200000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_15 : bρ 15 = (89520072139 / 125000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_15 : cρ 15 = (30462865791 / 1000000000000 : ℝ) := by norm_num [cρ, table1]
lemma aρ_16 : aρ 16 = (7174131 / 100000000000 : ℝ) := by norm_num [aρ, table1]
lemma bρ_16 : bρ 16 = (746637295669 / 1000000000000 : ℝ) := by norm_num [bρ, table1]
lemma cρ_16 : cρ 16 = (5959622577 / 1000000000000 : ℝ) := by norm_num [cρ, table1]

/-- Template for a certified lower bound of `V` (parenthesis nonnegative). -/
lemma Vfield_ge_of_bounds_pos {p slo shi l1 l2 A1 A2 : ℝ} (hp : 0 < p) (hslo : 0 < slo)
    (hs1 : slo ≤ Real.sqrt p) (hs2 : Real.sqrt p ≤ shi) (hl1 : l1 ≤ Real.log (1 + p))
    (hl2 : Real.log (p + (3 / 40) ^ 2) ≤ l2) (hA1 : A1 ≤ Real.arctan (1 / shi))
    (hA2 : Real.arctan ((3 / 40) / slo) ≤ A2)
    (hP : 0 ≤ 3.14159265358979323846 + A1 - 6 * A2) :
    l1 - 6 * (3 / 40) * l2 - 2 + 12 * (3 / 40) + 2 * slo * (3.14159265358979323846 + A1 - 6 * A2) ≤ Vfield p := by
  rw [Vfield_eq hp]
  have hsp : 0 < Real.sqrt p := Real.sqrt_pos.mpr hp
  have hshi : 0 < shi := hsp.trans_le hs2
  have hm1 : Real.arctan (1 / shi) ≤ Real.arctan (1 / Real.sqrt p) :=
    Real.arctan_strictMono.monotone (div_le_div_of_nonneg_left zero_le_one hsp hs2)
  have hm2 : Real.arctan ((3 / 40) / Real.sqrt p) ≤ Real.arctan ((3 / 40) / slo) :=
    Real.arctan_strictMono.monotone (div_le_div_of_nonneg_left (by norm_num) hslo hs1)
  have hpi := Real.pi_gt_d20
  have hPle : 3.14159265358979323846 + A1 - 6 * A2 ≤
      Real.pi + Real.arctan (1 / Real.sqrt p) - 6 * Real.arctan ((3 / 40) / Real.sqrt p) := by linarith
  have hprod : 2 * slo * (3.14159265358979323846 + A1 - 6 * A2) ≤
      2 * Real.sqrt p * (Real.pi + Real.arctan (1 / Real.sqrt p) - 6 * Real.arctan ((3 / 40) / Real.sqrt p)) :=
    mul_le_mul (by linarith) hPle hP (by positivity)
  have hl2' : 6 * (3 / 40) * Real.log (p + (3 / 40) ^ 2) ≤ 6 * (3 / 40) * l2 :=
    mul_le_mul_of_nonneg_left hl2 (by norm_num)
  linarith

/-- Template for a certified lower bound of `V` (parenthesis nonpositive). -/
lemma Vfield_ge_of_bounds_neg {p slo shi l1 l2 A1 A2 : ℝ} (hp : 0 < p) (hslo : 0 < slo)
    (hs1 : slo ≤ Real.sqrt p) (hs2 : Real.sqrt p ≤ shi) (hl1 : l1 ≤ Real.log (1 + p))
    (hl2 : Real.log (p + (3 / 40) ^ 2) ≤ l2) (hA1 : A1 ≤ Real.arctan (1 / shi))
    (hA2 : Real.arctan ((3 / 40) / slo) ≤ A2)
    (hP : 3.14159265358979323846 + A1 - 6 * A2 ≤ 0) :
    l1 - 6 * (3 / 40) * l2 - 2 + 12 * (3 / 40) + 2 * shi * (3.14159265358979323846 + A1 - 6 * A2) ≤ Vfield p := by
  rw [Vfield_eq hp]
  have hsp : 0 < Real.sqrt p := Real.sqrt_pos.mpr hp
  have hshi : 0 < shi := hsp.trans_le hs2
  have hm1 : Real.arctan (1 / shi) ≤ Real.arctan (1 / Real.sqrt p) :=
    Real.arctan_strictMono.monotone (div_le_div_of_nonneg_left zero_le_one hsp hs2)
  have hm2 : Real.arctan ((3 / 40) / Real.sqrt p) ≤ Real.arctan ((3 / 40) / slo) :=
    Real.arctan_strictMono.monotone (div_le_div_of_nonneg_left (by norm_num) hslo hs1)
  have hpi := Real.pi_gt_d20
  have hPle : 3.14159265358979323846 + A1 - 6 * A2 ≤
      Real.pi + Real.arctan (1 / Real.sqrt p) - 6 * Real.arctan ((3 / 40) / Real.sqrt p) := by linarith
  have hprod : 2 * shi * (3.14159265358979323846 + A1 - 6 * A2) ≤
      2 * Real.sqrt p * (Real.pi + Real.arctan (1 / Real.sqrt p) - 6 * Real.arctan ((3 / 40) / Real.sqrt p)) := by
    calc 2 * shi * (3.14159265358979323846 + A1 - 6 * A2)
        ≤ 2 * Real.sqrt p * (3.14159265358979323846 + A1 - 6 * A2) :=
          mul_le_mul_of_nonpos_right (by linarith) hP
      _ ≤ _ := mul_le_mul_of_nonneg_left hPle (by positivity)
  have hl2' : 6 * (3 / 40) * Real.log (p + (3 / 40) ^ 2) ≤ 6 * (3 / 40) * l2 :=
    mul_le_mul_of_nonneg_left hl2 (by norm_num)
  linarith

end Apery
Source
mo271/Zeta5 @ 7fe736760f4b96bfdb4334b68e3b3124ecbe10b0, `Apery/Table2/Data.lean` (verbatim, imports adapted).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me