Skip to the passage panel
WikiLean · Articles Articles Brain Contribute About

Preliminary: these links have not yet had an independent audit.

Regular polygon

75 passages1 formalized3 statement only7 partial64 not formalized

More ways to filter
Library
TauCeti related only
Passages
About this page

This page

  • Wikipedia revision 1379891336, pinned: the text here is that revision, not today's article.
  • WikiProject Mathematics: C-class, High importance
  • 75 passages checked, 14 Lean locations (and 32 related declarations).

Central statements: 35 of the 75 passages state the article's subject or a named result or definition; the other 40 are supporting (examples, setup). Of these 35: 1 formalized, 3 statement only, 5 partial, 26 not formalized.

What the colours mean

  • Formalized a Lean declaration states it, proved, or a Lean definition defines it
  • Statement only Lean states it, but the proof is not finished
  • Partial Lean states part of it, or a more general or special form
  • Not formalized searched every library and not found

Libraries searched

Searched 48 Lean libraries, pinned 2026-10-17, 3 left out (library set u1).

How these links were made

  • Accuracy, from an audit of a sample of 224 items (blind, not independent): Strong links (exact, close or broad match) on supporting passages that have exactly the right relation: 92% (95% interval 49–99%), from 36 drawn of 1029, weighted by relation and library, an effective sample of 5.1; Links in a counting relation (exact, close, broad, narrow match or part) on supporting passages that have exactly the right relation: 73% (95% interval 40–92%), from 48 drawn of 1740, weighted by relation and library, an effective sample of 8.1; Central and subject passages whose formalization status is right: 86% (95% interval 73–94%), from 44 drawn of 1905, weighted by recorded status, an effective sample of 42; 'Not formalized' on supporting passages that is right (no declaration in the 48 libraries states it): 60% (95% interval 25–87%), from 12 drawn of 1236, weighted by article, an effective sample of 6.1.
  • Audit run tierA-batch1-audit, run by jack, 2 Nov 2026, 21:10 – 3 Nov 2026, 02:10 UTC: judged by Claude Opus 5.5 (claude-opus-5-5).
  • Record set tierA-b1b (cf-locate-recordset/2, statuses by status rule 3), exported 1 Nov 2026 by formal-companion at commit d85385a.
  • Seal sha256 23710337d053e8212378a9e580805628bcdfda61a6fc431e65f24a4a16c9e602.
  • Inventory run inv-tierA-b1r, run by jack, 30 Oct 2026, 07:23–20:00 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). It listed the formal passages, each with its kind and prominence, that the locate run then searched.
  • Locate run loc-tierA-b1b, run by jack, 31 Oct 2026, 04:59 – 1 Nov 2026, 03:06 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5).
  • Challenge run chal-tierA-b1, run by jack, 1 Nov 2026, 03:19–14:25 UTC: worker Claude Opus 5 (claude-opus-5), reviewer Claude Opus 5 (claude-opus-5). In this article it re-checked every Lean location and absence on a central or subject passage (12 locations and 26 absences); on supporting passages, a seeded sample (seed 0; drawn at 0.5 for strong matches, 0.2 for weaker links and 0.25 for absences): 1 of 2 locations and 9 of 38 absences. In all, 13 of 14 Lean locations (93%) and 35 of 64 absences (55%) were re-checked.
  • Passage text: 75 of 75 passages shown in full, each the slice of the pinned revision's text that its record's span sha256 hashes, checked when the store was built.
  • Lean code: each declaration's type, from the declaration corpus of universe u1 (built 18 Oct 2026, sha256 a364fd6aede5), at the commit its card links.

How the text is shown

