Let AA be a , and let N[A]\mathbb N[A] denote the semiring of finite formal sums of elements of AA. A pre-addition on AA is an R\mathcal R on N[A]\mathbb N[A], written

∑ai≡∑bj,\sum a_i\equiv\sum b_j,

with the following properties:

  1. relations may be added and multiplied termwise;
  2. the empty sum is equivalent to the one-term sum 00;
  3. if the one-term sums aa and bb are equivalent, then a=ba=b in AA.

Explicitly, if ∑ai≡∑bj\sum a_i\equiv\sum b_j and ∑ck≡∑dℓ\sum c_k\equiv\sum d_\ell, then

∑ai+∑ck≡∑bj+∑dℓ\sum a_i+\sum c_k\equiv\sum b_j+\sum d_\ell

and

∑i,kaick≡∑j,ℓbjdℓ.\sum_{i,k}a_ic_k\equiv\sum_{j,\ell}b_jd_\ell.

The third condition says that the pre-addition is proper: it does not identify distinct elements of the underlying monoid.

Role in a blueprint

A A/ ⁣/RA/\!/\mathcal R records the multiplication of AA together with the additive relations in R\mathcal R. Quotienting all formal sums by R\mathcal R produces its .

References