In
mathematics, a refinement monoid is a
commutative monoid
In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being 0.
Monoids a ...
''M'' such that for any elements ''a
0'', ''a
1'', ''b
0'', ''b
1'' of ''M'' such that ''a
0+a
1=b
0+b
1'', there are elements ''c
00'', ''c
01'', ''c
10'', ''c
11'' of ''M'' such that ''a
0=c
00+c
01'', ''a
1=c
10+c
11'', ''b
0=c
00+c
10'', and ''b
1=c
01+c
11''.
A commutative monoid ''M'' is said to be
conical
A cone is a three-dimensional geometric shape that tapers smoothly from a flat base (frequently, though not necessarily, circular) to a point called the apex or vertex.
A cone is formed by a set of line segments, half-lines, or lines conn ...
if ''x''+''y''=0 implies that ''x''=''y''=0, for any elements ''x'',''y'' of ''M''.
Basic examples
A
join-semilattice
In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a ...
with zero is a refinement monoid if and only if it is
distributive.
Any
abelian group
In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is com ...
is a refinement monoid.
The
positive cone
In mathematics, an ordered vector space or partially ordered vector space is a vector space equipped with a partial order that is compatible with the vector space operations.
Definition
Given a vector space ''X'' over the real numbers R and a p ...
''G
+'' of a
partially ordered abelian group ''G'' is a refinement monoid if and only if ''G'' is an ''interpolation group'', the latter meaning that for any elements ''a
0'', ''a
1'', ''b
0'', ''b
1'' of ''G'' such that ''a
i ≤ b
j'' for all ''i, j<2'', there exists an element ''x'' of ''G'' such that ''a
i ≤ x ≤ b
j'' for all ''i, j<2''. This holds, for example, in case ''G'' is
lattice-ordered.
The ''isomorphism type'' of a
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values ''true'' and ''false'', usually denoted 1 and 0, whereas ...
''B'' is the class of all Boolean algebras isomorphic to ''B''. (If we want this to be a
set, restrict to Boolean algebras of set-theoretical
rank
Rank is the relative position, value, worth, complexity, power, importance, authority, level, etc. of a person or object within a ranking, such as:
Level or position in a hierarchical organization
* Academic rank
* Diplomatic rank
* Hierarchy
* H ...
below the one of ''B''.)
The class of isomorphism types of Boolean algebras, endowed with the addition defined by