Diagonal
In geometry, a diagonal is a line segment joining two vertices of a polygon or polyhedron, when those vertices are not on the same edge. Informally, any sloping line is called diagonal. The word diagonal derives from the ancient Greek διαγώνιος diagonios,^{[1]} "from angle to angle" (from διά dia, "through", "across" and γωνία gonia, "angle", related to gony "knee"); it was used by both Strabo^{[2]} and Euclid^{[3]} to refer to a line connecting two vertices of a rhombus or cuboid,^{[4]} and later adopted into Latin as diagonus ("slanting line").
In matrix algebra, the diagonal of a square matrix consists of the entries on the line from the top left corner to the bottom right corner.
There are also other, nonmathematical uses.
Nonmathematical uses
In engineering, a diagonal brace is a beam used to brace a rectangular structure (such as scaffolding) to withstand strong forces pushing into it; although called a diagonal, due to practical considerations diagonal braces are often not connected to the corners of the rectangle.
Diagonal pliers are wirecutting pliers defined by the cutting edges of the jaws intersects the joint rivet at an angle or "on a diagonal", hence the name.
A diagonal lashing is a type of lashing used to bind spars or poles together applied so that the lashings cross over the poles at an angle.
In association football, the diagonal system of control is the method referees and assistant referees use to position themselves in one of the four quadrants of the pitch.
Polygons
As applied to a polygon, a diagonal is a line segment joining any two nonconsecutive 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 reentrant polygons, some diagonals are outside of the polygon.
Any nsided polygon (n ≥ 3), convex or concave, has [math]\displaystyle{ \tfrac{n(n3)}{2} }[/math] diagonals, as each vertex has diagonals to all other vertices except itself and the two adjacent vertices, or n − 3 diagonals, and each diagonal is shared by two vertices.





Regions formed by diagonals
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
 [math]\displaystyle{ \binom n4 + \binom {n1}2 = \frac{(n1)(n2)(n^23n+12)}{24}. }[/math]
For ngons with n=3, 4, ... the number of regions is^{[5]}
 1, 4, 11, 25, 50, 91, 154, 246...
This is OEIS sequence A006522.^{[6]}
Intersections of diagonals
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 [math]\displaystyle{ \binom n4 }[/math].^{[7]}^{[8]} 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.
Regular polygons
There exist separate formulae for calculating the length of the longest diagonal in regular polygons with an even or odd number of sides.
In an evensided regular polygon with n sides and side length a, the length of the longest diagonal is equivalent to the diameter of its circumcircle because the long diagonals all intersect each other at the polygon's center. This is given by the following formula.
 [math]\displaystyle{ d = \frac{a}{\sin (\pi/n)} = \frac{a}{\sin (180/n)\text{ degrees}}. }[/math]
The length of the longest diagonal of any oddsided regular nsided polygon (n ≥ 5) with side length a is given by the following formula.^{[9]}
 [math]\displaystyle{ d = \frac{a}{2 \sin (\pi/2n)} = \frac{a}{2 \sin (90/n)\text{ degrees}}. }[/math]
The length of a polygon's shortest diagonal can also be calculated for all polygons (n ≥ 4) with the following formula.^{[10]} As the number of sides approaches infinity, the shortest diagonal approaches 2a.
 [math]\displaystyle{ d = 2a \cos (\pi/n) = 2a \cos (180/n)\text{ degrees}. }[/math]
