Some Inequalities Between Two Polygons Inscribed One in the Other

Similar documents
COMPLEX NUMBERS AND QUADRATIC EQUATIONS

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

A Note on Bound for Jensen-Shannon Divergence by Jeffreys

Curvature and isoperimetric inequality

Another converse of Jensen s inequality

arxiv: v1 [math.co] 1 Mar 2014

Spectral Graph Theory and its Applications September 16, Lecture 5

3rd Bay Area Mathematical Olympiad

The Order Relation and Trace Inequalities for. Hermitian Operators

Volume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].

CONVERGENCE OF A GENERALIZED MIDPOINT ITERATION

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

The internal structure of natural numbers and one method for the definition of large prime numbers

The Second Eigenvalue of Planar Graphs

Edge Isoperimetric Inequalities

Formulas for the Determinant

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Randić Energy and Randić Estrada Index of a Graph

The Second Anti-Mathima on Game Theory

Line Drawing and Clipping Week 1, Lecture 2

Convexity preserving interpolation by splines of arbitrary degree

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Affine transformations and convexity

CSCE 790S Background Results

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

The L(2, 1)-Labeling on -Product of Graphs

Problem Set 9 Solutions

More metrics on cartesian products

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

The path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions

On some variants of Jensen s inequality

Chapter Newton s Method

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

A new construction of 3-separable matrices via an improved decoding of Macula s construction

Foundations of Arithmetic

Geometric drawings of K n with few crossings

Unit 5: Quadratic Equations & Functions

Ch 35 Images. Eunil Won Department of Physics Korea University. Fundamentals of Physics by Eunil Won, Korea University 1

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

