# Let f:A rightarrow B and g:C rightarrow D. Define f times g={((a,c),(b,d)):(a,b) in f and (c,d) in g}. Prove that f times g is a function from A times C to B times D.

Let $f:A\to B$ and $g:C\to D$. DefineProve that $f×g$ is a function from $A×C$ to $B×D$.
My proof (so far):
Let $\left(a,c\right)\in A×C$, then $a\in A$ and $c\in C$.
Let $\left(b,d\right)\in B×D$, $b\in B$ and $d\in D$.
If $p\in A×C$ then $p=\left(a,c\right)$.
Define $\left(f×g\right)\left(p\right)$ as $\left(f×g\right)\left(p\right)=\left(f×g\right)\left(a,c\right)=\left(f\left(a\right),g\left(c\right)\right)=\left(b,d\right)$, however $b\in B$ and $d\in D$ and $\left(b,d\right)\in B×D$.
This shows $f×g$ is a function from $A×C$ to $B×D$ as $\left(f×g\right):A×C\to B×D$ then $\left(a,b\right)\to \left(f\left(a\right),g\left(c\right)\right)$.
I know that it is not well written out, but I was wondering if my thought process so far made sense or if I accidentally missed something. Additionally, I am unsure of what the next step may be. As a sidenote, I am worried that this does not work for the given definition of $f×g$.
You can still ask an expert for help

## Want to know more about Discrete math?

• Live experts 24/7
• Questions are typically answered in as fast as 30 minutes
• Personalized clear answers

Solve your problem for the price of one coffee

• Math expert for every subject
• Pay only if we can solve it

Eynardfb0
Step 1
You're missing something very important: the definition of a function. The set $f×g$ is defined as a relation, specifically a binary relation between the sets $A×C$ and $B×D$. Functions are a specific type of relation. Specifically,
A relation $f\subseteq X×Y$ between X and Y is a function if, for all $x\in X$, there exists a unique $y\in Y$ such that $\left(x,y\right)\in f$.
You need to use this property in your proof, as f and g are both assumed to have this property, as well as prove this property for $f×g$.
In your proof, you skirt around this a little by equivalently defining $f×g$ in terms of function notation, specifically defining $\left(f×g\right)\left(p\right)$ for all $p\in A×C$. As a proof technique, it's right on the border between acceptable and unacceptable. It buries the logic simply by a change of notation. By using function notation, you're implicitly assuming $f×g$ is a function. You could instead define a new function $h:A×C\to B×D$ by saying $h\left(a,c\right):=\left(f\left(a\right),g\left(c\right)\right)$, but then you should prove that the function h is equal to the relation $f×g$.
Step 2
Either way, something is missing from your approach. You haven't assumed anything false or difficult to show, but some steps need to be added in order to rectify the proof. That said, I would highly recommend proving it from the definition above, because I strongly suspect you're not comfortable enough with it yet.
So, let me get you started here. Suppose $\left(a,b\right)\in A×B$. Then $a\in A$ and $b\in B$. Since $f:A\to C$ is a function, there must exist some $c\in C$ such that $\left(a,c\right)\in f$.
###### Did you like this example?
vedentst9i
Explanation:
What you need to check is:
1. Is $f×g$ a subset of $\left(A×C\right)×\left(B×D\right)$?
2. Is there, for every $\left(a,c\right)\in A×C,$ some $\left(b,d\right)\in \left(B×D\right)$ such that $\left(\left(a,c\right),\left(b,d\right)\right)\in f×g$?
3. Is the pair (b,d) in the previous point unique for each $\left(a,c\right)\in A×C$?