Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Landau maximiser as a product of prime powers

Proved
LandauExplore.landau_primePow_decomp

by pitimespi · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

group-theorynumber-theory

For every natural number nnn, Landau's function g(n)g(n)g(n) — the largest order of a permutation of an nnn-element set — is a product of prime powers whose sum is at most nnn. More precisely, there is a finite set ttt of prime powers (each of the form pkp^kpk with ppp prime and k≥1k \geq 1k≥1) such that ∑q∈tq≤n\sum_{q \in t} q \leq n∑q∈t​q≤n and ∏q∈tq=g(n)\prod_{q \in t} q = g(n)∏q∈t​q=g(n).

This is the sup/max bookkeeping half of the identification of Landau's function with a knapsack optimum over prime-power families: the maximum order is attained, and the attaining permutation's order decomposes into prime powers. The converse direction — that every prime-power family with sum at most nnn has product at most g(n)g(n)g(n) — is a separate statement.

Preamble
import Mathlib.Data.Nat.Factorization.Basic
import Mathlib.NumberTheory.Chebyshev
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Algebra.GCDMonoid.FinsetLemmas
import Mathlib.RingTheory.Coprime.Lemmas
import Mathlib.GroupTheory.Perm.Cycle.Type
import Mathlib.GroupTheory.Perm.Cycle.PossibleTypes
import Definitions.Def_LandauExplore_landauLocal

open Finset
Formal statement
namespace LandauExplore
theorem landau_primePow_decomp (n : ℕ) :
    ∃ t : Finset ℕ, (∀ q ∈ t, ∃ p k : ℕ, p.Prime ∧ 1 ≤ k ∧ q = p ^ k)
      ∧ ∑ q ∈ t, q ≤ n ∧ ∏ q ∈ t, q = landauLocal n := by sorry
end LandauExplore
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by pitimespi · Nov 3, 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