-2

Use Zorns lemma to prove that every finite totally ordered set has a unique minimal element.

I know how to use induction to prove it but I am asked to use Zorn's lemma.

what I have thus far:
Let $X$ be a finite totally ordered set with elements $x_1,...,x_n$. Let's arbitrarily pick an element $x_{1}$ to be the minimal element of $X$ itself, then an arbitrary element $x_{2}$ to be the minimal element of $X \setminus \{x_1\}$, and so on. I am just stuck on how I would incorporate Zorns lemma to prove that there exists a unique minimal element.

justanewb
  • 1,179

1 Answers1

0

I am not sure if this is correct but I just attempted to prove this by contradiction:

Let $(T,\le)$ be a finite totally ordered set. Then $T$ has at least one unique minimal element. Suppose that $T$ has no minimal element. Then for each $t\in T$ there is a nonempty subset of $T$, $$S_{t} = \{u\in T:t \le u\}.$$ The axiom of choice says that consequently there exists a function $f:T\rightarrow T$ such that $f(t)\in S_t$ for all $t\in T$. That is, $$f(t) \ge t\text{ for all }t\in T.$$ This contradicts the fundamental lemma

As I've said not sure if this is right I didn't use Zorn's lemma but the axiom of choice which is equivalent so maybe that is ok?

justanewb
  • 1,179