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

<record version="6" id="5653">
 <title>pairwise disjoint</title>
 <name>MutuallyDisjoint</name>
 <created>2004-02-29 03:15:21</created>
 <modified>2007-06-27 02:36:44</modified>
 <type>Definition</type>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <author id="1858" name="matte"/>
 <classification>
	<category scheme="msc" code="03E99"/>
 </classification>
 <synonyms>
	<synonym concept="pairwise disjoint" alias="mutually disjoint"/>
 </synonyms>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here

\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}

\newcommand*{\norm}[1]{\lVert #1 \rVert}
\newcommand*{\abs}[1]{| #1 |}

\def\emptyset{\varnothing}</preamble>
 <content>{\bf Definition}
Suppose $\{ E_\alpha\mid \alpha \in I \}$ is an arbitrary collection of sets.
These sets are said to be \emph{pairwise disjoint}
if for every pair of distinct elements $\alpha,\beta\in I$,
we have $E_\alpha \cap E_\beta= \emptyset$.

\subsubsection*{Remark}
The synonym \emph{mutually disjoint} is also used.</content>
</record>