Each passage is shown in full, as revision 1379891336 states it (checked against its record's span hash when the store was built). Where a passage is only part of a sentence, it is highlighted and the rest of the sentence is shown in grey around it, from the same copy of the revision; a list item also shows the sentence that introduces it. Formulas are drawn from their TeX; hover one to see it.

Each card's Lean code is its declaration's type as Lean prints it, from the declaration corpus of library set u1 at the card's commit, laid out as a header: binders before the colon, then the hypotheses as arrows (the corpus keeps no hypothesis names) and the conclusion, in Mathlib's notation (𝓝, π, R[X], Type*). It is not the source text; Source opens that.

Select a highlighted passage to see where Lean formalizes it.

Regular polygon
Regular triangle
Regular square
Regular pentagon
Regular hexagon
Regular heptagon
Regular octagon
Regular nonagon
Regular decagon
Regular hendecagon
Regular dodecagon
Regular tridecagon
Regular tetradecagon
Edges and vertices n {\displaystyle n}
Schläfli symbol { n } {\displaystyle \{n\}}
Coxeter–Dynkin diagram
Symmetry groupDn, order 2n
Dual polygonSelf-dual
Area
(with side length s {\displaystyle s} )
A = 1 4 n s 2 cot ⁡ ( π n ) {\displaystyle A={\tfrac {1}{4}}ns^{2}\cot \left({\frac {\pi }{n}}\right)}
Internal angle ( n − 2 ) × π n {\displaystyle (n-2)\times {\frac {\pi }{n}}}
Internal angle sum ( n − 2 ) × π {\displaystyle \left(n-2\right)\times {\pi }}
Inscribed circle diameter d IC = s cot ⁡ ( π n ) {\displaystyle d_{\text{IC}}=s\cot \left({\frac {\pi }{n}}\right)}
Circumscribed circle diameter d OC = s csc ⁡ ( π n ) {\displaystyle d_{\text{OC}}=s\csc \left({\frac {\pi }{n}}\right)}
PropertiesConvex, cyclic, equilateral, isogonal, isotoxal

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be either convex or star. In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a straight line), if the edge length is fixed.

General properties

Regular convex and star polygons with 3 to 12 vertices labelled with their Schläfli symbols

These properties apply to all regular polygons, whether convex or star:

  • Together with the property of equal-length sides, this implies that every regular polygon also has an inscribed circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential polygon.
  • A regular n-sided polygon can be constructed with compass and straightedge if and only if the odd prime factors of n are distinct Fermat primes. (See constructible polygon.)
  • A regular n-sided polygon can be constructed with origami if and only if n = 2 a 3 b p 1 ⋯ p r {\displaystyle n=2^{a}3^{b}p_{1}\cdots p_{r}} for some r ∈ N {\displaystyle r\in \mathbb {N} } , where each distinct p i {\displaystyle p_{i}} is a Pierpont prime.[1]

Symmetry

The symmetry group of an n-sided regular polygon is the dihedral group Dn (of order 2n): D2, D3, D4, ... It consists of the rotations in Cn, together with reflection symmetry in n axes that pass through the center. If n is even then half of these axes pass through two opposite vertices, and the other half through the midpoint of opposite sides. If n is odd then all axes pass through a vertex and the midpoint of the opposite side.

Regular convex polygons

All regular simple polygons (a simple polygon is one that does not intersect itself anywhere) are convex. Those having the same number of sides are also similar.

An n-sided convex regular polygon is denoted by its Schläfli symbol { n } {\displaystyle \{n\}} . For n < 3 {\displaystyle n<3} , we have two degenerate cases:

Monogon {1}; point
Degenerate in ordinary space. (Most authorities do not regard the monogon as a true polygon, partly because of this, and also because the formulae below do not work, and its structure is not that of any abstract polygon.)
Digon {2}; line segment
Degenerate in ordinary space. (Some authorities[weasel words] do not regard the digon as a true polygon because of this.)

In certain contexts all the polygons considered will be regular. In such circumstances it is customary to drop the prefix regular. For instance, all the faces of uniform polyhedra must be regular and the faces will be described simply as triangle, square, pentagon, etc.

As a corollary of the annulus chord formula, the area bounded by the circumcircle and incircle of every unit convex regular polygon is π/4

Angles

For a regular convex n-gon, each interior angle has a measure of:

( n − 2 ) 180 n {\displaystyle {\frac {(n-2)180}{n}}} degrees;
( n − 2 ) π n {\displaystyle {\frac {(n-2)\pi }{n}}} radians; or
( n − 2 ) 2 n = 1 2 − 1 n {\displaystyle {\frac {(n-2)}{2n}}={\frac {1}{2}}-{\frac {1}{n}}} full turns,

and each exterior angle (i.e., supplementary to the interior angle) has a measure of 360 n {\displaystyle {\tfrac {360}{n}}} degrees, with the sum of the exterior angles equal to 360 degrees or 2π radians or one full turn.

