numerical_semigroup_multiplicity
def
The multiplicity of a numerical semigroup S is the natural number defined as the infimum of its strictly positive elements: sInf {x ∈ (S.toAddSubmonoid : Set ℕ) | 0 < x}.
Statement
noncomputable def numerical_semigroup_multiplicity (S : NumericalSemigroup) : ℕ
- Defined in
- arXiv:2611.11559
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 1
- NumericalSemigroupA numerical semigroup is an additive submonoid of the natural numbers whose complement in ℕ is finite.
- Used by 5
- numerical_semigroup_countThe counting function n_{F,m,g} of numerical semigroups, defined as the number (cardinality) of numerical semigroups with Frobenius number…
- numerical_semigroup_not_dvd_frobeniusIf S is a numerical semigroup with positive Frobenius number F and multiplicity m, then m does not divide F.
- numerical_semigroup_count_of_dvd_frobeniusIf F is a positive integer and m divides F, then the number of numerical semigroups with Frobenius number F, multiplicity m, and genus g…
- not_numerical_semigroup_count_fibonacci_recurrenceThe statement
numerical_semigroup_count_fibonacci_recurrenceis false: The identity is false. Take F = 3, m = 2, g = 2: indeed F + 2 = 5… - numerical_semigroup_exists_at_m_eq_succ_frobeniusFor every positive integer F, there exists a numerical semigroup S with Frobenius number F, multiplicity F + 1, and genus F.
Read back from the Lean
Given a numerical semigroup S (an additive submonoid of ℕ whose complement in ℕ is finite), numerical_semigroup_multiplicity S is defined as the infimum (in ℕ, via sInf) of the set of all natural numbers x such that x ∈ S and 0 < x.
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 multiplicity of a numerical semigroup is its smallest positive element. -/ noncomputable def numerical_semigroup_multiplicity (S : NumericalSemigroup) : ℕ := sInf {x ∈ (S.toAddSubmonoid : Set ℕ) | 0 < x}