Lemma 4.2 — Φ_n(x, s) ≥ n log n, with equality iff XSe = μe
ProvedWrightPDIPM.Potential.lemma_4_2Let be positive vectors, , and let be the potential (4.2) with . Then
with equality if and only if , that is, for every .
This shows that the centrality term of the decomposition (4.4a) is bounded below, with its minimum exactly on the points where all pairwise products agree.
Formalization Note Phi (n : ℝ) x s is . For both sides are and the equality condition is empty, so the statement needs no hypothesis .
import Mathlib import Definitions.Def_WrightPDIPM_Potential_Setting open Matrix
namespace WrightPDIPM.Potential
/-- **Lemma 4.2** (Wright, p. 68). For a positive vector pair `(x, s) > 0`,
`Φ_n(x, s) ≥ n log n`, with equality if and only if `XSe = (xᵀs/n)e = μe`.
Here `Φ_n` is the potential (4.2) with `ρ = n`. -/
theorem lemma_4_2 {n : ℕ} (x s : Fin n → ℝ) (hx : ∀ i, 0 < x i) (hs : ∀ i, 0 < s i) :
(n : ℝ) * Real.log n ≤ Phi (n : ℝ) x s ∧
(Phi (n : ℝ) x s = (n : ℝ) * Real.log n ↔ ∀ i, x i * s i = mu x s) := by sorry
end WrightPDIPM.Potential
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
This statement uses two functions from the accompanying definitions file, which I was not shown:
- (the bundle's
Phi): a real-valued function of a real parameter and two vectors . - (the bundle's
mu): a real-valued function of and .
Take any natural number and vectors with and for every index . Set the parameter to , the number read as a real. Then both of the following hold:
The second claim is a genuine equivalence. Equality of the potential with holds exactly when every product equals the single number .
Degenerate cases. When , the positivity hypotheses are vacuous, and (using ). The statement then says for the empty vectors . It also says is equivalent to a vacuously true condition, so it asserts . When , , and the right-hand condition reads .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.