请输入您要查询的字词:

 

单词 EveryOrderedFieldWithTheLeastUpperBoundPropertyIsIsomorphicTomathbbRProofThat
释义

every ordered field with the least upper bound property is isomorphic to , proof that


Let F be an ordered field with the least upper bound property. By theorder properties of F, 0<1F and by an inductionMathworldPlanetmath argumentPlanetmathPlanetmath 0<n1Ffor any positive integer n. Hence the characteristicPlanetmathPlanetmath of the field F iszero, implying that there is an order-preserving embeddingMathworldPlanetmathPlanetmath j:F.

We would like to extend this map to an embedding of into F. Let rand let Dr={q:q<r} be the associated Dedekind cut. Since Dr isnonempty and bounded above in , it follows that the set j(Dr) is nonempty andbounded above in F. Applying the least upper bound property of F, define a functionȷ~:F by

ȷ~(r)=sup(j(Dr)).

One can check that ȷ~ is an order-preserving field homomorphism.By replacing F with the isomorphicPlanetmathPlanetmathPlanetmath field Fȷ~(),we may assume that F.

We claim that in fact =F. To see this, first recall thatsince F is a partially ordered group with the least upperbound property, F has the Archimedean property (http://planetmath.org/DistributivityInPoGroups).So for any fF, there exists some positive integer n such that -n<f<n.Hence the setDf={r:r<f} is nonempty andbounded above, implying that f=supDf lies in .Now observe that applying the least upper bound axiom in F gives us thatf=supFDf. Since f is an upper bound of Df in F, it followsthat ff.

Seeking a contradictionMathworldPlanetmathPlanetmath, suppose f<f. By the Archimedean property,there is some positive integer n such that f<f-n-1<f. Becausef=supDf, we obtain f-n-1<f, which implies thecontradictionf<f. Therefore f=f, and so f. This completesPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath the proof.

随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 15:45:19