Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Definitions of TypeDensity.Reciprocity.Quantum

Definition
TypeDensity_Reciprocity_Quantum

by asving · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

type-density

Reciprocity: the quantum torus, dilations and reciprocal substitution

Algebraic properties of the reciprocity setting of TypeDensity.Reciprocity.Defs. We show that q ↦ q⁻¹ is an involution of ℚ(q) and of Coef, commuting with the Adams operations; that the reciprocal substitution recipSer and the dilations dilate/codilate act coefficientwise and commute with the plethystic powers; that the twisted product on contact series is associative and compatible with ι₊, ι₋, the anti-involution † and the diagonal substitution; and we relate the representation qact to its q ↦ q⁻¹ conjugate through the Gauss twist Φ.

Main results

  • recipRat_recipRat, recipCoef_recipCoef, recipCoef_adamsCoef, adamsCoef_adamsCoef.
  • qmul_assoc, qdagger_qmul, qdagger_qplus, qdagger_qminus, qdiag_mul, qcongr_qdiag_mul_qdagger.
  • recipSer_pPow, dilate_pPow, codilate_pPow, moebiusSum_plethSum, plethSum_moebiusSum.
  • gaussPhi_qactRecip_gaussPhiInv: Φ ∘ ρ̄(v V) ∘ Φ⁻¹ = S⁻¹ ∘ ρ(V†) ∘ S for symmetric V.
  • SCongr.mul, SCongr.of_mul_right, SCongr.expSer, SCongr.logSer: congruences of series.

Provenance: Thm_SurfaceBlowupV2_recip_{qplus_mul, qpositive_basic, recipRat_apply, adamsCoef_recipCoef_single, adamsSer_exp_log, plethSum_moebiusSum, projectiveNormalizer_recip, qact_recip, qpow_scalar_arith, qdagger_mul, qdagger_qplus_qminus, qmul_assoc, recipSer_hom, dilate_hom, dilate_pleth, gaussPhi_inv, gauss_conjugation, qdiag_mul, qdiag_central, recipSer_pleth, scalar_cancel, scongr_basic, scongr_cancel, scongr_exp_log}.

Definition code
-- Generated by the TypeDensity exporter from TypeDensity/Reciprocity/Quantum.lean (namespace TypeDensity); do not edit.
import Definitions.Def_TypeDensity_Basic
import Definitions.Def_TypeDensity_Reciprocity_Defs
import Mathlib.FieldTheory.RatFunc.Basic
import Mathlib.MeasureTheory.Measure.Haar.Unique
import Mathlib.NumberTheory.ArithmeticFunction.Moebius
import Mathlib.NumberTheory.Padics.PadicIntegers
import Mathlib.RingTheory.IntegralClosure.IntegralRestrict
import Mathlib.RingTheory.MvPowerSeries.Basic
import Mathlib.RingTheory.RamificationInertia.Basic
import Mathlib.Topology.Algebra.Nonarchimedean.AdicTopology
import Mathlib.FieldTheory.RatFunc.AsPolynomial
import Mathlib.RingTheory.PowerSeries.Expand
import Mathlib.RingTheory.PowerSeries.Log
set_option autoImplicit false

noncomputable section

namespace TypeDensity

/-- The divisor transform `[xⁿ] ↦ Σ_{k ∣ n} w(k) ψ_k([x^{n/k}] f)`. -/
def divisorTransform (w : ℕ → ℚ) (f : Ser) : Ser :=
  PowerSeries.mk fun n ↦ ∑ k ∈ n.divisors, w k • adamsCoef k (PowerSeries.coeff (n / k) f)

/-- Congruence of series is reflexive. -/
@[refl] theorem SCongr.refl (n : ℕ) (f : Ser) : SCongr n f f := fun _ _ ↦ rfl

end TypeDensity

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