Misplaced Pages

Part of a series on statistics
Probability theory
Probability Axioms Determinism System Indeterminism Randomness
Probability space Sample space Event Collectively exhaustive events Elementary event Mutual exclusivity Outcome Singleton Experiment Bernoulli trial Probability distribution Bernoulli distribution Binomial distribution Exponential distribution Normal distribution Pareto distribution Poisson distribution Probability measure Random variable Bernoulli process Continuous or discrete Expected value Variance Markov chain Observed value Random walk Stochastic process
Complementary event Joint probability Marginal probability Conditional probability
Independence Conditional independence Law of total probability Law of large numbers Bayes' theorem Boole's inequality
Venn diagram Tree diagram
v t e

A Venn diagram is a widely used diagram style that shows the logical relation between sets, popularized by John Venn (1834–1923) in the 1880s. The diagrams are used to teach elementary set theory, and to illustrate simple set relationships in probability, logic, statistics, linguistics and computer science. A Venn diagram uses simple closed curves drawn on a plane to represent sets. Very often, these curves are circles or ellipses.

Similar ideas had been proposed before Venn such as by Christian Weise in 1712 (Nucleus Logicoe Wiesianoe) and Leonhard Euler (Letters to a German Princess) in 1768. The idea was popularised by Venn in Symbolic Logic, Chapter V "Diagrammatic Representation", published in 1881.

Details

A Venn diagram, also called a set diagram or logic diagram, shows all possible logical relations between a finite collection of different sets. These diagrams depict elements as points in the plane, and sets as regions inside closed curves. A Venn diagram consists of multiple overlapping closed curves, usually circles, each representing a set. The points inside a curve labelled S represent elements of the set S, while points outside the boundary represent elements not in the set S. This lends itself to intuitive visualizations; for example, the set of all elements that are members of both sets S and T, denoted S ∩ T and read "the intersection of S and T", is represented visually by the area of overlap of the regions S and T.

In Venn diagrams, the curves are overlapped in every possible way, showing all possible relations between the sets. They are thus a special case of Euler diagrams, which do not necessarily show all relations. Venn diagrams were conceived around 1880 by John Venn. They are used to teach elementary set theory, as well as illustrate simple set relationships in probability, logic, statistics, linguistics, and computer science.

A Venn diagram in which the area of each shape is proportional to the number of elements it contains is called an area-proportional (or scaled) Venn diagram.

Example

This example involves two sets of creatures, represented here as colored circles. The orange circle represents all types of creatures that have two legs. The blue circle represents creatures that can fly. Each separate type of creature can be imagined as a point somewhere in the diagram. Living creatures that have two legs and can fly—for example, parrots—are then in both sets, so they correspond to points in the region where the blue and orange circles overlap. This overlapping region would only contain those elements (in this example, creatures) that are members of both the orange set (two-legged creatures) and the blue set (flying creatures).

Humans and penguins are bipedal, and so are in the orange circle, but since they cannot fly, they appear in the left part of the orange circle, where it does not overlap with the blue circle. Mosquitoes can fly, but have six, not two, legs, so the point for mosquitoes is in the part of the blue circle that does not overlap with the orange one. Creatures that are neither two-legged nor able to fly (for example, whales and spiders) would all be represented by points outside both circles.

The combined region of the two sets is called their union, denoted by A ∪ B, where A is the orange circle and B the blue. The union in this case contains all living creatures that either are two-legged or can fly (or both). The region included in both A and B, where the two sets overlap, is called the intersection of A and B, denoted by A ∩ B.

History

Venn diagrams were introduced in 1880 by John Venn in a paper entitled "On the Diagrammatic and Mechanical Representation of Propositions and Reasonings" in the Philosophical Magazine and Journal of Science, about the different ways to represent propositions by diagrams. The use of these types of diagrams in formal logic, according to Frank Ruskey and Mark Weston, predates Venn but are "rightly associated" with him as he "comprehensively surveyed and formalized their usage, and was the first to generalize them".

