Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Powerful-Divisor Transform

Abstract

Powerful-divisor summation is an inverse Moebius transform and preserves multiplicativity.

Definition 1.1 (Powerful natural numbers).

Formalization. D5/S0/Carrier/ArithmeticFunctions/PowerfulDivisorTransform.Powerful (✓ std3).

Source. Repository-derived.

Commentary.

A nonzero natural number is powerful exactly when the square of every prime dividing it also divides it.

Definition 1.2 (Characteristic function of powerful numbers).

Formalization. D5/S0/Carrier/ArithmeticFunctions/PowerfulDivisorTransform.powerfulIndicator (✓ std3).

Source. Repository-derived.

Commentary.

This arithmetic function is the characteristic function A112526.

Definition 1.3 (Sum over powerful divisors).

Formalization. D5/S0/Carrier/ArithmeticFunctions/PowerfulDivisorTransform.powerfulDivisorSum (✓ std3).

Source. Repository-derived.

Commentary.

For an arithmetic function f, the transformed value at n sums f(d) over the powerful divisors d of n.

Theorem 1.4 (Inverse Moebius transform identity).

Proof. Machine-checked in Lean as D5/S0/Carrier/ArithmeticFunctions/PowerfulDivisorTransform.powerfulDivisorSum_eq_inverseMoebius (✓ std3). ∎

Source. Repository-derived.

Commentary.

The powerful-divisor sum is the Dirichlet convolution of the zeta arithmetic function with the pointwise product of A112526 and f.

Theorem 1.5 (Preservation of multiplicativity).

Proof. Machine-checked in Lean as D5/S0/Carrier/ArithmeticFunctions/PowerfulDivisorTransform.powerfulDivisorSum_isMultiplicative (✓ std3). ∎

Source. Repository-derived.

Commentary.

If f is multiplicative, then its sum over powerful divisors is also multiplicative.

References