1 Matching Annotations
  1. Feb 2023
    1. A typical way to define a function ๐‘“ff from a set ๐‘†SS, called the domain of the function, to a set ๐‘‡TT, called the range, is that ๐‘“ff is a relationship between ๐‘†SS to ๐‘‡TT that relates one and only one member of ๐‘‡TT to each element of ๐‘‹XX. We use ๐‘“(๐‘ฅ)f(x)f(x) to stand for the element of ๐‘‡TT that is related to the element ๐‘ฅxx of ๐‘†SS. If we wanted to make our definition more precise, we could substitute the word โ€œrelationโ€ for the word โ€œrelationshipโ€ and we would have a more precise definition. For our purposes, you can choose whichever definition you prefer. However, in any case, there is a relation associated with each function. As we said above, the relation of a function ๐‘“:๐‘†โ†’๐‘‡f:Sโ†’Tf: S โ†’ T (which is the standard shorthand for โ€œ๐‘“ff is a function from ๐‘†SS to ๐‘‡TTโ€ and is usually read as ๐‘“ff maps ๐‘†SS to ๐‘‡TT) is the set of all ordered pairs (๐‘ฅ,๐‘“(๐‘ฅ))(x,f(x))(x, f(x)) such that ๐‘ฅxx is in ๐‘†SS.

      What happens in the case of a function with domains and ranges of different size? If the cardinality of S = 3 and T = 2, what happens with the "dangling" element of S when creating a mapping?