so i know cartesian product is defined as
but how do i define a subset of it so it's only pairs in matching order? lets say i have two sets A={1,2,3} and B={4,5,6} and I want to get the set of pairs that gives f(A,B)={(1,4),(2,5),(3,6)}, but for any two arbitrary equally sized sets. how do i define this f function?
but how do i define a subset of it so it's only pairs in matching order? lets say i have two sets A={1,2,3} and B={4,5,6} and I want to get the set of pairs that gives f(A,B)={(1,4),(2,5),(3,6)}, but for any two arbitrary equally sized sets. how do i define this f function?
