Mathematical diagram

Mathematical diagrams, such as charts and graphs, are

mainly designed to convey mathematical relationships—
for example, comparisons over time.[1]

Specific types of mathematical

diagrams

Argand diagram

A complex number can be visually represented as a pair of

numbers forming a vector on a diagram called an Argand
diagram The complex plane is sometimes called the
Argand plane because it is used in Argand diagrams.
These are named after Jean-Robert Argand (1768–1822),
although they were first described by Norwegian-Danish
land surveyor and mathematician Caspar Wessel (1745–
1818).[2] Argand diagrams are frequently used to plot the
positions of the poles and zeroes of a function in the
complex plane.
Euclid's Elements, ms. from Lüneburg, A.D.
The concept of the complex plane allows a geometric
1200
interpretation of complex numbers. Under addition, they
add like vectors. The multiplication of two complex
numbers can be expressed most easily in polar coordinates — the magnitude or
modulus of the product is the product of the two absolute values, or moduli, and the
angle or argument of the product is the sum of the two angles, or arguments. In
particular, multiplication by a complex number of modulus 1 acts as a rotation.

Butterfly diagram
Argand diagram.
In the context of fast Fourier transform algorithms, a
butterfly is a portion of the computation that combines the
results of smaller discrete Fourier transforms (DFTs) into a larger DFT, or vice
versa (breaking a larger DFT up into subtransforms). The name "butterfly" comes
from the shape of the data-flow diagram in the radix-2 case, as described below.
The same structure can also be found in the Viterbi algorithm, used for finding the
Butterfly diagram
most likely sequence of hidden states.
The butterfly diagram show a data-flow diagram connecting the inputs x (left) to the outputs y that depend
on them (right) for a "butterfly" step of a radix-2 Cooley–Tukey FFT algorithm. This diagram resembles a
butterfly as in the Morpho butterfly shown for comparison, hence the name.

Commutative diagram

In mathematics, and especially in category theory, a

commutative diagram is a diagram of objects, also
known as vertices, and morphisms, also known as
arrows or edges, such that when selecting two objects A commutative diagram depicting the five lemma
any directed path through the diagram leads to the
same result by composition.

Commutative diagrams play the role in category theory that equations play in algebra.

Hasse diagrams

A Hasse diagram is a simple picture of a finite partially ordered set, forming a

drawing of the partial order's transitive reduction. Concretely, one represents each
Hasse diagram.
element of the set as a vertex on the page and draws a line segment or curve that
goes upward from x to y precisely when x < y and there is no z such that x < z < y.
In this case, we say y covers x, or y is an immediate successor of x. In a Hasse
diagram, it is required that the curves be drawn so that each meets exactly two vertices: its two endpoints.
Any such diagram (given that the vertices are labeled) uniquely determines a partial order, and any partial
order has a unique transitive reduction, but there are many possible placements of elements in the plane,
resulting in different Hasse diagrams for a given order that may have widely varying appearances.

Knot diagrams

In Knot theory a useful way to visualise and manipulate knots is to project the knot
onto a plane—;think of the knot casting a shadow on the wall. A small perturbation
in the choice of projection will ensure that it is one-to-one except at the double
points, called crossings, where the "shadow" of the knot crosses itself once
transversely[3] Knot diagram.

At each crossing we must indicate which section is "over" and which is "under", so
as to be able to recreate the original knot. This is often done by creating a break in the strand going
underneath. If by following the diagram the knot alternately crosses itself "over" and "under", then the
diagram represents a particularly well-studied class of knot, alternating knots.

Venn diagram

A Venn diagram is a representation of mathematical sets: a mathematical diagram

representing sets as circles, with their relationships to each other expressed through
their overlapping positions, so that all possible relationships between the sets are
shown.[4]
Venn diagram.
The Venn diagram is constructed with a collection of simple closed curves drawn in the plane. 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.[5]

Voronoi diagram

A Voronoi diagram is a special kind of decomposition of a metric space determined

by distances to a specified discrete set of objects in the space, e.g., by a discrete set
Voronoi centerlines.
of points. This diagram is named after Georgy Voronoi, also called a Voronoi
tessellation, a Voronoi decomposition, or a Dirichlet tessellation after Peter Gustav
Lejeune Dirichlet.

In the simplest case, we are given a set of points S in the plane, which are the Voronoi sites. Each site s has
a Voronoi cell V(s) consisting of all points closer to s than to any other site. The segments of the Voronoi
diagram are all the points in the plane that are equidistant to two sites. The Voronoi nodes are the points
equidistant to three (or more) sites

Wallpaper group diagrams

A wallpaper group or plane symmetry group or plane crystallographic group is a

mathematical classification of a two-dimensional repetitive pattern, based on the
symmetries in the pattern. Such patterns occur frequently in architecture and
decorative art. There are 17 possible distinct groups.
Wallpaper group
Wallpaper groups are two-dimensional symmetry groups, intermediate in diagram.
complexity between the simpler frieze groups and the three-dimensional
crystallographic groups, also called space groups. Wallpaper groups categorize
patterns by their symmetries. Subtle differences may place similar patterns in different groups, while
patterns which are very different in style, color, scale or orientation may belong to the same group.

