Numerical semigroup Created 2026-10-20 Updated 2026-11-05
A numerical semigroup is a subset of the nonnegative integers that contains zero, is closed under addition, and has finite complement within the nonnegative integers. For example,Its missing values are . To verify that no larger value is missing, observe that are present and then repeatedly add three, using consecutive-base induction for additive semigroups.
A finite family of positive integer generators produces a numerical semigroup exactly when their greatest common divisor is one. The condition is necessary because all generated integers are multiples of that greatest common divisor. Sufficiency follows by finding a generated representative of each residue class modulo one generator and then adding multiples of that generator.
Use strong induction with three consecutive base cases:For , assume all values from through have the required representation. Since , write with nonnegative integers. Then is another such representation. Strong induction proves the claim for every . This is a consecutive-base induction for additive semigroups: the three base cases handle all residues before repeated addition of .