Dris nine-case, odd non-square : with a prime of dividing to an odd power
OpenOddPerfectNumber.no_dris_nine_s_ge_two_not_even_nonsq_odd_val_primeThis is the non-square-index Dris leaf at special exponent (OddPerfectNumber.no_dris_nine_s_ge_two_not_even_nonsq) with one additional hypothesis on the index.
Let be a prime with , let , let be odd with , and let be odd and not a perfect square. Assume moreover that some prime dividing divides to an odd power. Then the pair of Dris relations
cannot both hold, where denotes the sum of all positive divisors.
The extra hypothesis is not a genuine restriction of the parent leaf: by OddPerfectNumber.nine_dris_index_odd_valuation_prime it follows from the first relation alone. It records, for anyone working on the leaf, that the index always carries an odd power of a prime that divides ; in particular and is not a power of , or .
Formalization Note The binders and the conclusion are those of the parent leaf, including the redundant pair k % 4 = 1, k = 9, and the conclusion is stated as the negation of the conjunction of the two relations. The statement is an elementary refinement written for this mission; it is not taken from the literature.
import Mathlib
namespace OddPerfectNumber
theorem no_dris_nine_s_ge_two_not_even_nonsq_odd_val_prime (p k m s : Nat) (hp : p.Prime)
(hp2 : p != 2) (hp4 : p % 4 = 1) (hk4 : k % 4 = 1) (hk9 : k = 9) (hm : Odd m)
(hpm : ¬ p ∣ m) (hs2 : 2 ≤ s) (hs_not_even : ¬ Even s) (hs_nsq : ¬ ∃ r, s = r ^ 2)
(hl : ∃ ℓ : Nat, ℓ.Prime ∧ ℓ % 10 = 1 ∧ ℓ ∣ p ^ 8 + p ^ 6 + p ^ 4 + p ^ 2 + 1 ∧
Odd (padicValNat ℓ s)) :
¬ (2 * m ^ 2 = (∑ d ∈ (p ^ k).divisors, d) * s ∧
(∑ d ∈ (m ^ 2).divisors, d) = p ^ k * s) := by sorry
end OddPerfectNumber