第一届熊赛试题解答


\documentclass[11pt]{amsart}

%\usepackage{color,graphicx}
%\usepackage{mathrsfs,amsbsy}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{amsthm}
\usepackage{enumerate}
\usepackage[mathscr]{eucal}
\usepackage{mathrsfs}
\usepackage{verbatim}

%\usepackage[notcite,notref]{showkeys}

% showkeys make label explicit on the paper

\makeatletter
\@namedef{subjclassname@2010}{%
\textup{2010} Mathematics Subject Classification}
\makeatother

\numberwithin{equation}{section}

\theoremstyle{plain}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{claim}[theorem]{Claim}
\newtheorem{defn}[theorem]{Definition}

\theoremstyle{plain}
\newtheorem{thmsub}{Theorem}[subsection]
\newtheorem{lemmasub}[thmsub]{Lemma}
\newtheorem{corollarysub}[thmsub]{Corollary}
\newtheorem{propositionsub}[thmsub]{Proposition}
\newtheorem{defnsub}[thmsub]{Definition}

\numberwithin{equation}{section}


\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}
\newtheorem{remarks}{Remarks}


\renewcommand\thefootnote{\fnsymbol{footnote}}
%dont use number as footnote symbol, use this command to change

\DeclareMathOperator{\supp}{supp}
\DeclareMathOperator{\dist}{dist}
\DeclareMathOperator{\vol}{vol}
\DeclareMathOperator{\diag}{diag}
\DeclareMathOperator{\tr}{tr}

\begin{document}
\date{}

\title
{This is the Title}


\author{Name}
\address{School of Mathematical Sciences\\
University of Science and Technology of China\\
Hefei, 230026\\ P.R. China\\}
\email{email}

 

 

\begin{abstract} Briefly describe the topic. \end{abstract}\begin{abstract} Briefly describe the topic. \end{abstract}

\subjclass[2010]{}

\keywords{}


\maketitle
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%


\section{Introduction}
This section is the introduction to the paper.\\\\

1. Suppose Sn=a1++anSn=a1++an, and Tn=S1++SnTn=S1++Sn. If limn1nTn=slimn1nTn=s and nannan is bounded, then limnSn=s.limnSn=s.
\begin{proof}

We may assume that limn1nTn=0limn1nTn=0, or we can replace a1a1 by a1sa1s. For ε>0ε>0, there is a large number NN, nNnN, we have |Tn|εn.|Tn|εn. Since
Tn+kTn=Sn+1++Sn+kTn+kTn=Sn+1++Sn+k
=kSn+(kan+1+(k1)an+2++2an+k1+an+k),=kSn+(kan+1+(k1)an+2++2an+k1+an+k),
we have
kSn=Tn+kTn(kan+1+(k1)an+2++2an+k1+an+k).kSn=Tn+kTn(kan+1+(k1)an+2++2an+k1+an+k).
Suppose |nan|C|nan|C, then
k|Sn|(2n+k)ε+C(kn+1+k1n+2++1n+k)(2n+k)ε+Ck2n,k|Sn|(2n+k)ε+C(kn+1+k1n+2++1n+k)(2n+k)ε+Ck2n,
or equivalent,
|Sn|(2nk+1)ε+Ckn.|Sn|(2nk+1)ε+Ckn.
Take k=[εn]>12εnk=[εn]>12εn, then we have
|Sn|(4ε+1)ε+Cε=(4+ε+C)ε.|Sn|(4ε+1)ε+Cε=(4+ε+C)ε.

\end{proof}

