At most one odd prime factor means the shape
ProvedOddPerfectNumber.exists_two_pow_mul_prime_pow_of_card_odd_primeFactors_le_oneIf a non-zero natural number has at most one odd prime factor, then
for some prime and some .
Why it is true. Removing from leaves the odd prime factors. Two cases:
- The set is empty. Then has no odd prime factor, so — including with . Take any prime for and ; the statement is satisfied with arbitrary, so it is convenient to pick .
- The set is a singleton . Then the prime factors of are contained in , so the factorisation collapses to .
The hypothesis is needed: in Mathlib , so the cardinality condition holds vacuously at , but is not of the form .
What it is for. In the Dris analysis of odd perfect numbers , the factorisation of is governed by the divisors of : each contributes a cyclotomic factor . The branch where has at most one odd prime factor is handled by OddPerfectNumber.no_dris_one_odd_prime_shaped_core, which assumes the shape outright. This statement is exactly what converts the cardinality hypothesis of no_dris_one_odd_prime_core into that shape, and it is pure elementary number theory — no perfect numbers, no , nothing about or .
Separating it out keeps the counting fact about away from the arithmetic of the Dris equations, where it would otherwise have to be re-derived.
import Mathlib
namespace OddPerfectNumber
theorem exists_two_pow_mul_prime_pow_of_card_odd_primeFactors_le_one
(n : Nat) (hn : n ≠ 0)
(h : (n.primeFactors.erase 2).card ≤ 1) :
∃ a q b : Nat, q.Prime ∧ n = 2 ^ a * q ^ b := by sorry
end OddPerfectNumber