Partial Order Relation on a Functions Set

Click For Summary
SUMMARY

The discussion centers on the concept of a partial order relation R on a set A of functions defined from the interval [0,1] to [0,∞). The relation is defined such that fRg if and only if f(x) ≤ g(x) for all x in [0,1]. Key points include the identification of the smallest function, which is confirmed to be f(x) = 0, and the clarification that most functions in this set are not comparable. The use of Hasse diagrams for visualizing the order relation is also mentioned, highlighting the complexity compared to simpler numerical examples.

PREREQUISITES
  • Understanding of partial order relations
  • Familiarity with function comparison techniques
  • Knowledge of Hasse diagrams for visualizing order relations
  • Basic concepts of real-valued functions defined on intervals
NEXT STEPS
  • Explore the properties of partial order relations in more depth
  • Learn how to construct Hasse diagrams for complex sets of functions
  • Investigate the concept of maximal and minimal elements in ordered sets
  • Study examples of non-comparable functions and their implications
USEFUL FOR

Mathematicians, computer scientists, and students studying order theory, particularly those interested in function analysis and visualization techniques.

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.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 35 ·
2
Replies
35
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 14 ·
Replies
14
Views
4K