Register to reply

Functions as sets

by cam875
Tags: functions, sets
Share this thread:
cam875
#1
Jan21-09, 08:28 PM
P: 230
Ive never been taught functions using sets and I have been told that to really understand the real meaning of them it is helpful to work them out and understand them with sets and stuff. Im not sure if im on the right track or confused but Im sure someone here can help me out. I have a basic understanding of sets and elements and all that so i should be able to follow along.
thanks in advance.
Phys.Org News Partner Science news on Phys.org
World's largest solar boat on Greek prehistoric mission
Google searches hold key to future market crashes
Mineral magic? Common mineral capable of making and breaking bonds
lurflurf
#2
Jan21-09, 09:53 PM
HW Helper
P: 2,263
I am not sure how often the set definition of functions is helpful. There is also a notion of a function inducing a function from the power set of the domain into the power set of the range. It is helpful to first give the definition of a relation.

Definition: Catesian Product
Let A and B be sets. AxB is called the Cartesian product of A and B.
AxB contains all ordered pairs of the form (a,b) were a and be are respectively elements of A and B.

Definition: relation from A to B (set version)
Let A and B be sets.
R is a relation from A to B if R is a subset of AxB

Definition: Domain (of a relation)
Let R be a relation from A to B
The domain of R, Dom(R) is the set of all elements a in A such that there exists a b in B so that
(a,b) is in R.

Definition: range (of a relation)
Let R be a relation from A to B
The range of R, Rng(R) is the set of all elements b in B such that there exists a in A so that
(a,b) is in R.

Definition: function from A to B (set version)
let A and B be sets. A function f from A to B is a relation from A to B such that for each a in A there exist exactly one b in B such that (a,b) is in f.

Often is is helpful to break this condition in two parts.
Dom(f)=A (for each a in A there exist at least one b in B such that (a,b) is in f)
if (a,b) and (a,b') are both in f, then b=b' (for each a in A there exist at most one b in B such that (a,b) is in f)
cam875
#3
Jan22-09, 11:26 AM
P: 230
would you be able to give an example of a cartesian product between two example sets called A and B so that I could see the resulting set from that?

CRGreathouse
#4
Jan22-09, 01:16 PM
Sci Advisor
HW Helper
P: 3,684
Functions as sets

Quote Quote by cam875 View Post
would you be able to give an example of a cartesian product between two example sets called A and B so that I could see the resulting set from that?
{1, 2, 3} x {a, b, c} = {(1, a), (1, b), (1, c), (2, a), (2, b), (2, c), (3, a), (3, b), (3, c)}
Tac-Tics
#5
Jan22-09, 01:39 PM
P: 810
The set definitions of pairs, tuples, relations, functions, and integers only serves to show that set theory can be used as a formal basis for pretty much all of mathematics. The point of set theory was to reduce as many ideas as possible to as few as possible. It makes everything it can into a set.

If you have done any computer programming before, it's essentially the same concept. Computer languages only understand a limited set of objects: integers, floating point numbers, unicode characters, functions, and lists of other objects (or some similar-looking list). But then, how do you program a 3-D game? There are no "vectors" in the computer's eyes! The answer is you have to "build" vectors yourself out of what's given. A vector might be a list of floating point numbers, coupled with functions that can act on them (addition, scaling, dot products). What about a matrix? Well, now that we've defined vectors, a matrix is simply a list of vectors and functions for how to multiply them, transpose them, take their determinants, etc.

We're doing the same thing here with sets. You start off with only sets. Nothing but sets. Well, how do we make ordered pairs? We define them in terms of sets: (a, b) = {{a}, {a, b}} or whatnot. What about relations? We define a~b to be a set of pairs. What about functions? We define a function as a relationship with a condition that no two pairs (a, b) and (a', b') in the relation can have a = a'.

In a sense, we are merely "programming" the rest of mathematics with set theory. After we have defined a function in terms of sets, we can treat it as if functions are their own "real" entites. Once we have proven basic theorems about functions by their definition (composition is associative, and basic principles behind "onto" and "one-to-one" functions), we can more or less completely forget about the definition, knowing that as long as we defined it properly and made no mistakes in our core theorems, evereything else we prove with them will be correct, regardless of the details of the definition.

The take home message is, if sets are the only "primitive" object you have at your disposal, you can define many other mathematical objects in terms of them. Functions are not *really* sets. But if you went to a planet where functions were not yet discovered, but where the natives understood sets, you could give a precise description of what Earth mathematicians mean by "function."
cam875
#6
Jan22-09, 02:14 PM
P: 230
make sense and yes im an avid programmer so it does help me understand with the analogy u gave me, thanks


Register to reply

Related Discussions
Proof on functions of an intersection of sets... Calculus 2
Functions and Sets? General Math 19
Continuous Functions, Closed Sets Calculus & Beyond Homework 4
Discrete Math: Sets/Functions/Proofs Calculus & Beyond Homework 3
Question Regarding Sets and Functions Set Theory, Logic, Probability, Statistics 4