Supremum of a set, relations and order

In summary, the supremum of a set is the least upper bound of that set, meaning it is the smallest value that is greater than or equal to every element in the set. Relations define how elements are associated with each other, and order refers to the arrangement of elements based on specific criteria, such as less than or greater than. Understanding these concepts is crucial in mathematical analysis and set theory, as they help in comparing and organizing elements systematically.
  • #36
lys04 said:
TL;DR Summary: prove that a supremum for a set doesn't exist; relations, total order and partial order

Hello, found this proof online, I was wondering why they defined r_2=r_1-(r_1^2-2)/(r_1+2)? i understand the numerator, because if i did r_1^2-4 then there might be a chance that this becomes negative. But for the denominator, instead of plus 2, can i do plus 10 as well? or some other number thats positive
View attachment 342079

I also did some reading on Cartesian product, relations, total order and partial order.
So a Cartesian product AxB is just ordered pair (a,b) where a is an element of A and b is an element of B right.
And a relation is just a subset of the Cartesian product.
Now total and partial orders.
Total order is denoted by < and partial order is denoted by <=? I’m a bit unsure about these, please correct me if I’m wrong.
And a total order relation requires four things:
Reflexive, anti-symmetric, transitive and comparability? I’m a bit unsure what comparability is though.
And for partial order relation I think it just needs to be reflexive, anti-symmetric and transitive?
The product ## A \times B## is not a pair ##(a,b)## but rather the collection of _all_ pairs ##(a,b)## for ##a \in A, b\in B##.
 

Similar threads

Replies
5
Views
2K
Replies
7
Views
2K
Replies
1
Views
1K
Replies
6
Views
1K
Replies
3
Views
2K
Replies
3
Views
2K
Replies
9
Views
2K
Back
Top