<?xml version="1.0" encoding="UTF-8"?>

<record version="8" id="2611">
 <title>join</title>
 <name>Join</name>
 <created>2002-02-24 17:12:12</created>
 <modified>2005-02-26 05:18:57</modified>
 <type>Definition</type>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <author id="25" name="greg"/>
 <classification>
	<category scheme="msc" code="06A12"/>
 </classification>
 <defines>
	<concept>join-semilattice</concept>
	<concept>join semilattice</concept>
	<concept>upper semilattice</concept>
 </defines>
 <synonyms>
	<synonym concept="join" alias="or operator"/>
 </synonyms>
 <related>
	<object name="Meet"/>
	<object name="Semilattice"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}</preamble>
 <content>Certain posets $X$ have a binary operation \emph{join} denoted by $\lor$, such that $x \lor y$ is the least upper bound of $x$ and $y$. Such posets are called \emph{join-semilattices}, or \emph{$\lor$-semilattices}, or \emph{upper semilattices}.

If $j$ and $j'$ are both joins of $x$ and $y$, then $j \leq j'$ and $j' \leq j$, and so $j = j'$; thus a join, if it exists, is unique.  The join is also known as the \emph{or operator}.</content>
</record>