As n approaches infinity, the internal angle approaches 180 degrees. For a regular polygon with 10,000 sides (a myriagon) the internal angle is 179.964°. As the number of sides increases, the internal angle can come very close to 180°, and the shape of the polygon approaches that of a circle. However the polygon can never become a circle. The value of the internal angle can never become exactly equal to 180°, as the circumference would effectively become a straight line (see apeirogon). For this reason, a circle is not a polygon with an infinite number of sides.

Diagonals

For n > 2 {\displaystyle n>2} , the number of diagonals is 1 2 n ( n − 3 ) {\displaystyle {\tfrac {1}{2}}n(n-3)} ; i.e., 0, 2, 5, 9, ..., for a triangle, square, pentagon, hexagon, ... . The diagonals divide the polygon into 1, 4, 11, 24, ... pieces.[a]

For a regular n-gon inscribed in a circle of radius 1 {\displaystyle 1} , the product of the distances from a given vertex to all other vertices (including adjacent vertices and vertices connected by a diagonal) equals n.

Points in the plane

For a regular simple n-gon with circumradius R and distances di from an arbitrary point in the plane to the vertices, we have[2]

1 n ∑ i = 1 n d i 4 + 3 R 4 = ( 1 n ∑ i = 1 n d i 2 + R 2 ) 2 . {\displaystyle {\frac {1}{n}}\sum _{i=1}^{n}d_{i}^{4}+3R^{4}={\biggl (}{\frac {1}{n}}\sum _{i=1}^{n}d_{i}^{2}+R^{2}{\biggr )}^{2}.}

For higher powers of distances d i {\displaystyle d_{i}} from an arbitrary point in the plane to the vertices of a regular n-gon, if

S n ( 2 m ) = 1 n ∑ i = 1 n d i 2 m {\displaystyle S_{n}^{(2m)}={\frac {1}{n}}\sum _{i=1}^{n}d_{i}^{2m}} ,

then[3]

S n ( 2 m ) = ( S n ( 2 ) ) m + ∑ k = 1 ⌊ m / 2 ⌋ ( m 2 k ) ( 2 k k ) R 2 k ( S n ( 2 ) − R 2 ) k ( S n ( 2 ) ) m − 2 k {\displaystyle S_{n}^{(2m)}=\left(S_{n}^{(2)}\right)^{m}+\sum _{k=1}^{\left\lfloor m/2\right\rfloor }{\binom {m}{2k}}{\binom {2k}{k}}R^{2k}\left(S_{n}^{(2)}-R^{2}\right)^{k}\left(S_{n}^{(2)}\right)^{m-2k}} ,

and

S n ( 2 m ) = ( S n ( 2 ) ) m + ∑ k = 1 ⌊ m / 2 ⌋ 1 2 k ( m 2 k ) ( 2 k k ) ( S n ( 4 ) − ( S n ( 2 ) ) 2 ) k ( S n ( 2 ) ) m − 2 k {\displaystyle S_{n}^{(2m)}=\left(S_{n}^{(2)}\right)^{m}+\sum _{k=1}^{\left\lfloor m/2\right\rfloor }{\frac {1}{2^{k}}}{\binom {m}{2k}}{\binom {2k}{k}}\left(S_{n}^{(4)}-\left(S_{n}^{(2)}\right)^{2}\right)^{k}\left(S_{n}^{(2)}\right)^{m-2k}} ,

where m is a positive integer less than n.

If L is the distance from an arbitrary point in the plane to the centroid of a regular n-gon with circumradius R, then[3]

∑ i = 1 n d i 2 m = n ( ( R 2 + L 2 ) m + ∑ k = 1 ⌊ m / 2 ⌋ ( m 2 k ) ( 2 k k ) R 2 k L 2 k ( R 2 + L 2 ) m − 2 k ) {\displaystyle \sum _{i=1}^{n}d_{i}^{2m}=n\left(\left(R^{2}+L^{2}\right)^{m}+\sum _{k=1}^{\left\lfloor m/2\right\rfloor }{\binom {m}{2k}}{\binom {2k}{k}}R^{2k}L^{2k}\left(R^{2}+L^{2}\right)^{m-2k}\right)} ,

where m = 1 , 2 , … , n − 1 {\displaystyle m=1,2,\dots ,n-1} .

Interior points

For a regular n-gon, the sum of the perpendicular distances from any interior point to the n sides is n times the apothem[4]: p. 72  (the apothem being the distance from the center to any side). This is a generalization of Viviani's theorem for the n = 3 case.[5][6]

