Normalized count via finset sum (M1a bridge)
ProvedGoldbachCometImprint.normalized_from_sumcombinatorial-countinggoldbachnumber-theory
Statement
For every n, the normalized ordered representation count is the raw count divided by the Hardy–Littlewood prime part of the singular series:
Formally this is definitional in GoldbachCometImprint.normalizedOrderedCount.
Role
This is the normalization used in race_imprint.py (ρ = r/S) before demeaning and residue-class analysis (D4).
Preamble
import Mathlib.Data.Nat.Basic import Mathlib.Data.Finset.Basic import Mathlib.Data.Finset.Range import Mathlib.Data.Nat.Factors import Mathlib.Data.Nat.Prime.Defs import Mathlib.Data.Rat.Defs import Mathlib.Data.List.Basic import Definitions.Def_GoldbachComet import Definitions.Def_GoldbachCometImprint import Definitions.Def_GoldbachCometRace import Mathlib.Algebra.BigOperators.Group.Finset.Basic open scoped BigOperators set_option autoImplicit false
Formal statement
namespace GoldbachCometImprint
open GoldbachComet
open scoped BigOperators
theorem normalized_from_sum (n : ℕ) :
normalizedOrderedCount n =
((primeLeftSummand n).sum (fun _ => 1) : ℚ) / singularSeriesPrimes n := by sorry
end GoldbachCometImprint
Source
docs/goldbach-comet/README.md; empirical motivation in docs/captain/goldbach/FRESH-PERSPECTIVES-2026-10-04.md