A strict exponential inequality for cyclic polygons and its elliptical generalization
1. Introduction In the geometric analysis of convex planar shapes, the ratio of area to semiperimeter serves as a fundamental continuous shape parameter. For tangential polygons, this ratio defines the exact inradius. By formally adopting this isoperimetric ratio \(r = \frac{A}{s}\) as the generalized inradius for non-tangential cyclic polygons, we can construct strict analytical bounds between the circumcircle and this generalized parameter without relying on the existence of a true inscribed circle. Furthermore, extending these discrete bounds into continuous functional spaces allows for the dedublation of classical algebraic relationships into strict analytical inequalities across multiple geometric forms. Let \(\mathcal{P}\) be a non-degenerate cyclic \(n\)-gon with side lengths \(a_{1},a_{2},\dots,a_{n}\), circumradius \(R\), and generalized inradius \(r = \frac{A}{s}\). The primary result of this paper establishes a novel strict lower bound connecting these parameters. Theorem 1. For any non-degenerate cyclic \(n\)-gon \(\mathcal{P}\), the following inequality strictly holds: \[ \left(\frac{a_{1}+a_{2}+\cdots+a_{n-1}}{a_{n}}\right)^{R/r}>\sqrt{e} \tag{1} \] Isolating the natural logarithm, this theorem can be equivalently expressed as: \[ \ln\left(\frac{S-a_{n}}{a_{n}}\right)>\frac{r}{2R}, \tag{2} \] where \(S=2s\) is the total perimeter of the polygon. The foundational geometric inequality and primary proof methods presented in this note were originally developed by the author under the pseudonym ‘Tveltzel’ in response to a problem posed on Mathematics Stack Exchange [1]. 2. Geometric preliminaries Let \(O\) be the circumcenter of the cyclic \(n\)-gon \(\mathcal{P}\). Any simple (non-intersecting) polygon inscribed in a circle is strictly convex, as its vertices lie in sequential order on the boundary of a strictly convex circular domain. This geometric reality guarantees that all interior angles are strictly less than \(\pi\). We parameterize the polygon using directed central half-angles \(\theta_{i}\in(0,\pi)\) such that \(\sum\limits_{i=1}^{n}\theta_{i}=\pi\). Let \(d_{i}\) be the signed perpendicular distance (apothem) from \(O\) to the side \(a_{i}\). We establish the following sequence of geometric relations: \[ d_{i} = R\cos\theta_{i} \tag{3} \] \[ A = \sum\limits_{i=1}^{n}\frac{1}{2}a_{i}d_{i} \tag{4} \] \[ r = \frac{A}{s} = \frac{\sum\limits_{i=1}^{n}a_{i}d_{i}}{\sum\limits_{i=1}^{n}a_{i}}. \tag{5} \] Consequently, \(r\) serves as the exact perimeter-weighted arithmetic mean of the signed perpendicular distances from the circumcenter to the sides. If the circumcenter lies outside the polygon, the distance to the side subtending the major arc takes a negative weight, rigorously preserving the exact geometric relationship without relying on the existence of an inscribed circle. 3. Required lemmas To analytically bound the logarithmic term, we utilize a lower bound derived from bounds inspired by Topsøe [2] on logarithmic functions, which directly motivates the strict inequality presented below. Lemma 1 (Logarithmic Bound). For all real \(x>1\), \[ \ln(x)>\frac{2(x-1)}{x+1}. \tag{6} \] Proof. Define the auxiliary function \(g(x)=\ln(x)-\frac{2(x-1)}{x+1}\). Evaluating at the boundary yields \(g(1)=0\). Computing the first derivative with respect to \(x\) yields: \[ g^{\prime}(x) = \frac{1}{x} - \frac{2(x+1) - 2(x-1)}{(x+1)^2} = \frac{1}{x} - \frac{4}{(x+1)^2} = \frac{(x-1)^{2}}{x(x+1)^{2}}. \tag{7} \] For all \(x>1\), \((x-1)^2 > 0\) and \(x(x+1)^2 > 0\), strictly implying \(g^{\prime}(x)>0\). Thus, \(g(x)\) is strictly monotonically increasing on the interval \((1, \infty)\), establishing that \(g(x) > 0\) for \(x > 1\). \(\square\) The following result is a standard property of non-negative concave functions. See [3]. Lemma 2 (Subadditivity). Let \(f : [0, D] \to \mathbb{R}\) be concave with \(f(0) \ge 0\). For any \(x, y \in [0, D]\) such that \(x + y \in [0, D]\), it follows that \(f(x) + f(y) \ge f(x + y)\). Proof. For any \(x,y\ge0\) such that \(x+y\le D\), concavity yields: \[ f(x)=f\left(\frac{x}{x+y}(x+y)+\frac{y}{x+y}(0)\right)\ge\frac{x}{x+y}f(x+y)+\frac{y}{x+y}f(0). \] \(\square\) For the convenience of the reader, a proof is included here. The following general result follows directly by induction over \(k\): Corollary 1. Let \(f : [0, D] \to \mathbb{R}\) be concave with \(f(0) \ge 0\). For any \(x_1, \dots, x_k \in [0, D]\) such that \(\sum\limits_{i=1}^k x_i \in [0, D]\), it follows that \[ \sum\limits_{i=1}^k f(x_i) \ge f\left( \sum\limits_{i=1}^k x_i \right). \] 4. Proof of Theorem 1 Let \(x=\frac{S-a_{n}}{a_{n}}\). By the generalized polygon inequality, the sum of any \(n-1\) sides of a non-degenerate \(n\)-gon is strictly greater than the remaining side, meaning \(S-a_{n}>a_{n}\), and consequently \(x>1\). Applying Lemma 1 yields: \[ \ln\left(\frac{S-a_{n}}{a_{n}}\right)> \frac{2\left(\frac{S-a_{n}}{a_{n}}-1\right)}{\frac{S-a_{n}}{a_{n}}+1} = \frac{2(S-2a_{n})}{S} = 2-\frac{4a_{n}}{S}. \tag{8} \] By transitivity, it is thus sufficient to prove the following algebraic condition: \[ 2-\frac{4a_{n}}{S}>\frac{r}{2R} . \tag{9} \] Translating the perimeter \(S\) and area \(A\) into trigonometric representations using the directed central angles, we have \(a_{i}=2R\sin\theta_{i}\), \(S=2R\sum\limits_{i=1}^{n}\sin\theta_{i}\), and \(A=\frac{1}{2}R^2\sum\limits_{i=1}^{n}\sin(2\theta_{i}) = R^{2}\sum\limits_{i=1}^{n}\sin\theta_{i}\cos\theta_{i}\). The ratio \(\frac{r}{2R}\) becomes: \[ \frac{r}{2R} = \frac{2A}{2SR} = \frac{2R^{2}\sum\limits_{i=1}^{n}\sin\theta_{i}\cos\theta_{i}}{2R\left(2R\sum\limits_{i=1}^{n}\sin\theta_{i}\right)} = \frac{\sum\limits_{i=1}^{n}\sin\theta_{i}\cos\theta_{i}}{2\sum\limits_{i=1}^{n}\sin\theta_{i}}. \tag{10} \] Substituting these parameters into the algebraic inequality (9) yields: \[ 2-\frac{8R\sin\theta_{n}}{2R\sum\limits_{i=1}^{n}\sin\theta_{i}}>\frac{\sum\limits_{i=1}^{n}\sin\theta_{i}\cos\theta_{i}}{2\sum\limits_{i=1}^{n}\sin\theta_{i}}. \tag{11} \] Because the polygon is non-degenerate (\(S>0\)), multiplying through by \(2\sum\limits_{i=1}^{n}\sin\theta_{i}\) preserves the inequality direction. Splitting the sums to isolate the \(n\)-th terms simplifies the condition to: \[ \sum\limits_{i=1}^{n-1}\sin\theta_{i}(4-\cos\theta_{i})>\sin\theta_{n}(4+\cos\theta_{n}). \tag{12} \] We define the function \(f(t)=\sin t(4-\cos t)=4\sin t-\frac{1}{2}\sin(2t)\). Since \(\sum\limits_{i=1}^{n}\theta_{i}=\pi\), evaluating \(f(t)\) at the supplementary angle \(\pi-\theta_{n}\) gives: \[ f(\pi-\theta_{n})=\sin(\pi-\theta_{n})(4-\cos(\pi-\theta_{n}))=\sin\theta_{n}(4+\cos\theta_{n}). \tag{13} \] Thus, the geometric condition (12) is identically equivalent to: \[ \sum\limits_{i=1}^{n-1}f(\theta_{i})> f\left(\sum\limits_{i=1}^{n-1}\theta_{i}\right). \tag{14} \] To rigorously complete the proof, we analyze the concavity of \(f(t)\). Differentiating twice yields: \[ f^{\prime}(t) = 4\cos t-\cos(2t) \tag{15} \] \[ f^{\prime\prime}(t) = -4\sin t+2\sin(2t) = -4\sin t+4\sin t\cos t = -4\sin t(1-\cos t). \tag{16} \] Because \(\sin t>0\) and \(1-\cos t>0\) for all \(t\in(0,\pi)\), it follows immediately that \(f^{\prime\prime}(t)<0\), confirming \(f(t)\) is concave on this interval. Since \(f(0)=0\) and the partial sum of angles remains entirely within \([0,\pi]\), Corollary 1 guarantees subadditivity, completing the proof of Theorem 1. 5. Elliptical generalization This mathematical framework can be extended to polygons inscribed in ellipses by leveraging affine transformations. Theorem 2. Let \(\mathcal{E}\) be an ellipse with semi-major
Authors
- Kia Keng Giam (ORCID: https://orcid.org/0009-0007-2566-3862)
Publication Details
- Journal
- The Pečarić Journal of Mathematical Inequalities
- Published
- 2026-11-14
- DOI
- https://doi.org/10.30538/pjmi2026.0028
- Primary Topic
- Mathematics and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00