Canonical: https://knowlpedia.com/algebraic-geometry-foundations/blueprint/

# Blueprint

A commutative multiplicative monoid together with compatible formal additive relations.

A **blueprint** \(B=A/\!/\mathcal R\) consists of a [commutative monoid with zero](https://knowlpedia.com/algebra-groups/commutative-monoid/) \(A\) together with a [pre-addition](https://knowlpedia.com/algebraic-geometry-foundations/pre-addition-on-a-monoid/) \(\mathcal R\) on \(A\).

A morphism \(f:A/\!/\mathcal R\to A'/\!/\mathcal R'\) is a multiplicative map preserving \(0\) and \(1\) whose termwise extension sends every relation in \(\mathcal R\) to one in \(\mathcal R'\).

## What the notation records

The monoid \(A\) is the multiplicative skeleton \(B^\bullet\). The relations \(\mathcal R\) say which formal sums are to count as equal without requiring every sum to be represented by an element of \(A\). The [semiring completion](https://knowlpedia.com/algebraic-geometry-foundations/semiring-completion-of-a-blueprint/) is
\[
B^+=\mathbb N[A]/\mathcal R
\]
and the canonical map \(B^\bullet\to B^+\) remembers which elements are designated as monomials.

## Familiar structures inside blueprints

There are fully faithful embeddings of [commutative semirings](https://knowlpedia.com/algebraic-geometry-foundations/semiring-as-a-blueprint/) and [commutative monoids with zero](https://knowlpedia.com/algebraic-geometry-foundations/commutative-monoid-with-zero-as-a-blueprint/) into blueprints, but the two constructions impose different additive relations.

Blueprints support localization, spectra, and [blue schemes](https://knowlpedia.com/algebraic-geometry-foundations/blue-scheme/). The [canonical embedding into ordered blueprints](https://knowlpedia.com/algebraic-geometry-foundations/blueprint-as-an-ordered-blueprint/) regards every additive equality as a pair of opposite inequalities.

## References

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