Canonical: https://knowlpedia.com/algebraic-geometry-foundations/commutative-monoid-with-zero-as-a-blueprint/

# Commutative monoid with zero as a blueprint

The blueprint obtained from a commutative monoid with zero by imposing only the minimal additive relations.

Let \(A\) be a [commutative monoid with zero](https://knowlpedia.com/algebra-groups/commutative-monoid/). Its **monoid blueprint** is
\[
A^{\mathrm{blpr}}=A/\!/\mathcal R_{\min},
\]
where \(\mathcal R_{\min}\) is the smallest [pre-addition](https://knowlpedia.com/algebraic-geometry-foundations/pre-addition-on-a-monoid/) on \(A\): apart from the blueprint axioms, it imposes no additive relations.

This construction defines a [fully faithful functor](https://knowlpedia.com/algebra-category-theory/fully-faithful-functor/)
\[
\mathbf{CMon}_0\hookrightarrow\mathbf{Blpr}.
\]
A blueprint morphism between two such objects has no additional additive relations to check, so it is exactly a multiplicative map preserving \(0\) and \(1\).

The [semiring completion](https://knowlpedia.com/algebraic-geometry-foundations/semiring-completion-of-a-blueprint/) of \(A^{\mathrm{blpr}}\) is the free [commutative semiring](https://knowlpedia.com/algebra-rings/commutative-semiring/) generated by the monoid \(A\), with the monoid zero identified with the additive zero. It is not an addition law on \(A\).

## References

Oliver Lorscheid, [*The geometry of blueprints, Part I: Algebraic background and scheme theory*, §1.5](https://arxiv.org/abs/1103.1745).