Circumradius

Regular pentagon (n = 5) with side s, circumradius R and apothem a
Graphs of side, s; apothem, a; and area, A of regular polygons of n sides and circumradius 1, with the base, b of a rectangle with the same area. The green line shows the case n = 6.

The circumradius R from the center of a regular polygon to one of the vertices is related to the side length s or to the apothem a by

R = s 2 sin ⁡ ( π n ) = a cos ⁡ ( π n ) , a = s 2 tan ⁡ ( π n ) {\displaystyle R={\frac {s}{2\sin \left({\frac {\pi }{n}}\right)}}={\frac {a}{\cos \left({\frac {\pi }{n}}\right)}}\quad _{,}\quad a={\frac {s}{2\tan \left({\frac {\pi }{n}}\right)}}}

For constructible polygons, algebraic expressions for these relationships exist (see Bicentric polygon § Regular polygons).

The sum of the perpendiculars from a regular n-gon's vertices to any line tangent to the circumcircle equals n times the circumradius.[4]: p. 73 

The sum of the squared distances from the vertices of a regular n-gon to any point on its circumcircle equals 2nR2 where R is the circumradius.[4]: p. 73 

The sum of the squared distances from the midpoints of the sides of a regular n-gon to any point on the circumcircle is 2nR2 − ⁠1/4⁠ns2, where s is the side length and R is the circumradius.[4]: p. 73 

If d i {\displaystyle d_{i}} are the distances from the vertices of a regular n {\displaystyle n} -gon to any point on its circumcircle, then[3]

3 ( ∑ i = 1 n d i 2 ) 2 = 2 n ∑ i = 1 n d i 4 {\displaystyle 3{\biggl (}\sum _{i=1}^{n}d_{i}^{2}{\biggr )}^{2}=2n\sum _{i=1}^{n}d_{i}^{4}} .

Dissections

Coxeter states that every zonogon (a 2m-gon whose opposite sides are parallel and of equal length) can be dissected into ( m 2 ) {\displaystyle {\tbinom {m}{2}}} or ⁠1/2⁠m(m − 1) parallelograms. These tilings are contained as subsets of vertices, edges and faces in orthogonal projections m-cubes.[7]

In particular, this is true for any regular polygon with an even number of sides, in which case the parallelograms are all rhombi. Regular polygons with 4m+2 sides can be dissected in a way with (2m+1)-fold radial symmetry. The list OEIS: A006245 gives the number of solutions for smaller polygons.

Examples of dissections for selected even-sided regular polygons
Sides 6 8 10 12 14 16
Rhombs 3 6 10 15 21 28
Sides 18 20 24 30 40 50
Rhombs 36 45 66 105 190 300

Area

The area A of a convex regular n-sided polygon having side s, circumradius R, apothem a, and perimeter p is given by[8][9] A = 1 2 n s a = 1 2 p a = 1 4 n s 2 cot ⁡ ( π n ) = n a 2 tan ⁡ ( π n ) = 1 2 n R 2 sin ⁡ ( 2 π n ) {\displaystyle {\begin{aligned}A&={\tfrac {1}{2}}nsa\\&={\tfrac {1}{2}}pa\\&={\tfrac {1}{4}}ns^{2}\cot \left({\tfrac {\pi }{n}}\right)\\&=na^{2}\tan \left({\tfrac {\pi }{n}}\right)\\&={\tfrac {1}{2}}nR^{2}\sin \left({\tfrac {2\pi }{n}}\right)\end{aligned}}}

For regular polygons with side s = 1, circumradius R = 1, or apothem a = 1, this produces the following table:[b] (Since cot ⁡ x → 1 / x {\displaystyle \cot x\rightarrow 1/x} as x → 0 {\displaystyle x\rightarrow 0} , the area when s = 1 {\displaystyle s=1} tends to n 2 / 4 π {\displaystyle n^{2}/4\pi } as n {\displaystyle n} grows large.)

