diagonal

As applied to a polygon, a diagonal is a line segment joining any two non-consecutive vertices. Therefore, a quadrilateral has two diagonals, joining opposite pairs of vertices. For any convex polygon, all the diagonals are inside the polygon, but for re-entrant polygons, some diagonals are outside of the polygon.

Any n-sided polygon (n ≥ 3), convex or concave, has $\backslash tfrac\{n(n-3)\}\{2\}$ total diagonals, as each vertex has diagonals to all other vertices except itself and the two adjacent vertices, or {{math|n − 3}} diagonals, and each diagonal is shared by two vertices.

In general, a regular n-sided polygon has $\backslash left\backslash lfloor\backslash frac\; \{n-2\}\{2\}\backslash right\backslash rfloor$ distinct diagonals in length, which follows the pattern 1,1,2,2,3,3... starting from a square.

|

|

|

|

|}

In a convex polygon, if no three diagonals are concurrent at a single point in the interior, the number of regions that the diagonals divide the interior into is given by{{cite book |chapter=A Problem in Combinatorics |at={{nobr|Ch. 9}}, {{pgs|99–107}} |last=Honsberger |title=Mathematical Gems |chapter-url=https://archive.org/details/mathematicalgems0001hons/page/99/?q=%22diagonals+of+a+square+divide%22 |chapter-url-access=limited |publisher=Mathematical Association of America |year=1973 |isbn=0-88385-301-9 }} {{pb}} {{cite journal |title=The Number of Regions Determined by a Convex Polygon |last=Freeman |first=J. W. |journal=Mathematics Magazine |volume=49 |number=1 |year=1976 |pages=23–25 |doi=10.2307/2689875 |jstor=2689875 }}

:$\backslash binom\; n4\; +\; \backslash binom\; \{n-1\}2\; =\; \backslash frac\{(n-1)(n-2)(n^2-3n+12)\}\{24\}.$

For n-gons with n=3, 4, ... the number of regions is

:1, 4, 11, 25, 50, 91, 154, 246...

This is OEIS sequence A006522.{{Cite OEIS|1=A006522}}

If no three diagonals of a convex polygon are concurrent at a point in the interior, the number of interior intersections of diagonals is given by $\backslash textstyle\; \backslash binom\; n4$.Poonen, Bjorn; Rubinstein, Michael. "The number of intersection points made by the diagonals of a regular polygon". SIAM J. Discrete Math. 11 (1998), no. 1, 135–156; [https://math.mit.edu/~poonen/papers/ngon.pdf link to a version on Poonen's website] {{Cite AV media |url=https://www.youtube.com/watch?v=K8P8uFahAgc |title=Circle Division Solution (old version) |date=2015-05-23 |last=3Blue1Brown |access-date=2024-09-01 |via=YouTube}} This holds, for example, for any regular polygon with an odd number of sides. The formula follows from the fact that each intersection is uniquely determined by the four endpoints of the two intersecting diagonals: the number of intersections is thus the number of combinations of the n vertices four at a time.

{{See also|Quadrilateral#Diagonals|Hexagon#Convex equilateral hexagon|Heptagon#Diagonals and heptagonal triangle}}

Although the number of distinct diagonals in a polygon increases as its number of sides increases, the length of any diagonal can be calculated.

In a regular n-gon with side length a, the length of the xth shortest distinct diagonal is:

:$\backslash sin\; \backslash left(\backslash frac\{\backslash pi(x+1)\}\{n\}\backslash right)\; \backslash csc\; \backslash left(\backslash frac\{\backslash pi\}\{n\}\backslash right)\; \backslash cdot\; a$

This formula shows that as the number of sides approaches infinity, the xth shortest diagonal approaches the length {{tmath|(x+1)a}}. Additionally, the formula for the shortest diagonal simplifies in the case of x = 1:

:$\backslash sin\; \backslash left(\backslash frac\{2\backslash pi\}\{n\}\backslash right)\; \backslash csc\; \backslash left(\backslash frac\{\backslash pi\}\{n\}\backslash right)\; \backslash cdot\; a\; =\; 2\backslash cos\; \backslash left(\backslash frac\{\backslash pi\}\{n\}\backslash right)\; \backslash cdot\; a$

If the number of sides is even, the longest diagonal will be equivalent to the diameter of the polygon's circumcircle because the long diagonals all intersect each other at the polygon's center.

Special cases include:

A square has two diagonals of equal length, which intersect at the center of the square. The ratio of a diagonal to a side is $\backslash sqrt\{2\}\backslash approx\; 1.414.$

A regular pentagon has five diagonals all of the same length. The ratio of a diagonal to a side is the golden ratio, $\backslash frac\{1+\backslash sqrt\{5\}\}\{2\}\backslash approx\; 1.618.$

A regular hexagon has nine diagonals: the six shorter ones are equal to each other in length; the three longer ones are equal to each other in length and intersect each other at the center of the hexagon. The ratio of a long diagonal to a side is 2, and the ratio of a short diagonal to a side is $\backslash sqrt\{3\}$.

A regular heptagon has 14 diagonals. The seven shorter ones equal each other, and the seven longer ones equal each other. The reciprocal of the side equals the sum of the reciprocals of a short and a long diagonal.

{{See also|Face diagonal|Space diagonal}}

A polyhedron (a solid object in three-dimensional space, bounded by two-dimensional faces) may have two different types of diagonals: face diagonals on the various faces, connecting non-adjacent vertices on the same face; and space diagonals, entirely in the interior of the polyhedron (except for the endpoints on the vertices).

The lengths of an n-dimensional hypercube's diagonals can be calculated by mathematical induction. The longest diagonal of an n-cube is $\backslash sqrt\{n\}$. Additionally, there are $2^\{n-1\}\backslash binom\{n\}\{x+1\}$ of the xth shortest diagonal. As an example, a 5-cube would have the diagonals:

|}

Its total number of diagonals is 416. In general, an n-cube has a total of $2^\{n-1\}(2^n-n-1)$ diagonals. This follows from the more general form of $\backslash frac\{v(v-1)\}\{2\}-e$ which describes the total number of face and space diagonals in convex polytopes.{{cite web | url=https://www.themathdoctors.org/counting-diagonals-of-a-polyhedron/ | title=Counting Diagonals of a Polyhedron – the Math Doctors }} Here, v represents the number of vertices and e represents the number of edges.

By analogy, the subset of the Cartesian product X×X of any set X with itself, consisting of all pairs {{tmath|(x,x)}}, is called the diagonal, and is the graph of the equality relation on X or equivalently the graph of the identity function from X to X. This plays an important part in geometry; for example, the fixed points of a mapping F from X to itself may be obtained by intersecting the graph of F with the diagonal.

In geometric studies, the idea of intersecting the diagonal with itself is common, not directly, but by perturbing it within an equivalence class. This is related at a deep level with the Euler characteristic and the zeros of vector fields. For example, the circle S¹ has Betti numbers 1, 1, 0, 0, 0, and therefore Euler characteristic 0. A geometric way of expressing this is to look at the diagonal on the two-torus S¹×S¹ and observe that it can move off itself by the small motion (θ, θ) to (θ, θ + ε). In general, the intersection number of the graph of a function with the diagonal may be computed using homology via the Lefschetz fixed-point theorem; the self-intersection of the diagonal is the special case of the identity function.

{{reflist}}

{{Wiktionary|diagonal}}

• [http://www.mathopenref.com/polygondiagonal.html Diagonals of a polygon] with interactive animation
• [http://mathworld.wolfram.com/PolygonDiagonal.html Polygon diagonal] from MathWorld.

Category:Elementary geometry