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

<record version="5" id="1331">
 <title>filtration</title>
 <name>Filtration</name>
 <created>2002-01-05 03:26:49</created>
 <modified>2009-01-28 00:21:11</modified>
 <type>Definition</type>
 <creator id="3771" name="CWoo"/>
 <author id="3771" name="CWoo"/>
 <author id="24" name="djao"/>
 <classification>
	<category scheme="msc" code="03E20"/>
 </classification>
 <related>
	<object name="FiltrationOfSigmaAlgebras"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>A {\em filtration} is a sequence of sets $A_1, A_2, \dots, A_n$ with
$$
A_1 \subset A_2 \subset \cdots \subset A_n.
$$
If one considers the sets $A_1, \dots, A_n$ as elements of a larger set which are partially ordered by inclusion, then a filtration is simply a finite chain with respect to this partial ordering. It should be noted that in some contexts the word ``filtration'' may also be employed to describe an infinite chain.</content>
</record>