Number
of sides
Area when side s = 1 Area when circumradius R = 1 Area when apothem a = 1
Exact Approxi­mation Exact Approxi­mation Relative to circum­circle area Exact Approxi­mation Relative to in­circle area
n n 4 cot ⁡ ( π n ) {\displaystyle \scriptstyle {\tfrac {n}{4}}\cot \left({\tfrac {\pi }{n}}\right)} n 2 sin ⁡ ( 2 π n ) {\displaystyle \scriptstyle {\tfrac {n}{2}}\sin \left({\tfrac {2\pi }{n}}\right)} n 2 π sin ⁡ ( 2 π n ) {\displaystyle \scriptstyle {\tfrac {n}{2\pi }}\sin \left({\tfrac {2\pi }{n}}\right)} n tan ⁡ ( π n ) {\displaystyle \scriptstyle n\tan \left({\tfrac {\pi }{n}}\right)} n π tan ⁡ ( π n ) {\displaystyle \scriptstyle {\tfrac {n}{\pi }}\tan \left({\tfrac {\pi }{n}}\right)}
3 ⁠ 3 4 {\displaystyle \scriptstyle {\tfrac {\sqrt {3}}{4}}} ⁠ 0.433012702 ⁠ 3 3 4 {\displaystyle \scriptstyle {\tfrac {3{\sqrt {3}}}{4}}} ⁠ 1.299038105 0.4134966714 ⁠ 3 3 {\displaystyle \scriptstyle 3{\sqrt {3}}} ⁠ 5.196152424 1.653986686
4 1 1.000000000 2 2.000000000 0.6366197722 4 4.000000000 1.273239544
5 ⁠ 1 4 25 + 10 5 {\displaystyle \scriptstyle {\tfrac {1}{4}}{\sqrt {25+10{\sqrt {5}}}}} ⁠ 1.720477401 ⁠ 5 4 1 2 ( 5 + 5 ) {\displaystyle \scriptstyle {\tfrac {5}{4}}{\sqrt {{\tfrac {1}{2}}\left(5+{\sqrt {5}}\right)}}} ⁠ 2.377641291 0.7568267288 ⁠ 5 5 − 2 5 {\displaystyle \scriptstyle 5{\sqrt {5-2{\sqrt {5}}}}} ⁠ 3.632712640 1.156328347
6 ⁠ 3 3 2 {\displaystyle \scriptstyle {\tfrac {3{\sqrt {3}}}{2}}} ⁠ 2.598076211 ⁠ 3 3 2 {\displaystyle \scriptstyle {\tfrac {3{\sqrt {3}}}{2}}} ⁠ 2.598076211 0.8269933428 ⁠ 2 3 {\displaystyle \scriptstyle 2{\sqrt {3}}} ⁠ 3.464101616 1.102657791
7 3.633912444 2.736410189 0.8710264157 3.371022333 1.073029735
8 ⁠ 2 + 2 2 {\displaystyle \scriptstyle 2+2{\sqrt {2}}} ⁠ 4.828427125 ⁠ 2 2 {\displaystyle \scriptstyle 2{\sqrt {2}}} ⁠ 2.828427125 0.9003163160 ⁠ 8 ( 2 − 1 ) {\displaystyle \scriptstyle 8\left({\sqrt {2}}-1\right)} ⁠ 3.313708500 1.054786175
9 6.181824194 2.892544244 0.9207254290 3.275732109 1.042697914
10 ⁠ 5 2 5 + 2 5 {\displaystyle \scriptstyle {\tfrac {5}{2}}{\sqrt {5+2{\sqrt {5}}}}} ⁠ 7.694208843 ⁠ 5 2 1 2 ( 5 − 5 ) {\displaystyle \scriptstyle {\tfrac {5}{2}}{\sqrt {{\tfrac {1}{2}}\left(5-{\sqrt {5}}\right)}}} ⁠ 2.938926262 0.9354892840 ⁠ 2 25 − 10 5 {\displaystyle \scriptstyle 2{\sqrt {25-10{\sqrt {5}}}}} ⁠ 3.249196963 1.034251515
11 9.365639907 2.973524496 0.9465022440 3.229891423 1.028106371
12 ⁠ 6 + 3 3 {\displaystyle \scriptstyle 6+3{\sqrt {3}}} ⁠ 11.19615242 3 3.000000000 0.9549296586 ⁠ 12 ( 2 − 3 ) {\displaystyle \scriptstyle 12\left(2-{\sqrt {3}}\right)} ⁠ 3.215390309 1.023490523
13 13.18576833 3.020700617 0.9615188694 3.204212220 1.019932427
14 15.33450194 3.037186175 0.9667663859 3.195408642 1.017130161
15 ⁠ 15 8 ( 15 + 3 + 2 ( 5 + 5 ) ) {\displaystyle \scriptstyle {\tfrac {15}{8}}\left({\sqrt {15}}+{\sqrt {3}}+{\sqrt {2\left(5+{\sqrt {5}}\right)}}\right)} ⁠ 17.64236291 ⁠ 15 16 ( 15 + 3 − 10 − 2 5 ) {\displaystyle \scriptstyle {\tfrac {15}{16}}\left({\sqrt {15}}+{\sqrt {3}}-{\sqrt {10-2{\sqrt {5}}}}\right)} ⁠ 3.050524822 0.9710122088 ⁠ 15 2 ( 3 3 − 15 − 2 ( 25 − 11 5 ) ) {\displaystyle \scriptstyle {\tfrac {15}{2}}\left(3{\sqrt {3}}-{\sqrt {15}}-{\sqrt {2\left(25-11{\sqrt {5}}\right)}}\right)} ⁠ 3.188348426 1.014882824
16 ⁠ 4 ( 1 + 2 + 2 ( 2 + 2 ) ) {\displaystyle \scriptstyle 4\left(1+{\sqrt {2}}+{\sqrt {2\left(2+{\sqrt {2}}\right)}}\right)} ⁠ 20.10935797 ⁠ 4 2 − 2 {\displaystyle \scriptstyle 4{\sqrt {2-{\sqrt {2}}}}} ⁠ 3.061467460 0.9744953584 ⁠ 16 ( 1 + 2 ) ( 2 ( 2 − 2 ) − 1 ) {\displaystyle \scriptstyle 16\left(1+{\sqrt {2}}\right)\left({\sqrt {2\left(2-{\sqrt {2}}\right)}}-1\right)} ⁠ 3.182597878 1.013052368
17 22.73549190 3.070554163 0.9773877456 3.177850752 1.011541311
18 25.52076819 3.078181290 0.9798155361 3.173885653 1.010279181
19 28.46518943 3.084644958 0.9818729854 3.170539238 1.009213984
20 ⁠ 5 ( 1 + 5 + 5 + 2 5 ) {\displaystyle \scriptstyle 5\left(1+{\sqrt {5}}+{\sqrt {5+2{\sqrt {5}}}}\right)} ⁠ 31.56875757 ⁠ 5 2 ( 5 − 1 ) {\displaystyle \scriptstyle {\tfrac {5}{2}}\left({\sqrt {5}}-1\right)} ⁠ 3.090169944 0.9836316430 ⁠ 20 ( 1 + 5 − 5 + 2 5 ) {\displaystyle \scriptstyle 20\left(1+{\sqrt {5}}-{\sqrt {5+2{\sqrt {5}}}}\right)} ⁠ 3.167688806 1.008306663
100 795.5128988 3.139525977 0.9993421565 3.142626605 1.000329117
1000 79577.20975 3.141571983 0.9999934200 3.141602989 1.000003290
104 7957746.893 3.141592448 0.9999999345 3.141592757 1.000000033
106 79577471545 3.141592654 1.000000000 3.141592654 1.000000000
Comparison of sizes of regular polygons with the same edge length, from three to sixty sides. The size increases without bound as the number of sides approaches infinity.

