Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Mutual exclusivity
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Two propositions or events that cannot both be true}} {{About|logical exclusivity of events and propositions|the concept in concurrent computing|Mutual exclusion|the concept in developmental psychology|Mutual exclusivity (psychology)}} {{More footnotes needed|date=October 2009}} {{Probability fundamentals}} In [[logic]] and [[probability theory]], two events (or propositions) are '''mutually exclusive''' or '''disjoint''' if they cannot both occur at the same time. A clear example is the set of outcomes of a single coin toss, which can result in either heads or tails, but not both. In the coin-tossing example, both outcomes are, in theory, [[Collectively exhaustive events|collectively exhaustive]], which means that at least one of the outcomes must happen, so these two possibilities together exhaust all the possibilities.<ref>{{cite book |last=Miller |first=Scott |first2=Donald |last2=Childers |title=Probability and Random Processes |publisher=Academic Press |edition=Second |year=2012 |page=8 |isbn=978-0-12-386981-4 |quote=The sample space is the collection or set of 'all possible' distinct (collectively exhaustive and mutually exclusive) outcomes of an experiment. }}</ref> However, not all mutually exclusive events are collectively exhaustive. For example, the outcomes 1 and 4 of a single roll of a [[six-sided die]] are mutually exclusive (both cannot happen at the same time) but not collectively exhaustive (there are other possible outcomes; 2,3,5,6).
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)