AFTD Auto-Formalizing Theoretical Domains

numerical_semigroup_count

def

The counting function n_{F,m,g} of numerical semigroups, defined as the number (cardinality) of numerical semigroups with Frobenius number F, multiplicity m, and genus g.

Statement

noncomputable def numerical_semigroup_count (F m g : ℕ) : ℕ
Defined in
arXiv:2611.11559 Section 2
Verified
11 Nov 2026
Axioms
none listed
Built on 4
  • NumericalSemigroupA numerical semigroup is an additive submonoid of the natural numbers whose complement in ℕ is finite.
  • numerical_semigroup_frobenius_numberThe Frobenius number of a numerical semigroup S is the natural number defined as the supremum of the complement of S in ℕ: sSup…
  • numerical_semigroup_multiplicityThe multiplicity of a numerical semigroup S is the natural number defined as the infimum of its strictly positive elements: sInf {x ∈…
  • numerical_semigroup_genusThe genus of a numerical semigroup S is the natural number defined as the cardinality of its complement in ℕ: Set.ncard ((S.toAddSubmonoid…
Used by 2

Read back from the Lean

The definition numerical_semigroup_count F m g returns the cardinality (as a natural number, via Set.ncard) of the set of all numerical semigroups S (additive submonoids of ℕ whose complement in ℕ is finite) satisfying: 1. numerical_semigroup_frobenius_number S = F, 2. numerical_semigroup_multiplicity S = m, and 3. numerical_semigroup_genus S = g.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The number of numerical semigroups with Frobenius number F, multiplicity m, and genus g. -/
noncomputable def numerical_semigroup_count (F m g : ℕ) : ℕ := {S : NumericalSemigroup |
    numerical_semigroup_frobenius_number S = F ∧
    numerical_semigroup_multiplicity S = m ∧
    numerical_semigroup_genus S = g}.ncard
See it in the graphDiscuss this resultChallenge it