Of all n-gons with a given perimeter, the one with the largest area is regular.[10]

Constructible polygon

Some regular polygons are easy to construct with compass and straightedge; other regular polygons are not constructible at all. The ancient Greek mathematicians knew how to construct a regular polygon with 3, 4, 5, or 15 sides,[11]: p. xi  and they knew how to construct a regular polygon with double the number of sides of a given regular polygon.[11]: pp. 49–50  This led to the question being posed: is it possible to construct all regular n-gons with compass and straightedge? If not, which n-gons are constructible and which are not?

Carl Friedrich Gauss proved the constructibility of the regular 17-gon in 1796. Five years later, he developed the theory of Gaussian periods in his Disquisitiones Arithmeticae. This theory allowed him to formulate a sufficient condition for the constructibility of regular polygons:

A regular n-gon can be constructed with compass and straightedge if n is the product of a power of 2 and any number of distinct Fermat primes (including none).

A Fermat prime is a prime number of the form 2 ( 2 n ) + 1 {\displaystyle 2^{\left(2^{n}\right)}+1} . Gauss stated without proof that this condition was also necessary, but never published his proof. A full proof of necessity was given by Pierre Wantzel in 1837. The result is known as the Gauss–Wantzel theorem.

Equivalently, a regular n-gon is constructible if and only if the cosine of its common angle is a constructible number—that is, can be written in terms of the four basic arithmetic operations and the extraction of square roots.

