Exact recurrence for the partial reciprocal-prime sums below 512
ProvedTaoFivePrimes.step_T_certificateFor every , the rational table of partial reciprocal-prime sums satisfies the exact one-step recurrence
with all values understood in and for .
This recurrence is what identifies the tabulated values with the partial sums of the reciprocal primes in the finite endpoint certificate; it is a 511-case arithmetic verification.
Formalization Note. The table T : \mathbb{N} \to \mathbb{Q} is stored in TaoFivePrimes_mertens_cert_511_tables; the case distinction uses Nat.Prime and the hypothesis keeps the recursion inside the tabulated range.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_mertens_cert_511_tables
Formal statement
namespace TaoFivePrimes
theorem step_T_certificate (k : Nat) (hk : k < 511) :
T (k+1) = T k + if (k+1).Prime then (1:Rat)/((k+1 : Nat) : Rat) else 0 := by
sorry
end TaoFivePrimes