Hardy spaces H~p over non-homogeneous metric measure spaces and their applications

Let(X,d,)be a metric measure space satisfying both the geometrically doubling and the upper doubling conditions.Let ρ∈(1,∞),0p≤1≤q≤∞,p≠q,γ∈[1,∞)and ∈∈(0,∞).In this paper,the authors introduce the atomic Hardy space Hp,q,γ atb,ρ(μ)and the molecular Hardy space Hp,q,γ,mb,ρ∈(μ)via the discrete coefficient K(ρ),p B,S,and prove that the Calder′on-Zygmund operator is bounded from Hp,q,γ,δmb,ρ(μ)(or Hp,q,γatb,ρ(μ))into Lp(μ),and from Hp,q,γ+1atb,ρ(ρ+1)(μ)into H p,q,γ,12(δ-νp+ν)mb,ρ(μ).The boundedness of the generalized fractional integral Tβ(β∈(0,1))from Hp1,q,γ,θmb,ρ(μ)(or Hp1,q,γatb,ρ(μ))into Lp2(μ)with 1/p2=1/p1-β is also established.The authors also introduce theρ-weakly doubling condition,withρ∈(1,∞),of the measure and construct a non-doubling measure satisfying this condition.If isρ-weakly doubling,the authors further introduce the Campanato space Eα,qρ,η,γ(μ)and show that Eα,qρ,η,γ(μ)is independent of the choices ofρ,η,γand q;the authors then introduce the atomic Hardy space Hp,q,γatb,ρ(μ)and the molecular Hardy space Hp,q,γ,mb,ρ(μ),which coincide with each other;the authors finally prove that Hp,q,γatb,ρ(μ)is the predual of E1/p-1,1ρ,ρ,1(μ).Moreover,if is doubling,the authors show that Eα,qρ,η,γ(μ)and the Lipschitz space Lipα,q(μ)(q∈[1,∞)),or Hp,q,γatb,ρ(μ)and the atomic Hardy space Hp,q at(μ)(q∈(1,∞])of Coifman and Weiss coincide.Finally,if(X,d,)is an RD-space(reverse doubling space)with(X)=∞,the authors prove that Hp,q,γatb,ρ(μ),Hp,q,γ,mb,ρ(μ)and Hp,q at(μ)coincide for any q∈(1,2].In particular,when(X,d,):=(RD,||,dx)with dx being the D-dimensional Lebesgue measure,the authors show that spaces Hp,q,γatb,ρ(μ),Hp,q,γ,mb,ρ(μ),Hp,q,γatb,ρ(μ)and Hp,q,γ,mb,ρ(μ)all coincide with Hp(RD)for any q∈(1,∞).     

有得有失 有加有减

正林泽宇说,他的爸爸妈妈经常吵架,他很羡(xiàn)慕(mù)其他同学有温暖和谐的家庭,其实,很多家庭都有不如意的事情,就拿我家来说,我爸爸是做生意的,他经常在全国各地飞来飞去,很少有时间陪我,为此我经常闷闷不乐。昨天早上,爸爸匆匆忙忙地整理好行李就去机场了,谁知过了半天,他又回来了,原来,由于雾太大,航班取消了。     

一类随机最优控制问题的单调控制解

讨论了一类可允许控制策略满足单调非降条件的随机最优控制问题,给出了值函数v(t,x,y,)满足一类受梯度限制的Hamilton-Jacobi-Bellman(HJB)方程:max{Lv(t,x,y), v(t,x,y)/ y}=0,其中Lv(t,x,y)= v/ t b(t,x,y,) v/ x 1/2σ2(t,x,y) 2v/ x2 f(t,x,y).借助粘性解的思想,定义了该类HJB方程的粘性解并在此意义下证明了v(t,x,y)是唯一粘性解,这类方程在随机控制,金融数学等领域内有重要应用.     

对一道中考模拟题的剖析

2011年,北京石景山区二模第22题,其中蕴含的数学知识非常值得探究,题目如下:(1)已知:如图1,在四边形ABCD中,E是AD上一点,EC//AB,EB//CD,若S△DEC=1,S△ABE=3,则S△BCE=;若S=S,S=S,S=S,请直     

例说数学思维的困境及其摆脱

思维受挫就是在解题时,按一般的思路介入后,或者浅尝辄止,或者眼花缭乱,或者误入歧途,一错再错,或者前途渺茫,无法推进,就算使尽了浑身解数,左冲右突,终觉“山重水复疑无路”.笔者以为,要修复受挫的思维,只要仔细读题审题,寻找蛛丝马迹,类比联想相关知识点,分析可能的思想方法,探索恰当的思维路径,就会“峰回路转,柳暗花明”.下面举例说明,供同学们参考.     

怎一个“又”字了得

