Diagonal
![](https://upload.wikimedia.org/wikipedia/commons/thumb/5/57/Cube_diagonals.svg/220px-Cube_diagonals.svg.png)
Ingeometry,adiagonalis aline segmentjoining twoverticesof apolygonorpolyhedron,when those vertices are not on the sameedge.Informally, any sloping line is called diagonal. The worddiagonalderives from theancient Greekδιαγώνιοςdiagonios,[1]"from corner to corner" (from διά-dia-,"through", "across" and γωνίαgonia,"corner", related togony"knee" ); it was used by bothStrabo[2]andEuclid[3]to refer to a line connecting two vertices of arhombusorcuboid,[4]and later adopted into Latin asdiagonus( "slanting line" ).
Polygons
[edit]As applied to apolygon,a diagonal is aline segmentjoining any two non-consecutive vertices. Therefore, aquadrilateralhas two diagonals, joining opposite pairs of vertices. For anyconvex polygon,all the diagonals are inside the polygon, but forre-entrant polygons,some diagonals are outside of the polygon.
Anyn-sided polygon (n≥ 3),convexorconcave,hastotaldiagonals, as each vertex has diagonals to all other vertices except itself and the two adjacent vertices, orn− 3 diagonals, and each diagonal is shared by two vertices.
In general, a regularn-sided polygon hasdistinctdiagonals in length, which follows the pattern 1,1,2,2,3,3... starting from a square.
|
|
|
|
|
Regions formed by diagonals
[edit]In aconvex polygon,if no three diagonals areconcurrentat a single point in the interior, the number of regions that the diagonals divide the interior into is given by[5]
Forn-gons withn=3, 4,... the number of regions is
- 1, 4, 11, 25, 50, 91, 154, 246...
This isOEISsequence A006522.[6]
Intersections of diagonals
[edit]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.[7][8]This holds, for example, for anyregular polygonwith 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 thenvertices four at a time.
Regular polygons
[edit]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 lengtha,the length of thexthshortest distinct diagonal is:
This formula shows that as the number of sides approaches infinity, thexthshortest diagonal approaches the length(x+1)a.Additionally, the formula for the shortest diagonal simplifies in the case of x = 1:
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:
Asquarehas two diagonals of equal length, which intersect at the center of the square. The ratio of a diagonal to a side is
Aregular pentagonhas five diagonals all of the same length. The ratio of a diagonal to a side is thegolden ratio,
A regularhexagonhas 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.
A regularheptagonhas 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.
Polyhedrons
[edit]Apolyhedron(asolid objectinthree-dimensional space,bounded bytwo-dimensionalfaces) 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).
Higher dimensions
[edit]N-Cube
[edit]The lengths of an n-dimensionalhypercube's diagonals can be calculated bymathematical induction.The longest diagonal of an n-cube is.Additionally, there areof thexthshortest 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 ofdiagonals. This follows from the more general form ofwhich describes the total number of face and space diagonals in convex polytopes.[9]Here, v represents the number of vertices and e represents the number of edges.
Geometry
[edit]By analogy, thesubsetof theCartesian productX×Xof any setXwith itself, consisting of all pairs (x,x), is called the diagonal, and is thegraphof theequalityrelationonXor equivalently thegraphof theidentity functionfromXtoX.This plays an important part in geometry; for example, thefixed pointsof amappingFfromXto itself may be obtained by intersecting the graph ofFwith the diagonal.
In geometric studies, the idea of intersecting the diagonalwith itselfis common, not directly, but by perturbing it within anequivalence class.This is related at a deep level with theEuler characteristicand the zeros ofvector fields.For example, thecircleS1hasBetti numbers1, 1, 0, 0, 0, and therefore Euler characteristic 0. A geometric way of expressing this is to look at the diagonal on the two-torusS1xS1and observe that it can moveoff itselfby the small motion (θ, θ) to (θ, θ + ε). In general, the intersection number of the graph of a function with the diagonal may be computed using homology via theLefschetz fixed-point theorem;the self-intersection of the diagonal is the special case of the identity function.
Notes
[edit]- ^Harper, Douglas R. (2018)."diagonal (adj.)".Online Etymology Dictionary.
- ^Strabo, Geography 2.1.36–37
- ^Euclid, Elements book 11, proposition 28
- ^Euclid, Elements book 11, proposition 38
- ^Honsberger (1973)."A Problem in Combinatorics".Mathematical Gems.Mathematical Association of America.Ch. 9,pp. 99–107.ISBN0-88385-301-9.Freeman, J. W. (1976). "The Number of Regions Determined by a Convex Polygon".Mathematics Magazine.49(1): 23–25.JSTOR2689875.
- ^Sloane, N. J. A.(ed.)."Sequence A006522".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^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
- ^3Blue1Brown (2015-05-23).Circle Division Solution (old version).Retrieved2024-09-01– via YouTube.
{{cite AV media}}
:CS1 maint: numeric names: authors list (link) - ^"Counting Diagonals of a Polyhedron – the Math Doctors".
External links
[edit]![](https://upload.wikimedia.org/wikipedia/commons/thumb/9/99/Wiktionary-logo-en-v2.svg/40px-Wiktionary-logo-en-v2.svg.png)
- Diagonals of a polygonwith interactive animation
- Polygon diagonalfromMathWorld.