These are not applicable for a triangle which has no diagonals.
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 [math]\displaystyle{ \sqrt{2}\approx 1.414. }[/math]
A regular pentagon has five diagonals all of the same length. The ratio of a diagonal to a side is the golden ratio, [math]\displaystyle{ \frac{1+\sqrt{5}}{2}\approx 1.618. }[/math]
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 [math]\displaystyle{ \sqrt{3} }[/math].
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.
In general a regular ngon has [math]\displaystyle{ \lfloor\frac {n2}{2}\rfloor }[/math] distinct diagonals in length, which follows the pattern 1,1,2,2,3,3... starting from a square.
Polyhedrons
A polyhedron (a solid object in threedimensional space, bounded by twodimensional faces) may have two different types of diagonals: face diagonals on the various faces, connecting nonadjacent vertices on the same face; and space diagonals, entirely in the interior of the polyhedron (except for the endpoints on the vertices).
Just as a triangle has no diagonals, so also a tetrahedron (with four triangular faces) has no face diagonals and no space diagonals.
A cuboid has two diagonals on each of the six faces and four space diagonals.
Matrices
For a square matrix, the diagonal (or main diagonal or principal diagonal) is the diagonal line of entries running from the topleft corner to the bottomright corner.^{[11]}^{[12]}^{[13]} For a matrix [math]\displaystyle{ A }[/math] with row index specified by [math]\displaystyle{ i }[/math] and column index specified by [math]\displaystyle{ j }[/math], these would be entries [math]\displaystyle{ A_{ij} }[/math] with [math]\displaystyle{ i = j }[/math]. For example, the identity matrix can be defined as having entries of 1 on the main diagonal and zeroes elsewhere:
 [math]\displaystyle{ \begin{pmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{pmatrix} }[/math]
The topright to bottomleft diagonal is sometimes described as the minor diagonal or antidiagonal.
The offdiagonal entries are those not on the main diagonal. A diagonal matrix is one whose offdiagonal entries are all zero.^{[14]}^{[15]}
A superdiagonal entry is one that is directly above and to the right of the main diagonal.^{[16]}^{[17]} Just as diagonal entries are those [math]\displaystyle{ A_{ij} }[/math] with [math]\displaystyle{ j=i }[/math], the superdiagonal entries are those with [math]\displaystyle{ j = i+1 }[/math]. For example, the nonzero entries of the following matrix all lie in the superdiagonal:
 [math]\displaystyle{ \begin{pmatrix} 0 & 2 & 0 \\ 0 & 0 & 3 \\ 0 & 0 & 0 \end{pmatrix} }[/math]
Likewise, a subdiagonal entry is one that is directly below and to the left of the main diagonal, that is, an entry [math]\displaystyle{ A_{ij} }[/math] with [math]\displaystyle{ j = i  1 }[/math].^{[18]} General matrix diagonals can be specified by an index [math]\displaystyle{ k }[/math] measured relative to the main diagonal: the main diagonal has [math]\displaystyle{ k = 0 }[/math]; the superdiagonal has [math]\displaystyle{ k = 1 }[/math]; the subdiagonal has [math]\displaystyle{ k = 1 }[/math]; and in general, the [math]\displaystyle{ k }[/math]diagonal consists of the entries [math]\displaystyle{ A_{ij} }[/math] with [math]\displaystyle{ j = i+k }[/math].
Geometry
By analogy, the subset of the Cartesian product X×X of any set X with itself, consisting of all pairs (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^{1} 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 twotorus S^{1}xS^{1} 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 fixedpoint theorem; the selfintersection of the diagonal is the special case of the identity function.
See also
Notes
 ↑ Online Etymology Dictionary
 ↑ Strabo, Geography 2.1.36–37
 ↑ Euclid, Elements book 11, proposition 28
 ↑ Euclid, Elements book 11, proposition 38
 ↑ Weisstein, Eric W. "Polygon Diagonal." From MathWorldA Wolfram Web Resource. http://mathworld.wolfram.com/PolygonDiagonal.html
 ↑ Sloane, N. J. A., ed. "Sequence A006522". OEIS Foundation. https://oeis.org/A006522.
 ↑ 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; link to a version on Poonen's website
 ↑ [1], beginning at 2:10
 ↑ "Murderous Maths: The LOngest Diagonal Formula!". http://www.murderousmaths.co.uk/books/longdiag.htm.
 ↑ "Length of Diagonal of a nsided regular polygon". 2 January 2019. https://www.geeksforgeeks.org/lengthofdiagonalofansidedregularpolygon/.
 ↑ (Bronson 1970)
 ↑ (Herstein 1964)
 ↑ (Nering 1970)
 ↑ (Herstein 1964)
 ↑ (Nering 1970)
 ↑ (Bronson 1970)
 ↑ (Herstein 1964)
 ↑ (Cullen 1966)
References
 Bronson, Richard (1970), Matrix Methods: An Introduction, New York: Academic Press
 Cullen, Charles G. (1966), Matrices and Linear Transformations, Reading: AddisonWesley
 Herstein, I. N. (1964), Topics In Algebra, Waltham: Blaisdell Publishing Company, ISBN 9781114541016
 Nering, Evar D. (1970), Linear Algebra and Matrix Theory (2nd ed.), New York: John Wiley & Sons
External links
 Diagonals of a polygon with interactive animation
 Polygon diagonal from MathWorld.
 Diagonal of a matrix from MathWorld.
Original source: https://en.wikipedia.org/wiki/Diagonal.
Read more 