In the k=5 two-prime case both cyclotomic kernel primes divide m
ProvedOddPerfectNumber.Kernel.five_two_prime_cyclotomic_primes_dvd_mfactorizationnumber-theoryperfect-numbers
Let be an odd prime, let be primes, and suppose the first Dris relation holds with square-free kernel . Assume in addition that is a perfect square. Then both and divide .
The accepted child five_two_prime_cyclotomic_split (81a70179) shows that the cyclotomic block is or , and the same parity argument applied to gives for the remaining kernel prime . Substituting into the square relation gives , hence , so and .
This is the first structural bridge from the parity split into the second Dris equation: it shows that each kernel prime must be supplied to by a different prime factor of , since .
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber.Kernel
theorem five_two_prime_cyclotomic_primes_dvd_m (p m d1 q r : Nat) (hp : p.Prime) (hp2 : p != 2)
(hp4 : p % 4 = 1) (hm : Odd m) (hpm : ¬ p ∣ m) (hq : q.Prime) (hr : r.Prime) (hqr : q < r)
(h1 : 2 * m ^ 2 = (2 * (p ^ 2 + p + 1) * ((p + 1) / 2 * (p ^ 2 - p + 1))) * (d1 ^ 2 * (q * r)))
(hsq : exists y : Nat, y ^ 2 = q * r * (p ^ 2 + p + 1) * ((p + 1) / 2 * (p ^ 2 - p + 1))) :
q ∣ m ∧ r ∣ m := by
sorry
end OddPerfectNumber.KernelSource
Mathlib/Data/Nat/Factorization/Defs.lean (Nat.eq_of_factorization_eq', Nat.factorization_eq_zero_of_not_dvd) together with the accepted children OddPerfectNumber.Kernel.five_two_prime_cyclotomic_split (81a70179-c0e7-41e8-97bd-86af2cb90f91), OddPerfectNumber.Kernel.two_prime_block_is_prime_mul_sq (672c3afb) and OddPerfectNumber.Kernel.isSq_of_sq_mul_eq_sq (74779081). Pure exponent-parity bookkeeping; it encodes no unproved conjecture.