Regular skew polygons

A regular skew polygon in 3-space can be seen as nonplanar paths zig-zagging between two parallel planes, defined as the side-edges of a uniform antiprism. All edges and internal angles are equal.

The Platonic solids (the tetrahedron, cube, octahedron, dodecahedron, and icosahedron) have Petrie polygons, seen in red here, with sides 4, 6, 6, 10, and 10 respectively.

More generally regular skew polygons can be defined in n-space. Examples include the Petrie polygons, polygonal paths of edges that divide a regular polytope into two halves, and seen as a regular polygon in orthogonal projection.

In the infinite limit regular skew polygons become skew apeirogons.

Regular star polygons

Regular star polygons
2 < 2q < p, gcd(p, q) = 1
Schläfli symbol{p/q}
Vertices and Edgesp
Densityq
Coxeter diagram
Symmetry groupDihedral (Dp)
Dual polygonSelf-dual
Internal angle
(degrees)
180 − 360 q p {\displaystyle 180-{\frac {360q}{p}}} [12]

A non-convex regular polygon is a regular star polygon. The most common example is the pentagram, which has the same vertices as a pentagon, but connects alternating vertices.

For an n-sided star polygon, the Schläfli symbol is modified to indicate the density or "starriness" m of the polygon, as {n/m}. If m is 2, for example, then every second point is joined. If m is 3, then every third point is joined. The boundary of the polygon winds around the center m times.

The (non-degenerate) regular stars of up to 12 sides are:

m and n must be coprime, or the figure will degenerate.

The degenerate regular stars of up to 12 sides are:

  • Tetragon – {4/2}
  • Hexagons – {6/2}, {6/3}
  • Octagons – {8/2}, {8/4}
  • Enneagon – {9/3}
  • Decagons – {10/2}, {10/4}, and {10/5}
  • Dodecagons – {12/2}, {12/3}, {12/4}, and {12/6}
Two interpretations of {6/2}
Grünbaum
{6/2} or 2{3}[13]
Coxeter
2{3} or {6}[2{3}]{6}
Doubly-wound hexagon Hexagram as a compound
of two triangles

Depending on the precise derivation of the Schläfli symbol, opinions differ as to the nature of the degenerate figure. For example, {6/2} may be treated in either of two ways:

  • For much of the 20th century (see for example Coxeter (1948)), we have commonly taken the /2 to indicate joining each vertex of a convex {6} to its near neighbors two steps away, to obtain the regular compound of two triangles, or hexagram.
    Coxeter clarifies this regular compound with a notation {kp}[k{p}]{kp} for the compound {p/k}, so the hexagram is represented as {6}[2{3}]{6}.[14] More compactly Coxeter also writes 2{n/2}, like 2{3} for a hexagram as compound as alternations of regular even-sided polygons, with italics on the leading factor to differentiate it from the coinciding interpretation.[15]
  • Many modern geometers, such as Grünbaum (2003),[13] regard this as incorrect. They take the /2 to indicate moving two places around the {6} at each step, obtaining a "double-wound" triangle that has two vertices superimposed at each corner point and two edges along each line segment. Not only does this fit in better with modern theories of abstract polytopes, but it also more closely copies the way in which Poinsot (1809) created his star polygons – by taking a single length of wire and bending it at successive points through the same angle until the figure closed.

Duality of regular polygons

All regular polygons are self-dual to congruency, and for odd n they are self-dual to identity.

In addition, the regular star figures (compounds), being composed of regular polygons, are also self-dual.

Regular polygons as faces of polyhedra

A uniform polyhedron has regular polygons as faces, such that for every two vertices there is an isometry mapping one into the other (just as there is for a regular polygon).

A quasiregular polyhedron is a uniform polyhedron which has just two kinds of face alternating around each vertex.

A regular polyhedron is a uniform polyhedron which has just one kind of face.

The remaining (non-uniform) convex polyhedra with regular faces are known as the Johnson solids.

A polyhedron having regular triangles as faces is called a deltahedron.

See also

