Technique
Range of a three-set union when the triple overlap is unknown
Algebra • Sets
Statement
Let , with the three sizes and the three pairwise intersections known. Then . Each of the seven Venn regions, written in terms of , must be at least . Those conditions give the possible values of ; the union is least at the least and greatest at the greatest .
How to use it
- 1Why it works: a region of a Venn diagram counts people, so it can never be negative.
- 2Exactly two: , so is at most the smallest pairwise intersection.
- 3Only one: ; this can give a least value of above .
- 4The union goes up by when goes up by .
Worked example
, , , , , . Find the least and greatest .
Step-by-step
- 1
Why: Write the union in terms of the unknown triple overlap .
- 2Exactly two:
, so . Why: No region may be negative.
- 3Only one:
hold for every . Why: These give no extra limit here, so .
Answer
Least , greatest .
Watch out
Check the 'only one' regions too: they can force above .
Builds on
Also known as
minimum and maximum of a union of three sets, Venn diagram regions non-negative