(mathematics) A diagram consisting of closed curves, used to represent relations between logical propositions or sets; similar to a Venn diagram.
| Sci-Tech Dictionary: Euler diagram |
(mathematics) A diagram consisting of closed curves, used to represent relations between logical propositions or sets; similar to a Venn diagram.
| 5min Related Video: Euler diagram |
| Wikipedia: Euler diagram |
An Euler diagram is a diagrammatic means of representing sets and their relationships. It is the modern manifestation of an Euler circle, which was invented by Leonhard Euler in the 18th century.
Venn 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 by other curriculum fields such as reading. [1]
Contents |
Euler diagrams usually consist of simple closed curves in the plane which are used to depict sets. The spatial relationships between the curves (overlap, containment or neither) corresponds to set-theoretic relationships (intersection, subset and disjointness).
Euler diagrams discriminate the well-known Venn diagrams which represent all possible set intersections available with the given sets.
The intersection of the interior of a collection of curves and the exterior of the rest of the curves in the diagrams is called a zone. Thus, in Venn diagrams all zones must be present (given the set of curves), but in an Euler diagram some zones might be missing.
In a logical setting, one can use model theoretic semantics to interpret Euler diagrams, within a universe of discourse. In the examples above, the Euler diagram depicts that the sets Animal and Mineral are disjoint since the corresponding curves are disjoint, and also that the set Four Legs is a subset of the set of Animals. The Venn diagram which uses the same categories of Animal, Mineral and Four Legs does not encapsulate these relationships. Traditionally the emptiness of a set in Venn diagrams is depicted by shading in the region. Euler diagrams represent emptiness either by shading or by the use of a missing zone.
Often a set of well-formedness conditions are imposed; these are topological or geometric constraints imposed on the structure of the diagram. For example, connectedness of zones might be enforced, or concurrency of curves or multiple points might be banned, as might tangential intersection of curves. In the diagram below, examples of small Venn diagrams are transformed into Euler diagrams by sequences of transformations; some of the intermediate diagrams have concurrency of curves. However, this sort of transformation of a Venn diagram with shading into an Euler diagram without shading is not always possible. There are examples of Euler diagrams with 9 sets which are not drawable using simple closed curves without the creation of unwanted zones since they would have to have non-planar dual graphs.
William Hamilton (1805-1865) in his 1860 asserts that the original use of circles to "sensualize ... the abstractions of Logic" (p. 180) was not Leonhard Paul Euler (1707-1783) but rather Christian Weise (?-1708) in his Nucleus Logicoe Weisianoe that appeared in 1712 posthumously. He references Euler's Letters to a German Princess on different Matters of Physics and Philosophy1" [1Partie ii., Lettre XXXV., ed. Cournot. --ED.][2]
The four forms of the syllogism as symbolized by the drawings A, E, I and O are[3]:
In his 1881 Symbolic Logic Chapter V "Diagrammatic Representation", John Venn (1834-1923) comments on the remarkable prevalence of the Euler diagram:
But nevertheless, he contended "the inapplicability of this scheme for the purposes of a really general Logic" (page 100) and in a footnote observed that "it fits in but badly even with the four propositions of the common Logic [the four forms of the syllogism] to which it is normally applied" (page 101). Venn ends his chapter with the observation that will be made in the examples below -- that their use is based on practice and intuition, not on a strict algorithmic practice:
Finally, in his Chapter XX HISTORIC NOTES Venn gets to a crucial criticism (italicized in the quote below); observe in Hamilton's illustration that the O (Particular Negative) and I (Particular Affirmative) are simply rotated:
(Sandifer 2003 reports that Euler makes such observations too; Euler reports that his figure 45 (a simple intersection of two circles) has 4 different interpretations). Whatever the case, armed with these observations and criticisms, Venn then demonstrates (pp. 100-125) how he derived what has become known as his Venn diagrams from the "old-fashioned Euler diagrams". In particular he gives an example, shown on the left.
By 1914 Louis Couturat (1968-1914) had labeled the terms as shown on the drawing on the right. Moreover, he had labeled the exterior region (shown as a'b'c') as well. He succinctly explains how to use the diagram -- one must strike out the regions that are to vanish:
Given the Venn's assignments, then, the unshaded areas can be summed to yield the following equation for Venn's example:
In Venn nowhere does is the 0th term x'y'z' appear i.e. the background surrounding the circles, discussed or labeled. But Couturat corrects this in his drawing.
Couturat now observes that, in a direct algorithmic (formal, systematic) manner, one cannot derive reduced" Boolean equations, nor does it show how to arrive at the conclusion "No X is Z". Couturat concluded that the process "has ... serious inconveniences as a method for solving logical problems":
Thus the matter would rest until 1952 when Maurice Karnaugh (1924- ) would adapt and expand a method proposed by Edward W. Veitch; this work would rely on the truth table method precisely defined in Emil Post's 1921 PhD thesis "Introduction to a general theory of elementary propositions" and the application of propositional logic to switching logic by Claude Shannon, George Stibitz, and Alan Turing[4]. In chapter "Boolean Algebra" Hill and Peterson (1968, 1964) present sections 4.5ff "Set Theory as an Example of Boolean Algebra" and in it they present the Venn diagram with shading and all. They give examples of Venn diagrams to solve example switching-circuit problems, but end up with this statement:
In Chapter 6, section 6.4 "Karnaugh Map Representation of Boolean Functions" they begin with:
The history of Karnaugh's development of his "chart" or "map" method is obscure. Karnaugh in his 1953 referenced Veitch 1951, Veitch referenced Claude E. Shannon 1938 (essentially Shannon's Master's thesis at M.I.T.), and Shannon in turn referenced, among other authors of logic texts, Couturat 1914. In Veitch's method the variables are arranged in a rectangle or square; as described in Karnaugh map, Karnaugh in his method changed the order of the variables to correspond to what has become known as (the vertices of) a hypercube.
--work in progress-- In the illustration and table the following logical symbols are used:
Given a proposed conclusion such as "No X is a Z", one can demonstrate using a truth table that given the two propositions "No Y is a Z" and "If an X then a Y", a reduction to "No X is a Z" yields a tautology -- a formula yielding "true" (shown as 1's in these examples) for all evaluations of its propositional variables (e.g. x, y, z valued at {0, 1} in all combinations):
One can abbreviate this as follows:
So now the formula can be abbreviated to:
Given the tautology, the stage is now set to use modus ponens to deduce that indeed "No x is a Z". The modus ponens "detaches" the conclusion from the premises, both of which must be true: The tautology is true as demonstrated, and only the evaluation from row of P that corresponds to row 7 of the truth table where x, y and z are true is allowed -- this row evaluates to "true" as well[5].
16 possible deductions exist, one of which is that "No X is a Z". Observe that on the right of the following truth table, the column under NOT (signified by the symbol " ~ ") has the same 1's that appear in the bold-faced column under the left &.
| Square # | Venn, Karnaugh region | x | y | z | (~ | (y | & | z) | & | (x | → | y)) | → | (~ | (x | & | z)) | ||
| 0 | x'y'z' | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | ||
| 1 | x'y'z | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | ||
| 2 | x'yz' | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | ||
| 3 | x'yz | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | ||
| 4 | xy'z' | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | ||
| 5 | xy'z | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | ||
| 6 | xyz' | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | ||
| 7 | xyz | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
-- Explanation of example needs work. Other deductions are possible (16 total). End with some examples. --
|
Examples of small Venn diagrams with shaded regions representing empty sets that are easily transformed into Euler diagrams. |
Example of an Euler diagram visualizing a real situation, the relationships between various supranational European organisations. |
By date of publishing:
| Wikimedia Commons has media related to: Euler diagrams |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
| Euler circle | |
| Spider diagram | |
| Venn diagram |
| What is Euler's rule? Read answer... | |
| What is euler's formula? Read answer... | |
| When was Euler born? Read answer... |
Copyrights:
![]() | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more | |
![]() | Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Euler diagram". Read more |