Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite real-cutoff carriers for Northcott functions

Definition
TauCeti_Order_Northcott_Basic

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

number-theorytauceti-chebotarev

Let N:A→NN:A\to\mathbb NN:A→N have finite bounded sublevel sets and let www be a weight on AAA. For real xxx, define

A≤x={a∈A:N(a)≤x},W(x)=∑a∈A≤xw(a).A_{\leq x}=\{a\in A:N(a)\leq x\},\qquad W(x)=\sum_{a\in A_{\leq x}}w(a).A≤x​={a∈A:N(a)≤x},W(x)=a∈A≤x​∑​w(a).

These inclusive finite cutoffs provide the common summation convention.

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 Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.Order.Archimedean.Real.Basic
import Mathlib.Data.Set.Card
import Mathlib.Order.Filter.AtTopBot.Finset
import Mathlib.Order.Northcott
import Mathlib.Topology.Algebra.Order.Floor
import Mathlib.Topology.UniformSpace.Real

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
-/
/-!
# Finite real-cutoff carriers for Northcott functions

This file packages the finite carrier selected by a real cutoff for a natural-valued Northcott
function, together with generic summatory functions over that carrier. The carrier depends only
on the integer part of the cutoff, and for a nonnegative cutoff it agrees with the one selected by
its natural floor.
-/

 section

namespace TauCeti

open Filter
open scoped Topology

variable {ι : Type*} (N : ι → ℕ) [Northcott N]

/-- Only finitely many indices have `N`-value at most a fixed real number, because the `N`-value
is a natural number and `N` is Northcott. -/
theorem finite_setOf_natCast_le (x : ℝ) : {i : ι | (N i : ℝ) ≤ x}.Finite :=
  (Northcott.finite_le (h := N) ⌊x⌋₊).subset fun _ hi ↦ Nat.le_floor hi

/-- The finite set of indices whose `N`-value is at most the real cutoff `x`. The cutoff is
inclusive: an index with `N i = x` belongs to `normLE N x`. -/
 noncomputable def normLE (x : ℝ) : Finset ι :=
  (finite_setOf_natCast_le N x).toFinset



















/-! ### Generic summatory functions -/

/-- The inclusive summatory function of a weight `w`: the sum of `w` over all indices of
`N`-value at most `x`. -/
 noncomputable def summatory {M : Type*} [AddCommMonoid M]
    (w : ι → M) (x : ℝ) : M :=
  ∑ i ∈ normLE N x, w i































end TauCeti

end
end
Source
https://github.com/TauCetiProject/TauCeti/blob/948fe4751b1fe528b6d580c522ca5d743d47f185/TauCeti/Order/Northcott/Basic.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