Best Answer

I asked this question so someone please help me in this question?

Q: What is the definition of disjoint events?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

Multiply the possible outcomes of the events in the disjoint events

Two events are disjoint if they cannot occur together. In set terms, their intersection is a null set.

No.

Complements or complementary events

Two sets are said to be "disjoint" if they have no common element - their intersection is the empty set. As far as I know, "joint" is NOT used in the sense of the opposite of disjoint, i.e., "not disjoint".

Related questions

Multiply the possible outcomes of the events in the disjoint events

Two events are disjoint if they cannot occur together. In set terms, their intersection is a null set.

No.

no

In probability theory, disjoint events are two (or more) events where more than one cannot occur in the same trial. It is possible that none of them occur in a particular trial.

Complements or complementary events

Yes, by definition a sigma field is closed under countable unions. Since countable disjoint unions are countable unions this is true directly by the definition. See http://en.wikipedia.org/wiki/Sigma-algebra.

Yes,Because not all disjoint no equivalent other have disjoint and equivalent

ExplanationFormally, two sets A and B are disjoint if their intersection is the empty set, i.e. if This definition extends to any collection of sets. A collection of sets is pairwise disjoint or mutually disjoint if, given any two sets in the collection, those two sets are disjoint.Formally, let I be an index set, and for each i in I, let Ai be a set. Then the family of sets {Ai : i ∈ I} is pairwise disjoint if for any i and j in I with i ≠ j,For example, the collection of sets { {1}, {2}, {3}, ... } is pairwise disjoint. If {Ai} is a pairwise disjoint collection (containing at least two sets), then clearly its intersection is empty:However, the converse is not true: the intersection of the collection {{1, 2}, {2, 3}, {3, 1}} is empty, but the collection is not pairwise disjoint. In fact, there are no two disjoint sets in this collection.A partition of a set X is any collection of non-empty subsets {Ai : i ∈ I} of X such that {Ai} are pairwise disjoint andSets that are not the same.

If two events are disjoint, they cannot occur at the same time. For example, if you flip a coin, you cannot get heads AND tails. Since A and B are disjoint, P(A and B) = 0 If A and B were independent, then P(A and B) = 0.4*0.5=0.2. For example, the chances you throw a dice and it lands on 1 AND the chances you flip a coin and it land on heads. These events are independent...the outcome of one event does not affect the outcome of the other.

Not necessarily. For a counterexample, A and C could be the same set.

Two sets are said to be "disjoint" if they have no common element - their intersection is the empty set. As far as I know, "joint" is NOT used in the sense of the opposite of disjoint, i.e., "not disjoint".