Home » Set Theory » Zorn’s Lemma Part 1

# Zorn’s Lemma Part 1

Hello, infinite-set readers. Set theory is back.

The previous post about set theory is on this link. If you visit this website for the first time, you should read the previous posts.

(x) Theorem :

Any poset has the largest well ordered subset.

Proof :

Given any poset . Consider poset with is the set of all well ordered subset of poset and is a relation that defined as before. By Theorem in this post then all well ordered subset of poset has the smallest upper bound. By Theorem in this post Because of is a poset that every the well ordered subset has the smallest upper bound then has at least one maximum element. Suppose that the maximum element of is , then is also largest well ordered of poset .

Next will be discussed about the theorem that became the basic of Zorn’s Lemma.

(y) Theorem :

For non-empty poset that every the well ordered subset has upper bound then has at least one maximum element.

Proof :

By Theorem (x) above then has largest well ordered subset . Let be the upper bound . The existence of is guaranteed by hypothesis. Therefore is the largest well ordered subset of then . It because if then is well ordered subset of with . Contradiction with is largest well ordered subset of .

Furthermore, it will be shown that is the maximum element of . Take any . If then is well ordered subset of with . Contradiction with is largest well ordered subset of . Therefore, always apply that if then . In other words, is the maximum element of .

The next post will discuss about Zorn’s Lemma. Make sure you follow this ‘story’. Thanks for reading. May be useful.

## 1 Comment

1. […] Zorn’s Lemma Part 1 […]