Young diagram

A Young diagram or Young tableau, also called Ferrers diagram, is a finite collection of boxes, or cells,
arranged in left-justified rows, with the row sizes weakly decreasing (each row has the same or shorter
length than its predecessor).

Listing the number of boxes in each row gives a partition of a positive integer n,
the total number of boxes of the diagram. The Young diagram is said to be of shape
, and it carries the same information as that partition. Listing the number of boxes
in each column gives another partition, the conjugate or transpose partition of ;
Young diagram.
one obtains a Young diagram of that shape by reflecting the original diagram along
its main diagonal.

Young tableaux were introduced by Alfred Young, a mathematician at Cambridge

University, in 1900. They were then applied to the study of symmetric group by Georg Frobenius in 1903.
Their theory was further developed by many mathematicians.
Other mathematical diagrams
Cremona diagram
De Finetti diagram
Dynkin diagram
Elementary diagram
Euler diagram
Stellation diagram
Ulam spiral
Van Kampen diagram
Taylor diagram

See also
Category theory
Logic diagram
Mathematical jargon
Mathematical model
Mathematics as a language
Mathematical visualization
Statistical model

References
1. Working with diagrams ([Link] at
LearningSpace.
2. Wessel's memoir was presented to the Danish Academy in 1797; Argand's paper was
published in 1806.
(Whittaker, Edmund Taylor; Watson, G.N. (1927). A Course of Modern Analysis: An
Introduction to the General Theory of Infinite Processes and of Analytic Functions, with an
Account of the Principal Transcendental Functions. Cambridge University Press. p. 9.
ISBN 978-0-521-58807-2.)
3. Rolfsen, Dale (1976). Knots and links ([Link]
J). Publish or Perish. ISBN 978-0-914098-16-4.
4. "Venn diagram" ([Link]
Archived ([Link]
861733754/Venn_diagram.html) 2009-11-07 at the Wayback Machine, Encarta World
English Dictionary, North American Edition 2007. Archived ([Link]
91107154423/[Link] 2009-11-
01.
5. Clarence Irving Lewis (1918). A Survey of Symbolic Logic ([Link]
ofsymboli00lewiuoft). Republished in part by Dover in 1960. p. 157.

Further reading
Barker-Plummer, Dave; Bailin, Sidney C. (1997). "The Role of Diagrams in Mathematical
Proofs". Machine Graphics and Vision. 6 (1): 25–56. CiteSeerX [Link].4712 ([Link]
 [Link]/viewdoc/summary?doi=[Link].4712). (Special Issue on Diagrammatic
Representation and Reasoning).
Barker-Plummer, Dave; Bailin, Sidney C. (2001). "On the practical semantics of
mathematical diagrams". In Anderson, M. (ed.). Reasoning with Diagrammatic
Representations. Springer Verlag. CiteSeerX [Link].9246 ([Link]
ewdoc/summary?doi=[Link].9246). ISBN 978-1-85233-242-6.
Kidman, G. (2002). "The Accuracy of mathematical diagrams in curriculum materials". In
Cockburn, A.; Nardi, E. (eds.). Proceedings of the PME 26. Vol. 3. University of East Anglia.
pp. 201–8.
Kulpa, Zenon (2004). "On Diagrammatic Representation of Mathematical Knowledge" (http
s://[Link]/books?id=j8bdlF8-2sIC&pg=PA191). In Andréa Asperti; Bancerek,
Grzegorz; Trybulec, Andrzej (eds.). Mathematical knowledge management: third
international conference, MKM 2004, Białowieża, Poland, September 19–21, 2004 :
Proceedings. Springer. pp. 191–204. ISBN 978-3-540-23029-8.
Puphaiboon, K.; Woodcock, A.; Scrivener, S. (25 March 2005). "Design method for
developing mathematical diagrams". In Bust, Philip D.; McCabe, P.T. (eds.). Contemporary
ergonomics 2005 Proceedings of the International Conference on Contemporary
Ergonomics (CE2005). Taylor & Francis. ISBN 978-0-415-37448-4.

External links
"Diagrams" ([Link] The Stanford
Encyclopedia of Philosophy. Fall 2008.
Kulpa, Zenon. "Diagrammatics: The art of thinking with diagrams" ([Link]
eb/20130425225258/[Link] Archived from the original (ht
tp://[Link]/~zkulpa/diagrams/) on April 25, 2013.
One of the oldest extant diagrams from Euclid ([Link]
[Link]) by Otto Neugebauer
Lomas, Dennis (1998). "Diagrams in Mathematical Education: A Philosophical Appraisal" (ht
tps://[Link]/web/20110721195349/[Link]
8/[Link]). Philosophy of Education Society. Archived from the original ([Link]
[Link]/eps/PES-Yearbook/1998/[Link]) on 2011.

Retrieved from "[Link]