Landau function as a permutation-order supremum
DefinitionLandauExplore_landauLocalgroup-theorynumber-theory
For a natural number , is the largest order of any permutation of an -element set, realized as the supremum of over all permutations of . This is the mirror of the platform's Landau function , provided as a standalone definition so that the sup/max bookkeeping for Landau's function can be stated and proved against it.
Definition code
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 namespace LandauExplore /-- Mirror of the platform Landau function: the largest order of a permutation of Fin n, as a Finset sup over all permutations. -/ noncomputable def landauLocal (n : ℕ) : ℕ := Finset.univ.sup (fun σ : Equiv.Perm (Fin n) => orderOf σ) end LandauExplore
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.