Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ideal convolution of ideal arithmetic functions

Definition
TauCeti_NumberTheory_ArithmeticDirichletSeries_Convolution

by riccardo.brasca · Sep 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorytauceti-chebotarev

For ideal arithmetic functions f,gf,gf,g on a number field KKK, define

(f∗g)(I)=∑AB=If(A)g(B).(f*g)(I)=\sum_{AB=I}f(A)g(B).(f∗g)(I)=AB=I∑​f(A)g(B).

The sum is finite over nonzero integral ideals. Its identity is the function equal to one at OK\mathcal O_KOK​ and zero elsewhere. This is ideal Dirichlet convolution.

Formalization Note. These foundational declarations are transplanted from the Tau Ceti contributors' original source (Apache-2.0, commit 948fe4751b1fe528b6d580c522ca5d743d47f185), with compatibility adaptations for Lean 4.33.1. Mathematical proofs requiring separate theorem nodes are published separately.

Definition code
/- Transplanted from https://github.com/TauCetiProject/TauCeti at 948fe4751b1fe528b6d580c522ca5d743d47f185.
Original source copyright/license notices are retained below.
Generated exclusively from compiler declaration, command, and reference facts. -/
import Definitions.Def_TauCeti_NumberTheory_ArithmeticDirichletSeries_Basic
import Mathlib.Algebra.Algebra.Subalgebra.Basic
import Mathlib.Algebra.CharZero.Infinite
import Mathlib.Algebra.Ring.Subgroup
import Mathlib.Algebra.Ring.Subring.Basic
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Complex.Order
import Mathlib.Analysis.SpecialFunctions.Pow.Complex
import Mathlib.Data.Complex.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.Units
import Mathlib.LinearAlgebra.Pi
import Mathlib.NumberTheory.ArithmeticFunction.Defs
import Mathlib.NumberTheory.NumberField.Basic
import Mathlib.RingTheory.DedekindDomain.Factorization
import Mathlib.RingTheory.DedekindDomain.Ideal.Basic
import Mathlib.RingTheory.DedekindDomain.Ideal.Lemmas
import Mathlib.RingTheory.Ideal.Maps
import Mathlib.RingTheory.Ideal.Norm.AbsNorm
import Mathlib.RingTheory.Ideal.Operations
import Mathlib.RingTheory.UniqueFactorizationDomain.Finite
import Mathlib.RingTheory.Valuation.Discrete.IsDiscreteValuationRing
import Mathlib.Tactic.Ring

section
set_option autoImplicit true
/-
Copyright (c) 2026 The Tau Ceti contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: The Tau Ceti contributors
-/
/-!
# Ideal convolution of ideal arithmetic functions

The Dirichlet convolution of two arithmetic functions on the nonzero ideals of the ring of integers
of a number field `K` sums over the factorizations `B * C = A` of a nonzero ideal `A`. This file
constructs that index set, defines the convolution, and proves that it makes
`TauCeti.IdealArithmeticFunction K` a commutative monoid with identity
`TauCeti.IdealArithmeticFunction.delta`, bilinear over the pointwise additive structure.
It also transports this operation through `TauCeti.normCoeff` to Mathlib's Dirichlet convolution
on `ArithmeticFunction ℂ`.

## Main definitions

* `TauCeti.IdealArithmeticFunction.delta` is the ideal arithmetic function that is `1` at the unit
  ideal and `0` elsewhere.
* `TauCeti.Ideal.divisorsAntidiagonal A` is the finite set of pairs `(B, C)` of nonzero ideals with
  `B * C = A`; it is the ideal analogue of Mathlib's `Nat.divisorsAntidiagonal`.
* `TauCeti.IdealArithmeticFunction.convolution f g` is the ideal Dirichlet convolution.
* `TauCeti.IdealArithmeticFunction.convolutionPow f n` is the `n`-fold convolution power of `f`.

## Main results

* `TauCeti.IdealArithmeticFunction.convolution_comm`,
  `TauCeti.IdealArithmeticFunction.convolution_assoc`,
  `TauCeti.IdealArithmeticFunction.delta_convolution` and
  `TauCeti.IdealArithmeticFunction.convolution_delta`: the convolution monoid laws.
* `TauCeti.IdealArithmeticFunction.convolution_add` and
  `TauCeti.IdealArithmeticFunction.add_convolution`: bilinearity over pointwise addition.
* `TauCeti.IdealArithmeticFunction.convolution_one_one_ne_mul`: ideal convolution is not the
  pointwise product.
* `TauCeti.normCoeff_delta`, `TauCeti.normCoeff_convolution`, and
  `TauCeti.normCoeff_convolutionPow`: regrouping by absolute norm transports the convolution
  identity, convolution, and convolution powers to Mathlib arithmetic functions.

## Implementation notes

`TauCeti.IdealArithmeticFunction K` is a `Pi` type, so it already carries Mathlib's *pointwise*
`CommRing` structure, in which `f * g` is `fun A => f A * g A` and `1` is the everywhere-one
function. Convolution is therefore deliberately **not** registered as a `Mul` instance and its
identity is the separate function `TauCeti.IdealArithmeticFunction.delta`; this is the roadmap's
convention that pointwise multiplication and ideal convolution stay distinct operations on one
carrier. The monoid laws are stated as ordinary theorems about
`TauCeti.IdealArithmeticFunction.convolution`, and
`TauCeti.IdealArithmeticFunction.convolution_one_one_ne_mul` records that the two products really do
differ. Consequently iterated convolution is the explicit
`TauCeti.IdealArithmeticFunction.convolutionPow` rather than a `Monoid.npow`.

