Proving me ? partial orders :hasse diagrams

  • Thread starter Thread starter rami070
  • Start date Start date
  • Tags Tags
    Diagrams Partial
rami070
Messages
4
Reaction score
0
partial orders :hasse diagrams
theorem : if [A,R] is poset and A is finite , then A has both a maximal and a minimal element

A={a1,a2,a3...an}

but i know prove it is maximal , but i not know how i prove it is minimal ?




please answer ?
 
Physics news on Phys.org
How did you prove that there is a maximal element?
 
https://fbcdn-sphotos-a.akamaihd.net/hphotos-ak-ash4/s320x320/400327_199078300188664_100002594878940_372880_1793624919_n.jpg
 
Last edited by a moderator:
see it i prove
 
see it is proved
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top