pith. machine review for the scientific record. sign in
module module high

IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions

show as:
view Lean formalization →

This module defines the Möbius function as an arithmetic function from natural numbers to integers, along with the bigOmega function. It supplies core algebraic definitions for prime-number work inside the Recognition framework. Number theorists citing arithmetic functions for inversion or factorization counts would reference it. The module consists entirely of definitions with no theorems or proofs.

claimThe Möbius function as an arithmetic function $μ:ℕ→ℤ$, together with the bigOmega function $Ω:ℕ→ℕ$.

background

The module lives in the NumberTheory.Primes namespace. It imports the Basic module, whose design reuses Mathlib’s Nat.Prime while remaining axiom-free and sorry-free, and the Squarefree module, which connects the squarefree predicate to the local valuation vp p n. The central object supplied is the Möbius function defined as an arithmetic function ℕ → ℤ.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

The module feeds the parent Primes aggregator, which downstream code imports in preference to individual files. It completes the algebraic layer for arithmetic functions before any analytic number theory is added.

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