# Diagonal

Last updated

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").

## Contents

In matrix algebra, a diagonal of a square matrix is a set of entries extending from one corner to the farthest corner.

There are also other, non-mathematical uses.

## Non-mathematical 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 wire-cutting 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 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 ${\displaystyle {\tfrac {n(n-3)}{2}}}$ 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.

SidesDiagonals
30
42
55
69
714
820
927
1035
SidesDiagonals
1144
1254
1365
1477
1590
16104
17119
18135
SidesDiagonals
19152
20170
21189
22209
23230
24252
25275
26299
SidesDiagonals
27324
28350
29377
30405
31434
32464
33495
34527
SidesDiagonals
35560
36594
37629
38665
39702
40740
41779
42819

### 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

${\displaystyle {\binom {n}{4}}+{\binom {n-1}{2}}={\frac {(n-1)(n-2)(n^{2}-3n+12)}{24}}.}$

For n-gons 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 ${\displaystyle {\binom {n}{4}}}$. [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

A triangle has no diagonals.

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 ${\displaystyle {\sqrt {2}}\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, ${\displaystyle {\frac {1+{\sqrt {5}}}{2}}\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 ${\displaystyle {\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.

In any regular n-gon with n even, the long diagonals all intersect each other at the polygon's center.

## Polyhedrons

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).

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

In the case of a square matrix, the main or principal diagonal is the diagonal line of entries running from the top-left corner to the bottom-right corner. [9] [10] [11] For a matrix ${\displaystyle A}$ with row index specified by ${\displaystyle i}$ and column index specified by ${\displaystyle j}$, these would be entries ${\displaystyle A_{ij}}$ with ${\displaystyle i=j}$. For example, the identity matrix can be defined as having entries of 1 on the main diagonal and zeroes elsewhere:

${\displaystyle {\begin{pmatrix}1&0&0\\0&1&0\\0&0&1\end{pmatrix}}}$

The top-right to bottom-left diagonal is sometimes described as the minor diagonal or antidiagonal. The off-diagonal entries are those not on the main diagonal. A diagonal matrix is one whose off-diagonal entries are all zero. [12] [13]

A superdiagonal entry is one that is directly above and to the right of the main diagonal. [14] [15] Just as diagonal entries are those ${\displaystyle A_{ij}}$ with ${\displaystyle j=i}$, the superdiagonal entries are those with ${\displaystyle j=i+1}$. For example, the non-zero entries of the following matrix all lie in the superdiagonal:

${\displaystyle {\begin{pmatrix}0&2&0\\0&0&3\\0&0&0\end{pmatrix}}}$

Likewise, a subdiagonal entry is one that is directly below and to the left of the main diagonal, that is, an entry ${\displaystyle A_{ij}}$ with ${\displaystyle j=i-1}$. [16] General matrix diagonals can be specified by an index ${\displaystyle k}$ measured relative to the main diagonal: the main diagonal has ${\displaystyle k=0}$; the superdiagonal has ${\displaystyle k=1}$; the subdiagonal has ${\displaystyle k=-1}$; and in general, the ${\displaystyle k}$-diagonal consists of the entries ${\displaystyle A_{ij}}$ with ${\displaystyle j=i+k}$.

## 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 S1 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 S1xS1 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.

## Notes

1. Strabo, Geography 2.1.36–37
2. Euclid, Elements book 11, proposition 28
3. Euclid, Elements book 11, proposition 38
4. Weisstein, Eric W. "Polygon Diagonal." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PolygonDiagonal.html
5. Sloane, N. J. A. (ed.). "SequenceA006522". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
6. 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
7. Bronson (1970 , p. 2)
8. Herstein (1964 , p. 239)
9. Nering (1970 , p. 38)
10. Herstein (1964 , p. 239)
11. Nering (1970 , p. 38)
12. Bronson (1970 , pp. 203,205)
13. Herstein (1964 , p. 239)
14. Cullen (1966 , p. 114)

## Related Research Articles

In linear algebra, the determinant is a scalar value that can be computed from the elements of a square matrix and encodes certain properties of the linear transformation described by the matrix. The determinant of a matrix A is denoted det(A), det A, or |A|. Geometrically, it can be viewed as the volume scaling factor of the linear transformation described by the matrix. This is also the signed volume of the n-dimensional parallelepiped spanned by the column or row vectors of the matrix. The determinant is positive or negative according to whether the linear transformation preserves or reverses the orientation of a real vector space.

In geometry, a polygon is a plane figure that is described by a finite number of straight line segments connected to form a closed polygonal chain or polygonal circuit. The solid plane region, the bounding circuit, or the two together, may be called a polygon.

A quadrilateral is a polygon in Euclidean plane geometry with four edges (sides) and four vertices (corners). Other names for quadrilateral include quadrangle, tetragon, and 4-gon. A quadrilateral with vertices , , and is sometimes denoted as .

In geometry, a simplex 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 space.

In linear algebra, the trace of a square matrix A, denoted , is defined to be the sum of elements on the main diagonal of A.

In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises in probability theory, combinatorics, and algebra. In much of the Western world, it is named after the French mathematician Blaise Pascal, although other mathematicians studied it centuries before him in India, Persia, China, Germany, and Italy.

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices A and B is denoted as AB.

In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally,

In Euclidean geometry, a parallelogram is a simple (non-self-intersecting) quadrilateral with two pairs of parallel sides. The opposite or facing sides of a parallelogram are of equal length and the opposite angles of a parallelogram are of equal measure. The congruence of opposite sides and opposite angles is a direct consequence of the Euclidean parallel postulate and neither condition can be proven without appealing to the Euclidean parallel postulate or one of its equivalent formulations.

In linear algebra, the Cholesky decomposition or Cholesky factorization is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations. It was discovered by André-Louis Cholesky for real matrices. When it is applicable, the Cholesky decomposition is roughly twice as efficient as the LU decomposition for solving systems of linear equations.

In linear algebra, the permanent of a square matrix is a function of the matrix similar to the determinant. The permanent, as well as the determinant, is a polynomial in the entries of the matrix. Both are special cases of a more general function of a matrix called the immanant.

In linear algebra, a tridiagonal matrix is a band matrix that has nonzero elements on the main diagonal, the first diagonal below this, and the first diagonal above the main diagonal only.

In linear algebra, a generalized eigenvector of an matrix is a vector which satisfies certain criteria which are more relaxed than those for an (ordinary) eigenvector.

A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the -dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary.

In mathematics, the Gershgorin circle theorem may be used to bound the spectrum of a square matrix. It was first published by the Soviet mathematician Semyon Aronovich Gershgorin in 1931. Gershgorin's name has been transliterated in several different ways, including Geršgorin, Gerschgorin, Gershgorin, Hershhorn, and Hirschhorn.

In mathematics, especially in probability and combinatorics, a doubly stochastic matrix (also called bistochastic matrix), is a square matrix of nonnegative real numbers, each of whose rows and columns sums to 1, i.e.,

In numerical linear algebra, the Jacobi eigenvalue algorithm is an iterative method for the calculation of the eigenvalues and eigenvectors of a real symmetric matrix. It is named after Carl Gustav Jacob Jacobi, who first proposed the method in 1846, but only became widely used in the 1950s with the advent of computers.

In mathematics, a square matrix is said to be diagonally dominant if, for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. More precisely, the matrix A is diagonally dominant if

In mathematics, a shift matrix is a binary matrix with ones only on the superdiagonal or subdiagonal, and zeroes elsewhere. A shift matrix U with ones on the superdiagonal is an upper shift matrix. The alternative subdiagonal matrix L is unsurprisingly known as a lower shift matrix. The (i,j):th component of U and L are

In graph theory, the Lovász number of a graph is a real number that is an upper bound on the Shannon capacity of the graph. It is also known as Lovász theta function and is commonly denoted by ϑ(G). This quantity was first introduced by László Lovász in his 1979 paper On the Shannon Capacity of a Graph.