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.

Joglxym 2022-11-02 Answered
Let f : A B and g : C D. Define f × g = { ( ( a , c ) , ( b , d ) ) : ( a , b ) f  and  ( c , d ) g } .Prove that f × g is a function from A × C to B × D.
My proof (so far):
Let ( a , c ) A × C, then a A and c C.
Let ( b , d ) B × D, b B and d D.
If p A × C then p = ( a , c ).
Define ( f × g ) ( p ) as ( f × g ) ( p ) = ( f × g ) ( a , c ) = ( f ( a ) , g ( c ) ) = ( b , d ), however b B and d D and ( b , d ) B × D.
This shows f × g is a function from A × C to B × D as ( f × g ) : A × C B × D then ( a , b ) ( f ( a ) , g ( c ) ).
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?

Expert Community at Your Service

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

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (2)

Eynardfb0
Answered 2022-11-03 Author has 19 answers
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 X × Y between X and Y is a function if, for all x X, there exists a unique y Y such that ( x , y ) 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 ( f × g ) ( p ) for all p 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 B × D by saying h ( a , c ) := ( f ( a ) , g ( c ) ), 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 ( a , b ) A × B. Then a A and b B. Since f : A C is a function, there must exist some c C such that ( a , c ) f.
Did you like this example?
Subscribe for all access
vedentst9i
Answered 2022-11-04 Author has 5 answers
Explanation:
What you need to check is:
1. Is f × g a subset of ( A × C ) × ( B × D )?
2. Is there, for every ( a , c ) A × C , some ( b , d ) ( B × D ) such that ( ( a , c ) , ( b , d ) ) f × g?
3. Is the pair (b,d) in the previous point unique for each ( a , c ) A × C?
Did you like this example?
Subscribe for all access

Expert Community at Your Service

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

You might be interested in

asked 2021-08-18

Discrete Mathematics Basics

1) Find out if the relation R is transitive, symmetric, antisymmetric, or reflexive on the set of all web pages.where (a,b)R if and only if 
I)Web page a has been accessed by everyone who has also accessed Web page b.
II) Both Web page a and Web page b lack any shared links.
III) Web pages a and b both have at least one shared link.

asked 2021-08-02

Suppose that A is the set of sophomores at your school and B is the set of students taking discrete mathematics at your school. Express each of these sets in terms of A and B. 
a) the set of sophomores taking discrete mathematics in your school 
b) the set of sophomores at your school who are not taking discrete mathematics 
c) the set of students at your school who either are sophomores or are taking discrete mathematics 
Use these symbols: 

asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2021-08-15
How many elements are in the set { 0, { { 0 } }?
asked 2021-08-14

Prove that discrete math:

1) If a|b and a|c then a|(b24c)
2) If a|b then a2|b2

asked 2021-08-03

Determine whether each statement is true or false. For each true statement, give a direct evidence as justication. For each false statement, give a counterexample as defense.( separate calculation)
i) If x + y is an even integer, then x and y are both even integers. 
ii) If x2=y2, then x=y. 
iii) The mean1 of two even numbers is even. 
iv) If x and y are even integers, then x + y is an even integer.

asked 2022-07-08
Find the generating function of f ( n ) = k = 0 n ( n k ) ( 1 ) n k C k
I want to find the generating function of f ( n ) = k = 0 n ( n k ) ( 1 ) n k C k , where C k is the k-th Catalan number. So, using the definition of an ordinary generating function:
F ( x ) = n 0 ( k = 0 n ( n k ) ( 1 ) n k C k ) x n
recalling that: C ( x ) = n 0 C n x n = 1 1 4 x 2 x
The first idea was to see F(x) as a product of two formal series and I have already seen a proof in this regard where they use the theorem of residues, yet I am looking for something less refined. Any idea?

New questions

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question