Dris configuration:
ProvedOddPerfectNumber.dris_prime_support_boundLet be a prime, let be odd with , and suppose the two Dris relations
hold, so that is the Dris index of the configuration. (These relations say exactly that is perfect.) Then the number of distinct primes dividing is bounded by
where counts the prime factors of with multiplicity (in Lean, the length of s.primeFactorsList).
The bound is an exact count of how the local divisor sums of distribute over the two factors of . Writing , call a prime a -source if . Since and , the index is prime to , so the product of one copy of per -source divides : there are at most of them. Every prime that is not a -source has dividing , and these local sums are pairwise coprime factors of , so there are at most of them.
The bound is attained: for , has .
import Mathlib
namespace OddPerfectNumber
theorem dris_prime_support_bound (p k m s : Nat)
(hp : p.Prime) (hm : Odd m) (hpm : ¬ p ∣ m)
(h1 : 2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s)
(h2 : (∑ x ∈ (m ^ 2).divisors, x) = p ^ k * s) :
m.primeFactors.card ≤ k + s.primeFactorsList.length := by
sorry
end OddPerfectNumber