检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:叶明露[1] 陈家欣 YE Minglu;CHEN Jiaxin(School of Mathematics and Information,China West Normal University,Nanchong Sichuan 637009,China)
机构地区:[1]西华师范大学数学与信息学院
出 处:《西华师范大学学报(自然科学版)》2019年第3期251-255,共5页Journal of China West Normal University(Natural Sciences)
基 金:国家自然科学基金面上项目(11871059);国家自然科学基金青年项目(11801455);2018年校级大学生创新创业训练计划项目(cxcy2018204)
摘 要:集列的上(下)极限的计算是实变函数教学中的一个重点和难点,但其计算公式对复杂的集列并不适用。本文主要证明了当集列{Bn}n=1^∞和{Cn}n=1^∞均单调时,集列{Bn×Cn}]n=1^∞的上(下)极限集分别等于{Bn}n=1^∞和{Cn}n=1^∞的上(下)极限集的笛卡尔集。当笛卡尔型集列的每个坐标集列均单调时,我们还证明了上述等式关系可以推广到有限个集合中去,但不能推广到可数个集合中去。通过例子,我们还展示了上述等式关系的运用。Calculation of the superior (inferior) limit of set sequence is a key and difficult point in the teaching of real variable function.Although the calculation formula about the superior (inferior) limit of set sequence is given,it does not apply to the case when the set sequence is complex.This paper mainly proves that the superior (inferior) limit of set sequence {Bn×Cn}n=1^∞ equals to the Cartesian set of superior (inferior) limit of set sequence {Bn}n=1^∞ and {Cn}n=1^∞ when both of them are monotone.Moreover,if each coordinate set sequence of the Cartesian set is monotone,the above equality relationship holds for the case when the Cartesian set is constructed by finite number of set but not for infinite number of set.Examples are also given to show the application of the above equality relationship.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.91.183