请输入您要查询的字词:

 

单词 ProofOfPoincareRecurrenceTheorem2
释义

proof of Poincaré recurrence theorem 2


Let {Un:n} be a basis of open sets for X, and for each n define

Un={xUn:n1,fn(x)Un}.

From theorem 1 we know that μ(Un)=0. Let N=nUn.Then μ(N)=0. We assert that if xX-N then x is recurrent. In fact,given a neighborhoodMathworldPlanetmathPlanetmath U of x, there is a basic neighborhood Un such that xUnU, and since xN we have that xUn-Un which by definition of Un means that there exists n1 such that fn(x)UnU; thus x is recurrent.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 6:39:17