You can edit almost every page by Creating an account and confirming your email.

Closed preordered set

From EverybodyWiki Bios & Wiki


In mathematics, a closed preordered set is one whose anti-well-ordered subsets have lower bounds.

Definition

Let κ be a cardinal. A preordered set (P,) is called κ-closed if every subset of P whose opposite is well-ordered with order-type less than κ has a lower bound.[1]:214, Definition VII.6.12

A preordered set is called inductive if every chain has an upper bound. Since every totally ordered set has a well-ordered cofinal subset, this is equivalent to saying that the opposite of the preordered set is κ-closed for all κ.

Properties

Inductive preordered sets satisfy Zorn's lemma and the Bourbaki–Witt theorem.

A κ-closed forcing preserves cofinalities less than or equal to κ, hence cardinals less than or equal to κ[1]:215, Corollary 2.6.15

References

  1. 1.0 1.1 Kunen, Kenneth (1980). Set theory: an introduction to independence proofs. Studies in Logic and the Foundations of Mathematics. 102. North-Holland. ISBN 978-0-444-86839-8. MR 0597342. Zbl 0534.03026. Search this book on


This article "Closed preordered set" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Closed preordered set. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.