In commutative monoids the finite product is uniquely characterized by recursion on finite subsets, forcing the empty product to equal the neutral element.
The archive of formal proofs.Journal of Formalized Reasoning,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Finite products in commutative monoids: well-definition, recursion on finite subsets, and why the empty product is $1$
In commutative monoids the finite product is uniquely characterized by recursion on finite subsets, forcing the empty product to equal the neutral element.