MHB Partial Order Relation on a Functions Set

Yankel
Messages
390
Reaction score
0
Hello,

I have a question which includes several statements, which I need to decide if they are true or false. I am not sure how to do it, if you could give me hints or "leads", it will mostly appreciated.

R is a partial order relation on A, a set of functions from [0,1] to [0,infinity) such that fRg if and only if f(x)<=g(x) for all x which belongs to [0,1].

In this relation:

1) There is a largest and smallest element
2) There is no largest element but there is a smallest one
3) There is more than one maximal element
4) There is more than one minimal element
5) Every 2 elements of A are comparable

I thought maybe to try and build a Hasse diagram, but unlike simple example with pairs of numbers, here I found it more difficult.

How do I compare two functions and order them ?

Thank you.
 
Physics news on Phys.org
Yankel said:
Hello,

I have a question which includes several statements, which I need to decide if they are true or false. I am not sure how to do it, if you could give me hints or "leads", it will mostly appreciated.

R is a partial order relation on A, a set of functions from [0,1] to [0,infinity) such that fRg if and only if f(x)<=g(x) for all x which belongs to [0,1].

In this relation:

1) There is a largest and smallest element
2) There is no largest element but there is a smallest one
3) There is more than one maximal element
4) There is more than one minimal element
5) Every 2 elements of A are comparable

I thought maybe to try and build a Hasse diagram, but unlike simple example with pairs of numbers, here I found it more difficult.

How do I compare two functions and order them ?

Thank you.
You are told how to "compare two functions and order them" in the definition of the order relation: given two functions f and g, f< g if and only if f(x)< g(x) for all x. Of course, most functions will NOT be "comparable" because we will have f(x)< g(x) for some x and g(x)< f(x) for others.
 
I see. Which function is the smallest in this case ? Is it f(x)=0 ?
 
Yankel said:
Which function is the smallest in this case ? Is it f(x)=0 ?
Yes.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top