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

<record version="4" id="450">
 <title>upper bound</title>
 <name>UpperBound</name>
 <created>2001-10-21 02:37:39</created>
 <modified>2004-03-20 23:32:06</modified>
 <type>Definition</type>
 <creator id="24" name="djao"/>
 <author id="24" name="djao"/>
 <author id="146" name="rmilson"/>
 <classification>
	<category scheme="msc" code="06A06"/>
 </classification>
 <defines>
	<concept>bound</concept>
	<concept>lower bound</concept>
	<concept>bounded</concept>
	<concept>bounded from above</concept>
	<concept>bounded from below</concept>
 </defines>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>Let $S$ be a set with a partial ordering $\leq$, and let $T$ be a subset of $S$. 
An {\em upper bound} for $T$ is an element $z \in S$ such that $x \leq z$ for all $x \in T$. We say that $T$ is {\em bounded from above} if there exists an upper bound for $T$.

{\em Lower bound}, and \emph{bounded from below} are defined in a similar manner.</content>
</record>
