Majorization inequality for (Nielsen, Lemma 1.2)
ProvedOddPerfectNumber.prod_one_sub_inv_le_of_prod_leA majorization inequality for products of the form .
Let and let and be real numbers, all greater than . Assume that the sequence is non-decreasing, and that every partial product of the 's is dominated by the corresponding partial product of the 's:
Then
In words: among sequences whose partial products are bounded below by a fixed non-decreasing sequence, the fixed sequence itself minimises . This is the analytic heart of the Heath-Brown-Cook-Nielsen upper bounds for odd perfect numbers: it is what allows one to replace an unknown tuple of prime powers by an explicit extremal tuple.
Formalization Note. Sequences are functions ℕ → ℝ and only their values on Finset.range n matter; the hypotheses are stated for indices below n. Nielsen's Lemma 1.2 assumes both sequences are non-decreasing and adds an equality characterisation; the monotonicity of is not needed for the inequality itself, so it is omitted here.
import Mathlib open Finset
namespace OddPerfectNumber
theorem prod_one_sub_inv_le_of_prod_le (n : ℕ) (x y : ℕ → ℝ)
(hx : ∀ i < n, 1 < x i) (hy : ∀ i < n, 1 < y i)
(hymono : ∀ i, i + 1 < n → y i ≤ y (i + 1))
(hle : ∀ m ≤ n, ∏ i ∈ Finset.range m, x i ≤ ∏ i ∈ Finset.range m, y i) :
∏ i ∈ Finset.range n, (1 - 1 / x i) ≤ ∏ i ∈ Finset.range n, (1 - 1 / y i) := by
sorry
end OddPerfectNumber