Empty Relations: Domain, Range & Functionality

Click For Summary
An empty relation is defined as a subset of the Cartesian product AxA, and since the empty set is a subset of any set, it qualifies as a relation. An empty relation can indeed be considered a function because it satisfies the condition that there is not more than one pair (x,y) for any x in the domain. If the empty set is the domain of a relation, it must also be the range, making it the empty relation. The discussion highlights the ambiguity in the definition of "range" and emphasizes that definitions of functions and relations can vary. Ultimately, the conversation underscores the importance of clarity in definitions when discussing mathematical concepts.
luizgguidi
Messages
8
Reaction score
0
What is an empty relation?
Can an empty relation be a function?
Is an empty relation one with the empty set as its domain or as its range or both?

THanks
 
Physics news on Phys.org
Look at the definitions! (How many times have I said that?)

A "relation" on a set A is a subset of the Cartesian product AxA. Since the empty set is a subset of any set, yes, the empty set is a subset of AxA and so is a relation.

A "function", F, is a relation on AxA such that "if x is in A, there is not more than one pair (x,y) with first member x". Because that says "not more than" it includes none. Yes, that is a function.

Any relation that has the empty set as its domain MUST have the empty set as its range and also is the empty relation.
 
HallsofIvy said:
A "function", F, is a relation on AxA such that "if x is in A, there is not more than one pair (x,y) with first member x".
Actually, it's "there is exactly one pair".

And we should ask the original poster what precisely he means by "range" -- there are at least two distinct ways of using it here.
 
luizgguidi said:
What is an empty relation?
Can an empty relation be a function?
Is an empty relation one with the empty set as its domain or as its range or both?

It's not really useful to worry about trivial points like this. It's all a matter of definition, and there is no universal definition for "function" or "relation". You can use any definition you want, but once you choose one, you have to stick with it.

In my mind, at least, I wouldn't even consider functions to be a kind of relation anyway. They are often defined in terms of relations, but they are very different grammatically. If R is a relation, "x R y" is a sentence. It can be either true or false. If f is a function, "f(x)" is just a noun. It has no statement behind it.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 4 ·
Replies
4
Views
683
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
10
Views
6K
  • · Replies 2 ·
Replies
2
Views
4K