The Number of Ways to Write n as a Sum of ` Regular Figurate Numbers

Binomial transforms of the modified k-fibonacci-like sequence

of Nebraska - Lincoln

PES 1120 Spring 2014, Spendier Lecture 6/Page 1

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

For all questions, answer choice E) NOTA" means none of the above answers is correct.

APPENDIX A Some Linear Algebra

The Geometry of Logit and Probit

Solutions to exam in SF1811 Optimization, Jan 14, 2015

HMMT February 2016 February 20, 2016

Kernel Methods and SVMs Extension

Complete subgraphs in multipartite graphs

Affine configurations of 4 lines in R 3

COS 521: Advanced Algorithms Game Theory and Linear Programming

P A = (P P + P )A = P (I P T (P P ))A = P (A P T (P P )A) Hence if we let E = P T (P P A), We have that

A particle in a state of uniform motion remain in that state of motion unless acted upon by external force.

Calculation of time complexity (3%)

On Finite Rank Perturbation of Diagonalizable Operators

Spin-rotation coupling of the angularly accelerated rigid body

Section 8.1 Exercises

Difference Equations

Graph Reconstruction by Permutations

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Important Instructions to the Examiners:

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD

PHYS 705: Classical Mechanics. Calculus of Variations II

Lecture 10: May 6, 2013

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

On cyclic of Steiner system (v); V=2,3,5,7,11,13

Lecture 12: Discrete Laplacian

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:

Learning Theory: Lecture Notes

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Math 702 Midterm Exam Solutions

PAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2

The Minimum Universal Cost Flow in an Infeasible Flow Network

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

Every planar graph is 4-colourable a proof without computer

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

MTH 263 Practice Test #1 Spring 1999

Section 8.3 Polar Form of Complex Numbers

ONE EXPRESSION FOR THE SOLUTIONS OF SECOND ORDER DIFFERENCE EQUATIONS JERZY POPENDA

Variations of the Rectangular Fuzzy Assessment Model and Applications to Human Activities

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

Welfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?

Celestial Mechanics. Basic Orbits. Why circles? Tycho Brahe. PHY celestial-mechanics - J. Hedberg

The lower and upper bounds on Perron root of nonnegative irreducible matrices

An application of generalized Tsalli s-havrda-charvat entropy in coding theory through a generalization of Kraft inequality

Discrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

SL n (F ) Equals its Own Derived Group

2.3 Nilpotent endomorphisms

The Quadratic Trigonometric Bézier Curve with Single Shape Parameter

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

Lecture 10 Support Vector Machines II

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Lecture Notes on Linear Regression

Transcription:

BULLETIN of the Malaysan Mathematcal Scences Socety http://math.usm.my/bulletn Bull. Malays. Math. Sc. Soc. () 8() (005), 73 79 Some Inequaltes Between Two Polygons Inscrbed One n the Other Aurelo de Gennaro Vale Molse,, 86035 Larno (CB), Italy adegennaro@fdespa.com Abstract. It s well known that, gven a trangle nscrbed n another trangle, the permeters of the three external trangles can never all be smultaneously greater than the permeter of the nscrbed trangle and that furthermore they are all equal to t f and only f we put the vertces of the nscrbed trangle at the mdponts of sdes of the crcumscrbed trangle. The same result s true for the areas. The present paper shows how such a results extends to the case of two convex polygons nscrbed one n other, connectng t to the classc works about nscrbed and crcumscrbed polygons respectvely wth mnmum and maxmum permeter. 000 Mathematcs Subject Classfcaton: 5M6 Key words and phrases: Geometrc nequaltes, extremum problems.. Introducton The followng neat nequalty between two trangles one nscrbed n the other was proposed by Debrunner [] n 956 and proved frst by Dresel [] n 96 and later on, wth dfferent methods, by other mathematcans: Theorem.. Gven a trangle ABC and any other trangle A B C crcumscrbng t, t s not possble that we have smultaneously: P(ABC) < P(A CB), P(ABC) < P(CB A) and P(ABC) < P(AC B) where P(ABC) ndcates the permeter of trangle ABC. Another result of the same knd, also proposed by Debrunner [3] n 956 and proved by Bager [4] n 957 and later on by other mathematcans, s the followng: Theorem.. Gven a trangle ABC and any other trangle A B C crcumscrbng t, t s not possble that we have smultaneously: S(ABC) < S(A CB), S(ABC) < S(CB A) and S(ABC) < S(AC B) where S(ABC) ndcates the area of trangle ABC. Receved: December 7, 000; Revsed: December 8, 003.

74 A. de Gennaro In ths paper we want to show how the nequaltes can be extended to the case of two convex polygons nscrbed one n the other, thus achevng a result that generalzes Theorems. and... The general case of convex polygons In the case of convex polygons the followng s n fact true: Theorem.. Gven a convex polygon of n sdes wth vertces A (,...,n) numbered cyclcally so that A 0 A n, and any other polygon of n sdes crcumscrbng t wth vertces A (wth A lyng on the sde A A ), f we call B the ntersecton of the dagonals A A + and A A + (see Fg. ), t s not possble that we have smultaneously: (.) P(A B A + ) < P(A A + A ) for,...,n or (.) S(A B A + ) < S(A A + A ) for,..., n. Furthermore one and only one crcumscrbed n gon exsts such that P(A B A + ) P(A A + A ) and S(A B A + ) S(A A + A ) for,...,n, and that s acheved by puttng the sde A A + parallel to the dagonal A A +. We defne the angular coordnate α (for,...,n) as the angle whch the sde A A makes wth the lne parallel to dagonal A A + passng for vertex A (see Fg. ) and fxng that the parallel lne has to be rotated counterclockwse through a postve angle α n order to become concdent wth A A. For the law of snes we wll have that: (.3) A B + B A + sn λ + snµ + A A + sn(λ + µ + ) for,..., n wth λ t s evdent that so that: (.4) λ+µ+ sn cos λ µ+ sn λ+µ+ cos λ+µ+ cos λ µ+ cos λ+µ+ A + A A + and µ A A A (for,...,n). Now A A + A λ + α + and A A + A A + sn(µ + α ) + sn(λ + α + ) A A + sn(λ + µ + + α + α ) A+ A A µ + α (see Fg. ) and for,...,n. Now, wth α as defned above, t s evdent that: (.5) λ < α < µ + for,...,n cos λ µ++α ++α cos λ+µ++α+ α and the denomnators of last term of (.3) and (.4) are both postve. Hence P(A B A + ) P(A A + A ) wll have the same sgn as: (.6) cos λ µ + cos λ + µ + + α + α cos λ + µ + cos λ µ + + α + + α ( sn λ + α ) + sn α ( sn µ + α ) sn α +.

Some Inequaltes Between Two Polygons Inscrbed One n the Other 75 A D D + A + α + D + A + µ + λ A A + µ + B α j A λ D A Fgure. General case of convex polygons There are now three possbltes: Case (): The α are all zero. Then, for the (.6), 0 for,...,n and the sde A A + s always parallel to the dagonal A A +. Case (): There s only one α 0 or there are two that don t have the same sgn. In such cases, on the varyng of, there wll be an for whch α > 0 and α + 0 (or α 0 and α + < 0). But for (.5) µ + α > 0 and λ + α+ > 0 and so, on the bass of (.6), 0 and the theorem s proved. Case (3): All the α, for,...,n, are dfferent from zero and have the same sgn. In such a case, dvdng (.6) by sn α α+ sn (> 0), has the same sgn as: (.7) sn ( ) λ + α+ sn α+ sn λ cotg α + sn( µ + α sn α ) sn µ + cotg α + cosλ + cosµ +

76 A. de Gennaro and supposng ab absurdo that < 0 for,...,n and consderng that cosλ + cosµ + > 0 we have: (.8) snλ cotg α + < snµ + cotg α for,...,n. Now f α > 0 for,...,n (smlar argument also holds f α < 0) and dvdng by snλ cotg α (> 0) we have: α+ cotg (.9) 0 < < sn µ + for,..., n. cotg α sn λ Multplyng (.9) for,..., n and rememberng that we wll have: (.0) < sn µ + sn λ sn µ + sn λ snµ +, sn λ sn λ +µ+ cos λ µ+ cos λ +µ+ sn λ µ+ sn λ +µ+ cos λ µ+ + cos λ +µ+ sn λ µ+ and dvdng numerator and denomnator by sn λ +µ+ cos λ µ+ (> 0) and utlsng the theorem of tangents n the trangle A A A + we have: (.) < cotg λ +µ+ tg λ µ+ + cotg λ +µ+ tg λ µ+ AA+ A A A A ++A A + AA+ A A A A ++A A whch s a contradcton. To prove (.) we observe, frst of all, that: (.) S(A B A + ) A A + sn µ + sn λ sn(µ + + λ ) and: A A A A + (.3) S(A A + A ) A A + sn(µ + α )sn(λ + α + ) sn(µ + + λ + α + α ) for,...,n for,...,n and, snce sn(µ + + λ )sn(µ + + λ + α + α ) > 0, then S(A B A + )+ S(A A + A ) has the same sgn as: (.4) sn µ + sn λ sn(µ + + λ + α + α ) sn(µ + α )sn(λ + α + )sn(µ + + λ ) sn µ + sn λ [sn(µ + α )cos(λ + α + ) + cos(µ + α )sn(λ + α + )] sn(µ + α )sn(λ + α + ) [sn µ + cosλ + cosµ + sn λ ].

Some Inequaltes Between Two Polygons Inscrbed One n the Other 77 Dvdng by snµ + sn λ sn(µ + α )sn(λ + α + )(> 0), (.4) becomes: (.5) cotg (λ + α + ) cotg λ + cotg (µ + α ) cotg µ +. Let s examne the three cases analysed before: Case (): If α are all zero then, from (.5), 0 for,...,n. Case (): If there s an such that α > 0 and α + 0 (or α 0 and α + < 0) then, for (.5), > 0 and the result s proved. Case (3): If fnally all the α are dfferent from zero and wth the same sgn, developpng (.4), we acheve that has the same sgn as: (.6) sn µ + sn λ snα [sn λ cosα + + cosλ sn α + ] + cos µ + snλ sn α [sn λ cosα + + cosλ snα + ] sn µ + sn λ sn α + [snµ + cosα cosµ + sn α ] sn µ + cos λ sn α + [sn µ + cosα cosµ + sn α ] that, dvdng by snα sn α + (> 0), become: (.7) cotg α + sn λ cotg α sn µ + + sn µ + cosµ + + sn λ cosλ. Now, supposng ab absurdo that < 0 for,...,n and consderng that snµ + cosµ + + sn λ cosλ > 0, we wll have that: (.8) cotg α + sn λ < cotg α sn µ + for,...,n and, supposng α > 0 for,...,n (f α < 0 smlar argument holds but reversng the nequalty), we have: (.9) 0 < cotg α + cotg α < sn µ + sn λ for,...,n and, multplyng (.9) for,...,n, we wll have, for the sne rule, that: sn µ + A A (.0) < sn λ A A + that s agan a contradcton. 3. Conclusve consderatons It s clear that f n 3 the mnmum dagonals A A + concde wth the sdes of trangle A A A 3, the ponts B wth the opposte vertces and Theorem. s reduced to Theorems. and.; Theorem. beng thus a generalzaton of Theorems. and.. Another way to express Theorem. s the followng. Takng the convex polygon wth vertces A (,...,n) we consder the ellpses whch have foc n two subsequent vertces A and A + and whch pass through the pont of ntersecton B. If we now magne throwng a ball from one of the vertces, towards the outsde and beyond the external angle opposte the vertex of the angle of the polygon, and we bounce t subsequently on the n ellpses we wll see that t wll return to the ntal vertex and that the drecton of departure and that of arrval, seen from the nsde of polygon, wll always form an angle π.

78 A. de Gennaro A +3 A + B + B + A + B B A B B A B B A A 3 Fgure. Internal and external polygons It s nterestng to remark too that the ponts B also form a convex n gon whch corresponds, from a projectve pont of vew, to the dual n gon B made by ntersectons of sdes A A and A + A + of polygon A adjacent to the same sde (see Fg. ) and that to Theorem.: P(A B A + ) P(A A + A ) corresponds to the dual result P(A B A +) > P(A A + A ) and lkewse for areas. In substance the result acheved tell us that the n vertces of crcumscrbed polygon A cannot smultaneously (n a manner of speakng) dstance themselves from the correspondng sdes of the nscrbed polygon A A + further than the correspondng ponts B are dstant from that sde. The result s n fact, n a manner of speakng, connected to the classc works about mnmum and maxmum permeters of respectvely nscrbed and crcumscrbed polygons represented by the well known (see e.g. [5]). Theorem 3.. The n gon wth vertces A nscrbed n a gven n gon wth vertces A (,...,n) wth mnmum permeter n all t s that n whch µ + α λ + α for,..., n. Usng the notatons ntroduced before we can say that the arthmetc mean of s maxmum for α µ+ λ for,...,n and that nstead, n order to maxmze

Some Inequaltes Between Two Polygons Inscrbed One n the Other 79 the mnmum of and of, the followng wll be true α 0 for,...,n and n such a case wll be mn{,...,n} mn{,...,n} 0. Of course fnally f the n gon A s regular the two nscrbed n gons wll concde. References [] O. Bottema, R. Djordjevć, R. R. Janć, D. S. Mtrnovć and P. M. Vasć, Geometrc Inequaltes, Wolters-Noordhoff, Gronngen (969), 83. [] L. A. G. Dresel, Nabla, Bull. Malays. Math. Soc. 8 (96), 97 99. [3] H. Debrunner, Elem. Math. (956), 0, Problem 60. [4] A. Bager, Elem. Math. (957), 43. [5] N. D. Kazarnoff, Geometrc Inequaltes, Yale Unversty, (96).