Abstract
The circuit layout system in a Euclidean space is defined. By means of algebraic,analytic, geometric and inequality theories, we obtain several sharp lowerbounds involving the circuit layout system.
MSC: 51K05, 26D15.
Similar content being viewed by others
1 Introduction
We first introduce a circuit layout problem as follows. Let Γ be a rectangular(or polygon) courtyard (or street). Five light poles (or street lamp), with a fixedminimal distance apart from each other, are proposed to be erected on the boundaryof Γ, and straight underground pipes are planned to connect these poles (seeFigure 1). Assuming that the major cost of theconstruction project is the price of the pipes, it is then important to find out theminimal total lengths required for the project, its purpose is toestimate the installation costs.
We can easily illustrate this problem by means of Figure 1in a later Example 4.3 in which the corners of the courtyard Γ areindicated by the points , , and , while the light poles are indicated by, , , and , respectively. The light poles are kept apart fromeach other for clear reasons so that we may assume the distances
We need to find among all possible locations of such that the total length
is the minimal one.
The above problem can easily be generalized. To this end, we need to recall somebasic concepts as follows.
Let be a Euclideanspace, and . The inner product of α andβ is denoted by and the norm of α is denoted by. The dimension of satisfies if and only if there exist n linearlyindependent vectors in (see [1]).
Let B, C be points in , the closed, openand closed-open segments joining them will respectively be denoted by
and defined as usual by
where
Let , , where
be a sequence of points in and
We call the set
an n-polygon, or a polygon if no confusion is caused. The angleaat and the angle ∠A are defined as
In case each is the same, we say that our polygon is equiangular.We will also denote the total length (or perimeter) of an n-gon by
where, and in the future,
Now we give the definition of the circuit layout system in a Euclidean space asfollows.
Definition 1.1 Let and , where , be two polygons in with the dimension. We say that the set
is a circuit layout system (or CLS for short) if the following conditions aresatisfied:
(H1.1) , .
(H1.2) for and .
(H1.3) If , then for and .
(H1.4) If and for and , then .
(H1.5) For any , there exists such that .
(H1.6) For any , there is such that
In this paper, we are concerned with the sharp lower bound (see [2–5]) of , its purpose is to estimate the installation costs ofthe circuit layout problem. In other words, we will mainly be concerned with thefollowing problem.
Problem 1.1 (Circuit layout problem)
Let be a CLS. How can we determine the lower bound of by means of n, N, δand ?
In this paper, by means of algebraic, analytic, geometric and inequality theories,several sharp lower bounds of in Problem 1.1 are obtained. As applications of ourresults, in Section 4, we calculate that for the special circuit layout system by means of three effective examples.
2 Preliminaries
We provide in this section some basic terminologies and results which are necessaryfor the investigation of Problem 1.1.
We first recall the concept of parallel vectors for later use. Two vectors xand y in are said to be inthe same (opposite) direction if (i) or , or (ii) and and x is a positive (respectively negative)constant multiple of y. Two vectors x and y in the same(opposite) direction are indicated by (respectively ) (see [1]).
Next, we set that
where .
In order to study Problem 1.1, we need six lemmas as follows.
Lemma 2.1 (Minkowski’s inequality [6])
Ifand, then
Furthermore, the equality holds if and only if.
According to Lemma 2.1 and the algebraic theory, we easily get the followinglemma.
Lemma 2.2 (Minkowski-type inequality [6])
Let. If, and, then for any, we have
Furthermore, if, then the equality in (2) holds if andonly if.
Lemma 2.3 Let the function be defined by
where, . Then the function φ is nondecreasing. If in addition, , then φ is increasing.
Proof Note that
Thus, is nondecreasing. Furthermore, if, then is a strictly increasing function. This ends theproof. □
Lemma 2.4 Let. Ifand, then
The result of Lemma 2.4 is well known.
By our assumptions (H1.2)-(H1.5), we may easily get the following result.
Lemma 2.5 Letbe a CLS. Then, for any, there existandsuch that
Furthermore,
Lemma 2.6 Letbe a CLS. If the infimum ofcan be attained, then for any
we have
whereandare defined in Lemma 2.5.
Proof Suppose to the contrary that there exist and such that
We construct a new as follows: If
then . If there exists such that , then
and
Now fix . Denote
Without loss of generality, we can assume that , . By condition (H1.3) and Lemma 2.4, we obtainthat
Since
we see that
where
By condition (H1.6), (6) and (9), we see that
According to Lemma 2.3, the function is increasing. Thus, by (10) and (11), we have
This is contrary to the minimality of . The proof is completed. □
3 Study of Problem 1.1
3.1 The case where n is an odd number
We first study the case of Problem 1.1 where n is an odd number. In thissituation we have the following result.
Theorem 3.1 Letbe a CLS and n is an odd number. Then we have the following inequality:
Proof We construct another such that (7) holds for any. Set
By equality (7) and Lemma 2.4, we see that
therefore,
Since
by (13) and (14) we obtain that
In view of Lemma 2.6 and equality (10), we see that
i.e.,
where
Note that condition (H1.1) implies , thus, where the matrix is positive definite.According to inequality (15), Lemma 2.2 and equality (14), we obtain that
This means that inequality (12) holds.
In addition, from the above analysis we may easily see that the equality in (12)holds if
(H3.1) is an equiangular n-gon;
(H3.2) for any , , equality (5) holds;
(H3.3) equality (4) holds; and
(H3.4) there exist such that
where
The proof is completed. □
3.2 The case where n is an even number
Now, we consider the case of Problem 1.1 where n is an even number.
Theorem 3.2 Letbe a CLS, n is even, and let
Then we have the following two assertions:
-
(I)
If
then we have
where
andis the Gaussian function.
-
(II)
If
then we have
Proof First we consider the case where
We show that for any , equality (7) holds by constructing a new. Since n is an even number, by the proofof Theorem 3.1 and (13), we see that
and
Inequality (15) is still valid where
is a positive definite quadratic function. By means of inequality (15),Lemma 2.2, (18), (19) and (4), we then obtain that
i.e.,
where
and
Note that
i.e.,
where
Set
Since
we see that
Thus, if
then
where equality holds if and only if , and if
then
The equalities in (25) and (26) hold if and only if . From (20), (21), (25) and (26), we see that
Thus, inequality (16) is proved.
Second, we consider the case
Since
we see that
and
where equality holds in (28) if and only if . By (20), (21) and (28), we have
Thus, inequality (16) is proved.
Finally, the conditions for the equality in (16) to hold are as follows:
(H3.5) The n-gon is an equiangular n-gon.
(H3.6) Equality (5) holds for any , .
(H3.7) Equality (4) holds.
(H3.8) , where is defined by (23).
(H3.9) There exist such that
While the conditions for the equality in (17) to hold are as follows:
(H3.10) The conditions (H3.5)-(H3.7) and (H3.9) hold.
(H3.11) .
Here,
This completes the proof of this theorem. □
3.3 The case is an equiangular n-gon
Equiangular polygon is a special kind of polygons. Regular polygon in is an equiangular polygon. If is a Euclideanspace with , then there is an equiangular 4-gon in . Indeed, in , there exist atleast two linearly independent vectors α,β. Then, by the Gram-Schmidt orthogonalizationprocess, we may obtain two orthogonal unit vectors from α, β. If we set
where , then the 4-gon is an equiangular polygon in with
Similarly, if , then the 8-gon
is equiangular with
where i, j, k are three mutually orthogonal unit vectors in .
We now turn to the calculation of .
Theorem 3.3 Letbe a CLS with n odd, and letbe an equiangular n-gon. Suppose that there existfor each, such that:
(H3.12) .
(H3.13) .
(H3.14) , where.
Then
Proof By the assumptions in Theorem 3.3, conditions (H3.1) and(H3.3) hold. Since , there exists such that condition (H3.2) holds. Thus, we justneed to consider condition (H3.4).
From
we have
By
and (30), we get
We can rewrite (31) as
By (30), (32), and n is odd number, we obtain that
where . By (30), and
we have
According to the assumption in Theorem 3.3, and (33)-(35), condition (H3.4)holds. Consequently, by Theorem 3.1, Theorem 3.3 holds.
This completes the proof of Theorem 3.3. □
Theorem 3.4 Letbe a CLS. Assume thatis an equiangular n-gon where n is an even number, and
Suppose that there existfor eachand free variablesuch that:
(H3.15) Condition (H3.12) holds.
(H3.16) The following inequalities hold:
where
(H3.17)
where ω is defined by (22).
Then we have the following two assertions:
-
(I)
If
then
-
(II)
If
then
Proof We first look for the conditions for equality in (16)-(17) tohold. The conditions are either (H3.5)-(H3.9) or (H3.10)-(H3.11). By theassumptions in Theorem 3.4 and , conditions (H3.5)-(H3.8) and (H3.11) hold. If(H3.5)-(H3.9) hold, then (H3.10) hold. Therefore we just need to show that(H3.9) holds.
Form (18)-(19) and
we see that
where
Consequently,
By
and (42), we have
and
Equalities (40)-(43) imply that if , then (43) holds, i.e., (44) holds. From(43) we have get (36), where are free variables. By (42),,
we have
This means that condition (H3.9) can be deduced from conditions (H3.15)-(H3.17).Thus Theorem 3.4 holds by applying Theorem 3.2.
This completes the proof of Theorem 3.4. □
4 Three effective examples
For a general , the equalities in (12), (16) and (17) may not hold,this is most probably because conditions (H3.1)-(H3.4) or conditions (H3.5)-(H3.11)cannot be met at the same time. We will discuss Problem 1.1 of a special CLS in.
Example 4.1 Consider the , where
and a, b, c is the length of the sides of the triangle. We will calculate that .
By Theorem 3.1 we have
where A, B, C are three inner angles of the triangle. According to conditions (H3.1)-(H3.4), the equalityin (46) holds if and only if is a normal triangle, and , , are the midpoints of line segment, , , respectively. Consequently, the equality ininequality (12) does not hold in general.
It is well known that is an acute triangle if and only if
implies that takes the minimum. By this we see that
If and , then
is necessary and sufficient for to take the minimum. By this we see that
Example 4.2 Consider the (see Figure 2), where
and
We will calculate that .
Note that
Without loss of generality, we may assume that . By Lemma 2.6, we have
where , and
By the help of Mathematica software, we obtain that
We note that (49) and
hold if
Example 4.3 Consider the (see Figure 1), where is a rectangle, and
and
We will calculate that .
We may assume that . By Lemma 2.6, we have
where , and
By the help of Mathematica software, we obtain that
On the other hand, by Theorem 3.2, we have
It should be noted that the apparent error is caused by the computer. Therefore
We note that (51) holds if
We can also give another intuitive proof of equation (52) as follows.
By Theorem 3.2, the equality in (51) holds if conditions (H3.5)-(H3.11) hold. Infact, there exist
such that (50) holds. From (H3.9) we get
i.e.,
Combined with (50), (53), we get
where w is a free variable. This means that (51) holds if and only if(53)-(54) hold. This proves equation (52).
In addition, we can also prove (52) by Theorem 3.4.
Example 4.3 is a geometry problem. However, we can see this example as a circuitlayout problem of a family. In addition, this example also means that the equalitiesin (12), (16) and (17) can hold.
Remark 4.1 Since a Euclidean space is an abstract space, we will find theapplications of CLS in theoretical fields such as statistics (see [1, 7]), matrix theory (see [8]), geometry (see [6, 9–12]) and space science (see [1, 9]), etc.
Remark 4.2 A large number of theories of algebra, analysis, geometry, computer(see [9, 12–14]) with inequality are used in this paper, which can be found in the latestliterature [1, 6–16].
Endnote
The angle between two nonzero vectors B and C is defined to be.
References
Wen JJ, Han TY, Cheng SS: Inequalities involving Dresher variance mean. J. Inequal. Appl. 2013., 2013: Article ID 366.http://www.journalofinequalitiesandapplications.com/content/2013/1/366
Matejc̆ka L: Sharp bounds for the weighted geometric mean of the first Seiffert andlogarithmic means in terms of weighted generalized Heronian mean. Abstr. Appl. Anal. 2013., 2013: Article ID 721539
Gao HY, Guo JL, Yu WG: Sharp bounds for power mean in terms of generalized Heronian mean. Abstr. Appl. Anal. 2011., 2011: Article ID 679201
Chu YM, Long BY: Bounds of the Neuman-Sándor mean using power and identric means. Abstr. Appl. Anal. 2013., 2013: Article ID 832591
Chu YM, Hou SW: Sharp bounds for Seiffert mean in terms of contraharmonic mean. Abstr. Appl. Anal. 2012., 2012: Article ID 425175
Gardner RJ: The Brunn-Minkowski inequality. Bull. Am. Math. Soc. 2002, 39: 355–405. 10.1090/S0273-0979-02-00941-2
Wen JJ, Zhang ZH: Jensen type inequalities involving homogeneous polynomials. J. Inequal. Appl. 2010., 2010: Article ID 850215 10.1155/2010/850215
Wen JJ, Wang WL: Chebyshev type inequalities involving permanents and their applications. Linear Algebra Appl. 2007, 422(1):295–303. 10.1016/j.laa.2006.10.014
Gao CB, Wen JJ: Theory of surround system and associated inequalities. Comput. Math. Appl. 2012, 63: 1621–1640. 10.1016/j.camwa.2012.03.037
Gao CB, Wen JJ: Several identities and inequalities involving Jordan closed curves. Appl. Math. E-Notes 2008, 8: 148–158.
Wen JJ, Ke R, Lu T: A class of geometric inequalities involving k -Brocard distance. Chin. Q. J. Math. 2006, 21(2):210–219.
Wen JJ, Wang WL: The inequalities involving generalized interpolation polynomial. Comput. Math. Appl. 2008, 56(4):1045–1058. 10.1016/j.camwa.2008.01.032
Wen JJ, Han TY, Gao CB: Convergence tests on constant Dirichlet series. Comput. Math. Appl. 2011, 62(9):3472–3489. 10.1016/j.camwa.2011.08.064
Wen JJ, Cheng SS: Closed balls for interpolating quasi-polynomials. Comput. Appl. Math. 2011, 30(3):545–570.
Pečarić JE, Wen JJ, Wang WL, Tao L: A generalization of Maclaurin’s inequalities and its applications. Math. Inequal. Appl. 2005, 8(4):583–598.
Wen JJ, Wang WL: The optimization for the inequalities of power means. J. Inequal. Appl. 2006., 2006: Article ID 46782 10.1155/JIA/2006/46782
Acknowledgements
This work was supported in part by the Natural Science Foundation of China (No.61309015) and in part by the Foundation of Scientific Research Project of FujianProvince Education Department of China (No. JK2012049). The authors are deeplyindebted to Professor Sui Sun Cheng, Tsing Hua University, Taiwan, for manyuseful comments and keen observations which led to the present improved versionof the paper as it stands.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no conflicts of interest to this work.
Authors’ contributions
All authors contributed equally and significantly in this paper. All authors read andapproved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Wen, J., Wu, S. & Gao, C. Sharp lower bounds involving circuit layout system. J Inequal Appl 2013, 592 (2013). https://doi.org/10.1186/1029-242X-2013-592
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-592