Pell certificate existence, records 1–64
ProvedD1Bound5.Prove2MeTransfer.pellCertificateMembership00_20261024diophantine-tuplesnumber-theory
Every integer parameter in the displayed list has a complete finite Pell certificate at cutoff 10^275. The proof extracts it from the corresponding already verified block of the original 1,016 certificate records.
Preamble
import Mathlib.Tactic import Definitions.Def_D1Bound5_PellFiniteCertificate_Definitions
Formal statement
section namespace D1Bound5 set_option maxRecDepth 32768 set_option maxHeartbeats 12000000 theorem _root_.D1Bound5.Prove2MeTransfer.pellCertificateMembership00_20261024 (d : ℤ) (hd : d ∈ ([7,15,23,31,39,47,55,71,79,87,95,103,111,119,127,143,151,159,167,183,191,199,215,223,231,239,247,255,263,271,287,295,303,311,319,327,335,359,367,383,391,399,407,415,431,439,447,455,463,471,479,487,503,511,519,527,535,543,551,559,583,591,599,607] : List ℤ)) : Nonempty (PellFiniteCertificate d (10^275)) := by sorry end D1Bound5 end
Source
D1Bound5/PellFiniteFields.lean, lines 91-110, SHA-256 352c30df17c6d6e5a3b765a23814fee880412e130767d7c10f6bf24c2c1ef96d. Project: https://github.com/tomislav-math/d1-bound5-lean