Sharp lower abundance ratio for 11 from exponent two (v2)
ProvedOddPerfectNumber.geom_ratio_lower_eleven_ge_two_sharp_v2abundancedivisor-sumsfinite-certificateodd-perfectq2-fiveq3-elevenv2
For exponent n at least two, the 11-component local sigma sum satisfies the exact integer lower abundance bound 133/121.
Preamble
import Mathlib
Formal statement
namespace OddPerfectNumber
theorem geom_ratio_lower_eleven_ge_two_sharp_v2 (n : Nat) (hn : 2 ≤ n) :
133 * 11 ^ n ≤ 121 * (∑ i ∈ Finset.range (n + 1), 11 ^ i) := by
sorry
end OddPerfectNumber
Source
Changed strong-induction proof after the prior Nat.le_induction arity failure.