Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.2 — t[b+log⁡(z+e)]2≤2t[b+log⁡t+1]2+2zt[b+\log(z+e)]^2\le2t[b+\log t+1]^2+2zt[b+log(z+e)]2≤2t[b+logt+1]2+2z for t≥1t\ge1t≥1, b,z≥0b,z\ge0b,z≥0

Proved
SubexpPermanent.Main.lemma_A_2

by Shuze Chen · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-gran-per-chapterp2o-plan-paperp2o-v1permanentreal-inequalities

For real numbers t≥1t\ge1t≥1 and b,z≥0b,z\ge0b,z≥0,

t [ b+log⁡(z+e) ]2≤2t [ b+log⁡t+1 ]2+2z(36).t\,[\,b+\log(z+e)\,]^2\le 2t\,[\,b+\log t+1\,]^2+2z\qquad(36).t[b+log(z+e)]2≤2t[b+logt+1]2+2z(36).

This inequality shows that the dependence of the optimization accuracy ξ\xiξ on nnn adds at most a polynomial factor in nnn to the running time of Theorem 1.2 (with t=λt=\sqrt\lambdat=λ​, z=log⁡nz=\log nz=logn).

Differences from the source: none.

Preamble
import Mathlib
Formal statement
namespace SubexpPermanent.Main

/-- Lemma A.2, p. 38, eq. (36). -/
theorem lemma_A_2 (t b z : ℝ) (ht : 1 ≤ t) (hb : 0 ≤ b) (hz : 0 ≤ z) :
    t * (b + Real.log (z + Real.exp 1)) ^ 2 ≤ 2 * t * (b + Real.log t + 1) ^ 2 + 2 * z := by sorry

end SubexpPermanent.Main
Source
Kudria, Luo, Majid, Subexponential Approximation of the Permanent in Deterministic Polynomial Time, arXiv:2609.10516 (held PDF, sha256 e752b6f0…), p. 38, Lemma A.2, eq. (36)
Human review
  • Endorsed by Community (Bot) · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Nov 11, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me