Diagrams of overlapping circles representing unions and intersections were introduced by Catalan philosopher Ramon Llull (c. 1232–1315/1316) in the 13th century, who used them to illustrate combinations of basic principles. Gottfried Wilhelm Leibniz (1646–1716) produced similar diagrams in the 17th century (though much of this work was unpublished), as did Johann Christian Lange in a work from 1712 describing Christian Weise's contributions to logic. Euler diagrams, which are similar to Venn diagrams but don't necessarily contain all possible unions and intersections, were first made prominent by mathematician Leonhard Euler in the 18th century.

Venn did not use the term "Venn diagram" and referred to the concept as "Eulerian Circles". He became acquainted with Euler diagrams in 1862 and wrote that Venn diagrams did not occur to him "till much later", while attempting to adapt Euler diagrams to Boolean logic. In the opening sentence of his 1880 article Venn wrote that Euler diagrams were the only diagrammatic representation of logic to gain "any general acceptance".

Venn viewed his diagrams as a pedagogical tool, analogous to verification of physical concepts through experiment. As an example of their applications, he noted that a three-set diagram could show the syllogism: 'All A is some B. No B is any C. Hence, no A is any C.'

Charles L. Dodgson (Lewis Carroll) includes "Venn's Method of Diagrams" as well as "Euler's Method of Diagrams" in an "Appendix, Addressed to Teachers" of his book Symbolic Logic (4th edition published in 1896). The term "Venn diagram" was later used by Clarence Irving Lewis in 1918, in his book A Survey of Symbolic Logic.

In the 20th century, Venn diagrams were further developed. David Wilson Henderson showed, in 1963, that the existence of an n-Venn diagram with n-fold rotational symmetry implied that n was a prime number. He also showed that such symmetric Venn diagrams exist when n is five or seven. In 2002, Peter Hamburger found symmetric Venn diagrams for n = 11 and in 2003, Griggs, Killian, and Savage showed that symmetric Venn diagrams exist for all other primes. These combined results show that rotationally symmetric Venn diagrams exist, if and only if n is a prime number.

Venn diagrams and Euler diagrams were incorporated as part of instruction in set theory, as part of the new math movement in the 1960s. Since then, they have also been adopted in the curriculum of other fields such as reading.

Popular culture

Venn diagrams have been commonly used in memes. At least one politician has been mocked for misusing Venn diagrams.

Overview

• Intersection of two sets ${\displaystyle ~A\cap B}$
• Union of two sets ${\displaystyle ~A\cup B}$
• Symmetric difference of two sets ${\displaystyle A~\triangle ~B}$
• Relative complement of A (left) in B (right) ${\displaystyle A^{c}\cap B~=~B\setminus A}$
• Absolute complement of A in U ${\displaystyle A^{c}~=~U\setminus A}$

A Venn diagram is constructed with a collection of simple closed curves drawn in a plane. According to Lewis, the "principle of these diagrams is that classes be represented by regions in such relation to one another that all the possible logical relations of these classes can be indicated in the same diagram. That is, the diagram initially leaves room for any possible relation of the classes, and the actual or given relation, can then be specified by indicating that some particular region is null or is not-null".

Venn diagrams normally comprise overlapping circles. The interior of the circle symbolically represents the elements of the set, while the exterior represents elements that are not members of the set. For instance, in a two-set Venn diagram, one circle may represent the group of all wooden objects, while the other circle may represent the set of all tables. The overlapping region, or intersection, would then represent the set of all wooden tables. Shapes other than circles can be employed as shown below by Venn's own higher set diagrams. Venn diagrams do not generally contain information on the relative or absolute sizes (cardinality) of sets. That is, they are schematic diagrams generally not drawn to scale.

Venn diagrams are similar to Euler diagrams. However, a Venn diagram for n component sets must contain all 2 hypothetically possible zones, that correspond to some combination of inclusion or exclusion in each of the component sets. Euler diagrams contain only the actually possible zones in a given context. In Venn diagrams, a shaded zone may represent an empty zone, whereas in an Euler diagram, the corresponding zone is missing from the diagram. For example, if one set represents dairy products and another cheeses, the Venn diagram contains a zone for cheeses that are not dairy products. Assuming that in the context cheese means some type of dairy product, the Euler diagram has the cheese zone entirely contained within the dairy-product zone—there is no zone for (non-existent) non-dairy cheese. This means that as the number of contours increases, Euler diagrams are typically less visually complex than the equivalent Venn diagram, particularly if the number of non-empty intersections is small.

