# 1.2 Interpretations  (Page 5/5)

 Page 5 / 5
${B}_{1}={A}_{1},\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{and}\phantom{\rule{4.pt}{0ex}}\text{for}\phantom{\rule{4.pt}{0ex}}\text{any}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}i>1,\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}{B}_{i}={A}_{i}{A}_{1}^{c}{A}_{2}^{c}\cdots {A}_{i-1}^{c}$

Thus each B i is the set of those elements of A i not in any of the previous members of the sequence.

This representation is used to show that subadditivity (P9) follows from countable additivity and property (P6) . Since each ${B}_{i}\subset {A}_{i}$ , by (P6) $P\left({B}_{i}\right)\le P\left({A}_{i}\right)$ . Now

$P\left(\bigcup _{i=1}^{\infty },{A}_{i}\right)=P\left(\phantom{\rule{0.166667em}{0ex}},\underset{i=1}{\overset{\infty }{\bigvee }},\phantom{\rule{0.166667em}{0ex}},\phantom{\rule{0.166667em}{0ex}},{B}_{i}\right)=\sum _{i=1}^{\infty }P\left({B}_{i}\right)\le \sum _{i=1}^{\infty }P\left({A}_{i}\right)$

The representation of a union as a disjoint union points to an important strategy in the solution of probability problems. If an event can be expressed as a countable disjointunion of events, each of whose probabilities is known, then the probability of the combination is the sum of the individual probailities. In in the module on Partitions and Minterms , we show that any Boolean combination of a finite class of events can be expressed as a disjoint union in a manner that often facilitates systematic determination of the probabilities.

## The indicator function

One of the most useful tools for dealing with set combinations (and hence with event combinations) is the indicator function I E for a set $E\subset \Omega$ . It is defined very simply as follows:

${I}_{E}\left(\omega \right)=\left\{\begin{array}{cc}1& \phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{for}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\omega \in E\hfill \\ 0& \phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{for}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\omega \in {E}^{c}\hfill \end{array}\right)$

Remark . Indicator fuctions may be defined on any domain. We have occasion in various cases to define them on the real line and on higher dimensionalEuclidean spaces. For example, if M is the interval $\left[a,\phantom{\rule{0.166667em}{0ex}}b\right]$ on the real line then ${I}_{M}\left(t\right)=1$ for each t in the interval (and is zero otherwise). Thus we have a step function with unit value over the interval M . In the abstract basic space Ω we cannot draw a graph so easily. However, with the representation of sets on a Venn diagram, we can give a schematic representation, as in [link] .

Much of the usefulness of the indicator function comes from the following properties.

• ${I}_{A}\le {I}_{B}$ iff $A\subset B$ . If ${I}_{A}\le {I}_{B}$ , then $\omega \in A$ implies ${I}_{A}\left(\omega \right)={I}_{B}\left(\omega \right)=1$ , so $\omega \in B$ . If $A\subset B$ , then ${I}_{A}\left(\omega \right)=1$ implies $\omega \in A$ implies $\omega \in B$ implies ${I}_{B}\left(\omega \right)=1$ .
• ${I}_{A}={I}_{B}$ iff $A=B$
$A=B\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{iff}\phantom{\rule{4.pt}{0ex}}\text{both}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}A\subset B\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{and}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}B\subset A\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{iff}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}{I}_{A}\le {I}_{B}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{and}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}{I}_{B}\le {I}_{A}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{iff}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}{I}_{A}={I}_{B}$
• ${I}_{{A}^{c}}=1-{I}_{A}$ This follows from the fact ${I}_{{A}^{c}}\left(\omega \right)=1$ iff ${I}_{A}\left(\omega \right)=0$ .
• ${I}_{AB}={I}_{A}{I}_{B}=min\left\{{I}_{A},\phantom{\rule{0.166667em}{0ex}}{I}_{B}\right\}$ (extends to any class) An element ω belongs to the intersection iff it belongs to all iff the indicator function for each event is one iff the product of the indicator functions is one.
• ${I}_{A\cup B}={I}_{A}+{I}_{B}-{I}_{A}{I}_{B}=max\left\{{I}_{A},{I}_{B}\right\}$ (the maximum rule extends to any class)The maximum rule follows from the fact that ω is in the union iff it is in any one or more of the events in the union iff any one or more of the individual indicator function has value oneiff the maximum is one. The sum rule for two events is established by DeMorgan's rule and properties (IF2), (IF3), and (IF4).
${I}_{A\cup B}=1-{I}_{{A}^{c}{B}^{c}}=1-\left[1-{I}_{A}\right]\left[1-{I}_{B}\right]=1-1+{I}_{B}+{I}_{A}-{I}_{A}{I}_{B}$
• If the pair $\left\{A,\phantom{\rule{0.166667em}{0ex}}B\right\}$ is disjoint, ${I}_{A\bigvee B}={I}_{A}+{I}_{B}$ (extends to any disjoint class)

