Archimedean solid Created 2026-09-29 Updated 2026-11-05
An Archimedean solid is a convex uniform polyhedron, excluding the Platonic solids and the infinite families of uniform prisms and antiprisms. Here uniform means that every face is a regular polygon and that the symmetry group acts transitively on the vertices of a polyhedron: a symmetry of the entire solid carries any chosen vertex of a polyhedron to any other. Merely having equal numbers of faces of each type at every vertex of a polyhedron is a weaker local condition.[ref]
There are thirteen types under this convention, counting a mirror-image pair as one type. The infinite prism and antiprism families are excluded by convention even though their uniform members satisfy the same regular-face and global vertex-equivalence conditions.[ref]
For example, the truncated octahedron has six square faces and eight regular hexagon faces. Counting face-edge incidences gives edge of a polyhedron; Euler characteristic then gives vertices of a polyhedron. At each vertex of a polyhedron, one square and two regular hexagons meet. The icosidodecahedron, with twenty equilateral triangles and twelve regular pentagons, gives a different regular-face combination.
Area of a regular octagon Created 2026-09-24 Updated 2026-11-05
A regular polygon with eight sides, each of length , has area
Join its center to all eight vertices of a polygon. The resulting congruent isosceles triangles each have base and central angle . Bisecting one gives a right triangle with opposite side and adjacent side , the perpendicular center-to-side distance. Hence
Adding the eight triangle areas gives , proving the formula. For side length one, the area is .
Constructible polygon Created 2026-10-14 Updated 2026-10-31
A constructible polygon is a polygon whose vertices can be obtained by a compass-and-straightedge construction from the specified initial data. The classical question for a regular polygon asks which numbers of sides permit an exact construction from a given side or circumscribed circle.
Take four congruent octagonal regular polygons with four alternate sides labelled . The intervening sides have Neumann boundary conditions. Pair equal face parameters in the positive reference boundary direction. The complete gluing data are
All unpaired labelled faces not in a Dirichlet column also have Neumann boundary conditions. Encode these rules by signed permutation matrices, using a positive swap for a paired interface and diagonal or for an unpaired Dirichlet boundary condition or Neumann boundary condition. The four-by-four Hadamard matrix above satisfies for every label. Explicitly, if its columns are , applying gives respectively , , , and , which are exactly the columns of the corresponding . On every intervening face the face matrix is the identity.
Since , the orthogonal matrix preserves the inner product and the sum of Dirichlet energies. Its intertwining relations map matching Sobolev traces and zero Dirichlet traces bijectively to those of the other assembly. It therefore preserves the quadratic form domains and the forms themselves. The associated self-adjoint operators are unitarily equivalent, proving equality of all eigenvalues with their multiplicities for the specified mixed boundary conditions.
The topology of disk tiles glued along disjoint boundary arcs shows that , whose gluing graph is in a path, is a closed disc and is simply connected and orientable. The gluing graph of has edges ; it is connected with two independent cycles, so and . Its odd cycle makes it a nonorientable surface. Each assembled surface has nonempty polygonal boundary. This explicitly realizes isospectrality between a simply-connected orientable bordered surface and a nonorientable, non-simply-connected one. The boundary corners and mixed boundary conditions are essential qualifications; it does not contradict the Euler characteristic from the heat trace of a bordered surface for smooth boundaries and pure boundary conditions.
Gauss-Wantzel theorem 2026-10-14
For , a regular polygon with sides is a constructible regular polygon exactly when , where is a nonnegative integer and the are distinct Fermat primes; the product may be empty. Thus seventeen and fifteen qualify, while nine does not. Carl Friedrich Gauss established sufficiency, and Pierre Wantzel proved necessity in 1837.[ref]
Kriz theorem for cyclic transitive point sets Created 2026-09-24 Updated 2026-09-24
Every finite cyclic transitive point set is a Euclidean Ramsey set. In particular every regular polygon is Euclidean Ramsey.
Fix a bounded tile in Euclidean space with labelled flat boundary faces. For each face label , encode an assembly of copies by an involutive real symmetric signed permutation matrix : a paired interface contributes a two-by-two swap, an unglued face with a Neumann boundary condition contributes on the diagonal, and an unglued face with a Dirichlet boundary condition contributes . Use the same face-identification convention on each copy. If a second assembly has matrices and there is an invertible constant matrix satisfying
then the map is an isomorphism between corresponding Laplace-Beltrami operator eigenspaces. This is the transplantation theorem.
To prove it, restrict an eigenfunction to the tile copies and identify each copy with . Along a face, let be its vector of boundary values and its vector of outward normal derivatives. At a glued interface the values agree and the outward derivatives are opposite. At an unglued face with a Neumann boundary condition the derivative vanishes, and at a face with a Dirichlet boundary condition the value vanishes. All three cases are encoded by
The intertwining identities give and , so the transplanted function satisfies the second assembly's interface and boundary conditions. On each tile its Laplace-Beltrami operator is the same constant linear combination of the original Laplacians, hence it has the same eigenvalue. Across an interface, matching values and opposite normal derivatives make it a weak solution; elliptic regularity, or the allowed reflection principle, makes it a genuine smooth solution there. At corners the operator is understood by its finite-energy, Friedrichs extension; the same matching argument applies to its quadratic form domain. Applying reverses the construction. Thus dimensions of all eigenspaces agree, including multiplicities, and the two specified boundary-value spectra coincide.
The requested pair exists with explicitly specified mixed boundary conditions and polygonal boundary. Take four copies of an octagonal regular polygon in Euclidean space. Label four alternate sides in cyclic order; the four intervening sides always have a Neumann boundary condition. The labelled sides are disjoint even at their endpoints. Parameterize every side in the positive boundary direction of the reference octagon. When pairing same-labelled sides, identify equal parameters. This produces a locally flat surface with boundary: a neighbourhood of an interior point of an interface consists of two half-disks glued along their diameters. All tile vertices remain boundary points, with boundary angles or ; there are no interior cone points.
Here are the complete gluing and boundary conditions. An entry pairs the corresponding sides of . The indicated unpaired sides have a Dirichlet boundary condition; every other unpaired side has a Neumann boundary condition.
Both assemblies are compact and connected. The Laplace-Beltrami operator is the nonnegative operator associated with the finite-energy quadratic form , with zero Sobolev trace on the specified Dirichlet arcs. Thus the mixed boundary condition is defined without requiring classical differentiability at a corner or at a Dirichlet–Neumann junction.
The four signed permutation matrices for are
For they are
Use the Hadamard matrix
The intertwining relations can be checked on all columns at once. Writing the columns of as , direct application of the displayed gives
For the four intervening faces both assemblies have the identity face matrix, so these intertwining relations hold as well. Also . This four-tile mixed-boundary transplantation between a disk and a nonorientable surface gives a bijection of every pair of eigenspaces, preserving eigenvalues and multiplicities.
There is also a direct argument on the quadratic form domains that handles all boundary corners. The orthogonal matrix acts on tile restrictions, preserves their L2 inner product and the sum of their Dirichlet energies, and commutes with taking a Sobolev trace. The condition on each face encodes equality of the two traces at a paired interface and vanishing trace at an unpaired Dirichlet face. Intertwining takes these conditions exactly to . Consequently maps the whole form domain onto the other form domain and preserves its quadratic form. The associated self-adjoint operators are unitarily equivalent, proving isospectrality for the stated mixed boundary conditions without any assumption of smoothness at a Dirichlet–Neumann junction.
We now verify the actual topology using the topology of disk tiles glued along disjoint boundary arcs. Because the gluing arcs in each tile are disjoint, the resulting surface with boundary is a thickening of its gluing graph, with one vertex for each closed disc tile and one edge for each paired arc. One can construct this homotopy equivalence by taking a small central closed disc in each tile and narrow strips to its paired arcs. What remains is a collar neighbourhood of the boundary, which retracts onto this connected system of closed discs and strips. Shrinking each central closed disc and each strip then gives the gluing graph. Equivalently, begin with a spanning tree of the gluing graph: its closed disc tiles joined along boundary arcs form one closed disc, and every remaining pair of boundary arcs adds one band. Thus for tiles and paired arcs the fundamental group is a free group of rank , and the Euler characteristic is .
For , the gluing graph is the path
Gluing a new closed disc to a closed disc along one boundary arc again gives a closed disc; applying this three times proves that is homeomorphic to a closed disc. In particular
For , the five paired arcs give the graph edges . It is connected, and hence
Here is the free group on two generators, so is not simply connected. To decide orientation of a surface, give every reference tile its counterclockwise orientation. Our same-parameter gluing preserves boundary directions, so a global orientation requires opposite orientation signs on paired tiles: the two induced boundary orientations at an interior interface must be opposite. Such signs exist exactly when the gluing graph is bipartite. In the cycle
has length three. Following it forces the sign to reverse three times and return to its starting tile with the opposite sign. This proves that is a nonorientable surface. It has nonempty boundary because every intervening octagon side remains unpaired. Thus is a simply-connected orientable surface with boundary, whereas its isospectral partner is neither simply connected nor orientable, exactly as required, for the specified mixed boundary problem.
The boundary qualification is essential. With smooth boundary and the same pure Dirichlet boundary condition or pure Neumann boundary condition on both surfaces, the following existing obstruction applies. Polygonal corners and the mixed boundary conditions in the construction above place it outside that obstruction.
With the interpretation of compact smooth Riemannian surfaces with the same pure Dirichlet boundary condition or pure Neumann boundary condition, the printed simply-connected/nonorientable pair cannot exist. The two-dimensional heat trace has the following expansion (the smooth-boundary coefficients are given in the heat-coefficient formulas, Theorems 5.1–5.2):
where the boundary sign is minus for Dirichlet and plus for Neumann. The Gauss-Bonnet theorem identifies the constant term with . Isospectrality therefore forces equal Euler characteristics. A compact connected simply-connected surface with boundary is a disk and has . A connected nonorientable surface with crosscaps and boundary components has . Thus no such smooth pure-Dirichlet or pure-Neumann pair exists. This is the Euler characteristic from the heat trace of a bordered surface.
Piecewise-smooth boundaries introduce corner terms, and mixed boundary conditions change the heat coefficients, as the explicit construction above demonstrates. Moreover, in the usual pure-Neumann polygonal reflection-transplantation setup, the pure Neumann reflection transplantation preserves Euler characteristic argument applies even with corners. The numbers of tiles agree. For each face label the number of edge classes is , so these agree too. For each tile-vertex label, vertex classes are orbits of the subgroup generated by incident-face involutions. Their number is the dimension of invariant vectors in that permutation representation, which is unchanged by the intertwiner. Hence the numbers of vertices agree, proving equal . Thus this standard tiled construction also cannot supply a disk on one side and a nonorientable surface on the other.
For comparison, the following existing construction gives an orientable and a nonorientable pair with the same spectrum for the pure Neumann boundary condition. Both have nontrivial fundamental groups; this is a separate example, not the construction used to meet the simply-connected requirement above. This eight-tile Neumann transplantation across orientability makes the comparison explicit. The finite seed is the affine modulo-eight example in the original orientability construction; the intertwiner and the topology checks are derived below. Take eight copies of a regular Euclidean hexagon and label three pairwise nonadjacent sides . Every remaining side is a side with a Neumann boundary condition. Index the copies by . For the first assembly pair same-labelled faces according to
for the second, use
with all arithmetic modulo eight. A fixed point means an unglued side with a Neumann boundary condition. Pair faces by the reflection convention, matching the same endpoint parameter in the reference tiles. The distinguished sides are disjoint, so no interior vertex singularities are created; the resulting surfaces have polygonal boundary corners.
Let on the eight-dimensional tile-index space and set
It commutes with the permutation matrices for and , because its coefficients are invariant under reversing cyclic order. For , write , where , , and all other vanish. The required relation is exactly , verified from these four nonzero entries. Thus all three intertwining relations hold.
The cyclic Fourier vectors diagonalize . Its eigenvalues are
namely . None is zero, so is invertible and the two assemblies are isospectral manifolds for the Neumann boundary condition.
We prove their topology as well. Their gluing graphs are connected: the first contains the spanning path , and the second contains the spanning cycle . Each has eight tile vertices and ten paired-face edges. Since tiles are disks and gluing arcs are disjoint, each surface retracts up to homotopy to this multigraph; thus its Euler characteristic is and its fundamental group is a free group of rank three.
An orientation assigns a sign to each reference tile, and a reflection gluing requires opposite signs at the ends of every graph edge. The second graph admits this assignment: take sign on and sign on . Every paired face joins opposite signs, proving orientability. In the first graph the cycle
has odd length. Transporting orientation around it reverses the initial sign, proving nonorientability. Hence the first surface is also not simply connected. The second surface is orientable but likewise not simply connected; the disk required in the question is supplied instead by the four-tile mixed-boundary construction above.
The four-tile construction resolves the printed simply-connected requirement under explicit mixed boundary conditions. The eight-tile comparison only concerns orientation of a surface under a pure Neumann boundary condition.
Let be the vertices of a regular polygon, indexed cyclically so that is an isometry. We first prove the product lemma needed for the cyclic-symmetry argument.
Suppose has the property that, for every number of colors, a finite witness forces a copy of on which the vertices corresponding to are monochromatic. We claim that for every there is a finite witness forcing an -invariant copy of . Proceed by mathematical induction on . The case is the assumption. For the step, choose a finite set that forces an -invariant for a coloring with colors, and choose that forces an -monochromatic for a coloring with colors.
Given a -coloring of , color by its complete vector . In the resulting copy of in , that vector is the same for every member of . Each can therefore be colored by the vector consisting of for one and the colors for . Applying the choice of gives an -invariant copy of , and its product with the chosen copy of in is the desired -invariant copy of . This proves the lemma rather than assuming it.
We now prove by induction on that a finite witness forces a copy of whose first vertices have one color. The case is trivial. For , use that a line segment is a Euclidean Ramsey set; each occurrence of a segment congruent to can be extended to a copy of the regular polygon, and only finitely many extensions are needed for a finite witness.
Assume the assertion for , and put . The product lemma lets us work inside an -invariantly colored copy of , with as large as required. For an increasing -element subset of and , define a word by putting in coordinate , with subscripts read modulo , and putting in every other coordinate. Color by the -tuple
By the Finite Ramsey theorem, for sufficiently large there are coordinates on which all -subsets have the same tuple color.
For , let be the word whose entries in coordinates are
cyclically, and whose other entries are . For , the word differs from only in coordinate , where the two entries lie in . Similarly differs from only in coordinate , again by two members of . The -invariance and the homogeneous choice of the therefore give
Hence have one color.
The cyclic words form an isometric copy of : in each of the varying coordinates the cyclic shift is an isometry, so every squared distance is multiplied by . Rescaling the finite witness by gives a copy of . The induction reaches , proving that every regular polygon is a Euclidean Ramsey set.
For three consecutive vertices of a regular -gon scaled to have side length one,
Since the polygon is Euclidean Ramsey, choosing large enough proves that is an approximately Euclidean Ramsey set.
In fact every finite is approximately Ramsey. First perturb each coordinate of each point onto a sufficiently fine lattice , changing all pairwise distances by less than . For each coordinate, map the finitely many required integers to consecutive vertices of a very large regular polygon, scaled so that one angular step has arc length . If the step angle is , the chord replacing a difference of lattice steps has length
as , uniformly over the finitely many differences involved. Taking the orthogonal Cartesian product of such polygons therefore embeds the perturbed points with a further distance error below . Each polygon is Euclidean Ramsey, and their product is Euclidean Ramsey by the product theorem for Euclidean Ramsey sets. A monochromatic copy of that product contains the corresponding approximate copy of , completing the proof.
The vertices satisfy
After removing the root , the product of the other roots has modulus equal to the constant term of , namely . Hence the product of the chord lengths from one vertex of a unit regular polygon is . Multiplying this identity over all vertices counts every chord twice, so the product of all chord lengths is . Scaling the circle by scales each of its chords by , giving
Let be the vertex set of a regular polygon and let the cyclic rotation group act transitively on it. The finite invariant-colouring lemma says that for every number of colours there are positive weights with such that every colouring of the weighted Cartesian power
contains a monochromatic set
For completeness, prove the lemma along a cyclic composition series for . For a prime cyclic quotient, refine each colour to the finite vector of colours obtained by applying the quotient elements in every active coordinate. The Hales-Jewett theorem supplies a variable block on which this vector is constant. Assign that block squared weights summing to the squared weight of the coordinate it replaces. This makes the quotient orbit monochromatic without changing any orbit distance. Iterating through the cyclic factors proves the lemma for the finite cyclic group .
Because rotations commute, for each coordinate satisfies
for a fixed vertex . Hence the squared distance between the two corresponding product points is
The monochromatic orbit is therefore isometric to . This proves that every regular polygon is a Euclidean Ramsey set.
Now consider the edge-colouring definition. If all pairwise distances in are equal, then is a regular simplex. Take a sufficiently large regular simplex of the same side length. The ordinary finite Ramsey theorem gives a monochromatic -vertex complete subgraph, and every such vertex set is isometric to . Thus is an edge Ramsey set.
Conversely, if has two distances, let and be its least and greatest distances. Colour every Euclidean edge by whether its length equals . Every isometric copy of contains both an edge of length and one of length , so no copy is monochromatic. Hence the edge Ramsey sets are exactly the equidistant finite sets.
Allowing similar copies does not change the answer. If , colour an edge of length by the parity of
In every similar copy, the images of a shortest and a longest edge have lengths and , whose displayed integers differ by one. They receive opposite colours. Thus no non-equidistant is edge Ramsey even up to similarity, while the regular-simplex argument already supplies an isometric copy.
Join the centre of the unit circle to adjacent vertices of the regular polygon. Each of the resulting triangles has two sides of length and included angle . Bisecting one gives a right triangle, so each polygon side, a chord of a circle, has length . Thus the perimeter is .
Each of these triangles has area , so the polygon's area is . Comparing the two expressions gives
The normal closure is the smallest normal subgroup of containing , equivalently the intersection of all normal subgroups containing . Any such normal subgroup contains every and hence every finite product of these elements. Thus .
Include the empty product so that , in particular when . Products of elements of are obtained by concatenating their factor lists. Inversion reverses the list and replaces by , so is closed under inverses. For any ,
Therefore is a normal subgroup and it contains . Minimality of the normal closure gives the reverse inclusion, proving
The notation in a finite-product description is understood to allow the empty product; otherwise the empty generating subset would require a separate identity convention.
In a group presentation, is a set of formal generators and is a subset of the free group , consisting of relators which are required to become the identity. The presented group is
The universal property of a group presentation says that a function extends to a group homomorphism from the presented group precisely when every relator evaluates to in : first extend freely to , then factor through the quotient because its kernel contains the normal closure of .
A rotation by and a reflection of a regular -gon satisfy
The last identity holds because reflection reverses the sense of rotation, and it implies . Hence all defining relators vanish, giving a homomorphism with and .
To prove it is an isomorphism without presupposing the order of the presented group, use . Move every occurrence of to the left, cancel pairs by , and reduce exponents modulo . Every element has one of the forms
Thus . For the usual regular polygon with , the rotations are distinct and the reflections are distinct; no rotation is a reflection, since their planar orientation behavior differs. The supplied description says these exhaust , so , and every one lies in the image of . Surjectivity and the order bound force and trivial kernel. Thus is an isomorphism.
For the requested Cayley graph, use right multiplication by the generators. The edges are the two directed 3-cycles
The edges are the undirected pairs
These pairs use . Thus the underlying graph is a triangular prism, with the two rotation cycles oriented oppositely when reflection pairs are drawn as radial edges.
Figure 1.
The Cayley graph of the dihedral group of order six
. Blue arrows are right multiplication by sigma. Orange undirected edges are right multiplication by the involution tau. Details.
Equal side lengths alone are insufficient: a nonsquare rhombus is not a regular polygon. Use the regular polygon edge rotation criterion: for , successive nonzero edge vectors must be related by the same rotation through either or .
regular :: Polygon -> Bool
regular ps
  | length ps < 3 = False
  | otherwise = norm2 (head es) > 0 && (fits 1 || fits (-1))
  where
    es = [ (u-x,v-y) | ((x,y),(u,v)) <- edges ps ]
    angle = 2*pi / fromIntegral (length ps)
    norm2 (x,y) = x*x+y*y
    close x y = abs (x-y) <= 1e-10 * max 1 (max (abs x) (abs y))
    same (x,y) (u,v) = close x u && close y v
    turn s (x,y) = (cos angle*x - s*sin angle*y,
                    s*sin angle*x + cos angle*y)
    fits s = and (zipWith (\a b -> same (turn s a) b)
                          es (tail es ++ [head es]))
