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

<record version="6" id="339">
 <title>infimum</title>
 <name>Infimum</name>
 <created>2001-10-18 22:51:50</created>
 <modified>2008-06-29 13:08:29</modified>
 <type>Definition</type>
 <creator id="22" name="vampyr"/>
 <author id="3771" name="CWoo"/>
 <author id="22" name="vampyr"/>
 <classification>
	<category scheme="msc" code="06A06"/>
 </classification>
 <related>
	<object name="Supremum"/>
	<object name="LebesgueOuterMeasure"/>
	<object name="MinimalAndMaximalNumber"/>
	<object name="InfimumAndSupremumForRealNumbers"/>
	<object name="NondecreasingSequenceWithUpperBound"/>
 </related>
 <keywords>
	<term>real analysis</term>
 </keywords>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>The \emph{infimum} of a set $S$ is the greatest lower bound of $S$ and is denoted $\inf(S)$.

Let $A$ be a set with a partial order $\leq$, and let $S \subseteq A$.  For any $x \in A$, $x$ is a lower bound of $S$ if $x \leq y$ for any $y \in S$.  The  infimum of $S$, denoted $\inf(S)$, is the greatest such lower bound; that is, if $b$ is a lower bound of $S$, then $b \leq \inf(S)$.

Note that it is not necessarily the case that $\inf(S) \in S$.  Suppose $S = (0, 1)$; then $\inf(S) = 0$, but $0 \not\in S$.

Also note that a set does not necessarily have an infimum. See the attachments to this entry for examples.</content>
</record>
