In
geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician w ...
, Monsky's theorem states that it is not possible to dissect a
square
In geometry, a square is a regular polygon, regular quadrilateral. It has four straight sides of equal length and four equal angles. Squares are special cases of rectangles, which have four equal angles, and of rhombuses, which have four equal si ...
into an odd number of
triangle
A triangle is a polygon with three corners and three sides, one of the basic shapes in geometry. The corners, also called ''vertices'', are zero-dimensional points while the sides connecting them, also called ''edges'', are one-dimension ...
s of equal area. In other words, a square does not have an odd
equidissection
In geometry, an equidissection is a partition of a polygon into triangles of equal area. The study of equidissections began in the late 1960s with Monsky's theorem, which states that a square cannot be equidissected into an odd number of trian ...
.
The problem was posed by Fred Richman in the ''
American Mathematical Monthly
''The American Mathematical Monthly'' is a peer-reviewed scientific journal of mathematics. It was established by Benjamin Finkel in 1894 and is published by Taylor & Francis on behalf of the Mathematical Association of America. It is an exposi ...
'' in 1965 and was proved by
Paul Monsky in 1970.
Proof

Monsky's proof combines
combinatorial
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many ...
and
algebra
Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic ope ...
ic techniques and in outline is as follows:
# Take the square to be the unit square with vertices at (0, 0), (0, 1), (1, 0) and (1, 1). If there is a dissection into ''n'' triangles of equal area, then the area of each triangle is 1/''n''.
# Colour each point in the square with one of three colours, depending on the
2-adic valuation of its coordinates.
# Show that a straight line can contain points of only two colours.
# Use
Sperner's lemma
In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an ...
to show that every
triangulation
In trigonometry and geometry, triangulation is the process of determining the location of a point by forming triangles to the point from known points.
Applications
In surveying
Specifically in surveying, triangulation involves only angle m ...
of the square into triangles meeting edge-to-edge must contain at least one triangle whose vertices have three different colours.
# Conclude from the straight-line property that a tricolored triangle must also exist in every dissection of the square into triangles, not necessarily meeting edge-to-edge.
# Use Cartesian geometry to show that the 2-adic valuation of the area of a triangle whose vertices have three different colours is greater than 1. So every dissection of the square into triangles must contain at least one triangle whose area has a 2-adic valuation greater than 1.
# If ''n'' is odd, then the 2-adic valuation of 1/''n'' is 1, so it is impossible to dissect the square into triangles all of which have area 1/''n''.
Optimal dissections
By Monsky's theorem, it is necessary to have triangles with different areas to dissect a square into an odd number of triangles.
Lower bound
In mathematics, particularly in order theory, an upper bound or majorant of a subset of some preordered set is an element of that is every element of .
Dually, a lower bound or minorant of is defined to be an element of that is less th ...
s for the area differences that must occur to dissect a square into an odd numbers of triangles and the optimal dissections have been studied.
Generalizations
Because
affine transformation
In Euclidean geometry, an affine transformation or affinity (from the Latin, '' affinis'', "connected with") is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles.
More general ...
s preserve equidissections, it follows more generally that
parallelogram
In Euclidean geometry, a parallelogram is a simple polygon, simple (non-list of self-intersecting polygons, self-intersecting) quadrilateral with two pairs of Parallel (geometry), parallel sides. The opposite or facing sides of a parallelogram a ...
s (the affine images of squares) also do not have odd equidissections.
Centrally symmetric
In geometry, a point reflection (also called a point inversion or central inversion) is a geometric transformation of affine space in which every point is reflected across a designated inversion center, which remains fixed. In Euclidean or ...
polygons, more generally, do not have odd equidissections, nor do
polyomino
A polyomino is a plane geometric figure formed by joining one or more equal squares edge to edge. It is a polyform whose cells are squares. It may be regarded as a finite subset of the regular square tiling.
Polyominoes have been used in popu ...
s.
[
The theorem can be generalized to higher dimensions: an ''n''-dimensional ]hypercube
In geometry, a hypercube is an ''n''-dimensional analogue of a square ( ) and a cube ( ); the special case for is known as a ''tesseract''. It is a closed, compact, convex figure whose 1- skeleton consists of groups of opposite parallel l ...
can only be divided into simplices
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. ...
of equal volume if the number of simplices is a multiple of ''n''!.[
]
References
{{reflist
Euclidean plane geometry
Theorems in discrete geometry
Geometric dissection