Jump to content

Talk:Empty function

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CBM (talk | contribs) at 21:12, 18 July 2010 (Rating article for WikiProject Mathematics. Quality: Stub / Priority: Low / Field: foundations (script assisted)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Redirect‑class Low‑priority
WikiProject iconThis redirect is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
RedirectThis redirect does not require a rating on Wikipedia's content assessment scale.
LowThis redirect has been rated as Low-priority on the project's priority scale.

What does the empty function evaluate to, for a particular set A?--ASL 00:51, 8 July 2007 (UTC)[reply]

Since the empty function has an empty domain, the empty function doesn't "evaluate to" anything. Paul August 02:10, 8 July 2007 (UTC)[reply]

I just wasn't used to defining a function in terms of a graph (which is a set, and therefore may be empty)--ASL 21:03, 8 July 2007 (UTC)[reply]

The idea is not that the empty function is empty as a set, nor does it depend upon defining a function in terms of a graph. The idea is that the domain is empty, and it applies equally well using the informal definition of a function as a rule which associates each element of its domain with a unique element of its codomain. If you define a function as a graph then an empty function will, incidentally, also be empty as a set. However it is common to formally define a function as an ordered triple (A, B, G) where A (the domain) and B (the codomain) are sets and G (the graph) is a subset of A X B (the set of ordered pairs with first element in A and second element in B) satisfying the property that if (r, t) and (s, t) are in G then r = s. In this case, for any set B, (∅, B, ∅) is an empty function, but of course not the empty set. Notice this means that although there is only one empty set, there are an infinite number of empty functions, one for each set B. Paul August 16:29, 9 July 2007 (UTC)[reply]