IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions
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
- Does not contain theorems or proofs.
- Does not introduce axioms or sorrys.
- Does not reference Recognition Science forcing chain or constants.
- Limits scope to standard arithmetic functions on naturals.
used by (1)
depends on (2)
declarations in this module (831)
-
abbrev
mobius -
theorem
mobius_def -
theorem
mobius_prime -
theorem
mobius_prime_sq -
theorem
mobius_eq_zero_of_not_squarefree -
theorem
mobius_ne_zero_iff_squarefree -
theorem
mobius_eq_zero_iff_not_squarefree -
theorem
mobius_apply_of_squarefree -
theorem
mobius_ne_zero_iff_vp_le_one -
abbrev
bigOmega -
theorem
bigOmega_def -
theorem
bigOmega_apply -
abbrev
omega -
theorem
omega_def -
theorem
omega_apply -
theorem
bigOmega_eq_omega_of_squarefree -
def
totient -
theorem
totient_apply -
theorem
totient_one -
theorem
totient_prime -
theorem
totient_prime_pow -
theorem
totient_mul_of_coprime -
theorem
totient_divisor_sum -
theorem
totient_le -
theorem
totient_pos_iff -
abbrev
vonMangoldt -
theorem
vonMangoldt_def -
theorem
vonMangoldt_prime -
theorem
vonMangoldt_eq_zero_of_not_prime_pow -
theorem
vonMangoldt_prime_pow -
theorem
mobius_isMultiplicative -
abbrev
sigma -
theorem
sigma_def -
theorem
sigma_apply -
theorem
sigma_zero_apply -
theorem
sigma_one_apply -
theorem
sigma_isMultiplicative -
theorem
sigma_zero_prime -
theorem
sigma_one_prime -
theorem
sigma_prime -
abbrev
zeta -
theorem
zeta_def -
theorem
zeta_apply -
theorem
zeta_zero -
theorem
zeta_isMultiplicative -
theorem
moebius_mul_zeta -
theorem
zeta_mul_moebius -
abbrev
dirichletOne -
theorem
dirichletOne_def -
theorem
dirichletOne_one -
theorem
dirichletOne_ne_one -
theorem
omega_mul_of_coprime -
theorem
bigOmega_mul -
theorem
bigOmega_pow -
def
liouville -
theorem
liouville_zero -
theorem
liouville_eq -
theorem
liouville_one -
theorem
liouville_prime -
theorem
liouville_prime_pow -
theorem
liouville_mul -
abbrev
arithId -
theorem
arithId_def -
theorem
arithId_apply -
theorem
arithId_isMultiplicative -
def
primeCounting -
theorem
primeCounting_def -
theorem
primeCounting_zero -
theorem
primeCounting_one -
theorem
primeCounting_two -
theorem
primeCounting_three -
theorem
primeCounting_five -
theorem
primeCounting_ten -
theorem
primeCounting_seven -
theorem
primeCounting_eleven -
theorem
primeCounting_thirteen -
theorem
primeCounting_seventeen -
theorem
primeCounting_twenty -
theorem
primeCounting_hundred -
theorem
primeCounting_mono