With exact real coordinates and exact equality in same, this is an if-and-only-if test for an ordinary convex regular polygon, in either boundary orientation. The displayed Double implementation tests that condition to the stated tolerance; it cannot promise exact geometric classification near the tolerance boundary. Both orientations are needed, and using the fundamental turn excludes regular star traversals. A repeated zero-length side fails the exact criterion.
Regular heptagon 2026-10-31
A regular heptagon is a regular polygon with seven sides. Its unit-circle vertices have complex coordinates for . It cannot be constructed from a unit segment by a straightedge and compass construction: the first coordinate has degree three over , since the seventh cyclotomic field has degree six and degree two over its real subfield. Every finite constructible coordinate extension has power-of-two degree, which cannot contain a degree-three subextension by the tower law.
For cyclically ordered planar vertices, let , with indices modulo . They describe a convex regular polygon exactly when and there is a single choice of sign for which every successive edge vector is obtained by a rotation through in that orientation. Necessity follows from equal sides and equal exterior angles. Conversely, the edge vectors have the form . Their sum is zero because the corresponding geometric series runs through the distinct roots of unity. Summing its partial series shows that the vertices are a translated and scaled copy of those roots, so they form a convex regular polygon. A larger turn such as can instead trace a star, which is why merely checking a constant turning angle is insufficient.
Figure 1.
Equal sides, equal turns and the fundamental turn distinguish an ordinary regular polygon
. Original constructions: a square satisfies the edge-rotation criterion; a nonsquare rhombus has unequal turns; a five-point star uses the wrong turn, instead of . Arrows indicate traversal direction. Details.