Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 1 — (log m)^t ≤ m · t!

Proved
CapacitatedKMedianFPT.Main.fact_1

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

approximation-algorithmscapacitated-k-medianp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1parameterized-complexity

For every integer t≥0t\ge0t≥0 and every m≥1m\ge1m≥1,

(log⁡m)t≤m⋅t!,(\log m)^t\le m\cdot t!,(logm)t≤m⋅t!,

where log⁡\loglog is the natural logarithm.

This bound turns enumeration counts such as (log⁡n/ε)t(\log n/\varepsilon)^{t}(logn/ε)t with ttt depending on kkk only into FPT bounds n⋅g(k,ε)n\cdot g(k,\varepsilon)n⋅g(k,ε).

Differences from the source:

  • generalization: m ≥ 1 (applied to integers) → every real m ≥ 1; reason: the statement does not restrict m to integers; integers m ≥ 1 are a special case
  • reading: log → natural logarithm Real.log; reason: the proof expands m = e^{log m}
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace CapacitatedKMedianFPT.Main

/-- **Fact 1** (p. 6, proof p. 22–23). `(log m)^t ≤ m · t!` for all integers `t ≥ 0` and all real
`m ≥ 1` (natural logarithm). -/
theorem fact_1 (t : ℕ) (m : ℝ) (hm : 1 ≤ m) :
    Real.log m ^ t ≤ m * (t.factorial : ℝ) := by sorry

end CapacitatedKMedianFPT.Main
Source
Aditya Anand, Yichen Huang, Ragesh Jaiswal, Amit Kumar, Euiwoong Lee, Jatin Yadav, A Tight FPT Approximation for Capacitated k-Median, STOC 2027 submission #1646 (October 2026), p. 6, Fact 1; proof p. 22–23
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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