The difference between Euler and Venn diagrams can be seen in the following example. Take the three sets:

• ${\displaystyle A=\{1,\,2,\,5\}}$
• ${\displaystyle B=\{1,\,6\}}$
• ${\displaystyle C=\{4,\,7\}}$

The Euler and the Venn diagram of those sets are:

• Euler diagram
• Venn diagram

Extensions to higher numbers of sets

Venn diagrams typically represent two or three sets, but there are forms that allow for higher numbers. Shown below, four intersecting spheres form the highest order Venn diagram that has the symmetry of a simplex and can be visually represented. The 16 intersections correspond to the vertices of a tesseract (or the cells of a 16-cell, respectively).

For higher numbers of sets, some loss of symmetry in the diagrams is unavoidable. Venn was keen to find "symmetrical figures ... elegant in themselves," that represented higher numbers of sets, and he devised an elegant four-set diagram using ellipses (see below). He also gave a construction for Venn diagrams for any number of sets, where each successive curve that delimits a set interleaves with previous curves, starting with the three-circle diagram.

• Venn's construction for four sets (use Gray code to compute, the digit 1 means in the set, and the digit 0 means not in the set)
• Venn's construction for five sets
• Venn's construction for six sets
• Venn's four-set diagram using ellipses
• Non-example: This Euler diagram is not a Venn diagram for four sets as it has only 14 regions as opposed to 2 = 16 regions (including the white region); there is no region where only the yellow and blue, or only the red and green circles meet.
• Five-set Venn diagram using congruent ellipses in a five-fold rotationally symmetrical arrangement devised by Branko Grünbaum. Labels have been simplified for greater readability; for example, A denotes A ∩ B ∩ C ∩ D ∩ E, while BCE denotes A ∩ B ∩ C ∩ D ∩ E.
• Six-set Venn diagram made of only triangles (interactive version)

Edwards–Venn diagrams

• Three sets
• Four sets
• Five sets
• Six sets

Anthony William Fairbank Edwards constructed a series of Venn diagrams for higher numbers of sets by segmenting the surface of a sphere, which became known as Edwards–Venn diagrams. For example, three sets can be easily represented by taking three hemispheres of the sphere at right angles (x = 0, y = 0 and z = 0). A fourth set can be added to the representation, by taking a curve similar to the seam on a tennis ball, which winds up and down around the equator, and so on. The resulting sets can then be projected back to a plane, to give cogwheel diagrams with increasing numbers of teeth—as shown here. These diagrams were devised while designing a stained-glass window in memory of Venn.

Other diagrams

Edwards–Venn diagrams are topologically equivalent to diagrams devised by Branko Grünbaum, which were based around intersecting polygons with increasing numbers of sides. They are also two-dimensional representations of hypercubes.

Henry John Stephen Smith devised similar n-set diagrams using sine curves with the series of equations $${\displaystyle y_{i}={\frac {\sin \left(2^{i}x\right)}{2^{i}}}{\text{ where }}0\leq i\leq n-1{\text{ and }}i\in \mathbb {N} .}$$

Charles Lutwidge Dodgson (also known as Lewis Carroll) devised a five-set diagram known as Carroll's square. Joaquin and Boyles, on the other hand, proposed supplemental rules for the standard Venn diagram, in order to account for certain problem cases. For instance, regarding the issue of representing singular statements, they suggest to consider the Venn diagram circle as a representation of a set of things, and use first-order logic and set theory to treat categorical statements as statements about sets. Additionally, they propose to treat singular statements as statements about set membership. So, for example, to represent the statement "a is F" in this retooled Venn diagram, a small letter "a" may be placed inside the circle that represents the set F.

Related concepts

