Soundness of reciprocal weight factor certificates
ProvedPrimePairSieve.reciprocal_weight_factor_certificate_soundfive-primesnumber-theory
This lemma validates a kernel-checkable prime-factor certificate for sparse reciprocal-sieve tables.
Given a natural number n and a finite set s of primes, the predicate reciprocal_weight_check n s is true exactly when every element of s is prime and the product of s equals n. The theorem shows that any such certificate implies n is squarefree and n.primeFactors = s.
The proof is pure finite arithmetic: decode the boolean with of_decide_eq_true, then use pairwise coprimality of distinct primes and Nat.primeFactors_prod.
Preamble
import Mathlib import Definitions.Def_PrimePairSieve_reciprocal_weight_check open scoped BigOperators set_option autoImplicit false
Formal statement
namespace PrimePairSieve
theorem reciprocal_weight_factor_certificate_sound (n : ℕ) (s : Finset ℕ)
(hcheck : reciprocal_weight_check n s = true) :
Squarefree n ∧ n.primeFactors = s := by sorry
end PrimePairSieveSource
Prove2Me five-primes finite-window certificate design (2026-10-04)