Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Dris configuration: ω(m)≤ω(s)+Ω(s)+#{q∣k+1}\omega(m)\le\omega(s)+\Omega(s)+\#\{q\mid k+1\}ω(m)≤ω(s)+Ω(s)+#{q∣k+1}

Proved
OddPerfectNumber.dris_index_lte_support_bound

by Gabewhigham · Sep 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Let ppp be prime, mmm odd with p∤mp \nmid mp∤m, and suppose the Dris relations

2m2=σ(pk) s,σ(m2)=pk s2m^{2} = \sigma(p^{k})\,s, \qquad \sigma(m^{2}) = p^{k}\,s2m2=σ(pk)s,σ(m2)=pks

hold, with Dris index sss. Then the prime support of mmm obeys

ω(m) ≤ ω(s)+Ω(s)+#{ q odd prime:q∣k+1 },\omega(m) \ \le\ \omega(s) + \Omega(s) + \#\{\,q \text{ odd prime} : q \mid k+1\,\},ω(m) ≤ ω(s)+Ω(s)+#{q odd prime:q∣k+1},

where ω\omegaω counts distinct prime factors and Ω\OmegaΩ counts them with multiplicity.

The three terms correspond to a trichotomy for a prime q∣mq \mid mq∣m. If q∣sq \mid sq∣s, it is counted by ω(s)\omega(s)ω(s). If q∤sq \nmid sq∤s, then q2∣σ(pk)q^{2} \mid \sigma(p^{k})q2∣σ(pk), because q2∣m2q^{2} \mid m^{2}q2∣m2 and sss is prime to qqq; moreover the local divisor sum σ(q2vq(m))\sigma(q^{2v_q(m)})σ(q2vq​(m)) divides σ(m2)=pks\sigma(m^{2}) = p^{k}sσ(m2)=pks. If that local sum is prime to sss it is a power of ppp, and lifting the exponent forces q∣k+1q \mid k+1q∣k+1 — the third term. Otherwise it contributes a prime factor of sss, and these contributions, taken one per prime, multiply to a divisor of sss, so they number at most Ω(s)\Omega(s)Ω(s).

Combined with Sylvester's bound ω(N)≥5\omega(N) \ge 5ω(N)≥5, which gives ω(m)≥4\omega(m) \ge 4ω(m)≥4, the inequality is the general form of the known impossibility of a Dris index equal to 111 or to an odd prime when k+1k+1k+1 has at most one odd prime factor: those cases have ω(s)+Ω(s)≤2\omega(s)+\Omega(s) \le 2ω(s)+Ω(s)≤2. It is stated with no congruence hypotheses on ppp, kkk or sss.

Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber

theorem dris_index_lte_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 ≤
      s.primeFactors.card + s.primeFactorsList.length + ((k + 1).primeFactors.erase 2).card := by
  sorry

end OddPerfectNumber
Source
J. A. B. Dris, The abundancy index of divisors of odd perfect numbers, Journal of Integer Seq. 15 (2012), Article 12.4.4, Section 2 (Dris parametrisation); the lifting-the-exponent step is the one used in G. G. Dandapat, J. L. Hunsucker, C. Pomerance, Some new results on odd perfect numbers, Pacific J. Math. 57 (1975), 359-364, Theorem 1.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me