This paper introduces a new computational framework to estimate the expected number of real roots of stochastic functions, bypassing the intractable joint density calculations of classical methods, and provides explicit formulas for specific distributions.
Contribution
A novel framework that avoids joint density calculations by using a cumulative expectation function, enabling analysis of stochastic functions' roots with broader applicability.
Findings
01
Explicit formulas for Gaussian and uniform distributions.
02
New analytical results for linear stochastic functions.
03
Broader applicability of root expectation analysis.
Abstract
We propose a new computational framework for the expected number of real roots of a stochastic function on a given interval. The classical Kac-Rice formula requires the joint density of the function and its derivative, which is often intractable. Our approach avoids this requirement entirely by introducing a cumulative expectation function. Through analysis of its absolute continuity and differential structure, we derive two complementary computational schemes: one expresses the expectation as a derivative of a variable-domain integral under weak conditions; the other yields an explicit integral representation without joint densities or variable-domain differentiation. We illustrate the method in detail for linear stochastic functions, obtaining explicit formulas for Gaussian and uniform distributions, together with several new analytical results. The framework substantially broadens…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometry and complex manifolds · Stochastic processes and statistical mechanics · Data Management and Algorithms
Full text
How many real zeros of a random equation (I)
Abstract
In this paper, we will get the analytical expression of the number of real zeros of a random equation in a interval. First, we present some proprieties of this expectation. Then we discuss a special case that the random function is linear in x, and promote the analytical expression of the expectation. Especially, when the parameter obeys some special distributions, e.g. the uniform distribution in a sup-sphere, the norm distribution, more concise results are got. Finally, we use our results to some classical problems, e.g. random polynomials, random trigonometric equations and etc, and all get the same result existed, which means that all existed results with proper density functions are our corollaries.
Yi Xu
School of Mathematics
Southeast University
2 Sipailou, Nanjing, 210096, China
1 Introduction
How many real zeros t of
[TABLE]
with a parameter x∈Rn,
where F:Δ↦R, Δ⊆R. It is obliviously that the number of the real zeros t of (1) is different with different x. If x is a random variable obeying a distribution with the density function ρ(x), then the number of different real zeros t of (1) is also a random variable. In this paper, we focus on getting its analytical expectation.
Definition 1.1**.**
Defining
[TABLE]
as the expectation of the number of real zeros of (1),
where NF(x,Δ) is the number of different real zeros t∈Δ of (1) with the parameter x∈Rn, ∫dx is the Lebesgue integral.
This problem has been studied for about a hundred years, and there are a lot of results on this subject. Most of them discuss some specific equations F(t;x) with some specific distributions, e.g, random polynomial equations[17, 18, 19, 7, 8, 9, 20, 3, 15, 16, 22, 23, 12, 13, 14, 5]:
[TABLE]
which parameter x obeys the discrete distribution or the standard normal distribution; trigonometric equations[21, 10, 6, 11, 1, 2]:
[TABLE]
which parameter x obeys the standard normal distribution, etc. Although, En(ρ,F,Δ) of above problems are all got, the methods used can’t extend to general cases. In [7], Edelman and Kostlan present a new view to review this problem, where F is linear and homogeneous in x
[TABLE]
They find that this problem could be turned into computing the ratio of the area of a scanned area on a sup-sphere and the area of this sup-sphere. By this idea, they promote a general result to this problem, and get the same results of above problems got by other papers. However, this method still has two disadvantages. Firstly, this method only suits for the standard normal distribution; Secondly, (3) is still not general enough, since (3) is linear and homogeneous in x, it misses a constant term f0(t). Meanwhile, we consider that their method has great potential, so in this paper, we extend this method into more general cases.
The main results are presented here. We find that En(ρ,F,Δ) is just the integral of ρ(x) on Rn with multiplicity, or in other words, the sum of integral of ρ(x) on some subsets of Rn. Then we get that En(ρ,F,[l,t]) is a continuous function in t. Under some assumptions, its derivative Hρ,F(t) exists also. So we could turn the problem that computing En(ρ,F,Δ) into computing Hρ,F(t).
When F(t;x) is linear in x (not homogeneous necessary), we discuss two cases n=2 and n≥4 in subsection 3.1 and 3.2, and analytical expressions of Hρ,F(t) for different n are presented, respectively. Furthermore, we discuss more concrete problems, which x obeys some common distributions, e.g, the uniform distribution in a sup-sphere, the normal distribution, etc, then more concise results are got. We use our results to some classical problems just mentioned above, and find that our results is exactly same as the result existed, it tells us that all existed results with the proper density function are our corollaries.
The remainder of this paper is organized as follows. We close Section 1 by summarizing notations and symbols used throughout this paper, and then Section 2 introduces some properties of En(ρ,F,Δ).
Then, in Section 3, we discuss the case that F(t;x) is a linear function in x. In this section, we discuss two cases that n=2 and n≥4.
Moreover, in Section 4, we present the analytic result when x obeys the uniform distribution in a sup-sphere.
Furthermore, we discuss other distributions in Section 5.
Section 6 concludes this paper and presents some directions for future research. Finally, we present some proofs and lemmas used in this paper in Appendix.
In closing this section, we introduce some basic notations and symbols that will be used in our subsequent analysis.
Notations and Symbols :R and Rn are real Euclidean space and n dimension real Euclidean space, respectively, R+={x∣x≥0}; M:,i is a column vector which is the ith column of matrix M; #{Ω} is the number of elements in set Ω; ∣Ω∣ is the Lebesgue measure of Ω; cl(Ω), int(Ω), ∂(Ω) and Ωˉ are the closure, interior, boundary and complement of Ω, respectively; l(A,B) is the line passing through point A and point B; ∣∣x∣∣ is 2-norm of x; Bn(x∗,r)={x∈Rn∣∣∣x−x∗∣∣≤r};W_{f,g}(t)=\left(\begin{array}[]{cc}f(t)&g(t)\\
f^{\prime}(t)&g^{\prime}(t)\\
\end{array}\right); T(A,B,C)⊂R2 is a triangle with three vertices A, B and C; If x obeys the uniform distribution on Bn(0,r),r>0, we add an extra subscript r to its density function ρr(x) to show the radii of Bn(0,r).
Given a derivable convex(concave) function G(x):R→R and x∗∈R, then the tangent line y−G(x∗)=G′(x∗)(x−x∗) at x∗ separates R2 into two open half planes Ω and Ωˉ, and a line l(x∗,G)={(x,y)∣y−G(x∗)=G′(x∗)(x−x∗)}. Denoting B(G)={(x,y)∣y≥(≤)G(x)}. Supposing Ωˉ⋃l⊇B(G), then we define A(x∗,G)=Ω⋃l as a closed half plane, Aˉ(x∗,G)=Ωˉ⋃l, C(x∗,G)=(Ωˉ∖int(B(G)))⋃l.
Given x∈Rn, where n≥4, we separate x into (y,xˉ), where y∈R2,xˉ∈Rn−2.
For a n(n≥4) dimension set Ω⊂Rn, {y∈R2∣y=0}×P(Ω) is the projection Ω on the subspace {(y,xˉ)∈Rn∣y=0}. Given xˉ∗∈Rn−2, Υ(Ω,xˉ∗)={y∈R2∣(y,xˉ∗)∈Ω}.
Given two hyperplanes l1 and l2 in Rn. If l1⋂l2=∅, then l1 and l2 separate Rn into 4 separated parts Ωi,i=1,2,3,4, where Ω1 and Ω2 are congruent with smaller facial angle, Ω3 and Ω4 are congruent with bigger facial angle. We define
Φ(l1,l2) as the cl(Ω1⋃Ω2).
2 Some properties of En(ρ,F,Δ)
In this section, we study the properties of En(ρ,F,Δ) firstly.
There are some assumptions of ρ(x) used in this paper.
Assumption 2.1**.**
(a)
P(∣∣x∣∣≥r)≤ae−br, where a>0,b>0.
(b)
There exists a constant Q≥0 such that ∣{x∈Rn∣ρ(x)>Q}∣=0.
(c)
∫Ωρ(x)dx=0,∀Ω⊂Rn,∣Ω∣=0.**
(d)
When n≥4, ∫Ωρ(x)dx=∫P(Ω)dxˉ∫Υ(Ω,xˉ)ρ(y,xˉ)dy,∀Ω⊂Rn.
A lot of distributions satisfy Assumption 2.1, e.g. the uniform distribution, the normal distribution, etc.
For avoiding discussing the case that En(ρ,F,Δ)=+∞, we give the following assumption.
Assumption 2.2**.**
There exists a constant κ such that
[TABLE]
Assumption 2.2 tells that for almost every x∈Rn, (1) has κ real zeros at most, so
If A⋂B=∅, then En(ρ,F,A⋃B)=En(ρ,F,A)+En(ρ,F,B).
(d)
If A⊆B, then En(ρ,F,A)≤En(ρ,F,B).
Proof.
(a) It is obviously that (a) is true.
(b) Since
[TABLE]
so the result is right.
(c) It is obviously true by (b).
(d) B=A⋃(B\A) and A⋂(B\A)=∅, then
[TABLE]
Definition 2.4 is the key of this paper, all works base on this definition.
Definition 2.4**.**
(a)
Family SF(A) with NF(x,A):SF(A) is denoted to the family with NF(x,A)
[TABLE]
where
[TABLE]
Furthermore, we define
[TABLE]
It is easy to see that ∣ΛNFi(A)∣=0,∀i>κ, if Assumption 2.2 holds.
(b)
Integral on SF(A): Supposing that f(x) is a Lebesgue integrable function on Rn.
Integrating f(x) on SF(A) is defined as
[TABLE]
(c)
Given t∗∈Δ, we define
[TABLE]
Some properties of SF(A) and ΛNFi(A) are presented here.
Lemma 2.5**.**
(a)
ΛNFi+1(A)⊆ΛNFi(A).
(b)
SF(A⋃B)={ΛNFi(A⋃B)}i=1∞,* where*
[TABLE]
(c)
If A⋂B=∅, then SF(A⋃B)={ΛNFi(A⋃B)}i=1∞, where
[TABLE]
(d)
If A⊆B, then ΛNFi(A)⊆ΛNFi(B).
(e)
ΛNFi(A)⊆t∈A⋃LF(t),∀i≥1.**
Proof.
It is obviously that (a) and (b) are true.
(c) It is obviously true by (b). And it is easy to see that
[TABLE]
(d) Since B=A⋃(B∖A), then ∀x∈ΛNFi(A), we have NF(x,A)≥i, so
[TABLE]
then
[TABLE]
(e) ∀x∈ΛNFi(A),i≥1, then there exists t∗∈A such that F(t∗;x)=0, which means that x∈LF(t∗)∈t∈A⋃LF(t).\qed
Using the above definition, we could get the following theorem.
Theorem 2.6**.**
[TABLE]
Proof.
Let \delta(x,i)=\left\{\begin{array}[]{cc}1,&x\in\Lambda^{i}_{N_{F}}(\Delta)\\
0,&x\not\in\Lambda^{i}_{N_{F}}(\Delta)\\
\end{array}\right.. It is clear that
NF(x,Δ)=i=1∑∞δ(x,i), if NF(x,Δ)≥1, so
[TABLE]
For avoiding to discuss too strange functions, e.g. Hilbert Curve, we give the following assumption.
Assumption 2.7**.**
∣LF(t)∣=0,∀t∈Δ.**
If Δ is countable, we have the following theorem.
Theorem 2.8**.**
Supposing that Assumption 2.1(c) and 2.7 hold. If Δ is countable, then
[TABLE]
Proof.
That Δ is countable means that LF(t),t∈Δ is also countable, so we could sort LF(t) as LF(ti).
Since ΛNFj(Δ)⊆i=1⋃+∞LF(ti),∀j∈{1,2,⋯}, then
[TABLE]
which means ∣ΛNFj(Δ)∣=0. Then
[TABLE]
Combining Lemma 2.3 and Theorem 2.8, it is easy to get the following proposition.
Proposition 2.9**.**
Supposing that Assumption 2.1(c) and 2.7 hold, then
(a)
if A⋂B is countable, then En(ρ,F,A⋃B)=En(ρ,F,A)+En(ρ,F,B).
(b)
if B is countable, then En(ρ,F,A⋃B)=En(ρ,F,A).
In the following paper, we always suppose that
[TABLE]
where −∞<l<u<+∞.
Theorem 2.10**.**
Supposing that Assumption 2.1(c) and 2.7 hold. Then En(ρ,F,[l,t]) is a continuous function in t≥l.
Proof.
We just need to prove ∀t∗∈[l,+∞),
[TABLE]
and
∀t∗∈(l,+∞)
[TABLE]
If there is t∗∈[l,+∞) such that
[TABLE]
then there exists ϑ0>0,εk↘0+ such that En(ρ,F,[t∗,t∗+εk])≥ϑ0,∀k. Noting that
[TABLE]
then En(ρ,F,{t∗})≥ϑ0, which is contradict to Theorem 2.8. So
[TABLE]
By the same way, we could prove that ∀t∗∈(l,+∞),
[TABLE]
So En(ρ,F,[l,t]) is a continuous function in t≥l.\qed
Theorem 2.11**.**
Supposing that Assumption 2.1(c) and 2.7 hold. For every t∗∈int(Δ). If
[TABLE]
exist and are same.
Let
[TABLE]
then
[TABLE]
Proof.
We define
[TABLE]
It is easy to see that Π(l)=0.
From Theorem 2.10, Π(t) is continuous in t∈Δ.
Let t∈int(Δ), then
[TABLE]
[TABLE]
It means that
[TABLE]
So
[TABLE]
Theorem 2.11 tells us if we want to compute En(ρ,F,Δ), we just need to compute Hρ,F(t).
3 F(t;x) is a linear function in x.
In the following paper, we always suppose that F(t;x) is linear in x:
[TABLE]
where fi(t):Δ→R,i=0,⋯,n.
For simplifying the problem, we give the following theorem.
Theorem 3.1**.**
[TABLE]
where Ξ={t∈Δ∣i=1∑nfi2(t)=0}.
Proof.
Since En(ρ,F,Ξ)=#{t∈Ξ∣f0(t)=0}, then
[TABLE]
Since #{t∈Ξ∣f0(t)=0} is easy to get, we only need to consider the case that the interval Δ satisfied
[TABLE]
In the following paper, we always suppose that (5) holds.
Now we give some assumptions of fi(t) here.
Assumption 3.2**.**
fi′′′(t),i=0,1,⋯,n* exist, and are continuous functions on Δ.*
Assumption 3.3**.**
f1(t)* has finite number of real zeros in Δ.*
Mark: (a) For convenience, in the following paper, we always suppose that Assumption 3.2 holds.
(b) If Assumption 3.2 holds, it is obviously that fi(t),fi′(t) and fi′′(t)i=0,1,⋯,n are continuous derivable functions on Δ.
(c) Since (4) and (5) hold, LF(t) is a hyperplane, so ∣LF(t)∣=0,∀t∈Δ, Assumption 2.7 always holds in the following paper.
3.1 How to compute E2(ρ,F,Δ)
In this subsection, we only consider the case n=2. Let
[TABLE]
If we consider t as a parameter of (6), then (6) scans an area in R2 with a envelop curve. This envelop curve of the family of (6) is denoted as H(x1,x2)=0, which could be got by following equations
[TABLE]
For studying the envelop curve of (6), we give the following assumption.
Assumption 3.4**.**
W_{f_{1},f_{2}}(t)=\left(\begin{array}[]{cc}f_{1}(t)&f_{2}(t)\\
f^{\prime}_{1}(t)&f^{\prime}_{2}(t)\\
\end{array}\right)* is not singular on Δ.*
If Assumption 3.4 holds, then we could solve (7) and get
[TABLE]
Bringing x1(t),x2(t) back to (rf(x;t))t(i), and denoting it as sfi(t),
[TABLE]
Let Γf(Δ)⊆Δ be the set of real zeros of
[TABLE]
Some properties are presented, and for the sake of brevity, we put the proofs of Lemma 3.6, 3.7, 3.8 and 3.9 into Appendix.
x1(t),x2(t),x1′(t),x2′(t)* and sfi(t),i=0,1,2 are continues derivable functions on Δ. x1′′(t),x2′′(t) and sf3(t) are continues functions on Δ.*
If f1(t)=0,x2′(t)=0,t∈int(Δ), then x1′(t)=0,t∈Γf(Δ).
(d)
Furthermore, if sf3(t)=0,f1(t)=0,∀t∈Γf(Δ), then ∀t∈Γf(Δ) must be all the strict minimum point or maximum point of x2(t).
(e)
If sf3(t)=0,∀t∈int(Δ),f1(t)=0∀t∈Δ, then sf2(t) has one zero in Δ at most.
Lemma 3.7**.**
If Assumption 3.4 holds. Supposing #{Γf(Δ)}<+∞, then
(a)
(x2(t),x1(t))∣t∈Δ* is the envelop curve H(x1,x2)=0 of (7) in R2.*
(b)
If f1(t)=0,∀t∈Δ, there is not a interval Δ^⊆Δ such that int(Δ^)=∅,x2(t)≡C,∀t∈Δ^.
Lemma 3.7 gives us the chance to discuss dx2dx1 on Δ.
Lemma 3.8**.**
If Assumption 3.4 holds. Supposing that f1(t)=0,∀t∈Δ, #{Γf(Δ)}<+∞, then
[TABLE]
[TABLE]
Lemma 3.9**.**
If Assumption 3.4 holds. Supposing that f1(t)=0,∀t∈Δ, #{Γf(Δ)}<+∞, then ∀t∈Δ, the tangent line of x1=H(x2) at (x2(t),x1(t)) is
[TABLE]
Mark:(1) If f1(t)=0,∀t∈Δ, the change of the concavity and convexity of H(x1,x2)=0 only happens at t∈Γf(Δ).
(2) if f1(t)=0,sf2(t)=0,∀t∈Δ, H(x1,x2)=0 must be strict convex or concave.
(3) Every point of H(x1,x2)=0 has its tangent line not perpendicular to x2 axis, if f1(t)=0,∀t∈Δ.
Lemma 3.6 and 3.8 tell us when x1=H(x2) is a convex(concave) function. Using this result, we could present the following important theorem to give the expression of SF(Δ).
Theorem 3.10**.**
If Assumption 3.4 holds. Supposing that Γf(Δ)=∅, f1(t)=0,∀t∈Δ, then
If ∃t∗∈int(Δ),x2′(t∗)=0, since f1(t)=0,∀t∈Δ, then by Lemma 3.6, we have t∗∈Γf(Δ), which is against to Γf(Δ)=∅, so x2′(t)=0,∀t∈int(Δ).
Then x2(t) is a strict increasing or decreasing function on Δ. Without general, we suppose that x2(t) is strict increasing on Δ, which means x2(Δ)=[x2(l),x2(u)].
Then by Lemma 3.8, there exists a second order derivable function
[TABLE]
which is the envelop curve of rf(x;t)=0,t∈Δ.
Γf(Δ)=∅ means that sf2(t)=0,∀t∈int(Δ), then by Lemma 3.8, x1=H(x2) is a strict convex or concave function on [x2(l),x2(u)]. Without general, we suppose that x1=H(x2) is strict convex in [x2(l),x2(u)].
Since x1=H(x2) is strict convex, then f1(l)f2(l)=f1(u)f2(u), which means
[TABLE]
We could extend the domain of H(x) to R, and make the extended one satisfy conditions in Lemma 7.2.
Then
LF(l), LF(u) and x1=H(x2) separate R2 into 6 parts.
is the tangent line of x1=H(x2) at (x2(t),x1(t)). Since x1=H(x2) is strict convex and derivable, then there is only one tangent line of LF(t) at x2∈[x2(l),x2(u)], which means for every tangent line of x1=H(x2) at x2∈[x2(l),x2(u)], there is only one t∈Δ corresponding to it.
Since (x2,x1)∈int(A(x2(l),H)), there exists only one z∗>x2(l) such that l(z∗,H) passes through (x2,x1). Since (x2,x1)∈int(A(x2(u),H)), then z∗>x2(u). So NF((x1,x2),Δ)=0,∀(x2,x1)∈Ef1(Δ).
If (x2,x1)∈int(A(x2(l),H)), there exists only one z∗>x2(l) such that l(z∗,H) passes through (x2,x1). Since (x2,x1)∈C(x2(u),H), then z∗≤x2(u).
If (x2,x1)∈∂(A(x2(l),H)), by the same discussion, besides l(x2(l),H), there exists l(z∗,H) passing through (x2,x1) with z∗ such that x2(l)<z∗≤x2(u).
So 2≥NF((x1,x2),Δ)≥1,∀(x2,x1)∈Ef2(Δ), Ef2(Δ)⊂ΛNF1(Δ).
there must be only two tangent lines l(z1∗,H) and l(z2∗,H) with tangent points z1∗,z2∗ passing through (x2,x1), respectively, such that x2(l)<z1∗<z2∗<x2(u). Then NF((x1,x2),Δ)=2, which means
[TABLE]
(e) ∀(x2,x1)∈{(x2,x1)∣x1=H(x2),x2∈[x2(l),x2(u)]}, since x1=H(x2) is strict convex and derivable on Δ, there exists only one tangent line
[TABLE]
which means {(x2,x1)∣x1=H(x2),x2∈[x2(l),x2(u)]}⊂ΛNF1(Δ). So it is easy to see that
[TABLE]
and
[TABLE]
(f) We define a new function x1=Hˉ(x2) as
[TABLE]
Then Ef6(Δ)={(x2,x1)∣x1>Hˉ(x2)} . So ∀(x2,x1)∈Ef6(Δ),
[TABLE]
can’t be a tangent line of x1=H(x2), which means
[TABLE]
So we could get
[TABLE]
Furthermore, it is easy to see that
[TABLE]
So
[TABLE]
Corollary 3.11**.**
If Assumption 3.4 holds. Supposing that Γf(Δ)={t∗}, f1(t)=0,∀t∈Δ, then
Since ΛNFi(Δ)=j≥0,k≥0,j+k=i⋃(ΛNFk([l,t∗])⋂ΛNFj((t∗,u])),
then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Theorem 3.12**.**
When n=2, if Assumption 2.1(b)(c), 3.3 and 3.4 hold.
Given t∗∈int(Δ) satisfied the following conditions
(a)
f1(t∗)=0, t∗∈Γf(Δ).
(b)
[TABLE]
exist and are same.
Then
[TABLE]
Proof.
Since Assumption 3.3 holds, there exists ε1>0 small enough such that f1(t)=0, ∀t∈[t∗,t∗+ε1].
Since t∗∈Γf(Δ), there exists ε2>0 small enough such that sf2(t)=0∀t∈[t∗,t∗+ε2], Γf([t∗,t∗+ε2])=∅.
Let 0<εˉ≤min{ε1,ε2}, then x1=H(x2) exists on [x2(t∗),x2(t∗+εˉ)] or [x2(t∗+εˉ),x2(t∗)] with H′′(x2)=0, and keeps its concavity and convexity. So −f1(t)f2(t) must be strict increasing or decreasing, which means ∀t∈(t∗,t∗+εˉ],
[TABLE]
So ∀ε∈(0,εˉ], the intersection point (x2∗,x1∗) of l(x2(t∗),H) and l(x2(t∗+ε),H) exists and satisfies
[TABLE]
and
[TABLE]
By Corollary 7.3, it is easy to get that x2∗ is between x2(t∗) and x2(t∗+ε).
Since Assumption 2.2 holds, E2(ρ,F,Δ) exists.
We call the point t∈Δ satisfied either f1(t)=0 or that Wf1,f2(t) is singular or that condition(b) in Theorem 3.12 doesn’t hold or sf2(t)=0 as the bad points. By the conditions, the number of bad points is finite, we could separate Δ into several closed intervals Δi1,Δi2 connected end to end, where Δi1 doesn’t have any bad point, i⋃Δi2 includes all the bad points, while every Δi2 just has one bad point, and ∣Δi2∣=ε with a small enough ε>0. Except the case that l or u is the bad point, we all ask the bad point must be at the middle of Δi2.
Then
[TABLE]
so
[TABLE]
Mark: If Γf(Δ) is consisted of finite number of points and intervals, we could get same results of Corollary 3.14.
3.2 How to compute En(ρ,F,Δ) with n≥4
In this section, we consider the case: n≥4.
Let
[TABLE]
then
[TABLE]
Denote
[TABLE]
for ∀xˉ∈Rn−2,ΛGxˉi(A)⊆R2,A⊆R.
The following theorem is one of main theorems of this paper.
Theorem 3.15**.**
When n≥4, if Assumption 2.1, 2.2, 3.3 and 3.4 hold. Given t∗∈int(Δ) satisfied
(a)
f1(t∗)=0,**
(b)
\left(\begin{array}[]{c}h(t^{*})\\
u(t^{*})\\
\end{array}\right)* is full rank, where h(t∗) and u(t∗) are row vectors defined in (30) and (31), respectively,*
(c)
[TABLE]
exist and are same.
Then
[TABLE]
Proof.
For t∗∈int(Δ), by Assumption 3.4, there exists ε1∗>0 such that
[TABLE]
By Assumption 3.3, there exists ε2∗>0, such that f1(t)=0,∀t∈[t∗,t∗+ε2∗].
There exists ε3∗>0 such that ∀ε∈(0,ε3∗], then \left(\begin{array}[]{cc}f_{1}(t^{*})&f_{2}(t^{*})\\
f_{1}(t^{*}+\varepsilon)&f_{2}(t^{*}+\varepsilon)\\
\end{array}\right) is not singular. If it is not true, then ∀εˉ>0, there exists ε^∈(0,εˉ] such that
\left(\begin{array}[]{cc}f_{1}(t^{*})&f_{2}(t^{*})\\
f_{1}(t^{*}+\hat{\varepsilon})&f_{2}(t^{*}+\hat{\varepsilon})\\
\end{array}\right) is singular. Let εˉ→0, then ε^→0,
[TABLE]
is singular, which is against to that Wf1,f2(t∗) is not singular.
Let ε∗=min{ε1∗,ε2∗,ε3∗,0.5}.
[TABLE]
where
[TABLE]
[TABLE]
Since fj(i)(t),i=0,1,2,j=0,1,⋯,n are continuous derivable functions on Δ, fj′′′(t),j=0,1,⋯,n are continuous functions on Δ, and f1(t)f2′(t)−f1′(t)f2(t)=0,∀t∈[t∗,t∗+ε∗], then f0′′(t),f0′′′(t),hi(t) and ui(t) are all Lip-continuous functions on [t∗,t∗+ε∗] with positive Lip constants α2,0,α3,0,β2,i and β3,i respectively.
Since h(t∗)=0, we always could take 0<ε<ε∗ satisfied
[TABLE]
then we could separate Rn into following 4 parts
[TABLE]
It is easy to get Ωi⋂Ωj=∅,i=j, Rn=i=1⋃4Ωi.
Given ε∈(0,ε∗),
we need to compute ∫SF([t∗,t∗+ε])ρ(x)dx.
Noting that
[TABLE]
we just need to compute ∫ΛFi([t∗,t∗+ε])ρ(x)dx.
For every ∫ΛNFi([t∗,t∗+ε])ρ(x)dx, we have
[TABLE]
For convenience, denoting Ωji=Ωi⋂ΛNFj([t∗,t∗+ε]). Noting that
Since \left(\begin{array}[]{c}h(t^{*})\\
u(t^{*})\\
\end{array}\right) is full rank, h(t∗)=0, by the definition of ε, we get Ω2=∅.∀xˉ∈P(Ω2),∀εˉ∈(0,ε], we have that
[TABLE]
which means Γgxˉ([t∗,t∗+ε])=∅,∀xˉ∈P(Ω2).
By Theorem 3.10, we have ΛNGxˉi([t∗,t∗+ε])=∅,i≥3,∀xˉ∈P(Ω2).
(2.1) ΛNGxˉi([t∗,t∗+ε])=∅,i≥3, when xˉ∈P(Ω2). So
[TABLE]
We just need to compute
[TABLE]
(2.2) i=2.
[TABLE]
Since (gxˉ)1(t∗)=f1(t∗)=0, Γgxˉ([t∗,t∗+ε])=∅,∀(y,xˉ)∈Ω2, by the proof of Theorem 3.12,
we know that
[TABLE]
where
[TABLE]
[TABLE]
So x1′(t)=(p01)′(t)+i=3∑n(pi1)′(t)xi, x2′(t)=(p02)′(t)+i=3∑n(pi2)′(t)xi.
∀xˉ∈P(Ω2),
[TABLE]
so
[TABLE]
∀xˉ∈P(Ω2).
Then
[TABLE]
(2.3) i=1, then
[TABLE]
(3) ∫Ωi3ρ(x)dx
If Ω3=∅, then ∫Ωi3ρ(x)dx=0,∀i, we only need to discuss the case Ω3=∅.
By the same discussion in (2), ∀εˉ∈(0,ε],
[TABLE]
Since xˉ∈P(Ω3), then
[TABLE]
so ∀εˉ∈(0,ε], we have
[TABLE]
which means that sgxˉ3(t∗+εˉ)=0,∀εˉ∈(0,ε]. By Lemma 3.6(e), we get either
[TABLE]
If Γgxˉ([t∗,t∗+ε])=∅, we could get the same result in (2).
If t^∈(t∗,t∗+ε) and xˉ∈P(Ω3), then ∣sgxˉ2(t∗)∣<2(α2,0+ni=3∑nβ2,i(−b2lnε))ε and ∣∣xˉ∣∣<−b2lnε.
(3.1) i=1.
[TABLE]
Now we discuss
[TABLE]
and
[TABLE]
Since Γgxˉ([t∗,t^])=∅, by the same discussion in Theorem 3.12, \left(\begin{array}[]{cc}f_{1}(t^{*})&f_{2}(t^{*})\\
f_{1}(\hat{t})&f_{2}(\hat{t})\\
\end{array}\right) is not singular,
then
[TABLE]
and
[TABLE]
must has a intersection point
[TABLE]
So
[TABLE]
where
[TABLE]
[TABLE]
Then
[TABLE]
So
[TABLE]
It is easy to see that
[TABLE]
where θ=∣arctanf1(t∗)f1(t^)+f2(t∗)f2(t^)f1(t∗)f2(t^)−f2(t∗)f1(t^)∣≤O(ε).
So
[TABLE]
By the same way,
[TABLE]
So
[TABLE]
since ∣ΛNGxˉ2([t∗,t^])∣=o(ε), ∣ΛNGxˉ2([t^,t∗+ε])∣=o(ε), which could be proved just like in (2.2).
(3.2) i=2,3,4,
[TABLE]
(3.3) i≥5.
Whatever Γgxˉ([t∗,t∗+ε])=∅ or Γgxˉ([t∗,t∗+ε])={t^},∀(y,xˉ)∈Ω3, by Corollary 3.11,
[TABLE]
so
[TABLE]
(4) ∫Ωi4ρ(x)dx
Since h(t∗) and u(t∗) are linear independent, then
Noting that given xˉ∈P(Ω2), sgxˉ2(t) doesn’t change its sign on [t∗,t∗+ε], which means that there exists x1=Hxˉ(x2) which is a convex or concave function.
Since 0<ε<ε3∗, \left(\begin{array}[]{cc}f_{1}(t^{*})&f_{2}(t^{*})\\
f_{1}(t^{*}+\varepsilon)&f_{2}(t^{*}+\varepsilon)\\
\end{array}\right) is not singular, then
[TABLE]
and
[TABLE]
separate R2 into 2 sets Φ(LGxˉ(t∗),LGxˉ(t∗+ε)) and R2∖Φ(LGxˉ(t∗),LGxˉ(t∗+ε)). Then LGxˉ(t∗) and LGxˉ(t∗+ε) are the tangent lines of x1=Hxˉ(x2). Then the image of x1=Hxˉ(x2) must be in cl(R2∖Φxˉ(t∗,t∗+ε)), so by Theorem 3.10,
[TABLE]
when ε is small enough, so
[TABLE]
Noting that
[TABLE]
[TABLE]
If Ω3=∅,
[TABLE]
If Ω3=∅,
[TABLE]
where θ=∣arctanf1(t∗)f1(t∗+ε)+f2(t∗)f2(t∗+ε)f1(t∗)f2(t∗+ε)−f2(t∗)f1(t∗+ε)∣≤O(ε),
so
[TABLE]
Then
[TABLE]
Now we have
[TABLE]
By the same way, we could prove that
[TABLE]
when ε>0 is small enough.
Then if
[TABLE]
exist and are same,
[TABLE]
Mark: From above proof, it is easy to see that if we use the following assumption:
[TABLE]
to instead of Assumption 2.1(a),
we could get all the same result.
We could use the following lemma to verify the condition(b) of Theorem 3.15.
Lemma 3.16**.**
If Wf3,f4(t) is not singular, then \left(\begin{array}[]{c}h(t)\\
u(t)\\
\end{array}\right) is full rank, where h(t) and u(t) are defined in (30) and (31), respectively.
Proof.
Since Wf3,f4(t) is not singular, then
[TABLE]
is full rank,
[TABLE]
is full rank too, where
[TABLE]
[TABLE]
So \left(\begin{array}[]{c}u(t)\\
h(t)\\
\end{array}\right) is full rank.∎
Corollary 3.17**.**
When n≥4, if Assumption 2.1, 2.2, 3.3 and 3.13 hold.
Supposing that
(a)
there are finite number of t∈Δ such that Wf1,f2(t) or Wf3,f4(t) is singular.
(b)
∀t∈int(Δ)* such that f1(t)=0, then condition(c) in Theorem 3.15 doesn’t hold at finite number of points at most.*
Then
[TABLE]
Proof.
Since Assumption 2.2 holds, En(ρ,F,Δ) exists. Since there are finite number of t∈int(Δ) such that either Wf1,f2(t) singular, or Wf3,f4(t) singular, or f1(t)=0, or the condition(c) in Theorem 3.10 doesn’t hold, we call this points as bad points. We could separate Δ into closed intervals Δi1 and Δi2 connected end to end, where Δi1 doesn’t have any bad point, i⋃Δi2 includes all the bad points, while every Δi2 just has one bad point, and ∣Δi2∣=ε with a small enough ε>0. Except the case that l or u is the bad point, we all ask the bad point must be at the middle of Δi2.
Since Wf3,f4(t) is not singular ∀t∈Δi1, then u(t) and h(t) defined in (30) and (31) are linear independent, for all t∈Δi1.
Then
[TABLE]
so
[TABLE]
4 When x obeys the uniform distribution in a sup-sphere
Now we are at the position to consider a practical problem.
It is well known that the Lebesgue measure of sup-sphere Bn(0,r)⊂Rn with radii r is
[TABLE]
In this section, we discuss the case that ρ(x)=ρr(x). It is easy to see that ρr(x) satisfies Assumption 2.1.
From Theorem 3.15, we just need to get Hρr,F(t).
Theorem 4.1**.**
When n≥4, if Assumption 2.2, 3.3 and 3.4 hold. Given t∗∈int(Δ),f1(t∗)=0, Wf1,f2(t∗) and Wf3,f4(t∗) are not singular, and
[TABLE]
Let
[TABLE]
[TABLE]
[TABLE]
(a)
When ∣a∣<r,χ2+a2<r2,
[TABLE]
(b)
When ∣a∣<r,χ<−r2−a2,
[TABLE]
(c)
When ∣a∣<r,χ>r2−a2,
[TABLE]
(d)
When ∣a∣>r,
[TABLE]
Proof.
Since Assumption 2.1 holds for ρr(x), by Theorem 3.15, we just need to compute
[TABLE]
Let t∈int(Δ), ∣ε∣ be small enough, we consider LF(t∗) and LF(t∗+ε).
Denoting
[TABLE]
By QR decomposition, we have Q∈Rn×n and R∈Rn×2 such that QR=B, where Q is a orthogonal matrix, R is a upper triangular matrix with positive diagonal elements.
Let
[TABLE]
[TABLE]
with
[TABLE]
[TABLE]
When ∣ε∣ is small enough, C1,2(ε)=0, and keep its sign, since i=1∑nfi2(t∗)=0.
We could rotate LF(t∗) and LF(t∗+ε) into
[TABLE]
[TABLE]
Let
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By Theorem 3.10, since Wf1,f2(t∗) and Wf3,f4(t∗) are not singular,
if
[TABLE]
exists, then
[TABLE]
exist and are same, then they are all Hρr,F(t∗), so we only need to discuss
[TABLE]
which is just
[TABLE]
We present some values needed here, where ε>0 is small enough.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
if b′(0)=0.
Basing on the relationship among the l, l(ε) and Bn(0,r), we just need to discuss 3 different cases.
(a)
f0(t∗)<0
(a.1)
∣a∣<r, χ2+a2<r2.
(a.2)
∣a∣<r, χ<−r2−a2.
(a.3)
∣a∣<r, χ>r2−a2.
(a.4)
∣a∣>r.
(b)
f0(t∗)=0
(b.1)
∣a∣<r, χ2+a2<r2.
(b.2)
∣a∣<r, χ<−r2−a2.
(b.3)
∣a∣<r, χ>r2−a2.
(c)
f0(t∗)>0
(c.1)
∣a∣<r, χ2+a2<r2.
(c.2)
∣a∣<r, χ<−r2−a2.
(d.3)
∣a∣<r, χ>r2−a2.
(c.4)
∣a∣>r.
In (a), there are 4 subcases.
It is obviously that in (a.4) Hρ,F(t∗)=0. In other three cases, we just prove (a.1) in detail, since the proofs of the left two cases are similar.
When ∣ε∣ is small enough, ε→0lim∣1+b2(ε)c(ε)∣=∣c(0)∣=∣a∣<r,
which means
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
[TABLE]
since b′(0)=0.
[TABLE]
where
[TABLE]
[TABLE]
(a.1.1)
[TABLE]
where
[TABLE]
Since
[TABLE]
so
[TABLE]
(a.1.2)
[TABLE]
where
[TABLE]
Since
[TABLE]
so
[TABLE]
The proof of (a.1.3) and (a.1.4) are similar as (a.1.1) and (a.1.2), respectively. Then we get
(a.1.3)
[TABLE]
(a.1.4)
[TABLE]
Now we have
[TABLE]
(a.2) When ∣ε∣ is small enough, ε→0lim∣1+b2(ε)c(ε)∣=∣c(0)∣=∣a∣<r,
which means
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By the same discussion in (a.1), we could get
[TABLE]
(a.3) When ∣ε∣ is small enough, ε→0lim∣1+b2(ε)c(ε)∣=∣c(0)∣=∣a∣<r,
which means
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where
[TABLE]
[TABLE]
By the same discussion in (a.1), we could get
[TABLE]
For all other cases in (b) and (c), we all get the same result in (a). ∎
Mark: (a) There is only one case that Theorem 4.1 doesn’t mention, which is ∣a∣=r. If we assume that there are finite number of t∈Δ such that
[TABLE]
then it doesn’t affect to compute En(ρr,F,Δ), since the continuity of En(ρ,F,[l,t]).
We discuss how to get analytical expressions of En(ρ,F,Δ) in this paper. Firstly we discuss the prosperities of En(ρ,F,Δ) for general cases. Then we give some expressions of En(ρ,F,Δ) by calculate Hρ,F(t), when F is linear in x. At last, for some practical problems, e.g. x obeys the uniform distribution and the normal distribution, we give more concise results, which are same as the results existed.
Our result suits for every n, except n=1,3. In the further work, we will go for it.
Acknowledgements: Yi Xu was supported in part by the National Natural Science Foundation of China (No. 11501100, 11571178, 11671082 and 11871149).
Since Wf1,f2(t) is not singular on Δ, then x1′(t)=x2′(t)=0.
(c) Since f1(t)=0,t∈int(Δ),
[TABLE]
then x1′(t)=0, which means t∈Γf(Δ).
(d) Furthermore,
[TABLE]
By the same discussion in (b), we could get ∀t∈Γf(Δ),
[TABLE]
[TABLE]
[TABLE]
Since sf3(t)=0,f1(t)=0,∀t∈Γf(Δ), then x2′′(t)=0,∀t∈Γf(Δ), which means that every t∈Γf(Δ) must be a strict minimum or maximum of x2(t).
(e) If there are two different points t1,t2∈Γf(Δ),t1<t2, by (d), since
[TABLE]
then t1 and t2 are all the strict minimum or maximum of x2(t). Then there must be t3∈(t1,t2), such that t3 is the strict maximum or minimum of x2(t), so x2′(t3)=0. Then by (c), t3∈Γf(Δ). Since t3 is the strict maximum or minimum of x2(t), then by (d), sf3(t3) has different sign from the sign of sf3(t1), then ∃t4∈(t1,t3) such that sf3(t4)=0, which is against to sf3(t)=0,∀t∈int(Δ). So there is one point in Γf(Δ) at most.∎
(a) If (x2(t),x1(t)) is a fix point for every t∈Δ, then sf2(t)=(sf1(t))t′=0,∀t∈int(Δ), which means Γf(Δ)=int(Δ), it is against to #{Γf(Δ)}<+∞.
(b) If there exists a interval Δ^⊆Δ such that x2(t)≡C,∀t∈Δ^, which means x2′(t)=0,∀t∈int(Δ^). By Lemma 3.6(c), x1′(t)=0,∀t∈int(Δ^), so x1(t)≡C^,∀t∈Δ^, which means
sf2(t)=0,∀t∈Δ^,Δ^⊆Γf(Δ), it is against to #{Γf(Δ)}<+∞. ∎.
By Lemma 3.8, the tangent line at (x2(t),x1(t)) is
[TABLE]
which is just
[TABLE]
7.2 Some properties of one variable convex functions
In this subsection, we present some prosperities of one variable convex functions used in this paper.
Lemma 7.1**.**
G(x)* is a continuous convex function in x∈R. If there are three points (x1,G(x1)),(x2,G(x2)),(x3,G(x3))(x1<x2<x3) on a line, then
G(x)≡kx+b,x1≤x≤x3.*
Proof.
Since (x1,G(x1)),(x2,G(x2)),(x3,G(x3))(x1<x2<x3) are on a line. It is obviously that this line is not perpendicular to x axis. Supposing that this line is y=kx+b, now we consider E(x)=G(x)−kx−b.
It is clear that E(x) is still a continuous convex function with E(x1)=E(x2)=E(x3)=0. Let Ξ1=argx∈[x1,x2]minE(x), Ξ2=argx∈[x2,x3]minF(x).
(a)
If x2∈Ξ1,x2∈Ξ2 then E(x)=0,∀x∈[x1,x3].
(b)
If x2∈Ξ1,x2∈Ξ2, then there exists z2∈Ξ2⊂[x2,x3],z2=x2 such that E(z2)<0. Then we have
[TABLE]
where λ=z2−x1x2−x1=0. It is contradict to E(x2)=0.
(c)
If x2∈Ξ1,x2∈Ξ2, it is same as (b).
(d)
If x2∈Ξ1,x2∈/Ξ2. Let z1∈Ξ1,z1=x2,z2∈Ξ2,z2=x2, we have
[TABLE]
Then
[TABLE]
where λ=z2−z1x2−z1=0, which is contradict to E(x2)=0.
So E(x)≡0,∀x∈[x1,x3], which means G(x)≡kx+b,∀x∈[x1,x3].\qed
Lemma 7.2**.**
y=G(x)* is a continuous second order derivable convex function defined in R.
Supposing that x→+∞limxG(x) and x→−∞limxG(x) don’t exists, then ∀(x∗,y∗), satisfied y∗<G(x∗), there are only two different tangent lines of y=G(x) at (xi,G(xi)),i=1,2 passing through (x∗,y∗).*
Proof.
Since y=G(x) is a derivable convex function in x∈R, then
[TABLE]
must has an unique optimal solution (x^,y^)=(x^,G(x^)).
Let θ∗=tan−1x∗−x^y∗−y^,θ^=tan−1(G′(x^)), then θ^=2π.
If θ∗=θ^,
then θ∗=2π. Since (x^,G(x^)) is the projection of (x∗,y∗) on y=G(x), then
[TABLE]
[TABLE]
Then the tangent line of G(x) at (x^,G(x^)) must pass through (x∗,y∗). By the differentiability of G(x) at x^, there must be a point (x1,G(x1))∈Υ, which is contradict to the definition of (x^,G(x^)). So θ∗=θ^, which means
[TABLE]
θ∗ and θ^ separate a circle into two parts. Without general, we consider [θ∗,θ^] (assuming θ∗<θ^).
Let
[TABLE]
It is easy to see v(θ^)≥1+G′2(x^)∣y∗−G(x^)−G′(x^)(x∗−x^)∣>0,v(θ∗)=0. Let θ~=sup{θ∈[θ∗,θ^]∣v(θ)=0}.
Firstly, we prove some properties:
(1) θ~=2π.
If θ~=2π and v(θ~)=0, there are three cases:
(a) x=x∗ and y=G(x) intersect at (x∗,G(x∗)), and there are (x1,G(x1)) and (x2,G(x2)) such as x1<x∗<x2, then there must be a θ1>θ~ such that v(θ1)=0, which is against to the definition of θ~.
(b) x=x∗ and y=G(x) intersect at (x∗,G(x∗)), and there are not (x1,G(x1)) and (x2,G(x2)) such that x1<x∗<x2, then y=G(x) belongs to only one side of x=x∗.
(c) there are not intersection points between x=x∗ and y=G(x), which means y=G(x) belongs to only one side of x=x∗. Either (b) or (c) is against to the definition of G(x).
If θ~=2π and v(θ~)=0, which means y=G(x) belongs to only one side of x=x∗, which is also against to the definition of G(x).
So θ~=2π.
(2) θ~=θ^.
If θ~=θ^, which means that v(θ)=0,∀θ∈[θ∗,θ^), while v(θ^)=0. Then ∀τ>0 such that 2π∈[θ^−τ,θ^], we have v(θ^−τ)=0. So ∀σ>0 small enough, there exists (x~,G(x~),t~) such that
[TABLE]
By solving
[TABLE]
we know that t~ must be positive and
[TABLE]
Since G′(x^)=tan(θ^),θ^=2π,x~=x∗+cos(θ^−τ)t~ must be ∞, when τ→0+.
Taken τn=n1, we could get {(x~n,t~n)}, then we select a subsequence {(xˉn,tˉn)} of {(x~n,t~n)}, such that xˉn→+∞ or xˉn→−∞. Without general, we just discuss xˉn→+∞. Taken σn=n1, we get
[TABLE]
[TABLE]
[TABLE]
[TABLE]
since tan(θ^) exists, then limn→∞xˉnG(xˉn) exists.
Since G(x) is a second order derivable convex function, then G′′(x)≥0, (xG(x))′=x2G′(x)x−G(x). Then (G′(x)x−G(x))′=xG′′(x). Supposing x>0, then G′(x)x−G(x) is a nondecreasing function, which means either G′(x)x−G(x) is negative or there is M>0, when x>M, then G′(x)x−G(x)≥0. So when x>M, xG(x) is monotone.
Then x→+∞limxG(x) exists, which is contradict to conditions of G(x), it means θ^=θ~.
(3) There exists θl,θu such that [θl,θu]⊂{θ∣v(θ)=0},θl<θu.
If it is not true, then {θ∗}={θ∣v(θ)=0}. If θ∗=2π, then ∀τ>0 small enough, tan(θ∗+τ) and tan(θ∗−τ) are well defined. If θ∗=2π, there must be ∀τ>0 small enough such that 2π∈[θ∗−τ,θ∗+τ], so tan(θ∗+τ) and tan(θ∗−τ) are well defined too. Then we have v(θ∗−τ)>0 and v(θ∗+τ)>0, ∀τ>0 small enough. y−y∗=tan(θ∗−τ)(x−x∗) and y−y∗=tan(θ∗+τ)(x−x∗) separate R2 into 4 parts. Since v(θ∗−τ)>0, v(θ∗+τ)>0, {(x,y)∣y≥G(x)} must be in only one part only.
When τ→0+, the domain of y=G(x) is not R, which is contradict to the definition of G(x). So int{θ∣v(θ)=0}=∅.
Now we prove that θ~ is the tangent angle of a tangent line.
(1) If θ∗=θ~.
At θ~, let α>0,ε>0, we consider
[TABLE]
where θ∈[θ~−ε,θ~+ε]⊂[θ∗,θ^] and 2π∈[θ~−ε,θ~+ε]
We will prove that there exists α∗>0,M∗>0 such that
[TABLE]
If it is not true, then ∀α>0,∀M>0, there exists θˉ∈[θ~−ε,θ~+ε],(xˉ,tˉ)∈Ωα(θˉ) such that ∣∣(x,t)∣∣>M.
Let αn=n1,Mn=n. Since (xˉn,tˉn)∈Ωαn(θˉn), then (xˉn−x∗−cos(θˉn)tˉn)2≤α, so ∣xˉn∣→∞, while n→∞.
Without general, we select the subsequence {(x~n,t~n,θ~n)} from {(xˉn,tˉn,θˉn)} such that x~n→+∞, and θ~n→θˇ. Then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
which means that x→+∞limxG(x) exists, and it is contradict to conditions of G(x). So there exists α∗>0,M∗>0 such that
[TABLE]
Furthermore, since H(x,t,θ) and Hθ(x,t,θ) are continuous at (x,t,θ)∈R×R+×[θ~−ε,θ~+ε], then v(θ) is continuous at θ~ by [4], which means v(θ~)=0. Furthermore,
since Ωα∗(θ~) is bounded and closed, argt≥0,xinfH(x,t,θ~) is attached, and we could select a point (x0,t0)∈argt≥0,xinfH(x,t,θ~).
Now we will prove that y−G(x0)=tan(θ~)(x−x0) is a tangent line at (x0,G(x0)) and passes through (x∗,y∗).
It is easy to see that H(x0,t0,θ~)=0, which means
[TABLE]
so (x0,G(x0)),(x∗,y∗) are all in the line y−G(x0)=tan(θ~)(x−x0).
Let θ1=θ~+ε, where ε>0 is small enough. ∀x1∈R,
[TABLE]
By v(θ1)>0, without general, we suppose Q(x1,θ1)>0. So ε→0+limQ(x1,θ1)≥0, ∀x1∈R, which means ∀(x1,G(x1)) is at only one side of y−y∗=tan(θ~)(x−x∗), then y−y∗=tan(θ~)(x−x∗) must be the tangent line at (x0,G(x0)).
(2) If θ~=θ∗. By the similar discussion, y−y∗=tan(θ∗)(x−x∗) is also a tangent line of y=G(x).
At last, we will prove there has just two tangent lines of y=G(x) passing through (x∗,y∗).
(1) There is only one tangent line of y=G(x) passing through (x∗,y∗).
By above discussion, we have know that [θ∗,θ^] and [θ^,θ∗] each have a tangent line. We just need to prove that they are different. The only chance that they are same is that θ∗=sup{θ∈[θ∗,θ^]∣v(θ)=0} and θ∗=inf{θ∈[θ^,θ∗]∣v(θ)=0}, which is against that there exists θl,θu such that θ∗∈[θl,θu]⊂{θ∣v(θ)=0},θl<θu.
(2) There are not more than 2 different tangent lines of y=G(x) passing through (x∗,y∗).
If there are 3 or more different tangent lines of y=G(x) passing through (x∗,y∗), we select 3 different tangent lines and denote their tangent points as (x1,G(x1)), (x2,G(x2)), (x3,G(x3)), where x1<x2<x3.
l((x3,G(x3)),(x1,G(x1))) and l((x2,G(x2)),(x∗,y∗)) must intersect at the point (x^,y^)∈B(G). It is obviously that (x^,y^)∈int(B(G)) is impossible, then y^=G(x^), which means x^=x2. Then (x1,G(x1)), (x2,G(x2)), (x3,G(x3)) are in a line. By Lemma 7.1, G(x)=kx+b,x∈[x1,x3], then the tangent lines at x1, and x3 are same, which is against to that there are 3 different tangent lines. ∎
Corollary 7.3**.**
Supposing that all conditions in Lemma 7.2 hold. Given x∗∈R, then
(a)
if (x^,y^)∈int(A(x∗,G)), then there are only two different tangent lines passing through (x^,y^), with their tangent points x1,x2 satisfied x1<x∗<x2.
(b)
if (x^,y^)∈int(C(x∗,G)), then there are only two different tangent lines passing through (x^,y^), with their tangent points x1,x2 are all at only one side of x∗, which means either x1<x2<x∗ or x1>x2>x∗.
Proof.
Either (x^,y^)∈int(A(x∗,G)) or (x^,y^)∈int(C(x∗,G)), from Lemma 7.2, there exist two tangent points x1,x2 such that two different tangent lines at x1,x2 of G(x) passing through (x^,y^).
If x1=x∗ or x2=x∗, then by Lemma 7.2, (x^,y^) must be at the tangent line of G(x) at (x∗,G(x∗)), which is against to definition of (x^,y^).
(a) Supposing x1>x2>x∗, then l((x1,G(x1)),(x∗,G(x∗))) and l((x^,y^),(x2,G(x2))) must intersect at (xˉ,yˉ) with yˉ≥G(xˉ).
If yˉ=G(xˉ), (x1,G(x1)), (xˉ,G(xˉ), (x∗,G(x∗)) are all in a line. By Lemma 7.1, G(x)=kx+b,∀x∈[x∗,x1], then the tangent line at x1, x2 are same, which is contradict to Lemma 7.2.
If yˉ>G(xˉ), which means that y−G(x2)=G′(x2)(x−x2) intersects int(B(G)), it is contradict to the definition of x2.
By the same discussion, x1<x2<x∗ is impossible too. So x1<x∗<x2.
(b) If x1<x∗<x2, (x1,G(x1)) or (x2,G(x2)) are at different sides of x=x∗, and at only one side of y−y∗=G′(x∗)(x−x∗), then the line l((x1,G(x1)),(x^,y^)) or l((x^,y^),(x2,G(x2))) must intersect y=G(x) twice at least.
Denoting one of intersection points as (x~,G(x~)).
If the image of G(x) includes l((x^,y^),(x~,G(x~))), then the tangent line at x∗ is same as l((x^,y^),(x~,G(x~))), which means (x^,y^)∈{(x,y)∣y−G(y∗)=G′(x∗)(x−x∗)}, it is contradict to the definition of (x^,y^).
If the image of y=G(x) does not include l((x^,y^),(x~,G(x~))), which means
[TABLE]
it is contradict to the definition of x1,x2.
So either x1<x2<x∗ or x1>x2>x∗.\qed
Noting that Lemma 7.1, Lemma 7.2 and Corollary 7.3 also suit for the concave function of one variable, so if the concavity and convexity of a function of one variable does not change in R, Lemma 7.1, Lemma 7.2 and Corollary 7.3 hold too.
Bibliography23
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J.M. Azaïs, J. Le n, CLT for crossings of random trigonometric polynomials. Electron. J. Probab., 2013, 18:no. 68, 17.
2[2] J.M. Azaïs, F. Dalmao, J. Le n, CLT for the zeros of classical random trigonometric polynomials, Ann. Inst. H. Poincar Probab. Statist., 2016, 52(2):804-820.
3[3] A.T. Bharucha-Reid, M. Sambandham, Random polynomials, Academic Press, 1986, New York.
4[4] J.F. Bonnans, A. Shapiro, Perturbation analysis of optimization problems, 2000, Berlin: Springer- Verlag.
5[5] Y. Do, H. Nguyen, V. Vu, Real roots of random polynomials: expectation and repulsion, Proceedings of the London Mathematical Society, 2015,111, 6, 1231-1260.
6[6] J.E.A. Dunnage, The number of real zeros of a random trigonometric polynomial, Proc. London Math. Soc., 1966, (3), 16:53-84.
7[7] A. Edelman, E. Kostlan, How many zeros of a random polynomial are real?, Bull. Amer. Math. Soc. (N.S.), 1995, 32(1):1-37.
8[8] Paul Erdös, A. C. Offord, On the number of real roots of a random algebraic equation, Proc. London Math. Soc. (3), 1956, 6:139-160.