# 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.

where we get a research paper on Nano chemistry....?
nanopartical of organic/inorganic / physical chemistry , pdf / thesis / review
Ali
what are the products of Nano chemistry?
There are lots of products of nano chemistry... Like nano coatings.....carbon fiber.. And lots of others..
learn
Even nanotechnology is pretty much all about chemistry... Its the chemistry on quantum or atomic level
learn
da
no nanotechnology is also a part of physics and maths it requires angle formulas and some pressure regarding concepts
Bhagvanji
hey
Giriraj
Preparation and Applications of Nanomaterial for Drug Delivery
revolt
da
Application of nanotechnology in medicine
what is variations in raman spectra for nanomaterials
ya I also want to know the raman spectra
Bhagvanji
I only see partial conversation and what's the question here!
what about nanotechnology for water purification
please someone correct me if I'm wrong but I think one can use nanoparticles, specially silver nanoparticles for water treatment.
Damian
yes that's correct
Professor
I think
Professor
Nasa has use it in the 60's, copper as water purification in the moon travel.
Alexandre
nanocopper obvius
Alexandre
what is the stm
is there industrial application of fullrenes. What is the method to prepare fullrene on large scale.?
Rafiq
industrial application...? mmm I think on the medical side as drug carrier, but you should go deeper on your research, I may be wrong
Damian
How we are making nano material?
what is a peer
What is meant by 'nano scale'?
What is STMs full form?
LITNING
scanning tunneling microscope
Sahil
how nano science is used for hydrophobicity
Santosh
Do u think that Graphene and Fullrene fiber can be used to make Air Plane body structure the lightest and strongest. Rafiq
Rafiq
what is differents between GO and RGO?
Mahi
what is simplest way to understand the applications of nano robots used to detect the cancer affected cell of human body.? How this robot is carried to required site of body cell.? what will be the carrier material and how can be detected that correct delivery of drug is done Rafiq
Rafiq
if virus is killing to make ARTIFICIAL DNA OF GRAPHENE FOR KILLED THE VIRUS .THIS IS OUR ASSUMPTION
Anam
analytical skills graphene is prepared to kill any type viruses .
Anam
Any one who tell me about Preparation and application of Nanomaterial for drug Delivery
Hafiz
what is Nano technology ?
write examples of Nano molecule?
Bob
The nanotechnology is as new science, to scale nanometric
brayan
nanotechnology is the study, desing, synthesis, manipulation and application of materials and functional systems through control of matter at nanoscale
Damian
Is there any normative that regulates the use of silver nanoparticles?
what king of growth are you checking .?
Renato
What fields keep nano created devices from performing or assimulating ? Magnetic fields ? Are do they assimilate ?
why we need to study biomolecules, molecular biology in nanotechnology?
?
Kyle
yes I'm doing my masters in nanotechnology, we are being studying all these domains as well..
why?
what school?
Kyle
biomolecules are e building blocks of every organics and inorganic materials.
Joe
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