Notes

  1. ^ (sequence A007678 in the OEIS)
  2. ^ Results for R = 1 and a = 1 obtained with Maple, using function definition:
    f := proc (n)
    options operator, arrow;
    [
     [convert(1/4*n*cot(Pi/n), radical), convert(1/4*n*cot(Pi/n), float)],
     [convert(1/2*n*sin(2*Pi/n), radical), convert(1/2*n*sin(2*Pi/n), float), convert(1/2*n*sin(2*Pi/n)/Pi, float)],
     [convert(n*tan(Pi/n), radical), convert(n*tan(Pi/n), float), convert(n*tan(Pi/n)/Pi, float)]
    ]
    end proc
    
    The expressions for n = 16 are obtained by twice applying the tangent half-angle formula to tan(π/4)

References

  1. ^ Hwa, Young Lee (2017). Origami-Constructible Numbers (PDF) (MA thesis). University of Georgia. pp. 55–59.
  2. ^ Park, Poo-Sung. "Regular polytope distances", Forum Geometricorum 16, 2016, 227-232. http://forumgeom.fau.edu/FG2016volume16/FG201627.pdf Archived 2016-10-10 at the Wayback Machine
  3. ^ a b c Meskhishvili, Mamuka (2020). "Cyclic Averages of Regular Polygons and Platonic Solids". Communications in Mathematics and Applications. 11: 335–355. arXiv:2010.12340. doi:10.26713/cma.v11i3.1420 (inactive 1 July 2025).{{cite journal}}: CS1 maint: DOI inactive as of July 2025 (link)
  4. ^ a b c d Johnson, Roger A., Advanced Euclidean Geometry, Dover Publ., 2007 (orig. 1929).
  5. ^ Pickover, Clifford A, The Math Book, Sterling, 2009: p. 150
  6. ^ Chen, Zhibo, and Liang, Tian. "The converse of Viviani's theorem", The College Mathematics Journal 37(5), 2006, pp. 390–391.
  7. ^ Coxeter, Mathematical recreations and Essays, Thirteenth edition, p.141
  8. ^ "Math Open Reference". Retrieved 4 Feb 2014.
  9. ^ "Mathwords".
  10. ^ Chakerian, G.D. "A Distorted View of Geometry." Ch. 7 in Mathematical Plums (R. Honsberger, editor). Washington, DC: Mathematical Association of America, 1979: 147.
  11. ^ a b Bold, Benjamin. Famous Problems of Geometry and How to Solve Them, Dover Publications, 1982 (orig. 1969).
  12. ^ Kappraff, Jay (2002). Beyond measure: a guided tour through nature, myth, and number. World Scientific. p. 258. ISBN 978-981-02-4702-7.
  13. ^ a b Are Your Polyhedra the Same as My Polyhedra? Branko Grünbaum (2003), Fig. 3
  14. ^ Regular polytopes, p.95
  15. ^ Coxeter, The Densities of the Regular Polytopes II, 1932, p.53

Further reading

  • Lee, Hwa Young; "Origami-Constructible Numbers".
  • Coxeter, H.S.M. (1948). Regular Polytopes. Methuen and Co.
  • Grünbaum, B.; Are your polyhedra the same as my polyhedra?, Discrete and comput. geom: the Goodman-Pollack festschrift, Ed. Aronov et al., Springer (2003), pp. 461–488.
  • Poinsot, L.; Memoire sur les polygones et polyèdres. J. de l'École Polytechnique 9 (1810), pp. 16–48.
Family An Bn I2(p) / Dn E6 / E7 / E8 / F4 / G2 Hn
Regular polygon Triangle Square p-gon Hexagon Pentagon
Uniform polyhedron Tetrahedron Octahedron • Cube Demicube Dodecahedron • Icosahedron
Uniform polychoron Pentachoron 16-cell • Tesseract Demitesseract 24-cell 120-cell • 600-cell
Uniform 5-polytope 5-simplex 5-orthoplex • 5-cube 5-demicube
Uniform 6-polytope 6-simplex 6-orthoplex • 6-cube 6-demicube 122 • 221
Uniform 7-polytope 7-simplex 7-orthoplex • 7-cube 7-demicube 132 • 231 • 321
Uniform 8-polytope 8-simplex 8-orthoplex • 8-cube 8-demicube 142 • 241 • 421
Uniform n-polytope n-simplex n-orthoplex • n-cube n-demicube 1k2 • 2k1 • k21 n-pentagonal polytope
Topics: Polytope families • Regular polytope • List of regular polytopes and compounds • Polytope operations