pith. sign in
module module high

IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions

show as:
view Lean formalization →

Module defining the Möbius function as an arithmetic map from naturals to integers, plus related functions such as bigOmega. Number theorists in the monolith cite it when needing multiplicative arithmetic functions inside the primes namespace. The module assembles these definitions via direct imports from the Basic and Squarefree modules.

claimThe Möbius function $μ:ℕ→ℤ$, together with the total prime-factor counting function $Ω(n)$.

background

The upstream Basic module supplies axiom-free prime footholds that reuse Mathlib’s Nat.Prime while remaining sorry-free. The Squarefree module connects the standard squarefree predicate on naturals to the repo-local valuation vp p n (exponent of p in n.factorization). This ArithmeticFunctions module sits in the algebraic layer of the primes namespace and introduces the Möbius function as ℕ → ℤ.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

Feeds the parent Primes module, which acts as the namespace aggregator and states: 'Prefer importing this module (rather than individual files) from downstream code.' It supplies the Möbius function required for any later analytic number theory built on the algebraic layer.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (2)

Lean names referenced from this declaration's body.

declarations in this module (831)

… and 751 more