The following example illustrates the use of indicator functions in establishing relationships between set combinations. Other uses and techniques are established in the module on Partitions and Minterms .

## Indicator functions and set combinations

Suppose $\left\{{A}_{i}:1\le i\le n\right\}$ is a partition.

$\text{If}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}B=\phantom{\rule{0.166667em}{0ex}}\underset{i=1}{\overset{n}{\bigvee }}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}{A}_{i}{C}_{i},\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}\text{then}\phantom{\rule{0.277778em}{0ex}}\phantom{\rule{0.277778em}{0ex}}{B}^{c}=\phantom{\rule{0.166667em}{0ex}}\underset{i=1}{\overset{n}{\bigvee }}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}{A}_{i}{C}_{i}^{c}$

VERIFICATION

Utilizing properties of the indicator function established above, we have

${I}_{B}=\sum _{i=1}^{n}{I}_{{A}_{i}}{I}_{{C}_{i}}$

Note that since the A i form a partition, we have $\sum _{i=1}^{n}{I}_{{A}_{i}}=1$ , so that the indicator function for the complementary event is

${I}_{{B}^{c}}=1-\sum _{i=1}^{n}{I}_{{A}_{i}}{I}_{{C}_{i}}=\sum _{i=1}^{n}{I}_{{A}_{i}}-\sum _{i=1}^{n}{I}_{{A}_{i}}{I}_{{C}_{i}}=\sum _{i=1}^{n}{I}_{{A}_{i}}\left[1-{I}_{{C}_{i}}\right]=\sum _{i=1}^{n}{I}_{{A}_{i}}{I}_{{C}_{i}^{c}}$

The last sum is the indicator function for $\phantom{\rule{0.166667em}{0ex}}\underset{i=1}{\overset{n}{\bigvee }}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}{A}_{i}{C}_{i}^{c}$ .

## A technical comment on the class of events

The class of events plays a central role in the intuitive background, the application, and the formal mathematical structure. Events have been modeled as subsets of the basic space ofall possible outcomes of the trial or experiment. In the case of a finite number of outcomes, any subset can be taken as an event. In the general theory, involving infinite possibilities, there are some technical mathematical reasons for limiting the class of subsets to beconsidered as events. The practical needs are these:

1. If A is an event, its complementary set must also be an event.
2. If $\left\{{A}_{i}:i\in J\right\}$ is a finite or countable class of events, the union and the intersection of members of the class need to be events.

A simple argument based on DeMorgan's rules shows that if the class contains complements of all its sets and countable unions, then itcontains countable intersections. Likewise, if it contains complements of all its sets and countable intersections, then it contains countable unions. A class of sets closedunder complements and countable unions is known as a sigma algebra of sets. In a formal, measure-theoretic treatment, a basic assumption is that the class of eventsis a sigma algebra and the probability measure assigns probabilities to members of that class. Such a class is so general that it takes very sophisticated arguments to establish the factthat such a class does not contain all subsets. But precisely because the class is so general and inclusive in ordinary applications we need not be concerned about which sets are permissible as events

A primary task in formulating a probability problem is identifying the appropriate events and the relationships between them. The theoretical treatment shows that we may work withgreat freedom in forming events, with the assurrance that in most applications a set so produced is a mathematically valid event. The so called measurability question only comes into play in dealing with random processes with continuous parameters. Even there,under reasonable assumptions, the sets produced will be events.

how to know photocatalytic properties of tio2 nanoparticles...what to do now
it is a goid question and i want to know the answer as well
Maciej
Do somebody tell me a best nano engineering book for beginners?
what is fullerene does it is used to make bukky balls
are you nano engineer ?
s.
what is the Synthesis, properties,and applications of carbon nano chemistry
Mostly, they use nano carbon for electronics and for materials to be strengthened.
Virgil
is Bucky paper clear?
CYNTHIA
so some one know about replacing silicon atom with phosphorous in semiconductors device?
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
Do you know which machine is used to that process?
s.
how to fabricate graphene ink ?
for screen printed electrodes ?
SUYASH
What is lattice structure?
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
A fair die is tossed 180 times. Find the probability P that the face 6 will appear between 29 and 32 times inclusive