Excluding the zero ideal from the carrier is what makes the index set finite: `⊥ * J = ⊥` for every
`J`, so the zero ideal has infinitely many factorizations while a nonzero ideal has only finitely
many, by Mathlib's `UniqueFactorizationMonoid.fintypeSubtypeDvd` for the unique factorization
monoid `Ideal (𝓞 K)`.

## Roadmap role

This is Layer **2.1** of `TauCetiRoadmap/ArithmeticDirichletSeries/README.md`, built on the Layer
**0.1** carrier of `TauCeti/NumberTheory/ArithmeticDirichletSeries/Basic.lean`. Its consumers are
the ideal Möbius function and von Mangoldt transform of Layer 2 and the local factors of Layer 3.

## References

* J. Neukirch, *Algebraic Number Theory*, Chapter VII.
* G. Tenenbaum, *Introduction to Analytic and Probabilistic Number Theory*, Chapters II--III.
-/

 section

namespace TauCeti

open scoped nonZeroDivisors NumberField

namespace IdealArithmeticFunction

variable {K : Type*} [Field K]

/-! ### The convolution identity -/

open Classical in
/-- The **delta function** on nonzero ideals: `1` at the unit ideal and `0` elsewhere. It is the
identity for ideal convolution. It is *not* the pointwise unit `(1 : IdealArithmeticFunction K)`,
which is the everywhere-one function. -/
noncomputable def delta : IdealArithmeticFunction K := fun A => if A = 1 then 1 else 0







end IdealArithmeticFunction

variable {K : Type*} [Field K] [NumberField K]

namespace Ideal

/-! ### The antidiagonal of a nonzero ideal -/

/-- A nonzero ideal admits only finitely many factorizations into two nonzero ideals. This is where
the exclusion of `⊥` from the carrier bites: every ideal `J` satisfies `⊥ * J = ⊥`. -/
theorem finite_setOf_mul_eq (A : (Ideal (𝓞 K))⁰) :
    {p : (Ideal (𝓞 K))⁰ × (Ideal (𝓞 K))⁰ | p.1 * p.2 = A}.Finite := by
  let hfin : Fintype {I : Ideal (𝓞 K) // I ∣ (A : Ideal (𝓞 K))} :=
    UniqueFactorizationMonoid.fintypeSubtypeDvd _ (nonZeroDivisors.coe_ne_zero A)
  have hdvd : {I : Ideal (𝓞 K) | I ∣ (A : Ideal (𝓞 K))}.Finite :=
    Set.Finite.ofFinset
      (Finset.univ.image (Subtype.val : {I : Ideal (𝓞 K) // I ∣ (A : Ideal (𝓞 K))} → _))
      (by simp)
  -- The first factor of a factorization divides `A` and determines the second factor.
  refine Set.Finite.of_finite_image (f := fun p => ((p.1 : (Ideal (𝓞 K))⁰) : Ideal (𝓞 K)))
    (hdvd.subset ?_) ?_
  · rintro _ ⟨p, hp, rfl⟩
    exact ⟨(p.2 : Ideal (𝓞 K)), by simpa using congrArg Subtype.val hp.symm⟩
  · rintro p hp q hq hpq
    have h1 : p.1 = q.1 := Subtype.ext hpq
    have h2 : p.2 = q.2 := by
      refine mul_left_cancel (a := p.1) ?_
      rw [hp, ← hq, h1]
    exact Prod.ext h1 h2

/-- The **antidiagonal** of a nonzero ideal `A`: the finite set of pairs `(B, C)` of nonzero ideals
with `B * C = A`. It is the index set of the ideal Dirichlet convolution, and the ideal analogue of
Mathlib's `Nat.divisorsAntidiagonal`. -/
noncomputable def divisorsAntidiagonal (A : (Ideal (𝓞 K))⁰) :
    Finset ((Ideal (𝓞 K))⁰ × (Ideal (𝓞 K))⁰) :=
  (finite_setOf_mul_eq A).toFinset













end Ideal

namespace IdealArithmeticFunction

/-! ### Ideal convolution -/

/-- The **ideal Dirichlet convolution** of two ideal arithmetic functions: the value at a nonzero
ideal `A` is the sum of `f B * g C` over the factorizations `B * C = A` into nonzero ideals. -/
noncomputable def convolution (f g : IdealArithmeticFunction K) : IdealArithmeticFunction K :=
  fun A => ∑ p ∈ Ideal.divisorsAntidiagonal A, f p.1 * g p.2





/-! ### The monoid laws -/









/-! ### Bilinearity over the pointwise additive structure -/





















/-! ### Iterated convolution -/













/-! ### Convolution is not the pointwise product -/





end IdealArithmeticFunction

/-! ## Compatibility with Dirichlet convolution -/

variable (K : Type*) [Field K] [NumberField K]







end TauCeti

end
end
Source
https://github.com/TauCetiProject/TauCeti/blob/948fe4751b1fe528b6d580c522ca5d743d47f185/TauCeti/NumberTheory/ArithmeticDirichletSeries/Convolution.lean

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me