拐角和问题,图形变化多端,神秘莫测,破解之法是挖掘图形中的一个又字,这个又字时大时小,时正时偏,扑朔迷离,然连接又字撇、捺的末端,好似变8字,构造规则图形,则会揭开其神秘的面纱.析解几例,以飨读者.     

例谈“以退求进”法解题策略

著名数学家华罗庚说过:善于退,足够的退,退到最原始而不失去重要的地方,是学好数学的一个诀窍.这里所谓的退,当然不是逃跑,而是养精蓄锐,蓄势待发,是在为进寻求途径,即以退为进.它的实质是借助转化的数学思想,把复杂的问题简单化,运动的问题静止化,高维问题低维化,变量问题常量化,抽象问题具体化,代数问     

零国王勇战食数兽

一天,数字王国突然闯进来一个三只角的怪兽,吓得数字王国的公民纷纷躲避走,怪兽张开血盆大口,一口吞下数36,接着它又吞吃了-6,数2吓得脚软,奇怪的是,怪兽看也没看它     

珠心算可以防止老人痴呆症

犹记得在24年前。仲夏之际,母亲在三军总医院住院一个月才把如小玉西瓜大的肿瘤切除,当母亲身体逐渐康复,正准备隔天要出院时,父亲却因为太劳累,脑溢血倒下去,住进特护病房、重病房插管不醒人世,二周后与我们永别,与世长辞。世事如此无常,对我们的打击犹如晴天霹雳,母亲也变得郁郁寡欢,精神恍惚,思念父亲溢于言表。     

突破直线与圆锥曲线综合问题的多种策略研究

湖北八校(华中师大一附中,黄冈中学,黄石二中,鄂南高中,荆州中学,襄阳四中,襄阳五中,孝感高中)2012届高三第一次联考结束后,笔者发现此次联考理科解析几何题虽然不是特别难,但得分率仍然普遍很低,随即进行了追踪调查(数据分析,学生访谈,教师访谈,调查问卷,质量分析会),大部分     

二次曲面和平面位置关系的判式

在解析几何中有二次曲线与直线位置关系的讨论、二次曲面与直线位置关系的讨论,而二次曲面与平面相关位置关系的探讨较少.本文给出二次曲面a11x2+a22y2+a33z2+2a12xy+2a13xz+2a23yz+2a14x+2a24y+2a34z+a44=0(1)和平面Ax+By+Cz+D=0(2)的相对位置的判别式Δ=a11a12a13a14Aa21a22a23a24Ba31a32a33a34Ca41a42a43a44DA B C D0(aij=aji).(3)并证明了:若Δ>0,则二次曲面(1)与平面(2)相交;若Δ=0,则(1)和(2)相切;若Δ<0,则(1)和(2)相离.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Characterizations of g-frames and g-Riesz bases in Hilbert spaces

In this paper, we introduce the pre-frame operator Q for the g-frame in a complex Hilbert space, which will play a key role in studying g-frames and g-Riesz bases etc. Using the pre-frame operator Q, we give some necessary and sufficient conditions for a g-Bessel sequence, a g-frame, and a g-Riesz basis in a complex Hilbert space, which have properties similar to those of the Bessel sequence, frame, and Riesz basis respectively. We also obtain the relation between a g-frame and a g-Riesz basis, and the relation of bounds between a g-frame and a g-Riesz basis. Lastly, we consider the stability of a g-frame or a g-Riesz basis for a Hilbert space under perturbation.     

Global efficiency in multiobjective programming *

In this paper, we are concerned with global efficiency in multiobjective optimization. After exposing a property of a cone-subconvexlike function, we prove that a local weakly efficient solution, a local efficient solution and a local properly efficient solution are respectively a global weakly efficient solution, a global efficient solution and a global properly efficient solution of a multiobjective programming problem if cone- subconvexlikeness or cone-pre-invexity is assumed     

Toader型平均与几种经典平均的确界

给出了最佳参数α_1,α_2,α_3,β_1,β_2,β_3∈R,使得双向不等式α_1Q(a,b)+(1-α_1)G(a,b)0且a≠b成立.其中A(a,b)=(a+b)/2,H(a,b)=2ab/(a+b),G(a,b)=(ab)~(1/2),Q(a,b)=((a~2+b~2)/2)~(1/2),C(a,b)=(a~2+b~2)/(a+b),T(a,b)=2/π∫_0~(π/2)(a~2cos~2t+b~2sin~2)~(1/2)tdt分别是两个正数a和b的算术平均,调和平均,几何平均,二次平均,反调和平均和Toader平均.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

管状曲面在曲线论中的应用

研究了围绕曲线的管状曲面上的曲率线,渐近线与测地线,给出它们的方程,揭示了这些曲线与Bertrand曲线或Mannheim曲线之间的关系,采用新的方法给出一条曲线是Bertrand曲线或Mannheim曲线的充要条件的另一种证明以及Mannheim侣线的曲率与挠率之间的关系．