The maximum of (c/√t)^t on [1, c²] is e^{c²/(2e)} (for c ≥ √e)
ProvedQAlgorithms.Arunachalam.max_c_div_sqrt_powLet . Then the function attains its maximum over the interval , and
The maximiser is . The bound is used to control terms of the form in the analysis of the PGM for the PAC and agnostic hard instances.
Formalization Note The source states the claim without a range for ; it is false for (for the set is while ). The hypothesis is exactly the condition under which the proof's maximiser lies in . The maximum is stated as IsGreatest of the image set, so attainment is part of the statement.
import Definitions.Def_QAlgorithms_Defs_BooleanFourier set_option autoImplicit false
namespace QAlgorithms.Arunachalam
/-- Arunachalam p.162, Claim 7.3.6: `max {(c/√t)^t : t ∈ [1, c²]} = e^{c²/(2e)}`.
Corrected statement (trap 30): the source states it for unspecified `c`; it is false for
`c < √e` (at `c = 1` the set is `{1}`, while `e^{1/(2e)} > 1`; for `|c| < 1` the interval is
empty). The source's proof places the maximiser at `t = c²/e`, which lies in `[1, c²]` exactly
when `c² ≥ e`; we therefore assume `√e ≤ c`. -/
theorem max_c_div_sqrt_pow {c : ℝ} (hc : Real.sqrt (Real.exp 1) ≤ c) :
IsGreatest ((fun t : ℝ => (c / Real.sqrt t) ^ t) '' Set.Icc 1 (c ^ 2))
(Real.exp (c ^ 2 / (2 * Real.exp 1))) := by
sorry
end QAlgorithms.Arunachalam
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a real number with . In particular and , so the interval is nonempty.
Consider the function , a real power with positive base, on the interval . The theorem states that is the greatest element of the image of under this function. This means two things:
- There exists with .
- For every ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.