2. Suppose ff is a real value function on RR, and f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y) for x,yRx,yR. If the set {(x,f(x)):xR}{(x,f(x)):xR} is not dense in R2R2, then ff is continuous.
\begin{proof}
In fact, we have f(x)f(1)xf(x)f(1)x. It is not hard to see f(rx)=rf(x)f(rx)=rf(x) for xR,rQxR,rQ. We denote c=f(1)c=f(1), then f(r)=crf(r)=cr for rQrQ. If f(x)cxf(x)cx is false, then there exists a number x0RQx0RQ, s.t. y0=f(x0)cx0y0=f(x0)cx0. Then we have
f(x0s+r)=y0s+cr=c(x0s+r)+(y0cx0)s,s,tQ.f(x0s+r)=y0s+cr=c(x0s+r)+(y0cx0)s,s,tQ.
Fix yRyR. For ε>0ε>0, there is a number sQsQ, s.t. |s(y0cx0)y|<ε|s(y0cx0)y|<ε, then |s|<|y|+ε|y0cx0||y|+1|y0cx0|=C|s|<|y|+ε|y0cx0||y|+1|y0cx0|=C. Take rQrQ s.t. |x0+r|<ε|x0+r|<ε, we have
f(x0+r)=c(x0+r)+(y0cx0),f(x0+r)=c(x0+r)+(y0cx0),
and
f(s(x0+r))=sc(x0+r)+s(y0cx0),f(s(x0+r))=sc(x0+r)+s(y0cx0),
then |s(x0+r)|Cε|s(x0+r)|Cε and
|f(s(x0+r))y||sc(x0+r)|+|s(y0cx0)y|<(Cc+1)ε.|f(s(x0+r))y||sc(x0+r)|+|s(y0cx0)y|<(Cc+1)ε.
Fix (x,y)R2(x,y)R2. For ε>0ε>0, there exists a number aRaR s.t. |a|<ε|a|<ε, and |f(a)(ycx)|<ε|f(a)(ycx)|<ε. Take rQrQ s.t. |xr|<ε|xr|<ε, we have
f(a+r)=f(a)+cr=f(a)+cx+c(rx)f(a+r)=f(a)+cr=f(a)+cx+c(rx)
then |(a+r)x|<2ε|(a+r)x|<2ε and
|f(a+r)y|=|f(a)(ycx)|+|c(rx)|<(1+c)ε.|f(a+r)y|=|f(a)(ycx)|+|c(rx)|<(1+c)ε.
It is a contradiction.

\end{proof}

3. Suppose ΩCΩC is a domain, and un=Refnun=Refn, where fnH(Ω)fnH(Ω). If {un}{un} is uniform convergence on arbitrary compact subset of ΩΩ, and {fn(z0)}{fn(z0)} is convergence for some z0Ωz0Ω. Prove that {fn}{fn} is uniform convergence on arbitrary compact subset of ΩΩ.
\begin{proof}
Since the compact set has a finite open covering property, we only need to consider the case Ω=DΩ=D. We can obtain the conclusion by the Borel-Carathˊe´eodory lemma: Suppose fH(D)fH(D). Let M(r)=max|z|=r|f(z)|M(r)=max|z|=r|f(z)|, A(r)=max|z|=rRef(z)A(r)=max|z|=rRef(z), then for 0<r<R<10<r<R<1, we have
M(r)2rRrA(R)+R+rRr|f(0)|.M(r)2rRrA(R)+R+rRr|f(0)|.

\end{proof}

4. Suppose ΩCΩC is a convex domain, and fH(Ω)fH(Ω). If Ref(z)0Ref(z)0 for zΩzΩ and ff is not constant function, then ff is injective.
\begin{proof}
Consider ef(z)H(Ω)ef(z)H(Ω), then |ef(z)|=eRef(z)1|ef(z)|=eRef(z)1. If Ref(z0)=0Ref(z0)=0 for some z0Ωz0Ω, then ef(z)=constef(z)=const, or f(z)=constf(z)=const by the maximum principle. That is to say f(z)=czf(z)=cz with c0c0, then ff is injective. If Ref(z)>0Ref(z)>0 for zΩzΩ, then for z1,z2Ωz1,z2Ω with z1z2z1z2, we have
f(z2)f(z1)=z2z1f(z)dz=(z2z1)10f(z1+t(z2z1))dt,f(z2)f(z1)=z2z1f(z)dz=(z2z1)10f(z1+t(z2z1))dt,
then
Ref(z2)f(z1)z2z1=10Ref(z1+t(z2z1))dt>0.Ref(z2)f(z1)z2z1=10Ref(z1+t(z2z1))dt>0.

\end{proof}

5. Prove the linear span of tnet,n=0,1,2,tnet,n=0,1,2, is dense in L2(0,)L2(0,).
\begin{proof}
Let MM be the closed linear span of tnet,n=0,1,2,tnet,n=0,1,2,. Take any φMφM, we have
0tnetφ(t)dt=0,n=0,1,2,.0tnetφ(t)dt=0,n=0,1,2,.
Let zz be a complex with  z>1I z>1, and
f(z)=0eiztetφ(t)dt.f(z)=0eiztetφ(t)dt.
Since |ez1z|Cmax{1,e|z|}|ez1z|Cmax{1,e|z|}, we have
f(z)=limh0f(z+h)f(z)h=limh00eiht1heiztetφ(t)dtf(z)=limh0f(z+h)f(z)h=limh00eiht1heiztetφ(t)dt
=0iteiztetφ(t)dt=0iteiztetφ(t)dt
by the dominated convergence theorem. That means ff is analytic. Similarly, we have
f(n)(z)=0intneiztetφ(t)dt.f(n)(z)=0intneiztetφ(t)dt.
Since f(n)(0)=in0tnetφ(t)dt=0,n=0,1,2,f(n)(0)=in0tnetφ(t)dt=0,n=0,1,2,, we have f(z)0f(z)0, that means eiztetMeiztetM. According to the Weierstrass approximation theorem, every continuous periodic function h(t)h(t) is the uniform limit of trigonometric polynomials, we can get h(t)etMh(t)etM. Let g(t)g(t) be a continuous function with compact support, and g1(t)=g(t)etg1(t)=g(t)et. Denote by h(t)h(t) a TT periodic function such that
h(t)g1(t),t[0,T],h(t)g1(t),t[0,T],
where TT is large enough so that the support of g1(t)g1(t) is contained in the interval [0,T][0,T]. Then
|g1(t)h(t)|||g1||Lχ(T,)(t),|g1(t)h(t)|||g1||Lχ(T,)(t),
so that
|g(t)h(t)et|||g1||Letχ(T,)(t).|g(t)h(t)et|||g1||Letχ(T,)(t).
Let TT, we can get g(t)Mg(t)M. Since the set of all continuous functions with compact support is dense in L2(0,)L2(0,), we have M=L2(0,)M=L2(0,).

\end{proof}

6. Let AA is a unital commutative Banach algebra that is generated by {1,x}{1,x} for some xAxA. Then the complement set of σ(x)σ(x) is connected.
\begin{proof}
Let us decompose σ(x)cσ(x)c into its connected components, obtaining an unbounded component ΩΩ together with a sequence of holes Ω1,Ω2,,Ω1,Ω2,,
σ(x)c=ΩΩ1Ω2.σ(x)c=ΩΩ1Ω2.
Let Ω=Ω1Ω2Ω=Ω1Ω2. If σ(x)cσ(x)c is not connected, the ΩΩ. Suppose λΩλΩ, then for arbitrary polynomial p(z)p(z), since p(z)p(z) is analytic, we have
|p(λ)|maxzσ(x)|p(z)|=maxωSp(A)|ω(p(x))|||p(x)|||p(λ)|maxzσ(x)|p(z)|=maxωSp(A)|ω(p(x))|||p(x)||
by the maximum principle and Gelfand theorem. If we defind
ω:p(x)p(λ),ω:p(x)p(λ),
then ωω is bounded on {p(x)}{p(x)}. Since {p(x)}{p(x)} is dense in AA, ωω have unique extension on AA, and ω(xy)=ω(x)ω(y)ω(xy)=ω(x)ω(y), that means ωSp(A)ωSp(A). Then λ=ω(x)σ(x)λ=ω(x)σ(x), it is a contradiction.

\end{proof}

7. Suppose XX is a compact Hausdorff space. ΩΩ is a family of colsed connected subset of XX, and ΩΩ is totally order with respect to inclusion relation. Then Y={A:AΩ}Y={A:AΩ} is connected.
\begin{proof}
If YY is not connected, then are open set BB and CC, with BC=BC=, BYBY and CYCY. Consider the set Y1={A(BC):AΩ}Y1={A(BC):AΩ}, then Y1=Y(BC)=Y1=Y(BC)=. Since AA is connected, if A(BC)=A(BC)=, or ABCABC, then ABAB, or ACAC, it is impossible. Thus A(BC)A(BC). Since A(BC)A(BC) is compact, and finite intersection is not empty, then Y1Y1. It is a contradiction.

\end{proof}

8. Suppose the measurable set ARAR with 0<m(A)<0<m(A)<. Let f(x,r)=m(A[xr,x+r])/2rf(x,r)=m(A[xr,x+r])/2r, then there exists xRxR s.t.
0<lim infr0+f(x,r)lim supr0+f(x,r)<1.0<liminfr0+f(x,r)limsupr0+f(x,r)<1.
\begin{proof}
Since 0<m(A)<0<m(A)<, there are interval I1,I2I1,I2 with |I1|=|l2|=2r0|I1|=|l2|=2r0 s.t. m(AI1)>12|I1|m(AI1)>12|I1|, m(AI2)<12|I2|m(AI2)<12|I2|.
Since f(x,r)f(x,r) is continuous about xx, there exists x0x0 with f(x0,r0)=12f(x0,r0)=12. Since we have
m(A[x0r0,x0+r0])=m(A[x0r0,x0])+m(A[x0,x0+r0])=r0,m(A[x0r0,x0+r0])=m(A[x0r0,x0])+m(A[x0,x0+r0])=r0,
there exists x1[x0r02,x0+r02]x1[x0r02,x0+r02] with f(x1,r02)=12f(x1,r02)=12. Or equivalently, there exists x1Rx1R with
|x1x0|r02,f(x1,r02)=12.|x1x0|r02,f(x1,r02)=12.
Similarly, there exists xnRxnR with
|xnxn1|r02n,f(xn,r02n)=12.|xnxn1|r02n,f(xn,r02n)=12.
Let x=limnxnx=limnxn, then |xxn|=|k=n+1(xkxk1)|k=n+1|xkxk1|r02n|xxn|=|k=n+1(xkxk1)|k=n+1|xkxk1|r02n. For any r<r0r<r0, there exists unique N1N1 s.t. r02Nr<r02N1r02Nr<r02N1. Then we have
[xN+1r02N+1,xN+1+r02N+1][xr02N,x+r02N][xr,x+r],[xN+1r02N+1,xN+1+r02N+1][xr02N,x+r02N][xr,x+r],
and
f(x,r)=m(A[xr,x+r])2rm(A[xN+1r02N+1,xN+1+r02N+1])2r02N1f(x,r)=m(A[xr,x+r])2rm(A[xN+1r02N+1,xN+1+r02N+1])2r02N1
=14f(xN+1,r02N+1)=18.=14f(xN+1,r02N+1)=18.
On the other hand, we have
m(A[xr,x+r])m(A[xN+1r02N+1,xN+1+r02N+1])m(A[xr,x+r])m(A[xN+1r02N+1,xN+1+r02N+1])
+m([xr,x+r][xN+1r02N+1,xN+1+r02N+1])+m([xr,x+r][xN+1r02N+1,xN+1+r02N+1])
=r02N+1+2r2r02N+1=2rr02N+12r14r=74r,=r02N+1+2r2r02N+1=2rr02N+12r14r=74r,
then
f(x,r)=m(A[xr,x+r])2r78.f(x,r)=m(A[xr,x+r])2r78.
That is to say
18lim infr0+f(x,r)lim supr0+f(x,r)78.18liminfr0+f(x,r)limsupr0+f(x,r)78.

\end{proof}

9. Suppose {fn}n=1{fn}n=1 is a bounded sequence in LpLp with 1p<1p<. If fnffnf a.e., then fLpfLp and
limn|fn|p|fnf|p=|f|p.limn|fn|p|fnf|p=|f|p.
\begin{proof}
We denote M=supn1|fn|p<M=supn1|fn|p<.Since fnffnf a.e., we have |fn|p|f|p|fn|p|f|p a.e. and by Fatou Lemma
|f|plim_n|fn|pM<,|f|plim––n|fn|pM<,
that is to say fLpfLp. For a,b0a,b0, we have
|apbp|=pξp1|ab|pmax{a,b}p1|ab||apbp|=pξp1|ab|pmax{a,b}p1|ab|
by Lagrange Mean Value Theorem, where ξξ is a real number between aa and bb. Then we obtain
||fn|p|fnf|p|pmax{|fn|,|fnf|}p1|f|.||fn|p|fnf|p|pmax{|fn|,|fnf|}p1|f|.
Fixed ε>0ε>0. Suppose AA is a measurable set with m(A)<m(A)<, and the follow inequality holds
Ac|f|pε.Ac|f|pε.
There is a δ>0δ>0 such that
B|f|p<ε whenever m(B)<δB|f|p<ε whenever m(B)<δ
by absolute continuity. Since fnffnf a.e. on AA and m(A)<m(A)<, we can find a measurable subset aAaA such m(Aa)<δm(Aa)<δ and fnffnf uniformly on aa by Egorov Theorem. Then we have
a|fn|p|fnf|pa|f|p,a|fn|p|fnf|pa|f|p,
as nn, and
ac|f|p=Aa|f|p+Ac|f|p<2ε.ac|f|p=Aa|f|p+Ac|f|p<2ε.
Since the function max{|fn|,|fnf|}p1Lpmax{|fn|,|fnf|}p1Lp, and ||max{|fn|,|fnf|}p1||p=||max{|fn|,|fnf|}||p1p(3Mp)1p.||max{|fn|,|fnf|}p1||p=||max{|fn|,|fnf|}||p1p(3Mp)1p.
We have
ac||fn|p|fnf|p|pacmax{|fn|,|fnf|}p1|f|p(3M)1p(ac|f|p)1pp(3M)1p(2ε)1p,ac||fn|p|fnf|p|pacmax{|fn|,|fnf|}p1|f|p(3M)1p(ac|f|p)1pp(3M)1p(2ε)1p, by H\"{o}lder inequality. Thus we obtain
¯limn||fn|p|fnf|p|f|p|(1+p(3M)1p)(2ε)1p.¯¯¯¯¯¯¯¯limn||fn|p|fnf|p|f|p|(1+p(3M)1p)(2ε)1p.

\end{proof}

10. Suppose Dn(t)Dn(t) are the Dirichlet kernels, and FN(t)FN(t) is the NN-th Fejˊe´er kernel given by
FN(t)=D0(t)++DN1(t)N.FN(t)=D0(t)++DN1(t)N.
Let LN(t)=min(N,π2Nt2)LN(t)=min(N,π2Nt2). Prove
FN(t)=1N1cosNt1costLN(t)FN(t)=1N1cosNt1costLN(t)
and TLN(t)dt4πTLN(t)dt4π. If fL1(T)fL1(T) and the NN-th Cesˊa`aro mean of Fourier series is
σN(f)(x)=S0(f)(x)++SN1(f)(x)N,σN(f)(x)=S0(f)(x)++SN1(f)(x)N,
then σN(f)(x)f(x)σN(f)(x)f(x) for every xx in the Lebesgue set of ff.
\begin{proof}
Since DN(t)=Nn=Neint=sin(N+12)tsint2DN(t)=Nn=Neint=sin(N+12)tsint2, we have
FN(t)=1Nsin2Nt2sin2t2=1N1cosNt1cost.FN(t)=1Nsin2Nt2sin2t2=1N1cosNt1cost.
Since |DN(t)|2N+1|DN(t)|2N+1, we can get FN(t)NFN(t)N. For 0<x<π20<x<π2, we have sinx2πxsinx2πx, then
FN(t)=1Nsin2Nt2sin2t21N1sin2t2π2Nt2.FN(t)=1Nsin2Nt2sin2t21N1sin2t2π2Nt2.
That mens FN(t)LN(t)FN(t)LN(t). And
TLN(t)dt=2π0LN(t)dt=2πN0Ndt+2ππNπ2Nt2dt=4π2πN4π.TLN(t)dt=2π0LN(t)dt=2πN0Ndt+2ππNπ2Nt2dt=4π2πN4π.
Since TFN(t)=1TFN(t)=1 and FN(t)LN(t)FN(t)LN(t), we can get {FN(t)}{FN(t)} is an approximation to the identity, then σN(f)(x)=(fFN)(x)f(x)σN(f)(x)=(fFN)(x)f(x) for every xx in the Lebesgue set of ff.

\end{proof}

11. Suppose the sequence {an}{an} satisfying an+1=(4n2)an+an1an+1=(4n2)an+an1. Prove that {an}{an} is convergence if and only if
(e1)a0+(e+1)a1=0.(e1)a0+(e+1)a1=0.
\begin{proof}
If {an}{an} is convengence and not vanishing, then it is obvious that anan+1<0anan+1<0. We can assume a0>0a0>0, a1<0a1<0, then a2n>0a2n>0, a2n+1<0a2n+1<0. Let bn=4n2bn=4n2 and
an=pn2a1+qn2a0,n2.an=pn2a1+qn2a0,n2.
Since a2=b1a1+a0a2=b1a1+a0, and a3=(1+b1b2)a1+b2a0a3=(1+b1b2)a1+b2a0, we can get
p0=b1,p1=1+b1b2,q0=1,q1=b2.p0=b1,p1=1+b1b2,q0=1,q1=b2.
Since an+2=bn+1an+1+an=bn+1(pn1a1+qn1a0)+(pn2a1+qn2a0)=(bn+1pn1+pn2)a1+(bn+1qn1+qn2)a0an+2=bn+1an+1+an=bn+1(pn1a1+qn1a0)+(pn2a1+qn2a0)=(bn+1pn1+pn2)a1+(bn+1qn1+qn2)a0, we can get
pn=bn+1pn1+pn2,qn=bn+1qn1+qn2.pn=bn+1pn1+pn2,qn=bn+1qn1+qn2.
That is to say
pnqn=[b1,b2,,bn+1]=b1+1b2+1+1bn+1,pnqn=[b1,b2,,bn+1]=b1+1b2+1+1bn+1,
and we have pnqn[b1,b2,]pnqn[b1,b2,] as nn. Since
a2n+1=p2n1a1+q2n1a0<0,a2n+2=p2na1+q2na0>0,a2n+1=p2n1a1+q2n1a0<0,a2n+2=p2na1+q2na0>0,
we have
p2nq2n(a1)<a0<p2n1q2n1(a1),p2nq2n(a1)<a0<p2n1q2n1(a1),
Let nn, we can get
a0+[b1,b2,]a1=0.a0+[b1,b2,]a1=0.
On the contrary, if a0+[b1,b2,]a1=0a0+[b1,b2,]a1=0, since |[b1,b2,]pnqn|<1qnqn+1|[b1,b2,]pnqn|<1qnqn+1, we can get
|an|=|a1||pn2qn2[b1,b2,]||a1|qn10.|an|=|a1||pn2qn2[b1,b2,]||a1|qn10.
Since
e1e+1=[0,2,6,10,]=12+16+110+1,e1e+1=[0,2,6,10,]=12+16+110+1,
we can get [b1,b2,]=e+1e1[b1,b2,]=e+1e1, then a0+[b1,b2,]a1=0a0+[b1,b2,]a1=0 is equivalent to
(e1)a0+(e+1)a1=0.(e1)a0+(e+1)a1=0.

\end{proof}

12. Suppose {xn}{xn} satisfying x1=1x1=1, xn+1=xn+1Snxn+1=xn+1Sn, where Sn=x1++xnSn=x1++xn. Prove that\\
(a) x2n2lnSnx2n2lnSn is increasing and x2n2lnSn1x2n2lnSn1 is decreasing for n2n2.\\
(b) x2n2lnnlnlnnx2n2lnnlnlnn is convengence.\\
(c) limnlnnlnlnn(xn2lnn1)=14limnlnnlnlnn(xn2lnn1)=14.
\begin{proof}
For n2n2, we have
(x2n+12lnSn)(x2n2lnSn1)=(xn+1Sn)2x2n+2lnSn1Sn(x2n+12lnSn)(x2n2lnSn1)=(xn+1Sn)2x2n+2lnSn1Sn
=2xnSn+1S2n+2ln(1xnSn)<2xnSn+1S2n2(xnSn+x2n2S2n)=1x2n2S2n0.=2xnSn+1S2n+2ln(1xnSn)<2xnSn+1S2n2(xnSn+x2n2S2n)=1x2n2S2n0.
Similarly,
(x2n+12lnSn+1)(x2n2lnSn)=(xn+1Sn)2x2n2lnSn+1Sn
=2xnSn+1S2n2ln(1+xn+1Sn)>2xnSn+1S2n2(xn+1Snx2n+12S2n+x3n+13S3n)
=x2n+11S2n23x3n+1S3n=x2n+1S2n(11x2n+12xn+13Sn).
Since x1=1,x2=2, and S1=1,S2=3, we have
xn+1Sn=xn+1SnSn=1SnSn11S2S1=12<0,
that means 2xn+13Sn23, then
11x2n+12xn+13Sn>131x2n+1>0.
That implys (a).\\
Since x2n2lnSn is increasing, we can get x2n2lnSnx222lnS2=42ln3>1. Since xn1, we have Snn, then
x2n1+2lnSn1+2lnn.
Since x2n2lnSn1 is decreasing, we can get x2n2lnSnx2n+12lnSnx222lnS2=4, then
x2n4+2lnSn.
Since Snn, we can get xn1+1+12++1n12+lnn, then Snnxnn(2+lnn), and
x2n4+2lnn+2ln(2+lnn).
Thus, it is obvious that
xnlnn2,
and we have
Snnlnn2
by Stolz formula. Since x2n2lnSn4, we can get x2n2lnSn is convengence, then
x2n2lnnlnlnn=x2n2lnSn+2lnSnnlnn
is convengence. That implys (b).\\
Since x2n=2lnn+lnlnn+a+o(1), we can get
x2n2lnn1=lnlnn2lnn+a+o(1)2lnn,
then
lnnlnlnn(xn2lnn1)=(xn2lnn+1)1lnnlnlnn(x2n2lnn1)
1212=14.
Moreover, we have
limnlnlnn(lnnlnlnn(xn2lnn1)14)=a4.

\end{proof}

13. Suppose fC[0,) and for a0, we have
limxf(x+a)f(x)=0.
Then there exist gC[0,) and hC1[0,) with f=g+h, such that
limxg(x)=0, limxh(x)=0.
\begin{proof}
In fact, f is uniformly continuous. Otherwise, there are two sequences {xn}n=1, {yn}n=1 and a positive ε, such that
xn,yn,|xnyn|0,|f(xn)f(yn)|ε0
as n. Consider the functions
φn(x)=f(xn+x)f(xn)
and
ϕn(x)=f(yn+x)f(yn)
defined on the interval [0,1]. Then we have
φ(x),ϕ(x)0
as n due to limxf(x+a)f(x)=0. For 0<ε<12, there is a set Aε[0,1] such that m([0,1]Aε)<ε and φn,ϕn0 uniformly on Aε by Egorov Theorem. Take a integer N such that nN and xAε, we have |xnyn|<12ε and
|φn(x)|ε03,|ϕn(x)|ε03.
Since m((xn+Aε)(yn+Aε))=m(xn+Aε)+m(yn+Aε)m((xn+Aε)(yn+Aε))2(1Aε)(1+|xnyn|)=12ε|xnyn|>0, there is a point x(xn+Aε)(yn+Aε). We have xxn,xynAε, and then
|φ(xxn)|=|f(x)f(xn)|ε03,|ϕ(xyn)|=|f(x)f(yn)|ε03,
thus |f(xn)f(yn)|23ε0, it is a contradiction.

Let h(x)=x+1xf(t)dt, and g(x)=f(x)h(x), then we have
h(x)=f(x+1)f(x)0
as x. Since f is uniformly continous, there is positive M such x,y0 with |xy|1, we have |f(x)f(y)|M. Since f(x)f(x+t)0 as x and |f(x)f(x+t)|M for t[0,1], by DCT, we have
g(x)=10f(x)f(x+t)0 as n.

\end{proof}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

 

 

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

 

 


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

 


\begin{thebibliography}{99}


%\bibitem{AF12}%
%Antunes, P., Freitas, P.: Optimal spectral rectangles and lattice ellipses. \emph{Proc. Royal Soc. London Ser. A.} \textbf{469} (2012), 20120492.

 


\end{thebibliography}


\end{document}

 

posted on   Eufisky  阅读(612)  评论(0编辑  收藏  举报

编辑推荐:
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
阅读排行:
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
· 园子的第一款AI主题卫衣上架——"HELLO! HOW CAN I ASSIST YOU TODAY
· 【自荐】一款简洁、开源的在线白板工具 Drawnix
< 2025年3月 >
23 24 25 26 27 28 1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30 31 1 2 3 4 5

导航

统计

点击右上角即可分享
微信分享提示