Minimal polynomials of Σ_n z^(p^n) modulo prime powers: a proof of a conjecture of Kauers, Krattenthaler and Müller, and the exact number of divisor levels for the Möbius function

For a prime p let Φ_p(z) = Σ_{n≥0} z^(p^n). Kauers, Krattenthaler and Müller (p = 2) and Krattenthaler and Müller (every p) conjectured that the least t-degree of a monic A ∈ ℤ[z][t] with A(z, Φ_p(z)) ≡ 0 (mod p^γ) is the Kempner value S(p^γ), the least d with p^γ | d!. We prove this for every prime p and every γ, in a sharper form: such an A of degree d exists exactly when p^γ | d!. One coefficient of A(z, Φ_p) equals d!, and a tower of polynomials built from the δ-ring structure of z ↦ z^p attains the bound. The same tower, in the ring of arithmetic functions with the Frobenius lift E_p, (E_p g)(j^p) = g(j), determines the least number of divisor levels for the Möbius function: the least L with μ ≡ Σ_{z≤L} d_z * E_p(g_z) (mod p^k) at every n is S(p^k) - 1, and summing such an identity gives the Mertens function modulo p^k from divisor sums. The bound S(p^k) - 1 holds for the Dirichlet inverse of every f with f(1) a unit over every commutative ring. For every unit of ℤ_p[[x_1, ..., x_n]] with x_i ↦ x_i^p, and for every f with f(1) a unit in the Dirichlet ring over ℤ or ℤ_p, the exact count is a Legendre-type formula in a depth flag of f; in particular, over ℤ and ℤ_p it is S(p^k) - 1 as soon as n primes q with p ∤ f(q) satisfy p^n ≥ S(p^k). Every theorem in this paper is proved in Lean 4 with Mathlib in the form stated, and each carries the names of its Lean proofs. Version 2.0: adds Theorem 7.20 (Lean-certified cost of one call of the block routine) and Section 9 (primes a² + 27b², fully Lean-certified), cites software v1.2.0 and the Palomar entry PALOMAR-2026-11-21-000012.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24411194
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Minimal polynomials of Σ_n z^(p^n) modulo prime powers: a proof of a conjecture of Kauers, Krattenthaler and Müller, and the exact number of divisor levels for the Möbius function

Joseph S. Farland
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Minimal polynomials of Σ_n z^(p^n) modulo prime powers: a proof of a conjecture of Kauers, Krattenthaler and Müller, and the exact number of divisor levels for the Möbius function

Joseph S. Farland
preprint en

Abstract

For a prime p let Φ_p(z) = Σ_{n≥0} z^(p^n). Kauers, Krattenthaler and Müller (p = 2) and Krattenthaler and Müller (every p) conjectured that the least t-degree of a monic A ∈ ℤ[z][t] with A(z, Φ_p(z)) ≡ 0 (mod p^γ) is the Kempner value S(p^γ), the least d with p^γ | d!. We prove this for every prime p and every γ, in a sharper form: such an A of degree d exists exactly when p^γ | d!. One coefficient of A(z, Φ_p) equals d!, and a tower of polynomials built from the δ-ring structure of z ↦ z^p attains the bound. The same tower, in the ring of arithmetic functions with the Frobenius lift E_p, (E_p g)(j^p) = g(j), determines the least number of divisor levels for the Möbius function: the least L with μ ≡ Σ_{z≤L} d_z * E_p(g_z) (mod p^k) at every n is S(p^k) - 1, and summing such an identity gives the Mertens function modulo p^k from divisor sums. The bound S(p^k) - 1 holds for the Dirichlet inverse of every f with f(1) a unit over every commutative ring. For every unit of ℤ_p[[x_1, ..., x_n]] with x_i ↦ x_i^p, and for every f with f(1) a unit in the Dirichlet ring over ℤ or ℤ_p, the exact count is a Legendre-type formula in a depth flag of f; in particular, over ℤ and ℤ_p it is S(p^k) - 1 as soon as n primes q with p ∤ f(q) satisfy p^n ≥ S(p^k). Every theorem in this paper is proved in Lean 4 with Mathlib in the form stated, and each carries the names of its Lean proofs. Version 2.0: adds Theorem 7.20 (Lean-certified cost of one call of the block routine) and Section 9 (primes a² + 27b², fully Lean-certified), cites software v1.2.0 and the Palomar entry PALOMAR-2026-11-21-000012.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon