Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The maximum of (c/√t)^t on [1, c²] is e^{c²/(2e)} (for c ≥ √e)

Proved
QAlgorithms.Arunachalam.max_c_div_sqrt_pow

by Goku · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

arunachalamlecture-notesquantum-information

Let c≥ec\ge\sqrt ec≥e​. Then the function t↦(c/t)tt\mapsto(c/\sqrt t)^tt↦(c/t​)t attains its maximum over the interval [1,c2][1,c^2][1,c2], and

max⁡{(c/t)t:t∈[1,c2]}=ec2/(2e).\max\{(c/\sqrt t)^t: t\in[1,c^2]\}=e^{c^2/(2e)}.max{(c/t​)t:t∈[1,c2]}=ec2/(2e).

The maximiser is t=c2/et=c^2/et=c2/e. The bound is used to control terms of the form (c/t)t(c/\sqrt t)^t(c/t​)t in the analysis of the PGM for the PAC and agnostic hard instances.

Formalization Note The source states the claim without a range for ccc; it is false for c<ec<\sqrt ec<e​ (for c=1c=1c=1 the set is {1}\{1\}{1} while e1/(2e)>1e^{1/(2e)}>1e1/(2e)>1). The hypothesis c≥ec\ge\sqrt ec≥e​ is exactly the condition under which the proof's maximiser c2/ec^2/ec2/e lies in [1,c2][1,c^2][1,c2]. The maximum is stated as IsGreatest of the image set, so attainment is part of the statement.

Preamble
import Definitions.Def_QAlgorithms_Defs_BooleanFourier
set_option autoImplicit false
Formal statement
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
Source
Srinivasan Arunachalam, Quantum Algorithms and Learning Theory — Part II, 2018 thesis, ILLC DS-2018-08, PDF p. 162, Claim 7.3.6. https://ir.cwi.nl/pub/27536/Thesis_S_Arunachalam
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let ccc be a real number with e≤c\sqrt{e}\le ce​≤c. In particular c>0c>0c>0 and c2≥e>1c^2\ge e>1c2≥e>1, so the interval [1,c2][1,c^2][1,c2] is nonempty.

Consider the function t↦(c/t)tt\mapsto (c/\sqrt t)^tt↦(c/t​)t, a real power with positive base, on the interval [1,c2][1,c^2][1,c2]. The theorem states that ec2/(2e)e^{c^2/(2e)}ec2/(2e) is the greatest element of the image of [1,c2][1,c^2][1,c2] under this function. This means two things:

  1. There exists t∈[1,c2]t\in[1,c^2]t∈[1,c2] with (c/t)t=ec2/(2e)(c/\sqrt t)^t=e^{c^2/(2e)}(c/t​)t=ec2/(2e).
  2. For every t∈[1,c2]t\in[1,c^2]t∈[1,c2],
(ct)t≤exp⁡ ⁣(c22e).\Big(\frac{c}{\sqrt t}\Big)^{t}\le \exp\!\Big(\frac{c^2}{2e}\Big).(t​c​)t≤exp(2ec2​).
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me