请输入您要查询的字词:

 

单词 ProofOfSchroederBernsteinTheoremUsingTarskiKnasterTheorem
释义

proof of Schroeder-Bernstein theorem using Tarski-Knaster theorem


The Tarski-Knaster theorem can be used to give a short, elegant proof of the Schroeder-Bernstein theorem.

Proof.

Suppose f:ST and g:TS are injectivePlanetmathPlanetmath. Define a function φ:P(S)P(S)by φ(X)=Sg(Tf(X)).

If XYS, then Sg(Tf(X))Sg(Tf(Y)), and so φ is monotone. Since P(S) is a complete latticeMathworldPlanetmath, we may apply the Tarski-Knaster theorem to conclude that the set of fixed pointsPlanetmathPlanetmath of φ is a complete lattice and thus nonempty.

Let C be a fixed point of φ. We have

SC=g(Tf(C)).

Hence g|Tf(C):Tf(C)SCand f|C:Cf(C) are bijections. We can therefore construct the desired bijection h:ST by defining

h(x)={f(x)if xC(g|Tf(C))-1(x)if xC.

The usual proof of Schroeder-Bernstein theorem explicitly constructs a fixed point of φ.

References

  • 1 Thomas Forster, Logic, inductionMathworldPlanetmath and sets, Cambridge University Press, Cambridge, 2003.
  • 2 M. Kolibiar, A. Legéň, T. Šalát, and Š. Znám, Algebra a príbuzné disciplíny, Alfa, Bratislava, 1992 (Slovak).
随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/5 2:12:01