有限积在交换半群中的研究：良定义性、有限子集的递归以及为何空积是1
Finite products in commutative monoids: well-definition, recursion on finite subsets, and why the empty product is $1$
AI总结：
本文研究了交换半群中有限积的良定义性，通过有限子集的递归关系证明了空积必须为1，并通过列表自由半群和半环分配恒等式提供了两种独立的证明方法。
摘要：
空积等于1的约定在数学中普遍存在，但通常缺乏显式的结构证明。本文在交换半群的背景下提供了一个自包含的参考。我们通过有限集的索引族构造积，并证明其计数独立性，展示其通过Fin(I)中的递归方案唯一确定：空集的值和新索引的插入规则。特别地，空积的值必然为中性元1。我们进一步通过列表自由半群和半环分配恒等式提供了两种互补且独立的证明。接着，我们通过交换有限支持的多重集自由半群以通用术语描述这一现象。我们还讨论了部分交换扩展，通过踪迹半群和堆，并包括线性代数、生存统计、范畴论和分析中的简要应用。相应的加法版本通过相同原理恢复了空和等于0的恒等式。
英文摘要：
The convention "empty product $=1$" is ubiquitous in mathematics, but often appears without an explicit structural justification. This note provides a self-contained reference to this fact in the context of commutative monoids. We construct the product of an indexed family by a finite set, prove its enumeration independence, and show that it is uniquely characterized by a recursion scheme in Fin$(I)$: value in the empty set and insertion rule of a new index. In particular, the value of the empty product is necessarily the neutral element $1$. We further record two complementary and independent justifications of this fact: one via the list-free monoid and another via distributive identities in semi-rings. Next, we formulate the same phenomenon in universal terms by means of the commutative multiset-free monoid of finite support. We also discuss partially commutative extensions, via trace monoids and heaps, and include brief applications in linear algebra, survival statistics, category theory, and analysis. The corresponding additive version recovers, by the same principle, the identity "empty sum $=0$".
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
