<?xml version="1.0"?> 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "mathml.dtd"> 
<?xml-stylesheet type="text/css" href="thesis.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title>3.5 Bounding the Union</title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" /> 
<meta name="generator" content="TeX4ht (http://www.cis.ohio-state.edu/~gurari/TeX4ht/mn.html)" /> 
<meta name="originator" content="TeX4ht (http://www.cis.ohio-state.edu/~gurari/TeX4ht/mn.html)" /> 
<!-- 3,early_,early^,xhtml,mozilla --> 
<meta name="src" content="thesis.tex" /> 
<meta name="date" content="2002-08-28 13:56:00" /> 
<link rel="stylesheet" type="text/css" href="thesis.css" /> 
</head><body 
>
   <div class="crosslinks"><p class="noindent">[<a 
href="thesisse14.xml" >next</a>] [<a 
href="thesisse12.xml" >prev</a>] [<a 
href="thesisse12.xml#tailthesisse12.xml" >prev-tail</a>] [<a 
href="#tailthesisse13.xml">tail</a>] [<a 
href="thesisch3.xml#thesisse13.xml" >up</a>] </p></div>
   <h3 class="sectionHead"><span class="titlemark">3.5. </span> <a 
  name="x19-270003.5"></a>Bounding the Union</h3>
<!--l. 819--><p class="noindent">One very common technique we will use is the union bound (known as the Bonferroni
bound in statistics). Given two coins, each with a bias (probability of heads) of <!--l. 821--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><mi 
>p</mi></mrow></math>,
what is the probability that if we flip each coin <!--l. 822--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><mi 
>m</mi></mrow></math> times, one of the
coins will have <!--l. 822--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">       <mrow 
><mi 
>k</mi></mrow></math>
or fewer heads?
</p><!--l. 825--><p class="indent">   Let <!--l. 825--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">        <mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></math>
= the proportion of heads in the first coin flip and <!--l. 825--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></math>
= the proportion of heads in the second coin flip. Then we get: <!--l. 827--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="display">
<mrow 
>
                        <mo 
>Pr</mo> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mfrac><mrow 
><mi 
>k</mi></mrow> 
<mrow 
><mi 
>m</mi></mrow></mfrac><!--mstyle 
class="text"--><mtext class="textrm">&#x000A0;or&#x000A0;</mtext><!--/mstyle--><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mfrac><mrow 
><mi 
>k</mi></mrow> 
<mrow 
><mi 
>m</mi></mrow></mfrac></mrow></mfenced>
</mrow></math> <!--l. 829--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="display">
                                                                     

                                                                     
<mrow 
>
                      <mo 
class="MathClass-rel">&#x2264;</mo><mo 
> Pr</mo> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mfrac><mrow 
><mi 
>k</mi></mrow> 
<mrow 
><mi 
>m</mi></mrow></mfrac></mrow></mfenced> <mo 
class="MathClass-bin">+</mo><mo 
> Pr</mo> <mfenced separators="" 
open="("  close=")" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mfrac><mrow 
><mi 
>k</mi></mrow> 
<mrow 
><mi 
>m</mi></mrow></mfrac></mrow></mfenced>
</mrow></math> where the
inequality is known as the union bound. This step is very applicable because it works even when the
values of <!--l. 832--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">        <mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></math>
and <!--l. 832--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">        <mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow></math>
are correlated in arbitrary ways.
</p><!--l. 835--><p class="indent">   The union bound is the fundamental tool which allows us to reason
about multiple hypotheses, each with possibly correlated empirical errors, <!--l. 836--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msub><mrow 
> <mover 
accent="true"><mrow 
><mi 
>e</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
><mi 
>S</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>h</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math> and <!--l. 837--><math 
xmlns="http://www.w3.org/1998/Math/MathML" 
mode="inline">
<mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msub><mrow 
> <mover 
accent="true"><mrow 
><mi 
>e</mi></mrow><mo 
class="MathClass-op">&#x0302;</mo></mover></mrow><mrow 
><mi 
>S</mi></mrow></msub 
><mrow><mo 
class="MathClass-open">(</mo><mrow><msub><mrow 
><mi 
>h</mi></mrow><mrow 
><mn>2</mn></mrow></msub 
></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>. The
use (and avoidance of the use) of the union bound is a constant issue.
</p><!--l. 841--><p class="indent">
                                                                     

                                                                     
</p>
   <div class="crosslinks"><p class="noindent">[<a 
href="thesisse14.xml" >next</a>] [<a 
href="thesisse12.xml" >prev</a>] [<a 
href="thesisse12.xml#tailthesisse12.xml" >prev-tail</a>] [<a 
href="thesisse13.xml" >front</a>] [<a 
href="thesisch3.xml#thesisse13.xml" >up</a>] </p></div><a 
  name="tailthesisse13.xml"></a>  
</body> 
</html> 