Venn diagrams correspond to truth tables for the propositions ${\displaystyle x\in A}$, ${\displaystyle x\in B}$, etc., in the sense that each region of Venn diagram corresponds to one row of the truth table. This type is also known as Johnston diagram. Another way of representing sets is with John F. Randolph's R-diagrams.

See also

• Existential graph (by Charles Sanders Peirce)
• Logical connectives
• Information diagram
• Marquand diagram (and as further derivation Veitch chart and Karnaugh map)
• Spherical octahedron – A stereographic projection of a regular octahedron makes a three-set Venn diagram, as three orthogonal great circles, each dividing space into two halves.
• Stanhope Demonstrator
• Three circles model
• Triquetra
• Vesica piscis
• UpSet plot

Notes

1. In Euler's Lettres à une princesse d'Allemagne sur divers sujets de physique et de philosophie (Saint Petersburg, Russia: l'Academie Impériale des Sciences, 1768), volume 2, pages 95-126. In Venn's article, however, he suggests that the diagrammatic idea predates Euler, and is attributable to Christian Weise or Johann Christian Lange (in Lange's book Nucleus Logicae Weisianae (1712)).

References

1. "Intersection of Sets". web.mnstate.edu. Archived from the original on 2020-08-04. Retrieved 2020-09-05.
2. Venn, John. "On the Diagrammatic and Mechanical Representation of Propositions and Reasonings" (PDF). Penn Engineering.
3. "The Philosophical Magazine: A Journal of Theoretical Experimental and Applied Physics". Taylor & Francis. Retrieved 2021-08-06.
4. ^ Venn, John (July 1880). "I. On the Diagrammatic and Mechanical Representation of Propositions and Reasonings" (PDF). The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science. 5. 10 (59): 1–18. doi:10.1080/14786448008626877. Archived (PDF) from the original on 2017-05-16.
5. ^ Venn, John (1880). "On the employment of geometrical diagrams for the sensible representations of logical propositions". Proceedings of the Cambridge Philosophical Society. 4: 47–59.
6. ^ Sandifer, Ed (2003). "How Euler Did It" (PDF). MAA Online. The Mathematical Association of America (MAA). Retrieved 2009-10-26.
7. ^ Ruskey, Frank; Weston, Mark (2005-06-18). "A Survey of Venn Diagrams". The Electronic Journal of Combinatorics.
8. ^ Baron, Margaret E. (May 1969). "A Note on The Historical Development of Logic Diagrams". The Mathematical Gazette. 53 (384): 113–125. doi:10.2307/3614533. JSTOR 3614533. S2CID 125364002.
9. Leibniz, Gottfried Wilhelm (1903) . "De Formae Logicae per linearum ductus". In Couturat, Louis (ed.). Opuscules et fragmentes inedits de Leibniz (in Latin). pp. 292–321.
10. ^ Venn, John (1881). Symbolic logic. Macmillan. p. 108. Retrieved 2013-04-09.
11. Mac Queen, Gailand (October 1967). The Logic Diagram (PDF) (Thesis). McMaster University. Archived from the original (PDF) on 2017-04-14. Retrieved 2017-04-14. (NB. Has a detailed history of the evolution of logic diagrams including but not limited to the Venn diagram.)
12. ^ Verburgt, Lukas M. (April 2023). "The Venn Behind the Diagram". Mathematics Today. Vol. 59, no. 2. Institute of Mathematics and its Applications. pp. 53–55.
13. ^ Lewis, Clarence Irving (1918). A Survey of Symbolic Logic. Berkeley: University of California Press.
14. Henderson, David Wilson (April 1963). "Venn diagrams for more than four classes". American Mathematical Monthly. 70 (4): 424–426. doi:10.2307/2311865. JSTOR 2311865.
15. Ruskey, Frank; Savage, Carla D.; Wagon, Stan (December 2006). "The Search for Simple Symmetric Venn Diagrams" (PDF). Notices of the AMS. 53 (11): 1304–1311.
16. "Strategies for Reading Comprehension Venn Diagrams". Archived from the original on 2009-04-29. Retrieved 2009-06-20.
17. Leo, Alex (2010-03-18). "Jesus, Karaoke, And Serial Killers: The Funniest Venn Diagrams The Web Has To Offer". Huffpost. Retrieved 2024-10-02.
18. Moran, Lee (2018-12-15). "Scott Walker Gets Mercilessly Mocked By Twitter Users Over Venn Diagram Fail". HuffPost. Retrieved 2024-10-02.
19. Weisstein, Eric W. "Venn Diagram". mathworld.wolfram.com. Retrieved 2020-09-05.
20. "Euler Diagrams 2004: Brighton, UK: September 22–23". Reasoning with Diagrams project, University of Kent. 2004. Retrieved 2008-08-13.
21. ^ Edwards, Anthony William Fairbank (2004). Cogwheels of the Mind: The Story of Venn Diagrams. Baltimore, Maryland, USA: Johns Hopkins University Press. p. 65. ISBN 978-0-8018-7434-5..
22. Joaquin, Jeremiah Joven; Boyles, Robert James M. (June 2017). "Teaching Syllogistic Logic via a Retooled Venn Diagrammatical Technique". Teaching Philosophy. 40 (2): 161–180. doi:10.5840/teachphil201771767. Archived from the original on 2018-11-21. Retrieved 2020-05-12.
23. Grimaldi, Ralph P. (2004). Discrete and combinatorial mathematics. Boston: Addison-Wesley. p. 143. ISBN 978-0-201-72634-3.
24. Johnson, David L. (2001). "3.3 Laws". Elements of logic via numbers and sets. Springer Undergraduate Mathematics Series. Berlin, Germany: Springer-Verlag. p. 62. ISBN 978-3-540-76123-5.

Further reading

• Mahmoodian, Ebadollah S.; Rezaie, M.; Vatan, F. (March 1987). "Generalization of Venn Diagram" (PDF). Eighteenth Annual Iranian Mathematics Conference. Tehran and Isfahan, Iran. Archived from the original (PDF) on 2017-05-01. Retrieved 2017-05-01.
• Edwards, Anthony William Fairbank (1989-01-07). "Venn diagrams for many sets". New Scientist. 121 (1646): 51–56.
• Watkinson, John (1990). "4.10. Hamming distance". Coding for Digital Recording. Stoneham, MA, USA: Focal Press. pp. 94–99, foldout in backsleeve. ISBN 978-0-240-51293-8. (NB. The book comes with a 3-page foldout of a seven-bit cylindrical Venn diagram.)
• Stewart, Ian (June 2003) . "Chapter 4. Cogwheels of the Mind". Another Fine Math You've Got Me Into (reprint of 1st ed.). Mineola, New York, USA: Dover Publications, Inc. (W. H. Freeman). pp. 51–64. ISBN 978-0-486-43181-9.
• Glassner, Andrew (2004). "Venn and Now". Morphs, Mallards, and Montages: Computer-Aided Imagination. Wellesley, MA, USA: A. K. Peters. pp. 161–184. ISBN 978-1568812311.
• Mamakani, Khalegh; Ruskey, Frank (2012-07-27). "A New Rose: The First Simple Symmetric 11-Venn Diagram". p. 6452. arXiv:1207.6452. Bibcode:2012arXiv1207.6452M. Archived from the original on 2017-05-01. Retrieved 2017-05-01.

External links

• "Venn diagram", Encyclopedia of Mathematics, EMS Press, 2001
• Lewis Carroll's Logic Game – Venn vs. Euler at Cut-the-knot
• Six sets Venn diagrams made from triangles
• Interactive seven sets Venn diagram
• VBVenn, a free open source program for calculating and graphing quantitative two-circle Venn diagrams
• InteractiVenn, a web-based tool for visualizing Venn diagrams
• DeepVenn, a tool for creating area-proportional Venn Diagrams

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

v t e Diagrams in logic
Venn diagram Square of opposition Porphyrian tree Karnaugh map Binary decision diagram Propositional directed acyclic graph Sentential decision diagram Truth table Sequent calculus Method of analytic tableaux

• Graphical concepts in set theory
• Diagrams
• Statistical charts and diagrams
• Logical diagrams