Geometric constructibility of cyclic polygons and a limit theorem

DOI10.14232/ACTASM-015-259-3MaRDI QIDQ4634932zbMATH OpenOpenAlexFDO

Authors Ádám Kunos, Gábor Czédli

Publication date 12 April 2018

Published in Acta Scientiarum Mathematicarum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.5484, http://publicatio.bibl.u-szeged.hu/9035/1/appeared_czedli_kunos_geometric_constructibility_of_cyclic_polygons_and_a_limit_theorem_u.pdf

zbMATH Keywords

circumscribed polygoncompass and rulercyclic polygonfield extensiongeometric constructibilityHilbert's irreducibility theoremholomorphic functioninscribed polygonpower seriesPuiseux seriesstraightedge and compass

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Elementary problems in Euclidean geometries (51M04) Geometric constructions in real or complex geometry (51M15) Convex sets in (2) dimensions (including convex curves) (52A10)

Abstract: We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their side lengths with straightedge and compass, provided $n$ is at least five. They are non-constructible even in the particular case where they only have two different integer side lengths, provided that $neq6$. To achieve this goal, we develop two tools of separate interest. First, we prove a limit theorem stating that, under reasonable conditions, geometric constructibility is preserved under taking limits. To do so, we tailor a particular case of Puiseux's classical theorem on some generalized power series, called Puiseux series, over algebraically closed fields to an analogous theorem on these series over real square root closed fields. Second, based on Hilbert's irreducibility theorem, we give a emph{rational parameter theorem} that, under reasonable conditions again, turns a non-constructibility result with a transcendental parameter into a non-constructibility result with a rational parameter. For $n$ even and at least six, we give an elementary proof for the non-constructibility of the cyclic $n$-gon from its side lengths and, also, from the emph{distances} of its sides from the center of the circumscribed circle. The fact that the cyclic $n$-gon is constructible from these distances for $n=4$ but non-constructible for $n=3$ exemplifies that some conditions of the limit theorem cannot be omitted.

Recommendations

• Geometric constructibility of Thalesian polygons
• scientific article; zbMATH DE number 2010099
• On the area formulas of inscribed polygons in classical geometry
• On the existence and constructibility of inscribed polygons
• Cyclic polygons with given edge lengths: existence and uniqueness

Cites work

• Field Arithmetic
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 1970438 (Why is no real title available?)
• scientific article; zbMATH DE number 2025824 (Why is no real title available?)
• scientific article; zbMATH DE number 1520569 (Why is no real title available?)
• scientific article; zbMATH DE number 1797624 (Why is no real title available?)
• scientific article; zbMATH DE number 3445421 (Why is no real title available?)
• scientific article; zbMATH DE number 854560 (Why is no real title available?)
• scientific article; zbMATH DE number 3207354 (Why is no real title available?)
• scientific article; zbMATH DE number 5268066 (Why is no real title available?)
• scientific article; zbMATH DE number 3088091 (Why is no real title available?)
• Introduction to abstract algebra
• On the existence and constructibility of inscribed polygons
• On the interval containing at least one prime number
• Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First

Cited in

(7)

• Geometric construction of a coboundary of a cycle
• Limiting forms of iterated circular convolutions of planar polygons
• Carlyle Circles and the Lemoine Simplicity of Polygon Constructions
• scientific article; zbMATH DE number 2010099 (Why is no real title available?)
• Geometric constructibility of Thalesian polygons
• Geometric constructibility of polygons lying on a circular arc
• Generalization of Heron's and Brahmagupta's equalities to any cyclic polygon

This page was built for publication: Geometric constructibility of cyclic polygons and a limit theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634932)