Home » 2017 » June

# Monthly Archives: June 2017

## Proof / Disclaimer With Example

I think my post is a bit long and a lot of hassle lately. Today I will make a basic article. This is for website refreshment as well. Happy reading.

Most people use the equivalent method to prove mathematical statements. Even to prove the error of a statement. Though there are other ways to prove error statement, ie with an example of denial. This is considered sufficient because a statement must be perfect. Also because the truth must be perfect in mathematics.

Suppose there is a statement “If then is prime”. Suppose we want to deny the statement. We have a presumption that not always prime. Then simply indicated there is a number such that is not prime. For this case, we take then is not prime. This example is sufficient to prove that the above statement is false.

## Basic of Zorn’s Lemma – Initial Segment Part 2

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

To read this post, you should read the previous post first. It deals with the definition of that we will use. Happy reading.

Theorem :

Given poset with is the set of all well ordered subsets of poset and is a relation that defined as before. For any simply ordered subset of poset then always have the smallest upper bound.

Proof :

Given simply ordered subset of . Suppose then . Next, let’s say is non-empty simply ordered subset of . Consider :

It will be proved that is a well ordered subset of . Take any with then between the set , there is at least one that the element is on . Suppose the set is . Since is well ordered set then has the smallest element. Suppose the smallest element is . It will be proved that is also the smallest element for .

Take any with . Will be proven . Because of then there is such that . On the other hand, since is simply ordered set then or . If then and if then it is not possible to apply . It because, if then which results in a contradiction with is the smallest element of . In other words, apply for all . So for any , has the smallest element. We get is well ordered set which resulted . Thus, we get cause for any apply .

Based on the description above, for the next well ordered subset of poset on above is called the greatest ordered subset of . So is called the greatest ordered subset of if is not the initial segment of a well ordered subset of .

Thanks for reading. May be useful.