Brent-Cohen-te Riele valuation bound for a prime-power sigma divisor
ProvedOddPerfectNumber.brent_cohen_te_riele_sigma_exp_boundnumber-theorypadic-valuationsperfect-numberssigma-factor-chain
For distinct odd primes p and q, if q^r exactly divides p+1 with r positive and p divides the local geometric sum sigma(q^A)=1+q+...+q^A, then A is at least 3r. This is the exact valuation/order bound attributed to Brent, Cohen and te Riele, Improved Techniques for Lower Bounds for Odd Perfect Numbers, Lemma 1. It is published here as an Open research child only; no proof is asserted by this submission.
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber
theorem brent_cohen_te_riele_sigma_exp_bound (p q A r : Nat)
(hp : p.Prime) (hq : q.Prime) (hp2 : p ≠ 2) (hq2 : q ≠ 2)
(hpq : p ≠ q) (hr : 1 ≤ r)
(hqr : q ^ r ∣ p + 1)
(hqr_exact : ¬ q ^ (r + 1) ∣ p + 1)
(hsigma : p ∣ ∑ i ∈ Finset.range (A + 1), q ^ i) :
3 * r ≤ A := by
sorry
end OddPerfectNumberSource
R. P. Brent, G. L. Cohen and H. J. J. te Riele, Improved Techniques for Lower Bounds for Odd Perfect Numbers, CWI manuscript (1991), Lemma 1. The statement uses exact divisibility q^r || p+1 and p | sigma(q^A), and records the sharp bound A >= 3r. The exact source must be checked before relying on any stronger or differently oriented formulation.